java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test10_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-29 23:59:59,182 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-29 23:59:59,183 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-29 23:59:59,196 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-29 23:59:59,196 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-29 23:59:59,197 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-29 23:59:59,198 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-29 23:59:59,200 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-29 23:59:59,202 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-29 23:59:59,203 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-29 23:59:59,204 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-29 23:59:59,204 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-29 23:59:59,205 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-29 23:59:59,206 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-29 23:59:59,207 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-29 23:59:59,210 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-29 23:59:59,212 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-29 23:59:59,214 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-29 23:59:59,215 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-29 23:59:59,216 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-29 23:59:59,218 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-29 23:59:59,218 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-29 23:59:59,218 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-29 23:59:59,219 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-29 23:59:59,220 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-29 23:59:59,221 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-29 23:59:59,222 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-29 23:59:59,222 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-29 23:59:59,222 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-29 23:59:59,223 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-29 23:59:59,223 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-29 23:59:59,224 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-29 23:59:59,233 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-29 23:59:59,234 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-29 23:59:59,234 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-29 23:59:59,235 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-29 23:59:59,235 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-29 23:59:59,235 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-29 23:59:59,235 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-29 23:59:59,236 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-29 23:59:59,236 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-29 23:59:59,236 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-29 23:59:59,236 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-29 23:59:59,237 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-29 23:59:59,237 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-29 23:59:59,237 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-29 23:59:59,237 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-29 23:59:59,237 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-29 23:59:59,238 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-29 23:59:59,238 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-29 23:59:59,238 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-29 23:59:59,238 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-29 23:59:59,238 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-29 23:59:59,239 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-29 23:59:59,239 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-29 23:59:59,239 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-29 23:59:59,239 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-29 23:59:59,240 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-29 23:59:59,240 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-29 23:59:59,240 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-29 23:59:59,240 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-29 23:59:59,240 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-29 23:59:59,240 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-29 23:59:59,241 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-29 23:59:59,241 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-29 23:59:59,242 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-29 23:59:59,275 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-29 23:59:59,287 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-29 23:59:59,291 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-29 23:59:59,293 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-29 23:59:59,294 INFO L276 PluginConnector]: CDTParser initialized [2018-01-29 23:59:59,294 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test10_false-valid-memtrack_true-termination.i [2018-01-29 23:59:59,481 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-29 23:59:59,485 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-29 23:59:59,497 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-29 23:59:59,497 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-29 23:59:59,502 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-29 23:59:59,503 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:59:59" (1/1) ... [2018-01-29 23:59:59,506 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13f5e0b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:59:59, skipping insertion in model container [2018-01-29 23:59:59,506 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:59:59" (1/1) ... [2018-01-29 23:59:59,524 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 23:59:59,572 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 23:59:59,683 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 23:59:59,703 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 23:59:59,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:59:59 WrapperNode [2018-01-29 23:59:59,713 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-29 23:59:59,714 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-29 23:59:59,714 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-29 23:59:59,714 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-29 23:59:59,728 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:59:59" (1/1) ... [2018-01-29 23:59:59,728 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:59:59" (1/1) ... [2018-01-29 23:59:59,737 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:59:59" (1/1) ... [2018-01-29 23:59:59,737 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:59:59" (1/1) ... [2018-01-29 23:59:59,744 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:59:59" (1/1) ... [2018-01-29 23:59:59,746 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:59:59" (1/1) ... [2018-01-29 23:59:59,748 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:59:59" (1/1) ... [2018-01-29 23:59:59,750 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-29 23:59:59,750 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-29 23:59:59,750 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-29 23:59:59,750 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-29 23:59:59,751 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:59:59" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-29 23:59:59,801 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-29 23:59:59,801 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-29 23:59:59,801 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-29 23:59:59,801 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_10 [2018-01-29 23:59:59,801 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-29 23:59:59,801 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-29 23:59:59,802 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-29 23:59:59,802 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-29 23:59:59,802 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-29 23:59:59,802 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-29 23:59:59,802 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-29 23:59:59,802 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-29 23:59:59,803 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-29 23:59:59,803 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-29 23:59:59,803 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-29 23:59:59,803 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_10 [2018-01-29 23:59:59,803 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-29 23:59:59,803 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-29 23:59:59,804 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-29 23:59:59,804 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 00:00:00,099 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 00:00:00,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:00:00 BoogieIcfgContainer [2018-01-30 00:00:00,100 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 00:00:00,101 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 00:00:00,101 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 00:00:00,104 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 00:00:00,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 11:59:59" (1/3) ... [2018-01-30 00:00:00,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d6c11fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:00:00, skipping insertion in model container [2018-01-30 00:00:00,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:59:59" (2/3) ... [2018-01-30 00:00:00,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d6c11fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:00:00, skipping insertion in model container [2018-01-30 00:00:00,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:00:00" (3/3) ... [2018-01-30 00:00:00,108 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test10_false-valid-memtrack_true-termination.i [2018-01-30 00:00:00,114 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 00:00:00,121 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 31 error locations. [2018-01-30 00:00:00,158 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 00:00:00,159 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 00:00:00,159 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 00:00:00,159 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 00:00:00,159 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 00:00:00,159 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 00:00:00,159 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 00:00:00,159 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 00:00:00,160 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 00:00:00,176 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states. [2018-01-30 00:00:00,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-30 00:00:00,183 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:00:00,184 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:00:00,184 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-01-30 00:00:00,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1603390114, now seen corresponding path program 1 times [2018-01-30 00:00:00,189 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:00:00,189 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:00:00,234 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:00,235 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:00:00,235 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:00,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:00:00,286 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:00:00,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:00:00,373 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:00:00,374 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-30 00:00:00,376 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 00:00:00,474 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 00:00:00,474 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 00:00:00,477 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 3 states. [2018-01-30 00:00:00,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:00:00,684 INFO L93 Difference]: Finished difference Result 164 states and 182 transitions. [2018-01-30 00:00:00,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 00:00:00,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-01-30 00:00:00,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:00:00,698 INFO L225 Difference]: With dead ends: 164 [2018-01-30 00:00:00,698 INFO L226 Difference]: Without dead ends: 157 [2018-01-30 00:00:00,702 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 00:00:00,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-01-30 00:00:00,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 99. [2018-01-30 00:00:00,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-30 00:00:00,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2018-01-30 00:00:00,750 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 21 [2018-01-30 00:00:00,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:00:00,751 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2018-01-30 00:00:00,751 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 00:00:00,751 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2018-01-30 00:00:00,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-30 00:00:00,753 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:00:00,753 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:00:00,754 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-01-30 00:00:00,754 INFO L82 PathProgramCache]: Analyzing trace with hash -598675529, now seen corresponding path program 1 times [2018-01-30 00:00:00,754 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:00:00,754 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:00:00,756 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:00,756 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:00:00,757 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:00,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:00:00,776 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:00:00,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:00:00,859 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:00:00,859 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 00:00:00,861 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:00:00,861 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:00:00,861 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:00:00,862 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand 6 states. [2018-01-30 00:00:01,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:00:01,010 INFO L93 Difference]: Finished difference Result 157 states and 173 transitions. [2018-01-30 00:00:01,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:00:01,011 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-30 00:00:01,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:00:01,012 INFO L225 Difference]: With dead ends: 157 [2018-01-30 00:00:01,012 INFO L226 Difference]: Without dead ends: 153 [2018-01-30 00:00:01,013 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:00:01,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-01-30 00:00:01,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 94. [2018-01-30 00:00:01,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-30 00:00:01,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2018-01-30 00:00:01,023 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 22 [2018-01-30 00:00:01,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:00:01,023 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2018-01-30 00:00:01,023 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:00:01,024 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2018-01-30 00:00:01,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-30 00:00:01,024 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:00:01,025 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:00:01,025 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-01-30 00:00:01,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1027705889, now seen corresponding path program 1 times [2018-01-30 00:00:01,025 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:00:01,025 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:00:01,027 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:01,027 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:00:01,027 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:01,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:00:01,042 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:00:01,094 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-30 00:00:01,094 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:00:01,094 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:00:01,105 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:00:01,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:00:01,149 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:00:01,176 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:00:01,206 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 00:00:01,206 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2018-01-30 00:00:01,206 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:00:01,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:00:01,207 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:00:01,207 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand 5 states. [2018-01-30 00:00:01,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:00:01,285 INFO L93 Difference]: Finished difference Result 182 states and 194 transitions. [2018-01-30 00:00:01,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:00:01,285 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-01-30 00:00:01,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:00:01,287 INFO L225 Difference]: With dead ends: 182 [2018-01-30 00:00:01,287 INFO L226 Difference]: Without dead ends: 96 [2018-01-30 00:00:01,288 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:00:01,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-01-30 00:00:01,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-01-30 00:00:01,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-30 00:00:01,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2018-01-30 00:00:01,301 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 27 [2018-01-30 00:00:01,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:00:01,301 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2018-01-30 00:00:01,302 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:00:01,302 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2018-01-30 00:00:01,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-30 00:00:01,303 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:00:01,303 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:00:01,303 INFO L371 AbstractCegarLoop]: === Iteration 4 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-01-30 00:00:01,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1204271240, now seen corresponding path program 1 times [2018-01-30 00:00:01,303 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:00:01,303 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:00:01,305 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:01,305 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:00:01,305 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:01,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:00:01,324 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:00:01,403 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:00:01,403 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:00:01,403 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:00:01,417 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:00:01,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:00:01,443 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:00:01,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2018-01-30 00:00:01,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:01,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:01,476 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-30 00:00:01,491 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:00:01,525 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:00:01,525 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-01-30 00:00:01,525 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 00:00:01,525 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 00:00:01,525 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:00:01,526 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand 7 states. [2018-01-30 00:00:01,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:00:01,969 INFO L93 Difference]: Finished difference Result 124 states and 131 transitions. [2018-01-30 00:00:01,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 00:00:01,969 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-01-30 00:00:01,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:00:01,971 INFO L225 Difference]: With dead ends: 124 [2018-01-30 00:00:01,971 INFO L226 Difference]: Without dead ends: 117 [2018-01-30 00:00:01,971 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-30 00:00:01,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-01-30 00:00:01,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 108. [2018-01-30 00:00:01,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-01-30 00:00:01,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 124 transitions. [2018-01-30 00:00:01,983 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 124 transitions. Word has length 28 [2018-01-30 00:00:01,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:00:01,984 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 124 transitions. [2018-01-30 00:00:01,984 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 00:00:01,984 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 124 transitions. [2018-01-30 00:00:01,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-30 00:00:01,985 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:00:01,985 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:00:01,985 INFO L371 AbstractCegarLoop]: === Iteration 5 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-01-30 00:00:01,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1204271239, now seen corresponding path program 1 times [2018-01-30 00:00:01,986 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:00:01,986 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:00:01,987 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:01,988 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:00:01,988 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:02,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:00:02,009 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:00:02,311 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:00:02,311 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:00:02,311 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:00:02,317 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:00:02,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:00:02,336 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:00:02,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 20 treesize of output 19 [2018-01-30 00:00:02,351 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:02,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 16 [2018-01-30 00:00:02,364 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:02,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:00:02,378 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-30 00:00:02,474 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:00:02,494 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:00:02,494 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-01-30 00:00:02,495 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-30 00:00:02,495 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-30 00:00:02,495 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-01-30 00:00:02,495 INFO L87 Difference]: Start difference. First operand 108 states and 124 transitions. Second operand 13 states. [2018-01-30 00:00:02,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:00:02,961 INFO L93 Difference]: Finished difference Result 160 states and 181 transitions. [2018-01-30 00:00:02,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 00:00:02,961 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2018-01-30 00:00:02,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:00:02,963 INFO L225 Difference]: With dead ends: 160 [2018-01-30 00:00:02,963 INFO L226 Difference]: Without dead ends: 153 [2018-01-30 00:00:02,963 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2018-01-30 00:00:02,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-01-30 00:00:02,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 137. [2018-01-30 00:00:02,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-01-30 00:00:02,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 170 transitions. [2018-01-30 00:00:02,978 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 170 transitions. Word has length 28 [2018-01-30 00:00:02,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:00:02,978 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 170 transitions. [2018-01-30 00:00:02,978 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-30 00:00:02,978 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 170 transitions. [2018-01-30 00:00:02,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-30 00:00:02,979 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:00:02,979 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:00:02,979 INFO L371 AbstractCegarLoop]: === Iteration 6 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-01-30 00:00:02,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1948836723, now seen corresponding path program 1 times [2018-01-30 00:00:02,980 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:00:02,980 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:00:02,981 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:02,981 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:00:02,981 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:02,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:00:03,000 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:00:03,201 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:00:03,202 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:00:03,202 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:00:03,215 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:00:03,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:00:03,239 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:00:03,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2018-01-30 00:00:03,244 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:03,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:03,245 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-30 00:00:03,317 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:00:03,321 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:00:03,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-30 00:00:03,325 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:03,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 00:00:03,338 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-01-30 00:00:03,366 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:00:03,389 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:00:03,389 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-01-30 00:00:03,389 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-30 00:00:03,390 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-30 00:00:03,390 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=86, Unknown=1, NotChecked=0, Total=110 [2018-01-30 00:00:03,390 INFO L87 Difference]: Start difference. First operand 137 states and 170 transitions. Second operand 11 states. [2018-01-30 00:00:03,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:00:03,945 INFO L93 Difference]: Finished difference Result 155 states and 176 transitions. [2018-01-30 00:00:03,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-30 00:00:03,946 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-01-30 00:00:03,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:00:03,948 INFO L225 Difference]: With dead ends: 155 [2018-01-30 00:00:03,949 INFO L226 Difference]: Without dead ends: 152 [2018-01-30 00:00:03,949 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=184, Unknown=1, NotChecked=0, Total=240 [2018-01-30 00:00:03,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-01-30 00:00:03,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 129. [2018-01-30 00:00:03,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-01-30 00:00:03,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 158 transitions. [2018-01-30 00:00:03,964 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 158 transitions. Word has length 29 [2018-01-30 00:00:03,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:00:03,965 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 158 transitions. [2018-01-30 00:00:03,965 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-30 00:00:03,965 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 158 transitions. [2018-01-30 00:00:03,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-30 00:00:03,966 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:00:03,966 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:00:03,966 INFO L371 AbstractCegarLoop]: === Iteration 7 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-01-30 00:00:03,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1948836724, now seen corresponding path program 1 times [2018-01-30 00:00:03,967 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:00:03,967 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:00:03,968 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:03,969 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:00:03,969 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:03,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:00:03,985 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:00:04,242 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:00:04,242 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:00:04,243 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:00:04,250 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:00:04,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:00:04,270 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:00:04,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 26 treesize of output 25 [2018-01-30 00:00:04,299 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:04,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 23 treesize of output 22 [2018-01-30 00:00:04,323 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:04,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 treesize of output 21 [2018-01-30 00:00:04,341 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:04,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 25 treesize of output 24 [2018-01-30 00:00:04,343 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:04,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:00:04,358 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-30 00:00:04,529 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:00:04,529 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:00:04,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-30 00:00:04,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:04,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 15 [2018-01-30 00:00:04,561 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:04,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 00:00:04,566 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2018-01-30 00:00:04,587 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:00:04,608 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:00:04,608 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-01-30 00:00:04,608 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-30 00:00:04,609 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-30 00:00:04,609 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=291, Unknown=1, NotChecked=0, Total=342 [2018-01-30 00:00:04,609 INFO L87 Difference]: Start difference. First operand 129 states and 158 transitions. Second operand 19 states. [2018-01-30 00:00:05,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:00:05,807 INFO L93 Difference]: Finished difference Result 175 states and 193 transitions. [2018-01-30 00:00:05,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-30 00:00:05,807 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 29 [2018-01-30 00:00:05,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:00:05,808 INFO L225 Difference]: With dead ends: 175 [2018-01-30 00:00:05,808 INFO L226 Difference]: Without dead ends: 168 [2018-01-30 00:00:05,809 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=112, Invalid=584, Unknown=6, NotChecked=0, Total=702 [2018-01-30 00:00:05,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-01-30 00:00:05,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 86. [2018-01-30 00:00:05,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-30 00:00:05,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2018-01-30 00:00:05,819 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 29 [2018-01-30 00:00:05,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:00:05,819 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2018-01-30 00:00:05,819 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-30 00:00:05,819 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2018-01-30 00:00:05,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-30 00:00:05,820 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:00:05,820 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:00:05,821 INFO L371 AbstractCegarLoop]: === Iteration 8 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-01-30 00:00:05,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1106081087, now seen corresponding path program 1 times [2018-01-30 00:00:05,821 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:00:05,821 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:00:05,822 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:05,822 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:00:05,822 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:05,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:00:05,832 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:00:05,913 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-30 00:00:05,913 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:00:05,913 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:00:05,924 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:00:05,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:00:05,942 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:00:06,072 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-30 00:00:06,106 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:00:06,106 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 13 [2018-01-30 00:00:06,106 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-30 00:00:06,106 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-30 00:00:06,107 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=143, Unknown=10, NotChecked=0, Total=182 [2018-01-30 00:00:06,107 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand 14 states. [2018-01-30 00:00:06,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:00:06,657 INFO L93 Difference]: Finished difference Result 133 states and 145 transitions. [2018-01-30 00:00:06,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-30 00:00:06,657 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2018-01-30 00:00:06,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:00:06,659 INFO L225 Difference]: With dead ends: 133 [2018-01-30 00:00:06,659 INFO L226 Difference]: Without dead ends: 127 [2018-01-30 00:00:06,659 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=340, Unknown=10, NotChecked=0, Total=420 [2018-01-30 00:00:06,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-01-30 00:00:06,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 90. [2018-01-30 00:00:06,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-01-30 00:00:06,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2018-01-30 00:00:06,669 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 36 [2018-01-30 00:00:06,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:00:06,669 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2018-01-30 00:00:06,669 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-30 00:00:06,669 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2018-01-30 00:00:06,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-30 00:00:06,671 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:00:06,671 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:00:06,671 INFO L371 AbstractCegarLoop]: === Iteration 9 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-01-30 00:00:06,671 INFO L82 PathProgramCache]: Analyzing trace with hash -601102790, now seen corresponding path program 1 times [2018-01-30 00:00:06,672 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:00:06,672 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:00:06,673 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:06,673 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:00:06,673 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:06,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:00:06,685 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:00:06,732 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-30 00:00:06,732 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:00:06,732 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-30 00:00:06,732 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 00:00:06,732 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 00:00:06,733 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:00:06,733 INFO L87 Difference]: Start difference. First operand 90 states and 97 transitions. Second operand 7 states. [2018-01-30 00:00:06,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:00:06,817 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2018-01-30 00:00:06,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 00:00:06,818 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2018-01-30 00:00:06,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:00:06,819 INFO L225 Difference]: With dead ends: 100 [2018-01-30 00:00:06,819 INFO L226 Difference]: Without dead ends: 94 [2018-01-30 00:00:06,820 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-01-30 00:00:06,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-01-30 00:00:06,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 84. [2018-01-30 00:00:06,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-30 00:00:06,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2018-01-30 00:00:06,830 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 37 [2018-01-30 00:00:06,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:00:06,831 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2018-01-30 00:00:06,831 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 00:00:06,831 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2018-01-30 00:00:06,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-30 00:00:06,832 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:00:06,832 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:00:06,832 INFO L371 AbstractCegarLoop]: === Iteration 10 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-01-30 00:00:06,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1225136673, now seen corresponding path program 1 times [2018-01-30 00:00:06,833 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:00:06,833 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:00:06,834 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:06,834 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:00:06,834 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:06,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:00:06,845 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:00:06,900 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-01-30 00:00:06,900 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:00:06,900 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:00:06,907 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:00:06,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:00:06,927 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:00:06,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-01-30 00:00:06,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-01-30 00:00:06,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:06,958 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:06,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-01-30 00:00:06,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-01-30 00:00:06,964 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:06,965 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:06,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:06,968 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-01-30 00:00:06,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2018-01-30 00:00:06,975 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-30 00:00:06,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:06,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:06,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2018-01-30 00:00:06,982 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-30 00:00:06,982 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:06,983 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:06,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:06,985 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-01-30 00:00:06,990 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-30 00:00:07,010 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 00:00:07,010 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2018-01-30 00:00:07,011 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:00:07,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:00:07,011 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:00:07,011 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand 6 states. [2018-01-30 00:00:07,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:00:07,053 INFO L93 Difference]: Finished difference Result 156 states and 165 transitions. [2018-01-30 00:00:07,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:00:07,054 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-01-30 00:00:07,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:00:07,055 INFO L225 Difference]: With dead ends: 156 [2018-01-30 00:00:07,055 INFO L226 Difference]: Without dead ends: 84 [2018-01-30 00:00:07,055 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:00:07,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-30 00:00:07,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-01-30 00:00:07,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-30 00:00:07,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2018-01-30 00:00:07,065 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 42 [2018-01-30 00:00:07,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:00:07,065 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2018-01-30 00:00:07,065 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:00:07,065 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-01-30 00:00:07,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-30 00:00:07,066 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:00:07,066 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:00:07,066 INFO L371 AbstractCegarLoop]: === Iteration 11 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-01-30 00:00:07,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1416405724, now seen corresponding path program 2 times [2018-01-30 00:00:07,066 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:00:07,066 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:00:07,067 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:07,067 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:00:07,068 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:07,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:00:07,083 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:00:07,363 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-30 00:00:07,363 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:00:07,363 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:00:07,379 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 00:00:07,390 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:00:07,409 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:00:07,414 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:00:07,418 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:00:07,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 20 treesize of output 19 [2018-01-30 00:00:07,440 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:07,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 23 treesize of output 22 [2018-01-30 00:00:07,458 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:07,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 treesize of output 21 [2018-01-30 00:00:07,488 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:07,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 18 [2018-01-30 00:00:07,489 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:07,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:00:07,501 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:40 [2018-01-30 00:00:07,666 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:00:07,667 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:00:07,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-30 00:00:07,667 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:07,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 15 [2018-01-30 00:00:07,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:07,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:07,678 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-30 00:00:07,700 INFO L477 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 11 treesize of output 8 [2018-01-30 00:00:07,702 INFO L477 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 8 treesize of output 7 [2018-01-30 00:00:07,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:07,704 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:07,714 INFO L477 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 11 treesize of output 8 [2018-01-30 00:00:07,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-01-30 00:00:07,716 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:07,717 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:07,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:07,725 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:47, output treesize:40 [2018-01-30 00:00:07,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 25 treesize of output 19 [2018-01-30 00:00:07,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 19 treesize of output 10 [2018-01-30 00:00:07,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:07,757 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:07,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 11 [2018-01-30 00:00:07,769 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-30 00:00:07,769 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:07,770 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:07,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 00:00:07,787 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:54, output treesize:23 [2018-01-30 00:00:07,822 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:00:07,843 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:00:07,843 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14] total 20 [2018-01-30 00:00:07,843 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-30 00:00:07,843 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-30 00:00:07,843 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2018-01-30 00:00:07,844 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 21 states. [2018-01-30 00:00:08,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:00:08,499 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2018-01-30 00:00:08,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-30 00:00:08,499 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 43 [2018-01-30 00:00:08,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:00:08,500 INFO L225 Difference]: With dead ends: 117 [2018-01-30 00:00:08,500 INFO L226 Difference]: Without dead ends: 116 [2018-01-30 00:00:08,501 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=106, Invalid=706, Unknown=0, NotChecked=0, Total=812 [2018-01-30 00:00:08,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-30 00:00:08,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 83. [2018-01-30 00:00:08,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-30 00:00:08,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2018-01-30 00:00:08,507 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 43 [2018-01-30 00:00:08,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:00:08,507 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2018-01-30 00:00:08,507 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-30 00:00:08,507 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2018-01-30 00:00:08,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-30 00:00:08,508 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:00:08,508 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:00:08,508 INFO L371 AbstractCegarLoop]: === Iteration 12 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-01-30 00:00:08,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1416405723, now seen corresponding path program 1 times [2018-01-30 00:00:08,508 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:00:08,508 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:00:08,509 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:08,509 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:00:08,509 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:08,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:00:08,517 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:00:08,610 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-30 00:00:08,611 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:00:08,611 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:00:08,623 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:00:08,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:00:08,647 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:00:08,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2018-01-30 00:00:08,660 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:08,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:08,664 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-30 00:00:08,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-01-30 00:00:08,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-01-30 00:00:08,680 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:08,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:08,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:08,686 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-01-30 00:00:08,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 17 treesize of output 13 [2018-01-30 00:00:08,709 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-01-30 00:00:08,709 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:08,711 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:08,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:08,713 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-01-30 00:00:08,717 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-30 00:00:08,751 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:00:08,751 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-01-30 00:00:08,751 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 00:00:08,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 00:00:08,752 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:00:08,752 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 8 states. [2018-01-30 00:00:08,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:00:08,928 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2018-01-30 00:00:08,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-30 00:00:08,928 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2018-01-30 00:00:08,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:00:08,929 INFO L225 Difference]: With dead ends: 93 [2018-01-30 00:00:08,929 INFO L226 Difference]: Without dead ends: 92 [2018-01-30 00:00:08,929 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-01-30 00:00:08,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-01-30 00:00:08,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 84. [2018-01-30 00:00:08,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-30 00:00:08,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2018-01-30 00:00:08,939 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 43 [2018-01-30 00:00:08,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:00:08,939 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2018-01-30 00:00:08,939 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 00:00:08,940 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-01-30 00:00:08,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-30 00:00:08,940 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:00:08,941 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:00:08,941 INFO L371 AbstractCegarLoop]: === Iteration 13 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-01-30 00:00:08,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1585441552, now seen corresponding path program 1 times [2018-01-30 00:00:08,941 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:00:08,941 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:00:08,942 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:08,943 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:00:08,943 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:08,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:00:08,955 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:00:09,083 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-30 00:00:09,083 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:00:09,083 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:00:09,088 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:00:09,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:00:09,105 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:00:09,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2018-01-30 00:00:09,111 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:09,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:09,113 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-30 00:00:09,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-01-30 00:00:09,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-01-30 00:00:09,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:09,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:09,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:09,133 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-01-30 00:00:09,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 17 treesize of output 13 [2018-01-30 00:00:09,141 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-01-30 00:00:09,141 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:09,142 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:09,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:09,144 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-01-30 00:00:09,173 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:00:09,173 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:00:09,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-30 00:00:09,175 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:09,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 00:00:09,180 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-01-30 00:00:09,193 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-30 00:00:09,213 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:00:09,213 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-01-30 00:00:09,213 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-30 00:00:09,214 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-30 00:00:09,214 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=106, Unknown=1, NotChecked=0, Total=132 [2018-01-30 00:00:09,214 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 12 states. [2018-01-30 00:00:09,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:00:09,472 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2018-01-30 00:00:09,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-30 00:00:09,472 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 44 [2018-01-30 00:00:09,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:00:09,473 INFO L225 Difference]: With dead ends: 93 [2018-01-30 00:00:09,473 INFO L226 Difference]: Without dead ends: 92 [2018-01-30 00:00:09,473 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=218, Unknown=1, NotChecked=0, Total=272 [2018-01-30 00:00:09,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-01-30 00:00:09,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 82. [2018-01-30 00:00:09,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-30 00:00:09,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2018-01-30 00:00:09,479 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 44 [2018-01-30 00:00:09,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:00:09,480 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2018-01-30 00:00:09,480 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-30 00:00:09,480 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2018-01-30 00:00:09,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-30 00:00:09,481 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:00:09,481 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:00:09,481 INFO L371 AbstractCegarLoop]: === Iteration 14 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-01-30 00:00:09,481 INFO L82 PathProgramCache]: Analyzing trace with hash 896152095, now seen corresponding path program 1 times [2018-01-30 00:00:09,481 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:00:09,481 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:00:09,482 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:09,482 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:00:09,482 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:09,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:00:09,493 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:00:09,624 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-30 00:00:09,652 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:00:09,652 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:00:09,657 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:00:09,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:00:09,676 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:00:09,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2018-01-30 00:00:09,682 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:09,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:09,687 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-30 00:00:09,726 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:00:09,727 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:00:09,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-30 00:00:09,728 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:09,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:09,734 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-01-30 00:00:09,752 INFO L477 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 11 treesize of output 8 [2018-01-30 00:00:09,754 INFO L477 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 8 treesize of output 7 [2018-01-30 00:00:09,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:09,755 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:09,760 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:09,760 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-01-30 00:00:09,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-01-30 00:00:09,795 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:09,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-30 00:00:09,797 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:12 [2018-01-30 00:00:13,815 WARN L143 SmtUtils]: Spent 2003ms on a formula simplification that was a NOOP. DAG size: 12 [2018-01-30 00:00:13,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-01-30 00:00:13,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 11 [2018-01-30 00:00:13,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:13,843 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:13,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:13,848 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:23 [2018-01-30 00:00:13,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 25 treesize of output 19 [2018-01-30 00:00:13,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 19 treesize of output 10 [2018-01-30 00:00:13,852 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:13,855 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:13,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 00:00:13,858 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:15 [2018-01-30 00:00:13,877 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:00:13,904 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:00:13,904 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2018-01-30 00:00:13,905 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-30 00:00:13,905 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-30 00:00:13,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=360, Unknown=1, NotChecked=0, Total=420 [2018-01-30 00:00:13,905 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand 21 states. [2018-01-30 00:00:42,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:00:42,351 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2018-01-30 00:00:42,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-30 00:00:42,352 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 47 [2018-01-30 00:00:42,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:00:42,352 INFO L225 Difference]: With dead ends: 109 [2018-01-30 00:00:42,353 INFO L226 Difference]: Without dead ends: 100 [2018-01-30 00:00:42,353 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=92, Invalid=557, Unknown=1, NotChecked=0, Total=650 [2018-01-30 00:00:42,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-30 00:00:42,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 92. [2018-01-30 00:00:42,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-01-30 00:00:42,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2018-01-30 00:00:42,361 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 47 [2018-01-30 00:00:42,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:00:42,361 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2018-01-30 00:00:42,361 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-30 00:00:42,361 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2018-01-30 00:00:42,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-30 00:00:42,362 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:00:42,362 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:00:42,362 INFO L371 AbstractCegarLoop]: === Iteration 15 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-01-30 00:00:42,362 INFO L82 PathProgramCache]: Analyzing trace with hash 896152096, now seen corresponding path program 1 times [2018-01-30 00:00:42,362 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:00:42,362 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:00:42,363 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:42,363 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:00:42,363 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:42,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:00:42,372 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:00:42,540 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-30 00:00:42,540 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:00:42,540 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:00:42,545 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:00:42,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:00:42,565 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:00:42,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2018-01-30 00:00:42,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:42,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:42,570 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-30 00:00:42,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 25 treesize of output 24 [2018-01-30 00:00:42,581 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:42,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 treesize of output 21 [2018-01-30 00:00:42,596 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:42,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-30 00:00:42,609 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:46 [2018-01-30 00:00:42,685 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:00:42,686 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:00:42,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-01-30 00:00:42,687 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:42,702 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:00:42,703 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:00:42,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-01-30 00:00:42,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:42,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-30 00:00:42,718 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:55, output treesize:43 [2018-01-30 00:00:42,759 INFO L477 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 41 treesize of output 38 [2018-01-30 00:00:42,761 INFO L477 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 8 treesize of output 7 [2018-01-30 00:00:42,762 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:42,769 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:42,793 INFO L477 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 39 treesize of output 36 [2018-01-30 00:00:42,798 INFO L477 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 8 treesize of output 7 [2018-01-30 00:00:42,798 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:42,805 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:42,824 INFO L477 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 37 treesize of output 34 [2018-01-30 00:00:42,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-01-30 00:00:42,827 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:42,833 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:42,851 INFO L477 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 35 treesize of output 32 [2018-01-30 00:00:42,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-01-30 00:00:42,853 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:42,859 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:42,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-30 00:00:42,874 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:81, output treesize:67 [2018-01-30 00:00:42,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 35 treesize of output 24 [2018-01-30 00:00:42,968 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:42,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 37 treesize of output 24 [2018-01-30 00:00:42,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:43,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-01-30 00:00:43,005 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:73, output treesize:39 [2018-01-30 00:00:43,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 77 [2018-01-30 00:00:43,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 11 [2018-01-30 00:00:43,168 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:43,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:43,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2018-01-30 00:00:43,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 11 [2018-01-30 00:00:43,217 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:43,226 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:43,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 00:00:43,269 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:171, output treesize:41 [2018-01-30 00:00:43,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 36 treesize of output 28 [2018-01-30 00:00:43,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 28 treesize of output 17 [2018-01-30 00:00:43,309 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:43,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:43,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 11 [2018-01-30 00:00:43,323 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-30 00:00:43,323 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:43,325 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:43,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 00:00:43,331 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:55, output treesize:21 [2018-01-30 00:00:43,361 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:00:43,382 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:00:43,382 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 21 [2018-01-30 00:00:43,382 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-30 00:00:43,382 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-30 00:00:43,383 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2018-01-30 00:00:43,383 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand 22 states. [2018-01-30 00:00:44,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:00:44,313 INFO L93 Difference]: Finished difference Result 131 states and 139 transitions. [2018-01-30 00:00:44,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-30 00:00:44,313 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 47 [2018-01-30 00:00:44,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:00:44,314 INFO L225 Difference]: With dead ends: 131 [2018-01-30 00:00:44,314 INFO L226 Difference]: Without dead ends: 130 [2018-01-30 00:00:44,315 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=160, Invalid=1100, Unknown=0, NotChecked=0, Total=1260 [2018-01-30 00:00:44,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-01-30 00:00:44,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 91. [2018-01-30 00:00:44,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-01-30 00:00:44,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2018-01-30 00:00:44,324 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 47 [2018-01-30 00:00:44,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:00:44,324 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2018-01-30 00:00:44,324 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-30 00:00:44,324 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2018-01-30 00:00:44,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-30 00:00:44,325 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:00:44,325 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:00:44,325 INFO L371 AbstractCegarLoop]: === Iteration 16 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-01-30 00:00:44,325 INFO L82 PathProgramCache]: Analyzing trace with hash 647695506, now seen corresponding path program 1 times [2018-01-30 00:00:44,325 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:00:44,325 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:00:44,326 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:44,326 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:00:44,326 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:44,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:00:44,339 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:00:44,518 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-30 00:00:44,519 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:00:44,519 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:00:44,530 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:00:44,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:00:44,558 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:00:44,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2018-01-30 00:00:44,562 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:44,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:44,563 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-30 00:00:44,591 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:00:44,592 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:00:44,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-30 00:00:44,592 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:44,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:44,595 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-30 00:00:44,606 INFO L477 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 11 treesize of output 8 [2018-01-30 00:00:44,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-01-30 00:00:44,609 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:44,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:44,617 INFO L477 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 11 treesize of output 8 [2018-01-30 00:00:44,619 INFO L477 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 8 treesize of output 7 [2018-01-30 00:00:44,619 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:44,621 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:44,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:44,633 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-01-30 00:00:44,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 16 treesize of output 12 [2018-01-30 00:00:44,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 12 treesize of output 4 [2018-01-30 00:00:44,644 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:44,645 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:44,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:44,647 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:12 [2018-01-30 00:00:44,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-01-30 00:00:44,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-01-30 00:00:44,686 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:44,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:44,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:44,697 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:23, output treesize:7 [2018-01-30 00:00:44,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2018-01-30 00:00:44,709 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-30 00:00:44,709 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:44,710 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:44,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:44,711 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-01-30 00:00:44,714 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:00:44,734 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:00:44,734 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 14 [2018-01-30 00:00:44,734 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-30 00:00:44,734 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-30 00:00:44,734 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-01-30 00:00:44,735 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand 15 states. [2018-01-30 00:00:45,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:00:45,108 INFO L93 Difference]: Finished difference Result 119 states and 121 transitions. [2018-01-30 00:00:45,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-30 00:00:45,109 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2018-01-30 00:00:45,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:00:45,110 INFO L225 Difference]: With dead ends: 119 [2018-01-30 00:00:45,110 INFO L226 Difference]: Without dead ends: 118 [2018-01-30 00:00:45,110 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 45 SyntacticMatches, 9 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=591, Unknown=0, NotChecked=0, Total=702 [2018-01-30 00:00:45,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-30 00:00:45,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 95. [2018-01-30 00:00:45,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-30 00:00:45,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 98 transitions. [2018-01-30 00:00:45,121 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 98 transitions. Word has length 52 [2018-01-30 00:00:45,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:00:45,121 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 98 transitions. [2018-01-30 00:00:45,121 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-30 00:00:45,121 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 98 transitions. [2018-01-30 00:00:45,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-30 00:00:45,122 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:00:45,122 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:00:45,122 INFO L371 AbstractCegarLoop]: === Iteration 17 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-01-30 00:00:45,123 INFO L82 PathProgramCache]: Analyzing trace with hash 647695507, now seen corresponding path program 1 times [2018-01-30 00:00:45,123 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:00:45,123 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:00:45,124 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:45,124 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:00:45,124 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:45,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:00:45,134 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:00:45,174 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-30 00:00:45,175 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:00:45,175 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:00:45,175 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:00:45,175 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:00:45,176 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:00:45,176 INFO L87 Difference]: Start difference. First operand 95 states and 98 transitions. Second operand 5 states. [2018-01-30 00:00:45,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:00:45,266 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2018-01-30 00:00:45,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:00:45,266 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-01-30 00:00:45,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:00:45,267 INFO L225 Difference]: With dead ends: 96 [2018-01-30 00:00:45,267 INFO L226 Difference]: Without dead ends: 95 [2018-01-30 00:00:45,267 INFO L553 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 [2018-01-30 00:00:45,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-01-30 00:00:45,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-01-30 00:00:45,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-30 00:00:45,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 97 transitions. [2018-01-30 00:00:45,275 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 97 transitions. Word has length 52 [2018-01-30 00:00:45,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:00:45,275 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 97 transitions. [2018-01-30 00:00:45,275 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:00:45,275 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2018-01-30 00:00:45,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-30 00:00:45,275 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:00:45,275 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:00:45,276 INFO L371 AbstractCegarLoop]: === Iteration 18 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-01-30 00:00:45,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1277924023, now seen corresponding path program 1 times [2018-01-30 00:00:45,276 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:00:45,276 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:00:45,277 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:45,277 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:00:45,277 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:45,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:00:45,284 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:00:45,319 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-30 00:00:45,320 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:00:45,320 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:00:45,320 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:00:45,320 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:00:45,320 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:00:45,320 INFO L87 Difference]: Start difference. First operand 95 states and 97 transitions. Second operand 6 states. [2018-01-30 00:00:45,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:00:45,747 INFO L93 Difference]: Finished difference Result 110 states and 113 transitions. [2018-01-30 00:00:45,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:00:45,747 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-01-30 00:00:45,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:00:45,748 INFO L225 Difference]: With dead ends: 110 [2018-01-30 00:00:45,748 INFO L226 Difference]: Without dead ends: 109 [2018-01-30 00:00:45,749 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:00:45,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-01-30 00:00:45,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 94. [2018-01-30 00:00:45,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-30 00:00:45,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2018-01-30 00:00:45,759 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 53 [2018-01-30 00:00:45,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:00:45,759 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2018-01-30 00:00:45,759 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:00:45,760 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2018-01-30 00:00:45,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-30 00:00:45,760 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:00:45,760 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:00:45,760 INFO L371 AbstractCegarLoop]: === Iteration 19 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-01-30 00:00:45,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1277924022, now seen corresponding path program 1 times [2018-01-30 00:00:45,761 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:00:45,761 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:00:45,762 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:45,762 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:00:45,762 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:45,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:00:45,772 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:00:45,890 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-01-30 00:00:45,890 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:00:45,890 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:00:45,902 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:00:45,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:00:45,933 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:00:46,044 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-30 00:00:46,078 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 00:00:46,078 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2018-01-30 00:00:46,079 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-30 00:00:46,079 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-30 00:00:46,079 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-01-30 00:00:46,079 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand 13 states. [2018-01-30 00:00:46,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:00:46,364 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2018-01-30 00:00:46,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-30 00:00:46,365 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2018-01-30 00:00:46,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:00:46,366 INFO L225 Difference]: With dead ends: 109 [2018-01-30 00:00:46,366 INFO L226 Difference]: Without dead ends: 108 [2018-01-30 00:00:46,366 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2018-01-30 00:00:46,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-01-30 00:00:46,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 93. [2018-01-30 00:00:46,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-30 00:00:46,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 95 transitions. [2018-01-30 00:00:46,378 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 95 transitions. Word has length 53 [2018-01-30 00:00:46,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:00:46,378 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 95 transitions. [2018-01-30 00:00:46,378 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-30 00:00:46,378 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 95 transitions. [2018-01-30 00:00:46,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-30 00:00:46,379 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:00:46,379 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:00:46,379 INFO L371 AbstractCegarLoop]: === Iteration 20 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-01-30 00:00:46,379 INFO L82 PathProgramCache]: Analyzing trace with hash -960939075, now seen corresponding path program 1 times [2018-01-30 00:00:46,379 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:00:46,380 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:00:46,380 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:46,381 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:00:46,381 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:46,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:00:46,393 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:00:46,465 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-30 00:00:46,465 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:00:46,465 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 00:00:46,466 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 00:00:46,466 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 00:00:46,466 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:00:46,466 INFO L87 Difference]: Start difference. First operand 93 states and 95 transitions. Second operand 7 states. [2018-01-30 00:00:46,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:00:46,581 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2018-01-30 00:00:46,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 00:00:46,582 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2018-01-30 00:00:46,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:00:46,582 INFO L225 Difference]: With dead ends: 93 [2018-01-30 00:00:46,582 INFO L226 Difference]: Without dead ends: 92 [2018-01-30 00:00:46,583 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-01-30 00:00:46,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-01-30 00:00:46,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-01-30 00:00:46,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-01-30 00:00:46,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2018-01-30 00:00:46,591 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 54 [2018-01-30 00:00:46,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:00:46,591 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2018-01-30 00:00:46,591 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 00:00:46,592 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2018-01-30 00:00:46,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-30 00:00:46,592 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:00:46,592 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:00:46,592 INFO L371 AbstractCegarLoop]: === Iteration 21 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-01-30 00:00:46,592 INFO L82 PathProgramCache]: Analyzing trace with hash -960939074, now seen corresponding path program 1 times [2018-01-30 00:00:46,592 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:00:46,592 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:00:46,593 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:46,593 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:00:46,593 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:46,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:00:46,605 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:00:46,988 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-30 00:00:46,988 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:00:46,988 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:00:46,994 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:00:47,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:00:47,017 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:00:47,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 19 [2018-01-30 00:00:47,105 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-01-30 00:00:47,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:47,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:47,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 26 treesize of output 20 [2018-01-30 00:00:47,115 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-01-30 00:00:47,115 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:47,118 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:47,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:47,120 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:37, output treesize:11 [2018-01-30 00:00:47,139 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-30 00:00:47,159 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 00:00:47,159 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [17] total 22 [2018-01-30 00:00:47,160 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-30 00:00:47,160 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-30 00:00:47,160 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=418, Unknown=0, NotChecked=0, Total=462 [2018-01-30 00:00:47,160 INFO L87 Difference]: Start difference. First operand 92 states and 94 transitions. Second operand 22 states. [2018-01-30 00:00:47,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:00:47,913 INFO L93 Difference]: Finished difference Result 169 states and 174 transitions. [2018-01-30 00:00:47,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-01-30 00:00:47,913 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 54 [2018-01-30 00:00:47,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:00:47,914 INFO L225 Difference]: With dead ends: 169 [2018-01-30 00:00:47,914 INFO L226 Difference]: Without dead ends: 122 [2018-01-30 00:00:47,915 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=230, Invalid=1750, Unknown=0, NotChecked=0, Total=1980 [2018-01-30 00:00:47,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-01-30 00:00:47,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 99. [2018-01-30 00:00:47,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-30 00:00:47,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 102 transitions. [2018-01-30 00:00:47,925 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 102 transitions. Word has length 54 [2018-01-30 00:00:47,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:00:47,925 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 102 transitions. [2018-01-30 00:00:47,925 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-30 00:00:47,925 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 102 transitions. [2018-01-30 00:00:47,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-30 00:00:47,926 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:00:47,926 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:00:47,926 INFO L371 AbstractCegarLoop]: === Iteration 22 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-01-30 00:00:47,926 INFO L82 PathProgramCache]: Analyzing trace with hash -334874379, now seen corresponding path program 1 times [2018-01-30 00:00:47,926 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:00:47,927 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:00:47,928 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:47,928 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:00:47,928 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:47,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:00:47,939 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:00:48,125 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-30 00:00:48,125 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:00:48,198 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:00:48,203 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:00:48,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:00:48,227 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:00:48,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2018-01-30 00:00:48,277 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-01-30 00:00:48,278 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:48,289 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 4 [2018-01-30 00:00:48,289 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:48,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-30 00:00:48,299 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-30 00:00:48,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:00:48,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 16 treesize of output 12 [2018-01-30 00:00:48,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 12 treesize of output 4 [2018-01-30 00:00:48,311 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:48,311 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:48,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-01-30 00:00:48,314 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-30 00:00:48,314 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:48,315 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:48,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:00:48,320 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:39, output treesize:29 [2018-01-30 00:00:48,340 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:00:48,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2018-01-30 00:00:48,341 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:48,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:48,347 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:10 [2018-01-30 00:00:48,359 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-30 00:00:48,379 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:00:48,379 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 15 [2018-01-30 00:00:48,380 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-30 00:00:48,380 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-30 00:00:48,380 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-01-30 00:00:48,380 INFO L87 Difference]: Start difference. First operand 99 states and 102 transitions. Second operand 16 states. [2018-01-30 00:00:48,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:00:48,661 INFO L93 Difference]: Finished difference Result 111 states and 114 transitions. [2018-01-30 00:00:48,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-30 00:00:48,661 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 54 [2018-01-30 00:00:48,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:00:48,662 INFO L225 Difference]: With dead ends: 111 [2018-01-30 00:00:48,663 INFO L226 Difference]: Without dead ends: 110 [2018-01-30 00:00:48,663 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2018-01-30 00:00:48,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-01-30 00:00:48,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 101. [2018-01-30 00:00:48,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-01-30 00:00:48,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 104 transitions. [2018-01-30 00:00:48,673 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 104 transitions. Word has length 54 [2018-01-30 00:00:48,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:00:48,673 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 104 transitions. [2018-01-30 00:00:48,673 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-30 00:00:48,673 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 104 transitions. [2018-01-30 00:00:48,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-01-30 00:00:48,674 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:00:48,674 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:00:48,674 INFO L371 AbstractCegarLoop]: === Iteration 23 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-01-30 00:00:48,674 INFO L82 PathProgramCache]: Analyzing trace with hash 966449530, now seen corresponding path program 1 times [2018-01-30 00:00:48,674 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:00:48,674 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:00:48,675 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:48,675 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:00:48,675 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:48,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:00:48,686 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:00:49,103 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-01-30 00:00:49,103 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:00:49,103 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:00:49,109 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:00:49,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:00:49,132 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:00:49,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2018-01-30 00:00:49,134 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:49,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:49,136 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-30 00:00:49,213 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-30 00:00:49,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-30 00:00:49,230 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:56 [2018-01-30 00:00:49,231 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 108473 column 39: unknown constant v_DerPreprocessor_1 at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1420) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:206) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:222) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:146) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript$DiffTransformer.checkOrAddAxiom(DiffWrapperScript.java:95) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript$DiffTransformer.convertApplicationTerm(DiffWrapperScript.java:105) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:297) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:239) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:198) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.assertTerm(ManagedScript.java:133) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:1002) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:946) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:355) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:573) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:445) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:283) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:237) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:185) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackTraceAbstractionRefinementStrategy.getTraceCheck(MultiTrackTraceAbstractionRefinementStrategy.java:218) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:396) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) 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:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-01-30 00:00:49,235 INFO L168 Benchmark]: Toolchain (without parser) took 49753.77 ms. Allocated memory was 305.1 MB in the beginning and 624.4 MB in the end (delta: 319.3 MB). Free memory was 264.0 MB in the beginning and 408.8 MB in the end (delta: -144.8 MB). Peak memory consumption was 174.5 MB. Max. memory is 5.3 GB. [2018-01-30 00:00:49,237 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 305.1 MB. Free memory is still 270.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 00:00:49,237 INFO L168 Benchmark]: CACSL2BoogieTranslator took 216.28 ms. Allocated memory is still 305.1 MB. Free memory was 264.0 MB in the beginning and 250.1 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-30 00:00:49,237 INFO L168 Benchmark]: Boogie Preprocessor took 35.80 ms. Allocated memory is still 305.1 MB. Free memory was 250.1 MB in the beginning and 248.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-30 00:00:49,238 INFO L168 Benchmark]: RCFGBuilder took 349.87 ms. Allocated memory is still 305.1 MB. Free memory was 248.1 MB in the beginning and 223.0 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 5.3 GB. [2018-01-30 00:00:49,238 INFO L168 Benchmark]: TraceAbstraction took 49133.86 ms. Allocated memory was 305.1 MB in the beginning and 624.4 MB in the end (delta: 319.3 MB). Free memory was 223.0 MB in the beginning and 408.8 MB in the end (delta: -185.8 MB). Peak memory consumption was 133.5 MB. Max. memory is 5.3 GB. [2018-01-30 00:00:49,240 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 305.1 MB. Free memory is still 270.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 216.28 ms. Allocated memory is still 305.1 MB. Free memory was 264.0 MB in the beginning and 250.1 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.80 ms. Allocated memory is still 305.1 MB. Free memory was 250.1 MB in the beginning and 248.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 349.87 ms. Allocated memory is still 305.1 MB. Free memory was 248.1 MB in the beginning and 223.0 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 49133.86 ms. Allocated memory was 305.1 MB in the beginning and 624.4 MB in the end (delta: 319.3 MB). Free memory was 223.0 MB in the beginning and 408.8 MB in the end (delta: -185.8 MB). Peak memory consumption was 133.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 108473 column 39: unknown constant v_DerPreprocessor_1 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 108473 column 39: unknown constant v_DerPreprocessor_1: de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1420) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test10_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-30_00-00-49-247.csv Received shutdown request...