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/mempurity-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-01_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-47db877 [2018-01-23 14:55:18,153 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-23 14:55:18,154 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-23 14:55:18,166 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-23 14:55:18,167 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-23 14:55:18,168 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-23 14:55:18,168 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-23 14:55:18,170 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-23 14:55:18,171 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-23 14:55:18,172 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-23 14:55:18,172 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-23 14:55:18,173 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-23 14:55:18,173 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-23 14:55:18,174 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-23 14:55:18,175 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-23 14:55:18,178 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-23 14:55:18,180 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-23 14:55:18,182 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-23 14:55:18,183 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-23 14:55:18,185 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-23 14:55:18,187 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-23 14:55:18,187 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-23 14:55:18,187 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-23 14:55:18,188 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-23 14:55:18,189 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-23 14:55:18,190 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-23 14:55:18,191 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-23 14:55:18,191 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-23 14:55:18,192 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-23 14:55:18,192 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-23 14:55:18,192 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-23 14:55:18,193 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf [2018-01-23 14:55:18,203 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-23 14:55:18,203 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-23 14:55:18,204 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-23 14:55:18,204 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-23 14:55:18,204 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-23 14:55:18,204 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-23 14:55:18,204 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-23 14:55:18,205 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-23 14:55:18,205 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-23 14:55:18,205 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-23 14:55:18,206 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-23 14:55:18,206 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-23 14:55:18,206 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-23 14:55:18,206 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-23 14:55:18,206 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-23 14:55:18,207 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-23 14:55:18,207 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-23 14:55:18,207 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-23 14:55:18,207 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-23 14:55:18,207 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-23 14:55:18,207 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-23 14:55:18,208 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-23 14:55:18,208 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-23 14:55:18,208 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-23 14:55:18,208 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-23 14:55:18,208 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-23 14:55:18,209 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-23 14:55:18,209 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-23 14:55:18,209 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-23 14:55:18,209 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-23 14:55:18,209 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-23 14:55:18,210 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-23 14:55:18,210 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-23 14:55:18,210 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-23 14:55:18,210 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-23 14:55:18,211 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-23 14:55:18,211 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-23 14:55:18,245 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-23 14:55:18,256 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-23 14:55:18,260 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-23 14:55:18,262 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-23 14:55:18,262 INFO L276 PluginConnector]: CDTParser initialized [2018-01-23 14:55:18,263 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-01_true-unreach-call_true-valid-memsafety.i [2018-01-23 14:55:18,436 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-23 14:55:18,441 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-23 14:55:18,442 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-23 14:55:18,442 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-23 14:55:18,447 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-23 14:55:18,447 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:55:18" (1/1) ... [2018-01-23 14:55:18,450 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@167329f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:55:18, skipping insertion in model container [2018-01-23 14:55:18,450 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:55:18" (1/1) ... [2018-01-23 14:55:18,462 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:55:18,504 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:55:18,628 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:55:18,653 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:55:18,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:55:18 WrapperNode [2018-01-23 14:55:18,664 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-23 14:55:18,665 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-23 14:55:18,665 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-23 14:55:18,665 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-23 14:55:18,679 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:55:18" (1/1) ... [2018-01-23 14:55:18,680 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:55:18" (1/1) ... [2018-01-23 14:55:18,689 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:55:18" (1/1) ... [2018-01-23 14:55:18,690 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:55:18" (1/1) ... [2018-01-23 14:55:18,695 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:55:18" (1/1) ... [2018-01-23 14:55:18,701 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:55:18" (1/1) ... [2018-01-23 14:55:18,703 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:55:18" (1/1) ... [2018-01-23 14:55:18,705 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-23 14:55:18,706 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-23 14:55:18,706 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-23 14:55:18,706 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-23 14:55:18,707 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:55:18" (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-23 14:55:18,756 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-23 14:55:18,756 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-23 14:55:18,756 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-23 14:55:18,756 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-23 14:55:18,756 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-23 14:55:18,756 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-23 14:55:18,756 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-23 14:55:18,757 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-23 14:55:18,757 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-23 14:55:18,757 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-23 14:55:18,757 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-23 14:55:18,757 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-23 14:55:18,757 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-23 14:55:18,757 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-23 14:55:18,757 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-23 14:55:19,203 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-23 14:55:19,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:55:19 BoogieIcfgContainer [2018-01-23 14:55:19,205 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-23 14:55:19,206 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-23 14:55:19,206 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-23 14:55:19,207 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-23 14:55:19,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.01 02:55:18" (1/3) ... [2018-01-23 14:55:19,209 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f954749 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:55:19, skipping insertion in model container [2018-01-23 14:55:19,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:55:18" (2/3) ... [2018-01-23 14:55:19,209 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f954749 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:55:19, skipping insertion in model container [2018-01-23 14:55:19,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:55:19" (3/3) ... [2018-01-23 14:55:19,211 INFO L105 eAbstractionObserver]: Analyzing ICFG sll-01_true-unreach-call_true-valid-memsafety.i [2018-01-23 14:55:19,217 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-23 14:55:19,224 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-23 14:55:19,265 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:55:19,266 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:55:19,266 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:55:19,266 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:55:19,266 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:55:19,266 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:55:19,266 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:55:19,266 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-23 14:55:19,267 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:55:19,284 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states. [2018-01-23 14:55:19,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-23 14:55:19,290 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:55:19,291 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-23 14:55:19,291 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-23 14:55:19,295 INFO L82 PathProgramCache]: Analyzing trace with hash 393051, now seen corresponding path program 1 times [2018-01-23 14:55:19,297 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:55:19,297 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:55:19,338 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:55:19,338 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:55:19,339 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:55:19,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:55:19,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:55:19,389 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:55:19,395 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:55:19,403 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:55:19,403 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:55:19,403 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:55:19,403 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:55:19,403 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:55:19,404 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:55:19,404 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:55:19,404 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-23 14:55:19,404 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:55:19,408 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states. [2018-01-23 14:55:19,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-23 14:55:19,410 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:55:19,410 INFO L322 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, 1] [2018-01-23 14:55:19,411 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:55:19,411 INFO L82 PathProgramCache]: Analyzing trace with hash -232031712, now seen corresponding path program 1 times [2018-01-23 14:55:19,411 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:55:19,411 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:55:19,412 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:55:19,412 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:55:19,412 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:55:19,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:55:19,433 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:55:19,470 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-23 14:55:19,472 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:55:19,473 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:55:19,474 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:55:19,575 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:55:19,575 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:55:19,578 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 2 states. [2018-01-23 14:55:19,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:55:19,611 INFO L93 Difference]: Finished difference Result 237 states and 341 transitions. [2018-01-23 14:55:19,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:55:19,613 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2018-01-23 14:55:19,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:55:19,625 INFO L225 Difference]: With dead ends: 237 [2018-01-23 14:55:19,626 INFO L226 Difference]: Without dead ends: 120 [2018-01-23 14:55:19,629 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:55:19,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-23 14:55:19,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-01-23 14:55:19,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-01-23 14:55:19,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 129 transitions. [2018-01-23 14:55:19,667 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 129 transitions. Word has length 23 [2018-01-23 14:55:19,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:55:19,667 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 129 transitions. [2018-01-23 14:55:19,667 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:55:19,668 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 129 transitions. [2018-01-23 14:55:19,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-23 14:55:19,669 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:55:19,669 INFO L322 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:55:19,669 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:55:19,669 INFO L82 PathProgramCache]: Analyzing trace with hash -448715966, now seen corresponding path program 1 times [2018-01-23 14:55:19,669 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:55:19,669 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:55:19,670 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:55:19,671 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:55:19,671 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:55:19,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:55:19,697 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:55:19,838 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-23 14:55:19,838 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:55:19,838 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-23 14:55:19,840 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:55:19,841 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:55:19,841 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:55:19,841 INFO L87 Difference]: Start difference. First operand 120 states and 129 transitions. Second operand 5 states. [2018-01-23 14:55:20,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:55:20,116 INFO L93 Difference]: Finished difference Result 280 states and 303 transitions. [2018-01-23 14:55:20,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-23 14:55:20,116 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-01-23 14:55:20,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:55:20,122 INFO L225 Difference]: With dead ends: 280 [2018-01-23 14:55:20,122 INFO L226 Difference]: Without dead ends: 188 [2018-01-23 14:55:20,124 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-23 14:55:20,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-01-23 14:55:20,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 124. [2018-01-23 14:55:20,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-23 14:55:20,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 133 transitions. [2018-01-23 14:55:20,133 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 133 transitions. Word has length 36 [2018-01-23 14:55:20,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:55:20,134 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 133 transitions. [2018-01-23 14:55:20,134 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:55:20,134 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 133 transitions. [2018-01-23 14:55:20,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-23 14:55:20,135 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:55:20,136 INFO L322 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:55:20,136 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:55:20,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1412768891, now seen corresponding path program 1 times [2018-01-23 14:55:20,136 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:55:20,136 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:55:20,137 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:55:20,137 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:55:20,137 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:55:20,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:55:20,154 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:55:20,206 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-23 14:55:20,207 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:55:20,207 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-23 14:55:20,207 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:55:20,207 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:55:20,208 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:55:20,208 INFO L87 Difference]: Start difference. First operand 124 states and 133 transitions. Second operand 5 states. [2018-01-23 14:55:20,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:55:20,305 INFO L93 Difference]: Finished difference Result 206 states and 222 transitions. [2018-01-23 14:55:20,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-23 14:55:20,306 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-01-23 14:55:20,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:55:20,308 INFO L225 Difference]: With dead ends: 206 [2018-01-23 14:55:20,308 INFO L226 Difference]: Without dead ends: 179 [2018-01-23 14:55:20,309 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-23 14:55:20,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-01-23 14:55:20,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 128. [2018-01-23 14:55:20,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-01-23 14:55:20,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 137 transitions. [2018-01-23 14:55:20,319 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 137 transitions. Word has length 38 [2018-01-23 14:55:20,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:55:20,320 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 137 transitions. [2018-01-23 14:55:20,320 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:55:20,320 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2018-01-23 14:55:20,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-23 14:55:20,322 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:55:20,322 INFO L322 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:55:20,322 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:55:20,323 INFO L82 PathProgramCache]: Analyzing trace with hash -812324167, now seen corresponding path program 1 times [2018-01-23 14:55:20,323 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:55:20,323 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:55:20,324 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:55:20,324 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:55:20,324 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:55:20,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:55:20,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:55:20,382 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:55:20,394 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:55:20,404 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:55:20,405 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:55:20,424 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:55:20,424 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:55:20,424 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:55:20,424 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:55:20,424 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:55:20,424 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:55:20,424 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:55:20,425 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-23 14:55:20,425 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:55:20,427 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states. [2018-01-23 14:55:20,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-23 14:55:20,428 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:55:20,429 INFO L322 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-23 14:55:20,429 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-23 14:55:20,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1381245512, now seen corresponding path program 1 times [2018-01-23 14:55:20,429 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:55:20,429 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:55:20,430 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:55:20,430 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:55:20,430 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:55:20,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:55:20,437 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:55:20,447 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-23 14:55:20,447 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:55:20,447 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:55:20,448 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:55:20,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:55:20,448 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:55:20,448 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 2 states. [2018-01-23 14:55:20,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:55:20,455 INFO L93 Difference]: Finished difference Result 237 states and 341 transitions. [2018-01-23 14:55:20,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:55:20,455 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-01-23 14:55:20,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:55:20,456 INFO L225 Difference]: With dead ends: 237 [2018-01-23 14:55:20,457 INFO L226 Difference]: Without dead ends: 118 [2018-01-23 14:55:20,458 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:55:20,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-23 14:55:20,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-01-23 14:55:20,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-23 14:55:20,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2018-01-23 14:55:20,465 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 127 transitions. Word has length 21 [2018-01-23 14:55:20,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:55:20,466 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 127 transitions. [2018-01-23 14:55:20,466 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:55:20,466 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 127 transitions. [2018-01-23 14:55:20,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-23 14:55:20,467 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:55:20,467 INFO L322 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:55:20,467 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-23 14:55:20,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1359124646, now seen corresponding path program 1 times [2018-01-23 14:55:20,468 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:55:20,468 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:55:20,469 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:55:20,469 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:55:20,469 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:55:20,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:55:20,479 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:55:20,544 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-23 14:55:20,544 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:55:20,544 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-23 14:55:20,544 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:55:20,545 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:55:20,545 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:55:20,545 INFO L87 Difference]: Start difference. First operand 118 states and 127 transitions. Second operand 5 states. [2018-01-23 14:55:20,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:55:20,664 INFO L93 Difference]: Finished difference Result 276 states and 298 transitions. [2018-01-23 14:55:20,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-23 14:55:20,665 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-01-23 14:55:20,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:55:20,666 INFO L225 Difference]: With dead ends: 276 [2018-01-23 14:55:20,667 INFO L226 Difference]: Without dead ends: 186 [2018-01-23 14:55:20,668 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-23 14:55:20,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-01-23 14:55:20,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 122. [2018-01-23 14:55:20,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-23 14:55:20,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 131 transitions. [2018-01-23 14:55:20,684 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 131 transitions. Word has length 34 [2018-01-23 14:55:20,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:55:20,684 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 131 transitions. [2018-01-23 14:55:20,684 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:55:20,684 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 131 transitions. [2018-01-23 14:55:20,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-23 14:55:20,686 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:55:20,686 INFO L322 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:55:20,686 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-23 14:55:20,686 INFO L82 PathProgramCache]: Analyzing trace with hash -166833059, now seen corresponding path program 1 times [2018-01-23 14:55:20,686 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:55:20,687 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:55:20,687 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:55:20,688 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:55:20,688 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:55:20,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:55:20,699 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:55:20,754 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-23 14:55:20,754 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:55:20,754 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-23 14:55:20,755 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:55:20,755 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:55:20,755 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:55:20,756 INFO L87 Difference]: Start difference. First operand 122 states and 131 transitions. Second operand 5 states. [2018-01-23 14:55:20,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:55:20,876 INFO L93 Difference]: Finished difference Result 202 states and 218 transitions. [2018-01-23 14:55:20,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-23 14:55:20,877 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-01-23 14:55:20,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:55:20,878 INFO L225 Difference]: With dead ends: 202 [2018-01-23 14:55:20,879 INFO L226 Difference]: Without dead ends: 177 [2018-01-23 14:55:20,879 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-23 14:55:20,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-01-23 14:55:20,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 126. [2018-01-23 14:55:20,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-23 14:55:20,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 135 transitions. [2018-01-23 14:55:20,888 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 135 transitions. Word has length 36 [2018-01-23 14:55:20,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:55:20,890 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 135 transitions. [2018-01-23 14:55:20,890 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:55:20,890 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 135 transitions. [2018-01-23 14:55:20,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-23 14:55:20,892 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:55:20,892 INFO L322 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:55:20,892 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-23 14:55:20,893 INFO L82 PathProgramCache]: Analyzing trace with hash -742743919, now seen corresponding path program 1 times [2018-01-23 14:55:20,893 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:55:20,893 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:55:20,894 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:55:20,894 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:55:20,894 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:55:20,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:55:20,914 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:55:21,045 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:55:21,045 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:55:21,045 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-23 14:55:21,051 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:55:21,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:55:21,089 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:55:21,188 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~list~5.base Int)) (and (= 0 (select |c_old(#valid)| main_~list~5.base)) (= |c_#valid| (store |c_old(#valid)| main_~list~5.base 0)) (not (= 0 main_~list~5.base)))) is different from true [2018-01-23 14:55:21,213 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2018-01-23 14:55:21,235 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:55:21,235 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6] total 8 [2018-01-23 14:55:21,235 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-23 14:55:21,236 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-23 14:55:21,236 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=43, Unknown=1, NotChecked=12, Total=72 [2018-01-23 14:55:21,236 INFO L87 Difference]: Start difference. First operand 126 states and 135 transitions. Second operand 9 states. [2018-01-23 14:55:21,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:55:21,588 INFO L93 Difference]: Finished difference Result 210 states and 225 transitions. [2018-01-23 14:55:21,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-23 14:55:21,589 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2018-01-23 14:55:21,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:55:21,591 INFO L225 Difference]: With dead ends: 210 [2018-01-23 14:55:21,591 INFO L226 Difference]: Without dead ends: 207 [2018-01-23 14:55:21,592 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=114, Unknown=1, NotChecked=22, Total=182 [2018-01-23 14:55:21,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-01-23 14:55:21,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 174. [2018-01-23 14:55:21,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-01-23 14:55:21,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 188 transitions. [2018-01-23 14:55:21,600 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 188 transitions. Word has length 56 [2018-01-23 14:55:21,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:55:21,601 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 188 transitions. [2018-01-23 14:55:21,601 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-23 14:55:21,601 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 188 transitions. [2018-01-23 14:55:21,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-23 14:55:21,602 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:55:21,602 INFO L322 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:55:21,602 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation]=== [2018-01-23 14:55:21,602 INFO L82 PathProgramCache]: Analyzing trace with hash -88253661, now seen corresponding path program 1 times [2018-01-23 14:55:21,602 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:55:21,602 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:55:21,603 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:55:21,603 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:55:21,603 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:55:21,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:55:21,619 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:55:21,795 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:55:21,795 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:55:21,796 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-23 14:55:21,796 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-23 14:55:21,796 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-23 14:55:21,797 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-23 14:55:21,797 INFO L87 Difference]: Start difference. First operand 174 states and 188 transitions. Second operand 7 states. [2018-01-23 14:55:22,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:55:22,084 INFO L93 Difference]: Finished difference Result 268 states and 289 transitions. [2018-01-23 14:55:22,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-23 14:55:22,085 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 61 [2018-01-23 14:55:22,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:55:22,087 INFO L225 Difference]: With dead ends: 268 [2018-01-23 14:55:22,087 INFO L226 Difference]: Without dead ends: 243 [2018-01-23 14:55:22,088 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-01-23 14:55:22,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-01-23 14:55:22,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 216. [2018-01-23 14:55:22,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-01-23 14:55:22,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 234 transitions. [2018-01-23 14:55:22,099 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 234 transitions. Word has length 61 [2018-01-23 14:55:22,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:55:22,099 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 234 transitions. [2018-01-23 14:55:22,099 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-23 14:55:22,099 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 234 transitions. [2018-01-23 14:55:22,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-23 14:55:22,100 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:55:22,100 INFO L322 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:55:22,100 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation]=== [2018-01-23 14:55:22,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1451296922, now seen corresponding path program 1 times [2018-01-23 14:55:22,101 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:55:22,101 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:55:22,101 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:55:22,101 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:55:22,101 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:55:22,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:55:22,118 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:55:22,295 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-23 14:55:22,295 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:55:22,295 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-23 14:55:22,296 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-23 14:55:22,296 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-23 14:55:22,296 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-01-23 14:55:22,296 INFO L87 Difference]: Start difference. First operand 216 states and 234 transitions. Second operand 11 states. [2018-01-23 14:55:22,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:55:22,899 INFO L93 Difference]: Finished difference Result 435 states and 468 transitions. [2018-01-23 14:55:22,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-23 14:55:22,900 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 63 [2018-01-23 14:55:22,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:55:22,901 INFO L225 Difference]: With dead ends: 435 [2018-01-23 14:55:22,902 INFO L226 Difference]: Without dead ends: 339 [2018-01-23 14:55:22,903 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-01-23 14:55:22,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-01-23 14:55:22,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 211. [2018-01-23 14:55:22,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-01-23 14:55:22,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 228 transitions. [2018-01-23 14:55:22,915 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 228 transitions. Word has length 63 [2018-01-23 14:55:22,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:55:22,916 INFO L432 AbstractCegarLoop]: Abstraction has 211 states and 228 transitions. [2018-01-23 14:55:22,916 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-23 14:55:22,916 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 228 transitions. [2018-01-23 14:55:22,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-01-23 14:55:22,917 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:55:22,917 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:55:22,917 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation]=== [2018-01-23 14:55:22,918 INFO L82 PathProgramCache]: Analyzing trace with hash 719042180, now seen corresponding path program 2 times [2018-01-23 14:55:22,918 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:55:22,918 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:55:22,918 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:55:22,918 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:55:22,919 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:55:22,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:55:22,928 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:55:23,089 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:55:23,090 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:55:23,090 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-23 14:55:23,098 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-23 14:55:23,113 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:55:23,142 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:55:23,149 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:55:23,153 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:55:23,183 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-23 14:55:23,191 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-23 14:55:23,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:55:23,204 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:55:23,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:55:23,214 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-01-23 14:55:23,251 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 21 treesize of output 16 [2018-01-23 14:55:23,260 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:55:23,263 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 16 treesize of output 23 [2018-01-23 14:55:23,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:55:23,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:55:23,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:55:23,272 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2018-01-23 14:55:23,350 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 24 treesize of output 18 [2018-01-23 14:55:23,353 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:55:23,353 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 18 treesize of output 10 [2018-01-23 14:55:23,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:55:23,356 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:55:23,357 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-23 14:55:23,357 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:3 [2018-01-23 14:55:23,404 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:55:23,424 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:55:23,425 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2018-01-23 14:55:23,425 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-23 14:55:23,425 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-23 14:55:23,425 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2018-01-23 14:55:23,425 INFO L87 Difference]: Start difference. First operand 211 states and 228 transitions. Second operand 19 states. [2018-01-23 14:55:23,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:55:23,988 INFO L93 Difference]: Finished difference Result 401 states and 433 transitions. [2018-01-23 14:55:23,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-23 14:55:23,988 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 65 [2018-01-23 14:55:23,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:55:23,990 INFO L225 Difference]: With dead ends: 401 [2018-01-23 14:55:23,990 INFO L226 Difference]: Without dead ends: 304 [2018-01-23 14:55:23,992 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=669, Unknown=0, NotChecked=0, Total=812 [2018-01-23 14:55:23,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-01-23 14:55:24,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 214. [2018-01-23 14:55:24,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-01-23 14:55:24,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 229 transitions. [2018-01-23 14:55:24,006 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 229 transitions. Word has length 65 [2018-01-23 14:55:24,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:55:24,007 INFO L432 AbstractCegarLoop]: Abstraction has 214 states and 229 transitions. [2018-01-23 14:55:24,007 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-23 14:55:24,007 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 229 transitions. [2018-01-23 14:55:24,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-23 14:55:24,008 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:55:24,008 INFO L322 BasicCegarLoop]: trace histogram [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, 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-23 14:55:24,008 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation]=== [2018-01-23 14:55:24,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1069337952, now seen corresponding path program 1 times [2018-01-23 14:55:24,009 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:55:24,009 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:55:24,009 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:55:24,010 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:55:24,010 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:55:24,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:55:24,021 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:55:24,238 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:55:24,239 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:55:24,239 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-23 14:55:24,239 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-23 14:55:24,239 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-23 14:55:24,239 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-23 14:55:24,240 INFO L87 Difference]: Start difference. First operand 214 states and 229 transitions. Second operand 7 states. [2018-01-23 14:55:24,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:55:24,431 INFO L93 Difference]: Finished difference Result 282 states and 299 transitions. [2018-01-23 14:55:24,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-23 14:55:24,432 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2018-01-23 14:55:24,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:55:24,433 INFO L225 Difference]: With dead ends: 282 [2018-01-23 14:55:24,433 INFO L226 Difference]: Without dead ends: 224 [2018-01-23 14:55:24,433 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-01-23 14:55:24,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-01-23 14:55:24,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 220. [2018-01-23 14:55:24,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-01-23 14:55:24,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 235 transitions. [2018-01-23 14:55:24,446 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 235 transitions. Word has length 69 [2018-01-23 14:55:24,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:55:24,447 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 235 transitions. [2018-01-23 14:55:24,447 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-23 14:55:24,447 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 235 transitions. [2018-01-23 14:55:24,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-01-23 14:55:24,448 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:55:24,448 INFO L322 BasicCegarLoop]: trace histogram [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, 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-23 14:55:24,448 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation]=== [2018-01-23 14:55:24,448 INFO L82 PathProgramCache]: Analyzing trace with hash 16076814, now seen corresponding path program 1 times [2018-01-23 14:55:24,448 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:55:24,448 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:55:24,449 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:55:24,449 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:55:24,449 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:55:24,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:55:24,466 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:55:24,977 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:55:24,977 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:55:24,977 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-23 14:55:24,983 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:55:25,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:55:25,010 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:55:25,110 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 19 treesize of output 15 [2018-01-23 14:55:25,113 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 15 treesize of output 3 [2018-01-23 14:55:25,114 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:55:25,115 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:55:25,117 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-23 14:55:25,117 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:3 [2018-01-23 14:55:25,169 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:55:25,190 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:55:25,190 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 [2018-01-23 14:55:25,191 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-23 14:55:25,191 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-23 14:55:25,191 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2018-01-23 14:55:25,191 INFO L87 Difference]: Start difference. First operand 220 states and 235 transitions. Second operand 20 states. [2018-01-23 14:55:26,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:55:26,621 INFO L93 Difference]: Finished difference Result 478 states and 511 transitions. [2018-01-23 14:55:26,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-01-23 14:55:26,621 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 74 [2018-01-23 14:55:26,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:55:26,623 INFO L225 Difference]: With dead ends: 478 [2018-01-23 14:55:26,623 INFO L226 Difference]: Without dead ends: 325 [2018-01-23 14:55:26,624 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 76 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=308, Invalid=2554, Unknown=0, NotChecked=0, Total=2862 [2018-01-23 14:55:26,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-01-23 14:55:26,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 277. [2018-01-23 14:55:26,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-01-23 14:55:26,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 299 transitions. [2018-01-23 14:55:26,634 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 299 transitions. Word has length 74 [2018-01-23 14:55:26,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:55:26,634 INFO L432 AbstractCegarLoop]: Abstraction has 277 states and 299 transitions. [2018-01-23 14:55:26,634 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-23 14:55:26,634 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 299 transitions. [2018-01-23 14:55:26,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-01-23 14:55:26,635 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:55:26,635 INFO L322 BasicCegarLoop]: trace histogram [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, 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-23 14:55:26,635 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation]=== [2018-01-23 14:55:26,635 INFO L82 PathProgramCache]: Analyzing trace with hash -687773399, now seen corresponding path program 1 times [2018-01-23 14:55:26,635 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:55:26,636 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:55:26,636 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:55:26,636 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:55:26,636 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:55:26,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:55:26,645 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:55:26,728 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-23 14:55:26,728 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:55:26,728 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-23 14:55:26,728 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:55:26,728 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:55:26,729 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:55:26,729 INFO L87 Difference]: Start difference. First operand 277 states and 299 transitions. Second operand 5 states. [2018-01-23 14:55:26,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:55:26,862 INFO L93 Difference]: Finished difference Result 506 states and 549 transitions. [2018-01-23 14:55:26,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-23 14:55:26,863 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2018-01-23 14:55:26,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:55:26,864 INFO L225 Difference]: With dead ends: 506 [2018-01-23 14:55:26,864 INFO L226 Difference]: Without dead ends: 293 [2018-01-23 14:55:26,865 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-23 14:55:26,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-01-23 14:55:26,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 281. [2018-01-23 14:55:26,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-01-23 14:55:26,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 302 transitions. [2018-01-23 14:55:26,880 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 302 transitions. Word has length 79 [2018-01-23 14:55:26,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:55:26,880 INFO L432 AbstractCegarLoop]: Abstraction has 281 states and 302 transitions. [2018-01-23 14:55:26,881 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:55:26,881 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 302 transitions. [2018-01-23 14:55:26,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-01-23 14:55:26,882 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:55:26,882 INFO L322 BasicCegarLoop]: trace histogram [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, 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-23 14:55:26,882 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation]=== [2018-01-23 14:55:26,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1760297446, now seen corresponding path program 1 times [2018-01-23 14:55:26,882 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:55:26,882 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:55:26,883 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:55:26,883 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:55:26,883 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:55:26,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:55:26,897 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:55:27,134 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:55:27,135 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:55:27,135 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-23 14:55:27,141 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:55:27,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:55:27,174 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:55:27,189 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-23 14:55:27,189 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:55:27,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:55:27,191 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-23 14:55:27,244 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:55:27,245 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:55:27,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 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-23 14:55:27,246 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:55:27,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:55:27,269 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:15 [2018-01-23 14:55:27,317 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-23 14:55:27,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-23 14:55:27,326 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:55:27,327 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:55:27,333 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-23 14:55:27,333 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-01-23 14:55:27,377 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:55:27,380 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 35 treesize of output 36 [2018-01-23 14:55:27,383 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-23 14:55:27,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:55:27,391 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:55:27,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:55:27,396 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-01-23 14:55:27,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2018-01-23 14:55:27,425 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:55:27,425 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 20 treesize of output 31 [2018-01-23 14:55:27,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:55:27,432 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:55:27,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:55:27,438 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2018-01-23 14:55:27,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 30 [2018-01-23 14:55:27,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-01-23 14:55:27,523 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:55:27,530 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:55:27,531 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 13 treesize of output 6 [2018-01-23 14:55:27,531 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:55:27,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:55:27,537 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-23 14:55:27,538 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:48, output treesize:4 [2018-01-23 14:55:27,592 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:55:27,612 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:55:27,612 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 21 [2018-01-23 14:55:27,613 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-23 14:55:27,613 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-23 14:55:27,613 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2018-01-23 14:55:27,613 INFO L87 Difference]: Start difference. First operand 281 states and 302 transitions. Second operand 21 states. [2018-01-23 14:55:29,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:55:29,065 INFO L93 Difference]: Finished difference Result 576 states and 620 transitions. [2018-01-23 14:55:29,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-23 14:55:29,065 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 81 [2018-01-23 14:55:29,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:55:29,067 INFO L225 Difference]: With dead ends: 576 [2018-01-23 14:55:29,067 INFO L226 Difference]: Without dead ends: 544 [2018-01-23 14:55:29,068 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 70 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=246, Invalid=1236, Unknown=0, NotChecked=0, Total=1482 [2018-01-23 14:55:29,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2018-01-23 14:55:29,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 423. [2018-01-23 14:55:29,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-01-23 14:55:29,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 456 transitions. [2018-01-23 14:55:29,083 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 456 transitions. Word has length 81 [2018-01-23 14:55:29,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:55:29,083 INFO L432 AbstractCegarLoop]: Abstraction has 423 states and 456 transitions. [2018-01-23 14:55:29,083 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-23 14:55:29,083 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 456 transitions. [2018-01-23 14:55:29,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-01-23 14:55:29,084 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:55:29,084 INFO L322 BasicCegarLoop]: trace histogram [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, 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-23 14:55:29,084 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation]=== [2018-01-23 14:55:29,084 INFO L82 PathProgramCache]: Analyzing trace with hash -126513239, now seen corresponding path program 1 times [2018-01-23 14:55:29,085 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:55:29,085 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:55:29,085 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:55:29,085 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:55:29,085 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:55:29,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:55:29,099 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:55:29,669 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:55:29,669 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:55:29,669 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-23 14:55:29,676 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:55:29,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:55:29,709 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:55:29,718 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-23 14:55:29,718 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:55:29,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:55:29,724 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-23 14:55:29,761 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:55:29,762 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:55:29,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 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-23 14:55:29,763 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:55:29,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:55:29,782 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:25 [2018-01-23 14:55:29,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 11 treesize of output 8 [2018-01-23 14:55:29,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-23 14:55:29,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:55:29,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:55:29,807 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-23 14:55:29,808 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-01-23 14:55:29,900 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:55:29,904 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 44 treesize of output 45 [2018-01-23 14:55:29,907 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-23 14:55:29,907 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:55:29,918 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:55:29,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:55:29,932 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2018-01-23 14:55:29,985 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:55:29,985 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:55:29,986 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:55:29,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-01-23 14:55:29,987 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:55:29,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:55:29,994 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:43 [2018-01-23 14:55:30,028 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:55:30,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 51 [2018-01-23 14:55:30,033 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:55:30,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-23 14:55:30,035 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:55:30,043 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:55:30,051 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-23 14:55:30,051 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:55 [2018-01-23 14:55:30,101 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:55:30,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 86 [2018-01-23 14:55:30,108 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 14 treesize of output 13 [2018-01-23 14:55:30,108 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:55:30,117 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:55:30,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:55:30,125 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:64 [2018-01-23 14:55:30,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 79 [2018-01-23 14:55:30,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 26 treesize of output 37 [2018-01-23 14:55:30,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:55:30,210 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:55:30,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-23 14:55:30,221 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:110, output treesize:96 [2018-01-23 14:55:34,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 60 [2018-01-23 14:55:34,329 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 0 case distinctions, treesize of input 13 treesize of output 1 [2018-01-23 14:55:34,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:55:34,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 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-23 14:55:34,337 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:55:34,343 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:55:34,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-01-23 14:55:34,345 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:55:34,348 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:55:34,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:55:34,350 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:103, output treesize:4 [2018-01-23 14:55:34,421 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:55:34,442 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:55:34,442 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 30 [2018-01-23 14:55:34,443 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-23 14:55:34,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-23 14:55:34,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=758, Unknown=2, NotChecked=0, Total=870 [2018-01-23 14:55:34,444 INFO L87 Difference]: Start difference. First operand 423 states and 456 transitions. Second operand 30 states. [2018-01-23 14:55:51,110 WARN L143 SmtUtils]: Spent 2028ms on a formula simplification that was a NOOP. DAG size: 64 [2018-01-23 14:55:59,161 WARN L143 SmtUtils]: Spent 2025ms on a formula simplification that was a NOOP. DAG size: 60 [2018-01-23 14:56:18,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:56:18,297 INFO L93 Difference]: Finished difference Result 743 states and 801 transitions. [2018-01-23 14:56:18,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-01-23 14:56:18,297 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 86 [2018-01-23 14:56:18,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:56:18,299 INFO L225 Difference]: With dead ends: 743 [2018-01-23 14:56:18,299 INFO L226 Difference]: Without dead ends: 711 [2018-01-23 14:56:18,300 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 70 SyntacticMatches, 6 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 917 ImplicationChecksByTransitivity, 41.7s TimeCoverageRelationStatistics Valid=557, Invalid=3085, Unknown=18, NotChecked=0, Total=3660 [2018-01-23 14:56:18,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2018-01-23 14:56:18,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 435. [2018-01-23 14:56:18,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-01-23 14:56:18,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 469 transitions. [2018-01-23 14:56:18,317 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 469 transitions. Word has length 86 [2018-01-23 14:56:18,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:56:18,317 INFO L432 AbstractCegarLoop]: Abstraction has 435 states and 469 transitions. [2018-01-23 14:56:18,317 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-23 14:56:18,317 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 469 transitions. [2018-01-23 14:56:18,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-01-23 14:56:18,318 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:56:18,318 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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-23 14:56:18,318 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation]=== [2018-01-23 14:56:18,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1530957106, now seen corresponding path program 2 times [2018-01-23 14:56:18,318 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:56:18,318 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:56:18,319 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:56:18,319 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:56:18,319 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:56:18,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:56:18,331 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:56:19,086 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-23 14:56:19,087 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:56:19,087 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-23 14:56:19,092 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-23 14:56:19,103 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:56:19,114 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:56:19,117 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:56:19,121 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:56:19,225 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 44 treesize of output 41 [2018-01-23 14:56:19,226 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-23 14:56:19,226 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:19,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:19,236 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 44 treesize of output 41 [2018-01-23 14:56:19,238 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-23 14:56:19,238 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:19,245 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:19,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:56:19,266 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:89, output treesize:83 [2018-01-23 14:56:19,377 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:19,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 54 [2018-01-23 14:56:19,382 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-23 14:56:19,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:19,389 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:19,407 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:19,410 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 53 treesize of output 54 [2018-01-23 14:56:19,412 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-23 14:56:19,412 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:19,420 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:19,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:56:19,439 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:107, output treesize:99 [2018-01-23 14:56:19,492 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:19,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 65 [2018-01-23 14:56:19,501 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:19,501 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 20 treesize of output 31 [2018-01-23 14:56:19,502 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:19,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:19,546 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:19,550 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 67 treesize of output 65 [2018-01-23 14:56:19,552 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:19,553 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 20 treesize of output 31 [2018-01-23 14:56:19,553 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:19,563 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:19,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-23 14:56:19,598 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:135, output treesize:119 [2018-01-23 14:56:19,716 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:19,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 54 [2018-01-23 14:56:19,720 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:19,720 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 13 treesize of output 6 [2018-01-23 14:56:19,720 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:19,779 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 27 treesize of output 18 [2018-01-23 14:56:19,779 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:19,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:19,935 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:19,949 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 0 case distinctions, treesize of input 66 treesize of output 54 [2018-01-23 14:56:19,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-01-23 14:56:19,953 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:20,027 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:20,028 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 13 treesize of output 6 [2018-01-23 14:56:20,028 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:20,072 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:20,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:56:20,099 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:133, output treesize:55 [2018-01-23 14:56:20,196 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~list~5.base Int)) (let ((.cse0 (store |c_old(#valid)| main_~list~5.base 1))) (and (= (select .cse0 c_main_~end~5.base) 0) (= 0 (select |c_old(#valid)| main_~list~5.base)) (= |c_#valid| (store (store .cse0 c_main_~end~5.base 1) main_~list~5.base 0)) (not (= 0 main_~list~5.base))))) is different from true [2018-01-23 14:56:20,202 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_subst_1 Int)) (let ((.cse0 (store |c_old(#valid)| v_subst_1 1))) (and (= 0 (select |c_old(#valid)| v_subst_1)) (not (= 0 v_subst_1)) (= |c_#valid| (store (store .cse0 c_main_~list~5.base 1) v_subst_1 0)) (= (select .cse0 c_main_~list~5.base) 0)))) is different from true [2018-01-23 14:56:20,689 WARN L1029 $PredicateComparison]: unable to prove that (or (and (not (= c_main_~list~5.offset 0)) (exists ((v_prenex_8 Int)) (let ((.cse0 (store |c_old(#valid)| v_prenex_8 1))) (and (not (= 0 v_prenex_8)) (= 0 (select |c_old(#valid)| v_prenex_8)) (= (select .cse0 c_main_~list~5.base) 0) (= |c_#valid| (store (store .cse0 c_main_~list~5.base 1) v_prenex_8 0)))))) (and (exists ((v_subst_1 Int)) (let ((.cse1 (store |c_old(#valid)| v_subst_1 1))) (and (= 0 (select |c_old(#valid)| v_subst_1)) (not (= 0 v_subst_1)) (= |c_#valid| (store (store .cse1 c_main_~list~5.base 1) v_subst_1 0)) (= (select .cse1 c_main_~list~5.base) 0)))) (not (= 0 c_main_~list~5.base)))) is different from true [2018-01-23 14:56:20,696 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~list~5.base Int) (v_subst_1 Int)) (let ((.cse0 (store |c_old(#valid)| v_subst_1 1))) (and (= 0 (select |c_old(#valid)| v_subst_1)) (not (= 0 v_subst_1)) (= |c_#valid| (store (store (store .cse0 main_~list~5.base 1) v_subst_1 0) main_~list~5.base 0)) (= (select .cse0 main_~list~5.base) 0) (not (= 0 main_~list~5.base))))) is different from true [2018-01-23 14:56:20,766 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 9 not checked. [2018-01-23 14:56:20,786 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:56:20,786 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 34 [2018-01-23 14:56:20,787 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-01-23 14:56:20,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-01-23 14:56:20,787 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=822, Unknown=21, NotChecked=244, Total=1190 [2018-01-23 14:56:20,787 INFO L87 Difference]: Start difference. First operand 435 states and 469 transitions. Second operand 35 states. Received shutdown request... [2018-01-23 14:56:21,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-23 14:56:21,551 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-23 14:56:21,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.01 02:56:21 BoogieIcfgContainer [2018-01-23 14:56:21,553 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-23 14:56:21,554 INFO L168 Benchmark]: Toolchain (without parser) took 63117.30 ms. Allocated memory was 303.0 MB in the beginning and 636.5 MB in the end (delta: 333.4 MB). Free memory was 262.0 MB in the beginning and 574.2 MB in the end (delta: -312.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 5.3 GB. [2018-01-23 14:56:21,555 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 303.0 MB. Free memory is still 267.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-23 14:56:21,555 INFO L168 Benchmark]: CACSL2BoogieTranslator took 222.51 ms. Allocated memory is still 303.0 MB. Free memory was 262.0 MB in the beginning and 250.0 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-23 14:56:21,555 INFO L168 Benchmark]: Boogie Preprocessor took 40.89 ms. Allocated memory is still 303.0 MB. Free memory was 250.0 MB in the beginning and 246.0 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 5.3 GB. [2018-01-23 14:56:21,556 INFO L168 Benchmark]: RCFGBuilder took 498.88 ms. Allocated memory is still 303.0 MB. Free memory was 246.0 MB in the beginning and 215.1 MB in the end (delta: 30.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 5.3 GB. [2018-01-23 14:56:21,556 INFO L168 Benchmark]: TraceAbstraction took 62347.40 ms. Allocated memory was 303.0 MB in the beginning and 636.5 MB in the end (delta: 333.4 MB). Free memory was 213.1 MB in the beginning and 574.2 MB in the end (delta: -361.1 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-23 14:56:21,557 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.13 ms. Allocated memory is still 303.0 MB. Free memory is still 267.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 222.51 ms. Allocated memory is still 303.0 MB. Free memory was 262.0 MB in the beginning and 250.0 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 40.89 ms. Allocated memory is still 303.0 MB. Free memory was 250.0 MB in the beginning and 246.0 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 498.88 ms. Allocated memory is still 303.0 MB. Free memory was 246.0 MB in the beginning and 215.1 MB in the end (delta: 30.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 62347.40 ms. Allocated memory was 303.0 MB in the beginning and 636.5 MB in the end (delta: 333.4 MB). Free memory was 213.1 MB in the beginning and 574.2 MB in the end (delta: -361.1 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 3 procedures, 123 locations, 3 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=123occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L991] EXPR, FCALL malloc(sizeof(SLL)) VAL [malloc(sizeof(SLL))={10:0}] [L991] SLL* list = malloc(sizeof(SLL)); VAL [list={10:0}, malloc(sizeof(SLL))={10:0}] [L992] FCALL list->next = ((void*)0) VAL [list={10:0}, malloc(sizeof(SLL))={10:0}] [L993] COND FALSE !(!(list != ((void*)0))) VAL [list={10:0}, malloc(sizeof(SLL))={10:0}] [L993] COND FALSE !(0) VAL [list={10:0}, malloc(sizeof(SLL))={10:0}] [L993] COND TRUE __VERIFIER_nondet_int() [L993] FCALL list->inner = ((void*)0) VAL [list={10:0}, malloc(sizeof(SLL))={10:0}] [L993] EXPR, FCALL list->inner VAL [list={10:0}, list->inner={0:0}, malloc(sizeof(SLL))={10:0}] [L993] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={10:0}, list->inner={0:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=0, malloc(sizeof(SLL))={10:0}] [L993] EXPR, FCALL list->inner VAL [list={10:0}, list->inner={0:0}, list->inner={0:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=0, malloc(sizeof(SLL))={10:0}] [L993] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={10:0}, list->inner={0:0}, list->inner={0:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1, malloc(sizeof(SLL))={10:0}] [L993] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L993] COND FALSE !(0) VAL [list={10:0}, malloc(sizeof(SLL))={10:0}] [L995] SLL* end = list; VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={10:0}] [L998] COND FALSE !(__VERIFIER_nondet_int()) [L1008] end = ((void*)0) [L1009] end = list VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1012] COND FALSE !(!(((void*)0) != end)) VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1012] COND FALSE !(0) VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1014] COND TRUE ((void*)0) != end [L1016] int len = 0; VAL [end={10:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1017] EXPR, FCALL end->inner VAL [end={10:0}, end->inner={0:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1017] SLL* inner = end->inner; [L1018] COND FALSE !(((void*)0) != inner) VAL [end={10:0}, inner={0:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1029] COND FALSE !(!(len <= 1)) VAL [end={10:0}, inner={0:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1029] COND FALSE !(0) VAL [end={10:0}, inner={0:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1031] EXPR, FCALL end->next VAL [end={10:0}, end->next={0:0}, inner={0:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1031] end = end->next [L1014] COND FALSE !(((void*)0) != end) VAL [end={0:0}, inner={0:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1035] COND TRUE ((void*)0) != list VAL [end={0:0}, inner={0:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1037] EXPR, FCALL list->inner VAL [end={0:0}, inner={0:0}, len=0, list={10:0}, list->inner={0:0}, malloc(sizeof(SLL))={10:0}] [L1037] end = list->inner [L1039] COND FALSE !(((void*)0) != end) VAL [end={0:0}, inner={0:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1047] EXPR, FCALL list->next VAL [end={0:0}, inner={0:0}, len=0, list={10:0}, list->next={0:0}, malloc(sizeof(SLL))={10:0}] [L1047] end = list->next [L1048] FCALL free(list) VAL [end={0:0}, inner={0:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1049] list = end VAL [end={0:0}, inner={0:0}, len=0, list={0:0}, malloc(sizeof(SLL))={10:0}] [L1035] COND FALSE !(((void*)0) != list) VAL [end={0:0}, inner={0:0}, len=0, list={0:0}, malloc(sizeof(SLL))={10:0}] [L1052] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 3 procedures, 123 locations, 3 error locations. UNSAFE Result, 1.0s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 350 SDtfs, 417 SDslu, 428 SDs, 0 SdLazy, 161 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=128occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 115 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 155 NumberOfCodeBlocks, 155 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 94 ConstructedInterpolants, 0 QuantifiedInterpolants, 7469 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 988). Cancelled while BasicCegarLoop was constructing difference of abstraction (435states) and interpolant automaton (currently 11 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 68. - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 3 procedures, 123 locations, 3 error locations. TIMEOUT Result, 61.1s OverallTime, 13 OverallIterations, 3 TraceHistogramMax, 49.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1662 SDtfs, 4370 SDslu, 10750 SDs, 0 SdLazy, 6312 SolverSat, 327 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 9.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 728 GetRequests, 433 SyntacticMatches, 17 SemanticMatches, 277 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 2309 ImplicationChecksByTransitivity, 46.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=435occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 854 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 10.3s InterpolantComputationTime, 1289 NumberOfCodeBlocks, 1289 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1270 ConstructedInterpolants, 134 QuantifiedInterpolants, 2124085 SizeOfPredicates, 59 NumberOfNonLiveVariables, 1209 ConjunctsInSsa, 159 ConjunctsInUnsatCore, 19 InterpolantComputations, 7 PerfectInterpolantSequences, 69/155 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-01_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-23_14-56-21-564.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-01_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-23_14-56-21-564.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-01_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-23_14-56-21-564.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-01_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-23_14-56-21-564.csv Completed graceful shutdown