/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 12:39:06,963 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 12:39:06,966 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 12:39:06,977 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 12:39:06,978 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 12:39:06,979 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 12:39:06,980 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 12:39:06,981 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 12:39:06,983 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 12:39:06,984 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 12:39:06,984 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 12:39:06,985 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 12:39:06,986 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 12:39:06,987 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 12:39:06,988 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 12:39:06,989 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 12:39:06,989 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 12:39:06,990 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 12:39:06,992 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 12:39:06,993 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 12:39:06,995 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 12:39:06,995 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 12:39:06,997 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 12:39:06,997 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 12:39:06,999 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 12:39:07,000 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 12:39:07,000 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 12:39:07,001 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 12:39:07,001 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 12:39:07,002 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 12:39:07,002 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 12:39:07,003 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 12:39:07,003 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 12:39:07,004 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 12:39:07,005 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 12:39:07,005 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 12:39:07,006 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 12:39:07,006 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 12:39:07,006 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 12:39:07,007 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 12:39:07,007 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 12:39:07,008 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-07-01 12:39:07,022 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 12:39:07,022 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 12:39:07,023 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 12:39:07,023 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 12:39:07,024 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 12:39:07,024 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:39:07,024 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 12:39:07,024 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 12:39:07,024 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 12:39:07,024 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 12:39:07,025 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 12:39:07,025 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 12:39:07,025 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 12:39:07,025 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 12:39:07,025 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:39:07,025 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 12:39:07,026 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 12:39:07,026 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 12:39:07,026 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 12:39:07,026 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 12:39:07,026 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 12:39:07,026 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 12:39:07,027 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 12:39:07,027 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 12:39:07,027 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:39:07,027 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 12:39:07,027 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 12:39:07,027 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 12:39:07,028 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 12:39:07,195 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 12:39:07,208 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 12:39:07,212 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 12:39:07,213 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 12:39:07,214 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 12:39:07,214 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 12:39:07,304 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_ZhV00q/tmp/4f7f0f36a3874d2d8f21f94313df6ade/FLAGbb605ee4b [2020-07-01 12:39:07,671 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 12:39:07,672 INFO L160 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 12:39:07,672 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 12:39:07,680 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_ZhV00q/tmp/4f7f0f36a3874d2d8f21f94313df6ade/FLAGbb605ee4b [2020-07-01 12:39:08,093 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/BenchExec_run_ZhV00q/tmp/4f7f0f36a3874d2d8f21f94313df6ade [2020-07-01 12:39:08,105 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 12:39:08,106 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 12:39:08,108 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 12:39:08,108 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 12:39:08,111 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 12:39:08,112 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:39:08" (1/1) ... [2020-07-01 12:39:08,115 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c3681d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:39:08, skipping insertion in model container [2020-07-01 12:39:08,116 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:39:08" (1/1) ... [2020-07-01 12:39:08,123 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 12:39:08,141 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 12:39:08,367 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:39:08,378 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 12:39:08,397 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:39:08,412 INFO L208 MainTranslator]: Completed translation [2020-07-01 12:39:08,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:39:08 WrapperNode [2020-07-01 12:39:08,413 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 12:39:08,413 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 12:39:08,414 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 12:39:08,414 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 12:39:08,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:39:08" (1/1) ... [2020-07-01 12:39:08,431 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:39:08" (1/1) ... [2020-07-01 12:39:08,453 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 12:39:08,453 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 12:39:08,453 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 12:39:08,453 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 12:39:08,462 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:39:08" (1/1) ... [2020-07-01 12:39:08,463 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:39:08" (1/1) ... [2020-07-01 12:39:08,464 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:39:08" (1/1) ... [2020-07-01 12:39:08,465 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:39:08" (1/1) ... [2020-07-01 12:39:08,471 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:39:08" (1/1) ... [2020-07-01 12:39:08,475 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:39:08" (1/1) ... [2020-07-01 12:39:08,477 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:39:08" (1/1) ... [2020-07-01 12:39:08,479 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 12:39:08,479 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 12:39:08,479 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 12:39:08,479 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 12:39:08,481 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:39:08" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:39:08,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 12:39:08,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 12:39:08,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 12:39:08,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 12:39:08,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 12:39:08,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 12:39:08,798 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 12:39:08,798 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-01 12:39:08,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:39:08 BoogieIcfgContainer [2020-07-01 12:39:08,802 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 12:39:08,803 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 12:39:08,803 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 12:39:08,805 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 12:39:08,805 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:39:08" (1/1) ... [2020-07-01 12:39:08,820 INFO L313 BlockEncoder]: Initial Icfg 31 locations, 38 edges [2020-07-01 12:39:08,822 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 12:39:08,822 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 12:39:08,823 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 12:39:08,823 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:39:08,825 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 12:39:08,826 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 12:39:08,826 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 12:39:08,852 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 12:39:08,882 INFO L200 BlockEncoder]: SBE split 13 edges [2020-07-01 12:39:08,887 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility [2020-07-01 12:39:08,889 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:39:08,920 INFO L100 BaseMinimizeStates]: Removed 12 edges and 6 locations by large block encoding [2020-07-01 12:39:08,923 INFO L70 RemoveSinkStates]: Removed 4 edges and 2 locations by removing sink states [2020-07-01 12:39:08,924 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:39:08,925 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:39:08,925 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 12:39:08,926 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 12:39:08,926 INFO L313 BlockEncoder]: Encoded RCFG 23 locations, 41 edges [2020-07-01 12:39:08,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:39:08 BasicIcfg [2020-07-01 12:39:08,927 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 12:39:08,928 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 12:39:08,928 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 12:39:08,931 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 12:39:08,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 12:39:08" (1/4) ... [2020-07-01 12:39:08,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c3a0c61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:39:08, skipping insertion in model container [2020-07-01 12:39:08,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:39:08" (2/4) ... [2020-07-01 12:39:08,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c3a0c61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:39:08, skipping insertion in model container [2020-07-01 12:39:08,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:39:08" (3/4) ... [2020-07-01 12:39:08,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c3a0c61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:39:08, skipping insertion in model container [2020-07-01 12:39:08,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:39:08" (4/4) ... [2020-07-01 12:39:08,935 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:39:08,945 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 12:39:08,953 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2020-07-01 12:39:08,967 INFO L251 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-07-01 12:39:08,990 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 12:39:08,990 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 12:39:08,990 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:39:08,991 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:39:08,991 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:39:08,991 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 12:39:08,991 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:39:08,991 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 12:39:09,006 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-07-01 12:39:09,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:39:09,012 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:39:09,013 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:39:09,013 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:39:09,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:39:09,019 INFO L82 PathProgramCache]: Analyzing trace with hash 175224190, now seen corresponding path program 1 times [2020-07-01 12:39:09,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:39:09,029 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042112799] [2020-07-01 12:39:09,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:39:09,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:39:09,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:39:09,183 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042112799] [2020-07-01 12:39:09,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:39:09,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:39:09,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230914191] [2020-07-01 12:39:09,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:39:09,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:39:09,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:39:09,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:39:09,207 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2020-07-01 12:39:09,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:39:09,311 INFO L93 Difference]: Finished difference Result 42 states and 73 transitions. [2020-07-01 12:39:09,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:39:09,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:39:09,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:39:09,327 INFO L225 Difference]: With dead ends: 42 [2020-07-01 12:39:09,328 INFO L226 Difference]: Without dead ends: 23 [2020-07-01 12:39:09,350 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:39:09,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-01 12:39:09,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-01 12:39:09,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-01 12:39:09,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 38 transitions. [2020-07-01 12:39:09,389 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 38 transitions. Word has length 5 [2020-07-01 12:39:09,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:39:09,390 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 38 transitions. [2020-07-01 12:39:09,390 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:39:09,390 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. [2020-07-01 12:39:09,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:39:09,391 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:39:09,391 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:39:09,392 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 12:39:09,393 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:39:09,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:39:09,393 INFO L82 PathProgramCache]: Analyzing trace with hash 175224252, now seen corresponding path program 1 times [2020-07-01 12:39:09,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:39:09,394 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779089029] [2020-07-01 12:39:09,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:39:09,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:39:09,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:39:09,433 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779089029] [2020-07-01 12:39:09,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:39:09,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:39:09,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662390178] [2020-07-01 12:39:09,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:39:09,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:39:09,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:39:09,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:39:09,436 INFO L87 Difference]: Start difference. First operand 23 states and 38 transitions. Second operand 3 states. [2020-07-01 12:39:09,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:39:09,493 INFO L93 Difference]: Finished difference Result 23 states and 38 transitions. [2020-07-01 12:39:09,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:39:09,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:39:09,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:39:09,495 INFO L225 Difference]: With dead ends: 23 [2020-07-01 12:39:09,495 INFO L226 Difference]: Without dead ends: 22 [2020-07-01 12:39:09,496 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:39:09,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-01 12:39:09,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-07-01 12:39:09,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-01 12:39:09,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 36 transitions. [2020-07-01 12:39:09,500 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 36 transitions. Word has length 5 [2020-07-01 12:39:09,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:39:09,501 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 36 transitions. [2020-07-01 12:39:09,501 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:39:09,501 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 36 transitions. [2020-07-01 12:39:09,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:39:09,502 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:39:09,502 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:39:09,502 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 12:39:09,502 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:39:09,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:39:09,503 INFO L82 PathProgramCache]: Analyzing trace with hash 175224254, now seen corresponding path program 1 times [2020-07-01 12:39:09,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:39:09,503 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292022880] [2020-07-01 12:39:09,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:39:09,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:39:09,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:39:09,544 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292022880] [2020-07-01 12:39:09,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:39:09,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:39:09,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748879248] [2020-07-01 12:39:09,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:39:09,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:39:09,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:39:09,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:39:09,546 INFO L87 Difference]: Start difference. First operand 22 states and 36 transitions. Second operand 4 states. [2020-07-01 12:39:09,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:39:09,599 INFO L93 Difference]: Finished difference Result 23 states and 36 transitions. [2020-07-01 12:39:09,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:39:09,599 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-07-01 12:39:09,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:39:09,600 INFO L225 Difference]: With dead ends: 23 [2020-07-01 12:39:09,600 INFO L226 Difference]: Without dead ends: 22 [2020-07-01 12:39:09,601 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:39:09,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-01 12:39:09,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-07-01 12:39:09,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-01 12:39:09,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 35 transitions. [2020-07-01 12:39:09,605 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 35 transitions. Word has length 5 [2020-07-01 12:39:09,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:39:09,605 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 35 transitions. [2020-07-01 12:39:09,605 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:39:09,606 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 35 transitions. [2020-07-01 12:39:09,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:39:09,606 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:39:09,606 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:39:09,606 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 12:39:09,606 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:39:09,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:39:09,607 INFO L82 PathProgramCache]: Analyzing trace with hash 175224255, now seen corresponding path program 1 times [2020-07-01 12:39:09,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:39:09,607 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128841956] [2020-07-01 12:39:09,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:39:09,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:39:09,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:39:09,644 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128841956] [2020-07-01 12:39:09,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:39:09,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:39:09,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444990657] [2020-07-01 12:39:09,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:39:09,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:39:09,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:39:09,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:39:09,646 INFO L87 Difference]: Start difference. First operand 22 states and 35 transitions. Second operand 3 states. [2020-07-01 12:39:09,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:39:09,697 INFO L93 Difference]: Finished difference Result 22 states and 35 transitions. [2020-07-01 12:39:09,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:39:09,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:39:09,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:39:09,698 INFO L225 Difference]: With dead ends: 22 [2020-07-01 12:39:09,698 INFO L226 Difference]: Without dead ends: 21 [2020-07-01 12:39:09,699 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:39:09,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-01 12:39:09,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-01 12:39:09,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-01 12:39:09,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 34 transitions. [2020-07-01 12:39:09,703 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 34 transitions. Word has length 5 [2020-07-01 12:39:09,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:39:09,703 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 34 transitions. [2020-07-01 12:39:09,703 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:39:09,703 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 34 transitions. [2020-07-01 12:39:09,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-01 12:39:09,704 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:39:09,704 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:39:09,704 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 12:39:09,704 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:39:09,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:39:09,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1721304005, now seen corresponding path program 1 times [2020-07-01 12:39:09,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:39:09,705 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948496911] [2020-07-01 12:39:09,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:39:09,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:39:09,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:39:09,744 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948496911] [2020-07-01 12:39:09,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:39:09,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 12:39:09,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153445880] [2020-07-01 12:39:09,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:39:09,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:39:09,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:39:09,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:39:09,746 INFO L87 Difference]: Start difference. First operand 21 states and 34 transitions. Second operand 4 states. [2020-07-01 12:39:09,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:39:09,836 INFO L93 Difference]: Finished difference Result 46 states and 75 transitions. [2020-07-01 12:39:09,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:39:09,836 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-07-01 12:39:09,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:39:09,837 INFO L225 Difference]: With dead ends: 46 [2020-07-01 12:39:09,837 INFO L226 Difference]: Without dead ends: 31 [2020-07-01 12:39:09,838 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:39:09,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-01 12:39:09,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 21. [2020-07-01 12:39:09,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-01 12:39:09,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 33 transitions. [2020-07-01 12:39:09,842 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 33 transitions. Word has length 8 [2020-07-01 12:39:09,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:39:09,842 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 33 transitions. [2020-07-01 12:39:09,842 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:39:09,843 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 33 transitions. [2020-07-01 12:39:09,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-01 12:39:09,843 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:39:09,843 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:39:09,844 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 12:39:09,844 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:39:09,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:39:09,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1721304966, now seen corresponding path program 1 times [2020-07-01 12:39:09,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:39:09,845 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000580464] [2020-07-01 12:39:09,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:39:09,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:39:09,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:39:09,903 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000580464] [2020-07-01 12:39:09,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:39:09,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 12:39:09,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584134170] [2020-07-01 12:39:09,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 12:39:09,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:39:09,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 12:39:09,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:39:09,905 INFO L87 Difference]: Start difference. First operand 21 states and 33 transitions. Second operand 5 states. [2020-07-01 12:39:09,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:39:09,992 INFO L93 Difference]: Finished difference Result 21 states and 33 transitions. [2020-07-01 12:39:09,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:39:09,993 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-07-01 12:39:09,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:39:09,993 INFO L225 Difference]: With dead ends: 21 [2020-07-01 12:39:09,994 INFO L226 Difference]: Without dead ends: 20 [2020-07-01 12:39:09,994 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:39:09,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-01 12:39:09,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-07-01 12:39:09,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-01 12:39:09,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 31 transitions. [2020-07-01 12:39:09,999 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 31 transitions. Word has length 8 [2020-07-01 12:39:09,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:39:09,999 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 31 transitions. [2020-07-01 12:39:09,999 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 12:39:09,999 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 31 transitions. [2020-07-01 12:39:10,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-01 12:39:10,000 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:39:10,000 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:39:10,000 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 12:39:10,000 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:39:10,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:39:10,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1721304968, now seen corresponding path program 1 times [2020-07-01 12:39:10,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:39:10,001 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896072743] [2020-07-01 12:39:10,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:39:10,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:39:10,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:39:10,061 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896072743] [2020-07-01 12:39:10,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:39:10,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-01 12:39:10,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914462486] [2020-07-01 12:39:10,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-01 12:39:10,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:39:10,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 12:39:10,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:39:10,063 INFO L87 Difference]: Start difference. First operand 20 states and 31 transitions. Second operand 6 states. [2020-07-01 12:39:10,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:39:10,171 INFO L93 Difference]: Finished difference Result 28 states and 43 transitions. [2020-07-01 12:39:10,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-01 12:39:10,172 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2020-07-01 12:39:10,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:39:10,173 INFO L225 Difference]: With dead ends: 28 [2020-07-01 12:39:10,173 INFO L226 Difference]: Without dead ends: 27 [2020-07-01 12:39:10,173 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-07-01 12:39:10,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-01 12:39:10,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2020-07-01 12:39:10,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-01 12:39:10,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 34 transitions. [2020-07-01 12:39:10,179 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 34 transitions. Word has length 8 [2020-07-01 12:39:10,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:39:10,179 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 34 transitions. [2020-07-01 12:39:10,179 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-01 12:39:10,179 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 34 transitions. [2020-07-01 12:39:10,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-01 12:39:10,180 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:39:10,180 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:39:10,180 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 12:39:10,180 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:39:10,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:39:10,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1721304969, now seen corresponding path program 1 times [2020-07-01 12:39:10,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:39:10,182 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644311337] [2020-07-01 12:39:10,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:39:10,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:39:10,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:39:10,273 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644311337] [2020-07-01 12:39:10,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:39:10,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-01 12:39:10,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285988329] [2020-07-01 12:39:10,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-01 12:39:10,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:39:10,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-01 12:39:10,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:39:10,275 INFO L87 Difference]: Start difference. First operand 22 states and 34 transitions. Second operand 7 states. [2020-07-01 12:39:10,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:39:10,429 INFO L93 Difference]: Finished difference Result 27 states and 42 transitions. [2020-07-01 12:39:10,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-01 12:39:10,429 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2020-07-01 12:39:10,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:39:10,430 INFO L225 Difference]: With dead ends: 27 [2020-07-01 12:39:10,430 INFO L226 Difference]: Without dead ends: 26 [2020-07-01 12:39:10,431 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-07-01 12:39:10,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-01 12:39:10,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2020-07-01 12:39:10,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-01 12:39:10,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 33 transitions. [2020-07-01 12:39:10,435 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 33 transitions. Word has length 8 [2020-07-01 12:39:10,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:39:10,436 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 33 transitions. [2020-07-01 12:39:10,436 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-01 12:39:10,436 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 33 transitions. [2020-07-01 12:39:10,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-01 12:39:10,437 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:39:10,437 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:39:10,437 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 12:39:10,437 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:39:10,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:39:10,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1820845391, now seen corresponding path program 1 times [2020-07-01 12:39:10,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:39:10,438 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404476410] [2020-07-01 12:39:10,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:39:10,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:39:10,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:39:10,536 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404476410] [2020-07-01 12:39:10,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:39:10,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-01 12:39:10,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68174833] [2020-07-01 12:39:10,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-01 12:39:10,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:39:10,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-01 12:39:10,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:39:10,538 INFO L87 Difference]: Start difference. First operand 22 states and 33 transitions. Second operand 7 states. [2020-07-01 12:39:10,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:39:10,689 INFO L93 Difference]: Finished difference Result 26 states and 41 transitions. [2020-07-01 12:39:10,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-01 12:39:10,690 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2020-07-01 12:39:10,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:39:10,690 INFO L225 Difference]: With dead ends: 26 [2020-07-01 12:39:10,691 INFO L226 Difference]: Without dead ends: 25 [2020-07-01 12:39:10,691 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-07-01 12:39:10,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-01 12:39:10,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2020-07-01 12:39:10,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-01 12:39:10,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 36 transitions. [2020-07-01 12:39:10,696 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 36 transitions. Word has length 9 [2020-07-01 12:39:10,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:39:10,697 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 36 transitions. [2020-07-01 12:39:10,697 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-01 12:39:10,697 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 36 transitions. [2020-07-01 12:39:10,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-01 12:39:10,697 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:39:10,697 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:39:10,698 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-01 12:39:10,698 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:39:10,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:39:10,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1820845388, now seen corresponding path program 1 times [2020-07-01 12:39:10,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:39:10,698 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024062377] [2020-07-01 12:39:10,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:39:10,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:39:10,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:39:10,751 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024062377] [2020-07-01 12:39:10,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:39:10,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-01 12:39:10,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701355017] [2020-07-01 12:39:10,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-01 12:39:10,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:39:10,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 12:39:10,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:39:10,753 INFO L87 Difference]: Start difference. First operand 23 states and 36 transitions. Second operand 6 states. [2020-07-01 12:39:10,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:39:10,868 INFO L93 Difference]: Finished difference Result 23 states and 36 transitions. [2020-07-01 12:39:10,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-01 12:39:10,869 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-07-01 12:39:10,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:39:10,869 INFO L225 Difference]: With dead ends: 23 [2020-07-01 12:39:10,869 INFO L226 Difference]: Without dead ends: 22 [2020-07-01 12:39:10,870 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-07-01 12:39:10,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-01 12:39:10,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-07-01 12:39:10,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-01 12:39:10,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2020-07-01 12:39:10,874 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 9 [2020-07-01 12:39:10,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:39:10,874 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 32 transitions. [2020-07-01 12:39:10,875 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-01 12:39:10,875 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2020-07-01 12:39:10,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-01 12:39:10,875 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:39:10,875 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:39:10,876 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-01 12:39:10,876 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:39:10,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:39:10,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1842438919, now seen corresponding path program 1 times [2020-07-01 12:39:10,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:39:10,876 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141895618] [2020-07-01 12:39:10,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:39:10,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:39:10,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:39:10,923 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141895618] [2020-07-01 12:39:10,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:39:10,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 12:39:10,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952143090] [2020-07-01 12:39:10,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 12:39:10,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:39:10,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 12:39:10,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:39:10,925 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. Second operand 5 states. [2020-07-01 12:39:11,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:39:11,009 INFO L93 Difference]: Finished difference Result 22 states and 32 transitions. [2020-07-01 12:39:11,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-01 12:39:11,009 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-01 12:39:11,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:39:11,010 INFO L225 Difference]: With dead ends: 22 [2020-07-01 12:39:11,010 INFO L226 Difference]: Without dead ends: 21 [2020-07-01 12:39:11,010 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:39:11,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-01 12:39:11,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-01 12:39:11,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-01 12:39:11,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2020-07-01 12:39:11,015 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 30 transitions. Word has length 13 [2020-07-01 12:39:11,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:39:11,015 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 30 transitions. [2020-07-01 12:39:11,015 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 12:39:11,015 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 30 transitions. [2020-07-01 12:39:11,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-01 12:39:11,016 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:39:11,016 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:39:11,016 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-01 12:39:11,016 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:39:11,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:39:11,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1842438921, now seen corresponding path program 1 times [2020-07-01 12:39:11,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:39:11,017 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770797812] [2020-07-01 12:39:11,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:39:11,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:39:11,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:39:11,085 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770797812] [2020-07-01 12:39:11,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:39:11,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-01 12:39:11,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186064986] [2020-07-01 12:39:11,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-01 12:39:11,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:39:11,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-01 12:39:11,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-01 12:39:11,087 INFO L87 Difference]: Start difference. First operand 21 states and 30 transitions. Second operand 8 states. [2020-07-01 12:39:11,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:39:11,219 INFO L93 Difference]: Finished difference Result 23 states and 33 transitions. [2020-07-01 12:39:11,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-01 12:39:11,220 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2020-07-01 12:39:11,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:39:11,220 INFO L225 Difference]: With dead ends: 23 [2020-07-01 12:39:11,220 INFO L226 Difference]: Without dead ends: 22 [2020-07-01 12:39:11,221 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2020-07-01 12:39:11,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-01 12:39:11,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2020-07-01 12:39:11,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-01 12:39:11,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2020-07-01 12:39:11,225 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 29 transitions. Word has length 13 [2020-07-01 12:39:11,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:39:11,225 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 29 transitions. [2020-07-01 12:39:11,225 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-01 12:39:11,225 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 29 transitions. [2020-07-01 12:39:11,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-01 12:39:11,226 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:39:11,226 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:39:11,226 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-01 12:39:11,226 INFO L427 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:39:11,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:39:11,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1842438922, now seen corresponding path program 1 times [2020-07-01 12:39:11,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:39:11,227 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862296515] [2020-07-01 12:39:11,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:39:11,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:39:11,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:39:11,333 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862296515] [2020-07-01 12:39:11,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:39:11,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-01 12:39:11,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481133507] [2020-07-01 12:39:11,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-01 12:39:11,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:39:11,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-01 12:39:11,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-07-01 12:39:11,335 INFO L87 Difference]: Start difference. First operand 21 states and 29 transitions. Second operand 9 states. [2020-07-01 12:39:11,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:39:11,564 INFO L93 Difference]: Finished difference Result 29 states and 41 transitions. [2020-07-01 12:39:11,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-01 12:39:11,565 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2020-07-01 12:39:11,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:39:11,565 INFO L225 Difference]: With dead ends: 29 [2020-07-01 12:39:11,565 INFO L226 Difference]: Without dead ends: 28 [2020-07-01 12:39:11,566 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2020-07-01 12:39:11,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-01 12:39:11,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2020-07-01 12:39:11,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-01 12:39:11,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 36 transitions. [2020-07-01 12:39:11,571 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 36 transitions. Word has length 13 [2020-07-01 12:39:11,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:39:11,571 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 36 transitions. [2020-07-01 12:39:11,571 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-01 12:39:11,571 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 36 transitions. [2020-07-01 12:39:11,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-01 12:39:11,572 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:39:11,572 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:39:11,572 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-01 12:39:11,572 INFO L427 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:39:11,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:39:11,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1842438953, now seen corresponding path program 1 times [2020-07-01 12:39:11,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:39:11,573 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734495053] [2020-07-01 12:39:11,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:39:11,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:39:11,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:39:11,607 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734495053] [2020-07-01 12:39:11,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:39:11,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 12:39:11,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195049117] [2020-07-01 12:39:11,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:39:11,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:39:11,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:39:11,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:39:11,609 INFO L87 Difference]: Start difference. First operand 25 states and 36 transitions. Second operand 4 states. [2020-07-01 12:39:11,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:39:11,663 INFO L93 Difference]: Finished difference Result 30 states and 42 transitions. [2020-07-01 12:39:11,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:39:11,665 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-07-01 12:39:11,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:39:11,666 INFO L225 Difference]: With dead ends: 30 [2020-07-01 12:39:11,666 INFO L226 Difference]: Without dead ends: 26 [2020-07-01 12:39:11,666 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:39:11,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-01 12:39:11,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2020-07-01 12:39:11,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-01 12:39:11,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2020-07-01 12:39:11,671 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 13 [2020-07-01 12:39:11,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:39:11,671 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2020-07-01 12:39:11,671 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:39:11,671 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2020-07-01 12:39:11,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-01 12:39:11,672 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:39:11,672 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:39:11,672 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-01 12:39:11,672 INFO L427 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:39:11,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:39:11,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1329263316, now seen corresponding path program 1 times [2020-07-01 12:39:11,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:39:11,673 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292788246] [2020-07-01 12:39:11,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:39:11,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:39:11,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:39:11,702 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292788246] [2020-07-01 12:39:11,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:39:11,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 12:39:11,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056100993] [2020-07-01 12:39:11,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:39:11,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:39:11,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:39:11,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:39:11,704 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. Second operand 4 states. [2020-07-01 12:39:11,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:39:11,750 INFO L93 Difference]: Finished difference Result 39 states and 56 transitions. [2020-07-01 12:39:11,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:39:11,751 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-07-01 12:39:11,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:39:11,752 INFO L225 Difference]: With dead ends: 39 [2020-07-01 12:39:11,752 INFO L226 Difference]: Without dead ends: 27 [2020-07-01 12:39:11,752 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:39:11,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-01 12:39:11,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-01 12:39:11,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-01 12:39:11,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2020-07-01 12:39:11,757 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 14 [2020-07-01 12:39:11,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:39:11,757 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2020-07-01 12:39:11,757 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:39:11,757 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2020-07-01 12:39:11,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-01 12:39:11,758 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:39:11,758 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:39:11,758 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-01 12:39:11,758 INFO L427 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:39:11,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:39:11,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1329264277, now seen corresponding path program 1 times [2020-07-01 12:39:11,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:39:11,759 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209940414] [2020-07-01 12:39:11,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:39:11,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:39:11,830 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:39:11,830 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209940414] [2020-07-01 12:39:11,830 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748321205] [2020-07-01 12:39:11,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:39:11,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:39:11,894 INFO L264 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 12:39:11,900 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:39:11,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:39:11,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:39:11,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 8 [2020-07-01 12:39:11,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500520410] [2020-07-01 12:39:11,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-01 12:39:11,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:39:11,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-01 12:39:11,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-07-01 12:39:11,937 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 9 states. [2020-07-01 12:39:12,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:39:12,101 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2020-07-01 12:39:12,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-01 12:39:12,102 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2020-07-01 12:39:12,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:39:12,102 INFO L225 Difference]: With dead ends: 28 [2020-07-01 12:39:12,102 INFO L226 Difference]: Without dead ends: 27 [2020-07-01 12:39:12,103 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2020-07-01 12:39:12,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-01 12:39:12,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-01 12:39:12,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-01 12:39:12,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2020-07-01 12:39:12,108 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 14 [2020-07-01 12:39:12,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:39:12,108 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2020-07-01 12:39:12,108 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-01 12:39:12,108 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2020-07-01 12:39:12,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-01 12:39:12,109 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:39:12,109 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:39:12,309 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-07-01 12:39:12,310 INFO L427 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:39:12,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:39:12,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1329264278, now seen corresponding path program 1 times [2020-07-01 12:39:12,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:39:12,311 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614454423] [2020-07-01 12:39:12,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:39:12,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:39:12,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:39:12,477 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614454423] [2020-07-01 12:39:12,477 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066899271] [2020-07-01 12:39:12,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:39:12,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:39:12,534 INFO L264 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 26 conjunts are in the unsatisfiable core [2020-07-01 12:39:12,535 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:39:12,555 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:39:12,603 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-01 12:39:12,603 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:39:12,610 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2020-07-01 12:39:12,610 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:39:12,635 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:39:12,638 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2020-07-01 12:39:12,639 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:43 [2020-07-01 12:39:12,769 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:39:12,770 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2020-07-01 12:39:12,771 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:39:12,771 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 12:39:12,782 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:39:12,784 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:39:12,787 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:39:12,788 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-07-01 12:39:12,789 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:23 [2020-07-01 12:39:12,830 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:39:12,833 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:39:12,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:39:12,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2020-07-01 12:39:12,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139051606] [2020-07-01 12:39:12,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-01 12:39:12,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:39:12,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-01 12:39:12,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2020-07-01 12:39:12,835 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand 14 states. [2020-07-01 12:39:13,200 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2020-07-01 12:39:13,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:39:13,443 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2020-07-01 12:39:13,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-01 12:39:13,443 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2020-07-01 12:39:13,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:39:13,444 INFO L225 Difference]: With dead ends: 30 [2020-07-01 12:39:13,444 INFO L226 Difference]: Without dead ends: 29 [2020-07-01 12:39:13,444 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2020-07-01 12:39:13,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-01 12:39:13,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-01 12:39:13,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-01 12:39:13,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2020-07-01 12:39:13,450 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 14 [2020-07-01 12:39:13,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:39:13,450 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2020-07-01 12:39:13,450 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-01 12:39:13,450 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2020-07-01 12:39:13,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-01 12:39:13,451 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:39:13,451 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:39:13,651 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-07-01 12:39:13,652 INFO L427 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:39:13,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:39:13,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1742481438, now seen corresponding path program 1 times [2020-07-01 12:39:13,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:39:13,653 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371854567] [2020-07-01 12:39:13,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:39:13,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:39:13,853 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:39:13,854 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371854567] [2020-07-01 12:39:13,854 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629785844] [2020-07-01 12:39:13,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:39:13,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:39:13,895 INFO L264 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 31 conjunts are in the unsatisfiable core [2020-07-01 12:39:13,896 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:39:13,902 INFO L435 ElimStorePlain]: Different costs {0=[|v_#length_14|], 1=[|v_#valid_27|]} [2020-07-01 12:39:13,905 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:39:13,906 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-07-01 12:39:13,906 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:39:13,917 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:39:13,924 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-01 12:39:13,925 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:39:13,931 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:39:13,932 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:39:13,932 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2020-07-01 12:39:14,071 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:39:14,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:39:14,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 18 [2020-07-01 12:39:14,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582780058] [2020-07-01 12:39:14,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-01 12:39:14,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:39:14,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-01 12:39:14,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2020-07-01 12:39:14,073 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand 19 states. [2020-07-01 12:39:14,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:39:14,748 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2020-07-01 12:39:14,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-01 12:39:14,770 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 15 [2020-07-01 12:39:14,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:39:14,770 INFO L225 Difference]: With dead ends: 33 [2020-07-01 12:39:14,771 INFO L226 Difference]: Without dead ends: 32 [2020-07-01 12:39:14,771 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=161, Invalid=651, Unknown=0, NotChecked=0, Total=812 [2020-07-01 12:39:14,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-01 12:39:14,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2020-07-01 12:39:14,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-01 12:39:14,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 40 transitions. [2020-07-01 12:39:14,776 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 40 transitions. Word has length 15 [2020-07-01 12:39:14,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:39:14,777 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 40 transitions. [2020-07-01 12:39:14,777 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-01 12:39:14,777 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2020-07-01 12:39:14,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-01 12:39:14,777 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:39:14,777 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:39:14,978 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-07-01 12:39:14,978 INFO L427 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:39:14,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:39:14,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1742481439, now seen corresponding path program 1 times [2020-07-01 12:39:14,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:39:14,979 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672408656] [2020-07-01 12:39:14,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:39:14,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:39:15,040 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:39:15,040 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672408656] [2020-07-01 12:39:15,040 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349556755] [2020-07-01 12:39:15,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:39:15,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:39:15,091 INFO L264 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 12:39:15,092 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:39:15,109 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:39:15,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:39:15,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 8 [2020-07-01 12:39:15,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036492912] [2020-07-01 12:39:15,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-01 12:39:15,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:39:15,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-01 12:39:15,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-07-01 12:39:15,111 INFO L87 Difference]: Start difference. First operand 30 states and 40 transitions. Second operand 9 states. [2020-07-01 12:39:15,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:39:15,272 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2020-07-01 12:39:15,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-01 12:39:15,272 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-07-01 12:39:15,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:39:15,273 INFO L225 Difference]: With dead ends: 31 [2020-07-01 12:39:15,273 INFO L226 Difference]: Without dead ends: 30 [2020-07-01 12:39:15,273 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2020-07-01 12:39:15,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-01 12:39:15,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-01 12:39:15,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-01 12:39:15,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2020-07-01 12:39:15,278 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 15 [2020-07-01 12:39:15,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:39:15,278 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2020-07-01 12:39:15,278 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-01 12:39:15,278 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2020-07-01 12:39:15,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-01 12:39:15,279 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:39:15,279 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:39:15,479 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:39:15,480 INFO L427 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:39:15,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:39:15,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1583839943, now seen corresponding path program 1 times [2020-07-01 12:39:15,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:39:15,481 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914465814] [2020-07-01 12:39:15,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:39:15,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:39:15,607 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 12:39:15,607 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914465814] [2020-07-01 12:39:15,607 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184483989] [2020-07-01 12:39:15,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:39:15,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:39:15,659 INFO L264 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 38 conjunts are in the unsatisfiable core [2020-07-01 12:39:15,660 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:39:15,667 INFO L435 ElimStorePlain]: Different costs {0=[|v_#length_15|], 1=[|v_#valid_28|]} [2020-07-01 12:39:15,670 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:39:15,671 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-07-01 12:39:15,671 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:39:15,678 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:39:15,682 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-01 12:39:15,683 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:39:15,690 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:39:15,691 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:39:15,691 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2020-07-01 12:39:15,821 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:39:15,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:39:15,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2020-07-01 12:39:15,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947962313] [2020-07-01 12:39:15,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-01 12:39:15,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:39:15,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-01 12:39:15,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2020-07-01 12:39:15,823 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand 19 states. [2020-07-01 12:39:16,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:39:16,409 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2020-07-01 12:39:16,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-01 12:39:16,410 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 16 [2020-07-01 12:39:16,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:39:16,410 INFO L225 Difference]: With dead ends: 39 [2020-07-01 12:39:16,410 INFO L226 Difference]: Without dead ends: 38 [2020-07-01 12:39:16,411 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=256, Invalid=934, Unknown=0, NotChecked=0, Total=1190 [2020-07-01 12:39:16,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-01 12:39:16,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2020-07-01 12:39:16,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-01 12:39:16,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2020-07-01 12:39:16,416 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 16 [2020-07-01 12:39:16,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:39:16,416 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2020-07-01 12:39:16,416 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-01 12:39:16,416 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2020-07-01 12:39:16,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-01 12:39:16,417 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:39:16,417 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:39:16,617 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:39:16,618 INFO L427 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:39:16,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:39:16,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1583839912, now seen corresponding path program 1 times [2020-07-01 12:39:16,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:39:16,619 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69080232] [2020-07-01 12:39:16,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:39:16,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:39:16,650 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:39:16,650 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69080232] [2020-07-01 12:39:16,650 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808923130] [2020-07-01 12:39:16,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:39:16,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:39:16,692 INFO L264 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 12:39:16,693 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:39:16,697 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:39:16,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:39:16,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-07-01 12:39:16,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771290080] [2020-07-01 12:39:16,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 12:39:16,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:39:16,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 12:39:16,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:39:16,699 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand 5 states. [2020-07-01 12:39:16,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:39:16,750 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2020-07-01 12:39:16,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:39:16,751 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-01 12:39:16,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:39:16,751 INFO L225 Difference]: With dead ends: 37 [2020-07-01 12:39:16,752 INFO L226 Difference]: Without dead ends: 27 [2020-07-01 12:39:16,752 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:39:16,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-01 12:39:16,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-01 12:39:16,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-01 12:39:16,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2020-07-01 12:39:16,756 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 16 [2020-07-01 12:39:16,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:39:16,756 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2020-07-01 12:39:16,756 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 12:39:16,756 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2020-07-01 12:39:16,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-01 12:39:16,757 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:39:16,757 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:39:16,957 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:39:16,958 INFO L427 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:39:16,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:39:16,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1371810756, now seen corresponding path program 1 times [2020-07-01 12:39:16,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:39:16,958 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418531680] [2020-07-01 12:39:16,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:39:16,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:39:16,995 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:39:16,995 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418531680] [2020-07-01 12:39:16,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:39:16,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-01 12:39:16,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506579199] [2020-07-01 12:39:16,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 12:39:16,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:39:16,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 12:39:16,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:39:16,997 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand 5 states. [2020-07-01 12:39:17,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:39:17,044 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2020-07-01 12:39:17,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:39:17,045 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-07-01 12:39:17,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:39:17,045 INFO L225 Difference]: With dead ends: 40 [2020-07-01 12:39:17,045 INFO L226 Difference]: Without dead ends: 34 [2020-07-01 12:39:17,046 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:39:17,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-01 12:39:17,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2020-07-01 12:39:17,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-01 12:39:17,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2020-07-01 12:39:17,050 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 40 transitions. Word has length 19 [2020-07-01 12:39:17,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:39:17,050 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 40 transitions. [2020-07-01 12:39:17,051 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 12:39:17,051 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2020-07-01 12:39:17,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-01 12:39:17,051 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:39:17,051 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:39:17,052 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-07-01 12:39:17,052 INFO L427 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:39:17,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:39:17,052 INFO L82 PathProgramCache]: Analyzing trace with hash 471770146, now seen corresponding path program 1 times [2020-07-01 12:39:17,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:39:17,052 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645477143] [2020-07-01 12:39:17,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:39:17,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:39:17,086 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:39:17,087 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645477143] [2020-07-01 12:39:17,087 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430014182] [2020-07-01 12:39:17,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:39:17,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:39:17,140 INFO L264 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 12:39:17,141 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:39:17,145 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:39:17,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:39:17,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-07-01 12:39:17,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34433428] [2020-07-01 12:39:17,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 12:39:17,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:39:17,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 12:39:17,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:39:17,147 INFO L87 Difference]: Start difference. First operand 31 states and 40 transitions. Second operand 5 states. [2020-07-01 12:39:17,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:39:17,187 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2020-07-01 12:39:17,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:39:17,188 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-07-01 12:39:17,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:39:17,188 INFO L225 Difference]: With dead ends: 39 [2020-07-01 12:39:17,188 INFO L226 Difference]: Without dead ends: 23 [2020-07-01 12:39:17,189 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:39:17,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-01 12:39:17,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-01 12:39:17,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-01 12:39:17,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-07-01 12:39:17,192 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 20 [2020-07-01 12:39:17,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:39:17,192 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-07-01 12:39:17,192 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 12:39:17,192 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-07-01 12:39:17,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-01 12:39:17,193 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:39:17,193 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:39:17,393 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:39:17,394 INFO L427 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:39:17,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:39:17,394 INFO L82 PathProgramCache]: Analyzing trace with hash 471771107, now seen corresponding path program 2 times [2020-07-01 12:39:17,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:39:17,394 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593677902] [2020-07-01 12:39:17,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:39:17,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:39:17,669 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:39:17,669 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593677902] [2020-07-01 12:39:17,669 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054252110] [2020-07-01 12:39:17,670 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:39:17,717 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 12:39:17,717 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 12:39:17,718 INFO L264 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 41 conjunts are in the unsatisfiable core [2020-07-01 12:39:17,720 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:39:17,724 INFO L435 ElimStorePlain]: Different costs {0=[|v_#length_16|], 1=[|v_#valid_29|]} [2020-07-01 12:39:17,728 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:39:17,729 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-07-01 12:39:17,729 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:39:17,737 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:39:17,741 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-01 12:39:17,741 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:39:17,747 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:39:17,748 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:39:17,748 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2020-07-01 12:39:17,772 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-07-01 12:39:17,772 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:39:17,779 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:39:17,780 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 12:39:17,781 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2020-07-01 12:39:17,881 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2020-07-01 12:39:17,881 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:39:17,890 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:39:17,892 INFO L539 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 12:39:17,892 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:34, output treesize:19 [2020-07-01 12:39:17,978 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:39:17,979 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2020-07-01 12:39:17,980 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:39:17,980 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 12:39:17,996 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:39:17,998 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:39:17,999 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-07-01 12:39:18,001 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-07-01 12:39:18,001 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:23 [2020-07-01 12:39:18,041 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:39:18,044 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:39:18,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:39:18,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2020-07-01 12:39:18,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062267250] [2020-07-01 12:39:18,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-01 12:39:18,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:39:18,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-01 12:39:18,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2020-07-01 12:39:18,046 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 19 states. [2020-07-01 12:39:18,393 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 59 [2020-07-01 12:39:18,524 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 64 [2020-07-01 12:39:19,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:39:19,235 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2020-07-01 12:39:19,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-01 12:39:19,235 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 20 [2020-07-01 12:39:19,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:39:19,236 INFO L225 Difference]: With dead ends: 24 [2020-07-01 12:39:19,236 INFO L226 Difference]: Without dead ends: 23 [2020-07-01 12:39:19,237 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=194, Invalid=736, Unknown=0, NotChecked=0, Total=930 [2020-07-01 12:39:19,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-01 12:39:19,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2020-07-01 12:39:19,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-01 12:39:19,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2020-07-01 12:39:19,240 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 20 [2020-07-01 12:39:19,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:39:19,240 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2020-07-01 12:39:19,240 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-01 12:39:19,240 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2020-07-01 12:39:19,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-01 12:39:19,241 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:39:19,241 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:39:19,441 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2020-07-01 12:39:19,442 INFO L427 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:39:19,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:39:19,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1740001333, now seen corresponding path program 2 times [2020-07-01 12:39:19,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:39:19,443 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163327786] [2020-07-01 12:39:19,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:39:19,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:39:19,720 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:39:19,720 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163327786] [2020-07-01 12:39:19,720 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988634304] [2020-07-01 12:39:19,721 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:39:19,765 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 12:39:19,766 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 12:39:19,785 INFO L264 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 38 conjunts are in the unsatisfiable core [2020-07-01 12:39:19,787 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:39:19,791 INFO L435 ElimStorePlain]: Different costs {0=[|v_#length_17|], 1=[|v_#valid_30|]} [2020-07-01 12:39:19,795 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:39:19,796 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-07-01 12:39:19,796 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:39:19,803 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:39:19,807 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-01 12:39:19,807 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:39:19,814 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:39:19,814 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:39:19,815 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2020-07-01 12:39:20,014 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:39:20,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:39:20,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 24 [2020-07-01 12:39:20,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166107383] [2020-07-01 12:39:20,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-07-01 12:39:20,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:39:20,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-07-01 12:39:20,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2020-07-01 12:39:20,016 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 25 states. [2020-07-01 12:39:21,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:39:21,355 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2020-07-01 12:39:21,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-01 12:39:21,356 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 21 [2020-07-01 12:39:21,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:39:21,356 INFO L225 Difference]: With dead ends: 29 [2020-07-01 12:39:21,356 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 12:39:21,357 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=366, Invalid=1526, Unknown=0, NotChecked=0, Total=1892 [2020-07-01 12:39:21,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 12:39:21,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 12:39:21,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 12:39:21,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 12:39:21,358 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2020-07-01 12:39:21,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:39:21,358 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:39:21,358 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-07-01 12:39:21,358 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 12:39:21,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 12:39:21,559 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:39:21,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 12:39:21,881 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2020-07-01 12:39:22,390 WARN L192 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 91 [2020-07-01 12:39:22,394 INFO L268 CegarLoopResult]: For program point L31(lines 31 33) no Hoare annotation was computed. [2020-07-01 12:39:22,394 INFO L268 CegarLoopResult]: For program point L31-2(lines 28 42) no Hoare annotation was computed. [2020-07-01 12:39:22,394 INFO L268 CegarLoopResult]: For program point L19-1(lines 19 20) no Hoare annotation was computed. [2020-07-01 12:39:22,394 INFO L268 CegarLoopResult]: For program point L17(line 17) no Hoare annotation was computed. [2020-07-01 12:39:22,395 INFO L268 CegarLoopResult]: For program point L17-1(line 17) no Hoare annotation was computed. [2020-07-01 12:39:22,395 INFO L264 CegarLoopResult]: At program point L19-3(lines 19 20) the Hoare annotation is: (and (<= (+ ULTIMATE.start_cstrncpy_~d~0.offset ULTIMATE.start_cstrncpy_~n) (+ (select |#length| ULTIMATE.start_cstrncpy_~d~0.base) 1)) (= ULTIMATE.start_main_~n~0 (select |#length| ULTIMATE.start_main_~nondetArea~0.base)) (= 1 (select |#valid| ULTIMATE.start_cstrncpy_~d~0.base)) (<= 1 ULTIMATE.start_main_~n~0) (= 0 ULTIMATE.start_cstrncpy_~dst.offset) (or (< 1 ULTIMATE.start_main_~length~0) (= 1 (+ ULTIMATE.start_main_~length~0 ULTIMATE.start_main_~nondetString~0.offset))) (= ULTIMATE.start_main_~length~0 (select |#length| ULTIMATE.start_main_~nondetString~0.base)) (<= 1 |#StackHeapBarrier|) (= (select |#valid| ULTIMATE.start_main_~nondetArea~0.base) 1) (<= 1 ULTIMATE.start_cstrncpy_~n) (<= 1 ULTIMATE.start_cstrncpy_~d~0.offset) (= 0 ULTIMATE.start_cstrncpy_~src.offset) (<= ULTIMATE.start_cstrncpy_~n (select |#length| ULTIMATE.start_cstrncpy_~dst.base)) (= 1 (select |#valid| ULTIMATE.start_main_~nondetString~0.base)) (= 1 (select |#valid| ULTIMATE.start_cstrncpy_~s~0.base)) (<= 1 ULTIMATE.start_cstrncpy_~s~0.offset) (= 1 (select |#valid| ULTIMATE.start_cstrncpy_~src.base)) (= 0 ULTIMATE.start_main_~nondetArea~0.offset) (= 1 (select |#valid| ULTIMATE.start_cstrncpy_~dst.base)) (= 0 ULTIMATE.start_main_~nondetString~0.offset) (<= 1 (select |#length| ULTIMATE.start_cstrncpy_~src.base))) [2020-07-01 12:39:22,395 INFO L268 CegarLoopResult]: For program point L17-2(lines 17 22) no Hoare annotation was computed. [2020-07-01 12:39:22,395 INFO L268 CegarLoopResult]: For program point L34-1(lines 34 36) no Hoare annotation was computed. [2020-07-01 12:39:22,395 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 12:39:22,395 INFO L268 CegarLoopResult]: For program point L20(line 20) no Hoare annotation was computed. [2020-07-01 12:39:22,396 INFO L268 CegarLoopResult]: For program point L16-1(lines 16 23) no Hoare annotation was computed. [2020-07-01 12:39:22,396 INFO L268 CegarLoopResult]: For program point L16-2(lines 16 23) no Hoare annotation was computed. [2020-07-01 12:39:22,396 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 12:39:22,396 INFO L268 CegarLoopResult]: For program point L12(lines 12 24) no Hoare annotation was computed. [2020-07-01 12:39:22,396 INFO L264 CegarLoopResult]: At program point L16-4(lines 16 23) the Hoare annotation is: (let ((.cse23 (= ULTIMATE.start_main_~nondetString~0.base ULTIMATE.start_main_~nondetArea~0.base)) (.cse0 (= ULTIMATE.start_main_~length~0 (select |#length| ULTIMATE.start_main_~nondetString~0.base)))) (let ((.cse1 (<= 1 |#StackHeapBarrier|)) (.cse2 (<= 1 ULTIMATE.start_cstrncpy_~n)) (.cse15 (select |#length| ULTIMATE.start_cstrncpy_~d~0.base)) (.cse3 (= 0 ULTIMATE.start_cstrncpy_~src.offset)) (.cse4 (<= ULTIMATE.start_cstrncpy_~n (select |#length| ULTIMATE.start_cstrncpy_~dst.base))) (.cse5 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString~0.base))) (.cse6 (= 1 (select |#valid| ULTIMATE.start_cstrncpy_~s~0.base))) (.cse19 (select |#length| ULTIMATE.start_cstrncpy_~s~0.base)) (.cse7 (not (= ULTIMATE.start_cstrncpy_~d~0.base ULTIMATE.start_cstrncpy_~s~0.base))) (.cse8 (= 1 (select |#valid| ULTIMATE.start_cstrncpy_~src.base))) (.cse9 (= 0 ULTIMATE.start_main_~nondetArea~0.offset)) (.cse12 (= 0 ULTIMATE.start_main_~nondetString~0.offset)) (.cse11 (= 1 (select |#valid| ULTIMATE.start_cstrncpy_~dst.base))) (.cse10 (or (= 1 (+ ULTIMATE.start_main_~length~0 ULTIMATE.start_main_~nondetString~0.offset)) (and (< 1 ULTIMATE.start_main_~length~0) .cse0))) (.cse13 (not .cse23)) (.cse14 (= ULTIMATE.start_main_~n~0 (select |#length| ULTIMATE.start_main_~nondetArea~0.base))) (.cse16 (= 1 (select |#valid| ULTIMATE.start_cstrncpy_~d~0.base))) (.cse17 (<= 1 ULTIMATE.start_main_~n~0)) (.cse18 (= 0 ULTIMATE.start_cstrncpy_~dst.offset)) (.cse21 (exists ((ULTIMATE.start_main_~nondetString~0.offset Int)) (and (<= ULTIMATE.start_main_~nondetString~0.offset 0) (<= 0 ULTIMATE.start_main_~nondetString~0.offset) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrncpy_~s~0.base) (+ (select |#length| ULTIMATE.start_cstrncpy_~s~0.base) ULTIMATE.start_main_~nondetString~0.offset (- 1))))))) (.cse20 (or .cse23 (= (select |#valid| ULTIMATE.start_main_~nondetArea~0.base) 1))) (.cse22 (<= 1 (select |#length| ULTIMATE.start_cstrncpy_~src.base)))) (or (and .cse0 .cse1 (= 0 ULTIMATE.start_cstrncpy_~s~0.offset) .cse2 (= 0 ULTIMATE.start_cstrncpy_~d~0.offset) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= ULTIMATE.start_cstrncpy_~src.base ULTIMATE.start_cstrncpy_~dst.base)) .cse10 .cse11 .cse12 .cse13 .cse14 (<= ULTIMATE.start_cstrncpy_~n .cse15) .cse16 .cse17 .cse18 (exists ((ULTIMATE.start_main_~nondetString~0.offset Int)) (and (<= ULTIMATE.start_main_~nondetString~0.offset 0) (<= 0 ULTIMATE.start_main_~nondetString~0.offset) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrncpy_~src.base) (+ (select |#length| ULTIMATE.start_cstrncpy_~src.base) ULTIMATE.start_main_~nondetString~0.offset (- 1)))))) (<= 1 .cse19) .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 (<= 1 ULTIMATE.start_cstrncpy_~d~0.offset) (<= (+ ULTIMATE.start_cstrncpy_~d~0.offset ULTIMATE.start_cstrncpy_~n) .cse15) .cse3 .cse4 .cse5 .cse6 (<= (+ ULTIMATE.start_cstrncpy_~s~0.offset 1) .cse19) .cse7 (<= 1 ULTIMATE.start_cstrncpy_~s~0.offset) .cse8 .cse9 .cse12 .cse11 .cse10 .cse13 .cse14 .cse16 .cse17 .cse18 .cse21 .cse20 .cse22)))) [2020-07-01 12:39:22,396 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:39:22,396 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 12:39:22,397 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:39:22,397 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 39) no Hoare annotation was computed. [2020-07-01 12:39:22,397 INFO L268 CegarLoopResult]: For program point L39(line 39) no Hoare annotation was computed. [2020-07-01 12:39:22,397 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:39:22,397 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:39:22,397 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 39) no Hoare annotation was computed. [2020-07-01 12:39:22,400 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 12:39:22,410 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,412 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,412 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,412 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:39:22,412 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,413 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,420 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,421 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,421 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,421 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:39:22,422 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,422 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,425 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:22,426 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:22,426 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:22,426 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:22,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:22,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:22,428 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:22,428 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:22,428 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:22,430 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,430 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:39:22,431 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,431 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,431 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,432 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,432 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:39:22,432 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,432 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,432 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:39:22,433 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,433 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,433 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,433 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:39:22,434 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,434 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,434 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,434 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,435 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,435 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:39:22,435 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,435 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,437 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:22,437 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:22,438 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:22,438 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:22,438 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:22,438 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:22,439 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:22,439 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:22,439 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:22,441 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,441 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:39:22,441 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,442 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,442 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,442 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,442 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:39:22,443 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,443 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,443 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:39:22,443 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,443 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,444 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,444 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:39:22,444 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,444 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,445 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,445 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,445 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,445 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:39:22,446 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,446 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:39:22 BasicIcfg [2020-07-01 12:39:22,449 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 12:39:22,449 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 12:39:22,449 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 12:39:22,453 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 12:39:22,454 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:39:22,454 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 12:39:08" (1/5) ... [2020-07-01 12:39:22,455 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6aac3815 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:39:22, skipping insertion in model container [2020-07-01 12:39:22,455 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:39:22,455 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:39:08" (2/5) ... [2020-07-01 12:39:22,455 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6aac3815 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:39:22, skipping insertion in model container [2020-07-01 12:39:22,455 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:39:22,455 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:39:08" (3/5) ... [2020-07-01 12:39:22,455 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6aac3815 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:39:22, skipping insertion in model container [2020-07-01 12:39:22,456 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:39:22,456 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:39:08" (4/5) ... [2020-07-01 12:39:22,456 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6aac3815 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:39:22, skipping insertion in model container [2020-07-01 12:39:22,456 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:39:22,456 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:39:22" (5/5) ... [2020-07-01 12:39:22,457 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:39:22,478 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 12:39:22,478 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 12:39:22,478 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:39:22,479 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:39:22,479 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:39:22,479 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 12:39:22,479 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:39:22,479 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 12:39:22,482 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2020-07-01 12:39:22,487 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-07-01 12:39:22,487 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:39:22,487 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:39:22,491 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:39:22,491 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:39:22,491 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 12:39:22,491 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2020-07-01 12:39:22,492 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-07-01 12:39:22,493 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:39:22,493 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:39:22,493 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:39:22,493 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:39:22,498 INFO L794 eck$LassoCheckResult]: Stem: 19#ULTIMATE.startENTRYtrue [155] ULTIMATE.startENTRY-->L31: Formula: (and (= 0 |v_#NULL.base_2|) (< 0 |v_#StackHeapBarrier_3|) (= 0 |v_#NULL.offset_2|) (= |v_#valid_17| (store |v_#valid_18| 0 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_5|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_4, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_6, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_4, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_4|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, #valid=|v_#valid_17|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_5|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_10, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~nondetArea~0.base, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, #NULL.base, ULTIMATE.start_main_#t~ret10.base, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~length~0, ULTIMATE.start_main_#t~ret10.offset] 17#L31true [109] L31-->L31-2: Formula: (and (< v_ULTIMATE.start_main_~length~0_5 1) (= v_ULTIMATE.start_main_~length~0_4 1)) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_5} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length~0] 13#L31-2true [75] L31-2-->L34-1: Formula: (and (< v_ULTIMATE.start_main_~n~0_5 1) (= v_ULTIMATE.start_main_~n~0_4 1)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~n~0] 21#L34-1true [127] L34-1-->L39: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc8.base_4| 1))) (and (< 0 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= 0 (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc8.base_4|)) (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_4|) (> 0 |v_ULTIMATE.start_main_#t~malloc8.base_4|) (= 0 |v_ULTIMATE.start_main_#t~malloc8.offset_4|) (= 0 |v_ULTIMATE.start_main_#t~malloc9.offset_4|) (= v_ULTIMATE.start_main_~nondetString~0.base_2 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= v_ULTIMATE.start_main_~nondetString~0.offset_2 |v_ULTIMATE.start_main_#t~malloc9.offset_4|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc8.base_4| v_ULTIMATE.start_main_~n~0_7) |v_ULTIMATE.start_main_#t~malloc9.base_4| v_ULTIMATE.start_main_~length~0_7)) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc9.base_4|)) (= |v_#valid_6| (store .cse0 |v_ULTIMATE.start_main_#t~malloc9.base_4| 1)) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_4|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc8.base_4|))) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_4|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_4|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_2, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_2, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_4|, #valid=|v_#valid_6|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_4|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_~nondetArea~0.base, #length, ULTIMATE.start_main_#t~malloc9.offset] 10#L39true [156] L39-->L12: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11))) (and (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= |v_ULTIMATE.start_cstrncpy_#in~src.offset_2| v_ULTIMATE.start_cstrncpy_~src.offset_4) (<= 1 .cse0) (= v_ULTIMATE.start_cstrncpy_~dst.offset_5 |v_ULTIMATE.start_cstrncpy_#in~dst.offset_2|) (= |v_ULTIMATE.start_cstrncpy_#in~dst.base_2| v_ULTIMATE.start_main_~nondetArea~0.base_5) (<= .cse0 (select |v_#length_12| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= |v_ULTIMATE.start_cstrncpy_#in~src.base_2| v_ULTIMATE.start_main_~nondetString~0.base_8) (= v_ULTIMATE.start_cstrncpy_~n_9 |v_ULTIMATE.start_cstrncpy_#in~n_2|) (= |v_ULTIMATE.start_cstrncpy_#in~n_2| v_ULTIMATE.start_main_~n~0_10) (= |v_ULTIMATE.start_cstrncpy_#in~dst.base_2| v_ULTIMATE.start_cstrncpy_~dst.base_5) (= v_ULTIMATE.start_main_~nondetArea~0.offset_5 |v_ULTIMATE.start_cstrncpy_#in~dst.offset_2|) (= |v_ULTIMATE.start_cstrncpy_#in~src.base_2| v_ULTIMATE.start_cstrncpy_~src.base_4) (= |v_ULTIMATE.start_cstrncpy_#in~src.offset_2| v_ULTIMATE.start_main_~nondetString~0.offset_7) (= (store |v_#memory_int_9| v_ULTIMATE.start_main_~nondetString~0.base_8 (store (select |v_#memory_int_9| v_ULTIMATE.start_main_~nondetString~0.base_8) (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11 (- 1)) 0)) |v_#memory_int_8|))) InVars {ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, #valid=|v_#valid_19|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_10, #memory_int=|v_#memory_int_9|, #length=|v_#length_12|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_8|, ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_7, ULTIMATE.start_cstrncpy_~dst.offset=v_ULTIMATE.start_cstrncpy_~dst.offset_5, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_cstrncpy_~dst.base=v_ULTIMATE.start_cstrncpy_~dst.base_5, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_8|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_cstrncpy_#in~src.offset=|v_ULTIMATE.start_cstrncpy_#in~src.offset_2|, ULTIMATE.start_cstrncpy_#res.base=|v_ULTIMATE.start_cstrncpy_#res.base_4|, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_7, #length=|v_#length_12|, ULTIMATE.start_cstrncpy_#in~n=|v_ULTIMATE.start_cstrncpy_#in~n_2|, ULTIMATE.start_cstrncpy_#t~pre0=|v_ULTIMATE.start_cstrncpy_#t~pre0_7|, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_9, ULTIMATE.start_cstrncpy_#in~src.base=|v_ULTIMATE.start_cstrncpy_#in~src.base_2|, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_5, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_7|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_10, ULTIMATE.start_cstrncpy_#t~pre4=|v_ULTIMATE.start_cstrncpy_#t~pre4_7|, ULTIMATE.start_cstrncpy_~src.offset=v_ULTIMATE.start_cstrncpy_~src.offset_4, ULTIMATE.start_cstrncpy_#res.offset=|v_ULTIMATE.start_cstrncpy_#res.offset_4|, ULTIMATE.start_cstrncpy_#in~dst.offset=|v_ULTIMATE.start_cstrncpy_#in~dst.offset_2|, ULTIMATE.start_cstrncpy_#in~dst.base=|v_ULTIMATE.start_cstrncpy_#in~dst.base_2|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_8|, ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_6|, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_5, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_7|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrncpy_~src.base=v_ULTIMATE.start_cstrncpy_~src.base_4, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3, ULTIMATE.start_cstrncpy_~d~0.offset, ULTIMATE.start_cstrncpy_~dst.offset, ULTIMATE.start_cstrncpy_~dst.base, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_#in~src.offset, ULTIMATE.start_cstrncpy_#res.base, ULTIMATE.start_cstrncpy_~d~0.base, ULTIMATE.start_cstrncpy_#in~n, ULTIMATE.start_cstrncpy_#t~pre0, ULTIMATE.start_cstrncpy_~n, ULTIMATE.start_cstrncpy_#in~src.base, ULTIMATE.start_cstrncpy_~s~0.offset, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~pre4, ULTIMATE.start_cstrncpy_~src.offset, ULTIMATE.start_cstrncpy_#res.offset, ULTIMATE.start_cstrncpy_#in~dst.offset, ULTIMATE.start_cstrncpy_#in~dst.base, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post5.offset, ULTIMATE.start_cstrncpy_~s~0.base, ULTIMATE.start_cstrncpy_#t~post5.base, #memory_int, ULTIMATE.start_cstrncpy_~src.base, ULTIMATE.start_cstrncpy_#t~post2.offset] 23#L12true [136] L12-->L16-4: Formula: (and (= v_ULTIMATE.start_cstrncpy_~s~0.base_2 v_ULTIMATE.start_cstrncpy_~src.base_3) (> v_ULTIMATE.start_cstrncpy_~n_4 0) (= v_ULTIMATE.start_cstrncpy_~d~0.offset_2 v_ULTIMATE.start_cstrncpy_~dst.offset_4) (= v_ULTIMATE.start_cstrncpy_~d~0.base_2 v_ULTIMATE.start_cstrncpy_~dst.base_4) (= v_ULTIMATE.start_cstrncpy_~s~0.offset_2 v_ULTIMATE.start_cstrncpy_~src.offset_3)) InVars {ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_4, ULTIMATE.start_cstrncpy_~dst.offset=v_ULTIMATE.start_cstrncpy_~dst.offset_4, ULTIMATE.start_cstrncpy_~src.base=v_ULTIMATE.start_cstrncpy_~src.base_3, ULTIMATE.start_cstrncpy_~src.offset=v_ULTIMATE.start_cstrncpy_~src.offset_3, ULTIMATE.start_cstrncpy_~dst.base=v_ULTIMATE.start_cstrncpy_~dst.base_4} OutVars{ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_2, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_4, ULTIMATE.start_cstrncpy_~dst.offset=v_ULTIMATE.start_cstrncpy_~dst.offset_4, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_2, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_2, ULTIMATE.start_cstrncpy_~dst.base=v_ULTIMATE.start_cstrncpy_~dst.base_4, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_2, ULTIMATE.start_cstrncpy_~src.base=v_ULTIMATE.start_cstrncpy_~src.base_3, ULTIMATE.start_cstrncpy_~src.offset=v_ULTIMATE.start_cstrncpy_~src.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~d~0.offset, ULTIMATE.start_cstrncpy_~s~0.offset, ULTIMATE.start_cstrncpy_~s~0.base, ULTIMATE.start_cstrncpy_~d~0.base] 24#L16-4true [2020-07-01 12:39:22,499 INFO L796 eck$LassoCheckResult]: Loop: 24#L16-4true [86] L16-4-->L17: Formula: (and (= v_ULTIMATE.start_cstrncpy_~s~0.base_3 |v_ULTIMATE.start_cstrncpy_#t~post2.base_2|) (= |v_ULTIMATE.start_cstrncpy_#t~post1.offset_2| v_ULTIMATE.start_cstrncpy_~d~0.offset_4) (= |v_ULTIMATE.start_cstrncpy_#t~post1.base_2| v_ULTIMATE.start_cstrncpy_~d~0.base_4) (= v_ULTIMATE.start_cstrncpy_~d~0.offset_3 (+ |v_ULTIMATE.start_cstrncpy_#t~post1.offset_2| 1)) (= |v_ULTIMATE.start_cstrncpy_#t~post2.offset_2| v_ULTIMATE.start_cstrncpy_~s~0.offset_4) (= v_ULTIMATE.start_cstrncpy_~d~0.base_3 |v_ULTIMATE.start_cstrncpy_#t~post1.base_2|) (= v_ULTIMATE.start_cstrncpy_~s~0.offset_3 (+ |v_ULTIMATE.start_cstrncpy_#t~post2.offset_2| 1)) (= |v_ULTIMATE.start_cstrncpy_#t~post2.base_2| v_ULTIMATE.start_cstrncpy_~s~0.base_4)) InVars {ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_4, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_4, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_4, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_4} OutVars{ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_3, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_3, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_3, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_2|, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_3, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_2|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_2|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~d~0.offset, ULTIMATE.start_cstrncpy_~s~0.base, ULTIMATE.start_cstrncpy_~s~0.offset, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_~d~0.base, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_#t~post2.offset] 9#L17true [100] L17-->L17-1: Formula: (and (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3| 1) (select |v_#length_6| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|)) (= 1 (select |v_#valid_11| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|)) (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|) (= |v_ULTIMATE.start_cstrncpy_#t~mem3_2| (select (select |v_#memory_int_3| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|) |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|))) InVars {#memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_3|, #valid=|v_#valid_11|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_2|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_3|, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3] 6#L17-1true [94] L17-1-->L17-2: Formula: (and (= (store |v_#memory_int_5| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3| (store (select |v_#memory_int_5| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|) |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3| |v_ULTIMATE.start_cstrncpy_#t~mem3_3|)) |v_#memory_int_4|) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3| 1) (select |v_#length_8| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|)) (= 1 (select |v_#valid_13| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|)) (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|)) InVars {ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_3|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_3|, #length=|v_#length_8|} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_3|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_3|, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 3#L17-2true [145] L17-2-->L16-1: Formula: (< 0 |v_ULTIMATE.start_cstrncpy_#t~mem3_7|) InVars {ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_7|} OutVars{ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_7|, ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_6|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_7|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_6|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_#t~post2.offset] 4#L16-1true [74] L16-1-->L16-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cstrncpy_~n_8 (- 1)))) (and (= v_ULTIMATE.start_cstrncpy_~n_7 .cse0) (= |v_ULTIMATE.start_cstrncpy_#t~pre0_2| .cse0))) InVars {ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_8} OutVars{ULTIMATE.start_cstrncpy_#t~pre0=|v_ULTIMATE.start_cstrncpy_#t~pre0_2|, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_7} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~pre0, ULTIMATE.start_cstrncpy_~n] 25#L16-2true [149] L16-2-->L16-4: Formula: (> 0 |v_ULTIMATE.start_cstrncpy_#t~pre0_6|) InVars {ULTIMATE.start_cstrncpy_#t~pre0=|v_ULTIMATE.start_cstrncpy_#t~pre0_6|} OutVars{ULTIMATE.start_cstrncpy_#t~pre0=|v_ULTIMATE.start_cstrncpy_#t~pre0_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~pre0] 24#L16-4true [2020-07-01 12:39:22,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:39:22,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1133079923, now seen corresponding path program 1 times [2020-07-01 12:39:22,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:39:22,500 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355945418] [2020-07-01 12:39:22,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:39:22,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:39:22,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:39:22,520 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355945418] [2020-07-01 12:39:22,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:39:22,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:39:22,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221980731] [2020-07-01 12:39:22,521 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 12:39:22,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:39:22,521 INFO L82 PathProgramCache]: Analyzing trace with hash -850062387, now seen corresponding path program 1 times [2020-07-01 12:39:22,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:39:22,522 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66945038] [2020-07-01 12:39:22,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:39:22,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:39:22,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:39:22,546 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:39:22,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:39:22,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:39:22,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:39:22,646 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2020-07-01 12:39:22,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:39:22,686 INFO L93 Difference]: Finished difference Result 23 states and 38 transitions. [2020-07-01 12:39:22,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:39:22,689 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 12:39:22,693 INFO L168 Benchmark]: Toolchain (without parser) took 14587.39 ms. Allocated memory was 649.6 MB in the beginning and 918.6 MB in the end (delta: 269.0 MB). Free memory was 561.4 MB in the beginning and 539.2 MB in the end (delta: 22.2 MB). Peak memory consumption was 291.2 MB. Max. memory is 50.3 GB. [2020-07-01 12:39:22,693 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 583.2 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:39:22,694 INFO L168 Benchmark]: CACSL2BoogieTranslator took 305.37 ms. Allocated memory was 649.6 MB in the beginning and 676.9 MB in the end (delta: 27.3 MB). Free memory was 561.4 MB in the beginning and 639.5 MB in the end (delta: -78.2 MB). Peak memory consumption was 29.2 MB. Max. memory is 50.3 GB. [2020-07-01 12:39:22,694 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.38 ms. Allocated memory is still 676.9 MB. Free memory was 639.5 MB in the beginning and 637.4 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-07-01 12:39:22,695 INFO L168 Benchmark]: Boogie Preprocessor took 25.72 ms. Allocated memory is still 676.9 MB. Free memory was 637.4 MB in the beginning and 636.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-07-01 12:39:22,695 INFO L168 Benchmark]: RCFGBuilder took 323.10 ms. Allocated memory is still 676.9 MB. Free memory was 636.3 MB in the beginning and 610.7 MB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 50.3 GB. [2020-07-01 12:39:22,695 INFO L168 Benchmark]: BlockEncodingV2 took 124.17 ms. Allocated memory is still 676.9 MB. Free memory was 610.7 MB in the beginning and 602.0 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 50.3 GB. [2020-07-01 12:39:22,696 INFO L168 Benchmark]: TraceAbstraction took 13521.03 ms. Allocated memory was 676.9 MB in the beginning and 918.6 MB in the end (delta: 241.7 MB). Free memory was 601.0 MB in the beginning and 576.7 MB in the end (delta: 24.3 MB). Peak memory consumption was 266.0 MB. Max. memory is 50.3 GB. [2020-07-01 12:39:22,696 INFO L168 Benchmark]: BuchiAutomizer took 242.45 ms. Allocated memory is still 918.6 MB. Free memory was 576.7 MB in the beginning and 539.2 MB in the end (delta: 37.5 MB). Peak memory consumption was 37.5 MB. Max. memory is 50.3 GB. [2020-07-01 12:39:22,698 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 31 locations, 38 edges - StatisticsResult: Encoded RCFG 23 locations, 41 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 583.2 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 305.37 ms. Allocated memory was 649.6 MB in the beginning and 676.9 MB in the end (delta: 27.3 MB). Free memory was 561.4 MB in the beginning and 639.5 MB in the end (delta: -78.2 MB). Peak memory consumption was 29.2 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 39.38 ms. Allocated memory is still 676.9 MB. Free memory was 639.5 MB in the beginning and 637.4 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 25.72 ms. Allocated memory is still 676.9 MB. Free memory was 637.4 MB in the beginning and 636.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 323.10 ms. Allocated memory is still 676.9 MB. Free memory was 636.3 MB in the beginning and 610.7 MB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 124.17 ms. Allocated memory is still 676.9 MB. Free memory was 610.7 MB in the beginning and 602.0 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 50.3 GB. * TraceAbstraction took 13521.03 ms. Allocated memory was 676.9 MB in the beginning and 918.6 MB in the end (delta: 241.7 MB). Free memory was 601.0 MB in the beginning and 576.7 MB in the end (delta: 24.3 MB). Peak memory consumption was 266.0 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 242.45 ms. Allocated memory is still 918.6 MB. Free memory was 576.7 MB in the beginning and 539.2 MB in the end (delta: 37.5 MB). Peak memory consumption was 37.5 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 39]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 39]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 19]: Loop Invariant [2020-07-01 12:39:22,708 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,709 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,709 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,709 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:39:22,709 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,709 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,710 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,711 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,711 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,711 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:39:22,711 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,712 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((((((((((((d + n <= unknown-#length-unknown[d] + 1 && n == unknown-#length-unknown[nondetArea]) && 1 == \valid[d]) && 1 <= n) && 0 == dst) && (1 < length || 1 == length + nondetString)) && length == unknown-#length-unknown[nondetString]) && 1 <= unknown-#StackHeapBarrier-unknown) && \valid[nondetArea] == 1) && 1 <= n) && 1 <= d) && 0 == src) && n <= unknown-#length-unknown[dst]) && 1 == \valid[nondetString]) && 1 == \valid[s]) && 1 <= s) && 1 == \valid[src]) && 0 == nondetArea) && 1 == \valid[dst]) && 0 == nondetString) && 1 <= unknown-#length-unknown[src] - InvariantResult [Line: 16]: Loop Invariant [2020-07-01 12:39:22,712 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:22,713 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:22,713 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:22,713 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:22,713 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:22,713 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:22,714 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:22,714 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:22,714 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:22,715 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,716 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:39:22,716 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,716 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,716 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,716 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,717 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:39:22,717 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,717 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,717 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:39:22,717 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,718 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,718 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,718 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:39:22,718 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,718 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,719 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,719 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,719 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,719 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:39:22,719 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,720 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,721 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:22,721 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:22,721 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:22,721 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:22,721 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:22,722 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:22,722 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:22,722 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:22,722 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:22,723 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,724 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:39:22,724 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,724 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,724 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,724 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,725 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:39:22,725 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,725 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,725 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:39:22,725 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,726 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,726 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,726 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:39:22,726 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,726 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,727 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,727 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,727 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,727 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:39:22,727 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:22,728 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((((((((((((((((((length == unknown-#length-unknown[nondetString] && 1 <= unknown-#StackHeapBarrier-unknown) && 0 == s) && 1 <= n) && 0 == d) && 0 == src) && n <= unknown-#length-unknown[dst]) && 1 == \valid[nondetString]) && 1 == \valid[s]) && !(d == s)) && 1 == \valid[src]) && 0 == nondetArea) && !(src == dst)) && (1 == length + nondetString || (1 < length && length == unknown-#length-unknown[nondetString]))) && 1 == \valid[dst]) && 0 == nondetString) && !(nondetString == nondetArea)) && n == unknown-#length-unknown[nondetArea]) && n <= unknown-#length-unknown[d]) && 1 == \valid[d]) && 1 <= n) && 0 == dst) && (\exists ULTIMATE.start_main_~nondetString~0.offset : int :: (ULTIMATE.start_main_~nondetString~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString~0.offset) && 0 == unknown-#memory_int-unknown[src][unknown-#length-unknown[src] + ULTIMATE.start_main_~nondetString~0.offset + -1])) && 1 <= unknown-#length-unknown[s]) && (nondetString == nondetArea || \valid[nondetArea] == 1)) && (\exists ULTIMATE.start_main_~nondetString~0.offset : int :: (ULTIMATE.start_main_~nondetString~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString~0.offset) && 0 == unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + ULTIMATE.start_main_~nondetString~0.offset + -1])) && 1 <= unknown-#length-unknown[src]) || ((((((((((((((((((((((((length == unknown-#length-unknown[nondetString] && 1 <= unknown-#StackHeapBarrier-unknown) && 1 <= n) && 1 <= d) && d + n <= unknown-#length-unknown[d]) && 0 == src) && n <= unknown-#length-unknown[dst]) && 1 == \valid[nondetString]) && 1 == \valid[s]) && s + 1 <= unknown-#length-unknown[s]) && !(d == s)) && 1 <= s) && 1 == \valid[src]) && 0 == nondetArea) && 0 == nondetString) && 1 == \valid[dst]) && (1 == length + nondetString || (1 < length && length == unknown-#length-unknown[nondetString]))) && !(nondetString == nondetArea)) && n == unknown-#length-unknown[nondetArea]) && 1 == \valid[d]) && 1 <= n) && 0 == dst) && (\exists ULTIMATE.start_main_~nondetString~0.offset : int :: (ULTIMATE.start_main_~nondetString~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString~0.offset) && 0 == unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + ULTIMATE.start_main_~nondetString~0.offset + -1])) && (nondetString == nondetArea || \valid[nondetArea] == 1)) && 1 <= unknown-#length-unknown[src]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 8 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 12.5s, OverallIterations: 25, TraceHistogramMax: 3, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 181 SDtfs, 1357 SDslu, 1275 SDs, 0 SdLazy, 2446 SolverSat, 398 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 398 GetRequests, 136 SyntacticMatches, 1 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 859 ImplicationChecksByTransitivity, 5.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 40 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 8 NumberOfFragments, 395 HoareAnnotationTreeSize, 2 FomulaSimplifications, 1317 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 926 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 457 NumberOfCodeBlocks, 457 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 423 ConstructedInterpolants, 12 QuantifiedInterpolants, 43223 SizeOfPredicates, 81 NumberOfNonLiveVariables, 1183 ConjunctsInSsa, 192 ConjunctsInUnsatCore, 34 InterpolantComputations, 16 PerfectInterpolantSequences, 31/102 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 12:39:04.761 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp/BenchExec_run_ZhV00q/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 12:39:22.954 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check