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/dll-01_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-47db877 [2018-01-23 14:52:16,353 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-23 14:52:16,354 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-23 14:52:16,370 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-23 14:52:16,370 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-23 14:52:16,371 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-23 14:52:16,372 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-23 14:52:16,374 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-23 14:52:16,376 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-23 14:52:16,377 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-23 14:52:16,378 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-23 14:52:16,378 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-23 14:52:16,379 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-23 14:52:16,380 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-23 14:52:16,381 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-23 14:52:16,384 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-23 14:52:16,386 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-23 14:52:16,389 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-23 14:52:16,390 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-23 14:52:16,391 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-23 14:52:16,394 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-23 14:52:16,394 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-23 14:52:16,394 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-23 14:52:16,396 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-23 14:52:16,397 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-23 14:52:16,398 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-23 14:52:16,398 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-23 14:52:16,399 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-23 14:52:16,399 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-23 14:52:16,399 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-23 14:52:16,400 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-23 14:52:16,400 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:52:16,408 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-23 14:52:16,409 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-23 14:52:16,410 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-23 14:52:16,410 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-23 14:52:16,410 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-23 14:52:16,410 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-23 14:52:16,410 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-23 14:52:16,411 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-23 14:52:16,411 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-23 14:52:16,411 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-23 14:52:16,411 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-23 14:52:16,411 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-23 14:52:16,411 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-23 14:52:16,412 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-23 14:52:16,412 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-23 14:52:16,412 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-23 14:52:16,412 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-23 14:52:16,412 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-23 14:52:16,412 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-23 14:52:16,412 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-23 14:52:16,413 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-23 14:52:16,413 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-23 14:52:16,413 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-23 14:52:16,413 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-23 14:52:16,413 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-23 14:52:16,414 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-23 14:52:16,414 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-23 14:52:16,414 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-23 14:52:16,414 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-23 14:52:16,414 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-23 14:52:16,414 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-23 14:52:16,414 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-23 14:52:16,415 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-23 14:52:16,415 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-23 14:52:16,415 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-23 14:52:16,415 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-23 14:52:16,416 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-23 14:52:16,451 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-23 14:52:16,464 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-23 14:52:16,468 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-23 14:52:16,469 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-23 14:52:16,469 INFO L276 PluginConnector]: CDTParser initialized [2018-01-23 14:52:16,470 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-01_true-unreach-call_true-valid-memsafety.i [2018-01-23 14:52:16,667 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-23 14:52:16,672 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-23 14:52:16,672 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-23 14:52:16,673 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-23 14:52:16,678 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-23 14:52:16,679 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:52:16" (1/1) ... [2018-01-23 14:52:16,682 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b6225bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:52:16, skipping insertion in model container [2018-01-23 14:52:16,683 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:52:16" (1/1) ... [2018-01-23 14:52:16,697 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:52:16,738 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:52:16,857 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:52:16,880 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:52:16,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:52:16 WrapperNode [2018-01-23 14:52:16,888 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-23 14:52:16,889 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-23 14:52:16,890 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-23 14:52:16,890 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-23 14:52:16,901 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:52:16" (1/1) ... [2018-01-23 14:52:16,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:52:16" (1/1) ... [2018-01-23 14:52:16,913 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:52:16" (1/1) ... [2018-01-23 14:52:16,914 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:52:16" (1/1) ... [2018-01-23 14:52:16,919 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:52:16" (1/1) ... [2018-01-23 14:52:16,924 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:52:16" (1/1) ... [2018-01-23 14:52:16,926 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:52:16" (1/1) ... [2018-01-23 14:52:16,928 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-23 14:52:16,929 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-23 14:52:16,929 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-23 14:52:16,929 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-23 14:52:16,930 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:52:16" (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:52:16,977 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-23 14:52:16,977 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-23 14:52:16,977 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-23 14:52:16,978 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-23 14:52:16,978 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-23 14:52:16,978 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-23 14:52:16,978 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-23 14:52:16,978 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-23 14:52:16,978 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-23 14:52:16,978 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-23 14:52:16,978 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-23 14:52:16,978 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-23 14:52:16,978 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-23 14:52:16,979 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-23 14:52:16,979 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-23 14:52:17,401 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-23 14:52:17,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:52:17 BoogieIcfgContainer [2018-01-23 14:52:17,402 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-23 14:52:17,403 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-23 14:52:17,403 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-23 14:52:17,406 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-23 14:52:17,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.01 02:52:16" (1/3) ... [2018-01-23 14:52:17,407 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4069a364 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:52:17, skipping insertion in model container [2018-01-23 14:52:17,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:52:16" (2/3) ... [2018-01-23 14:52:17,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4069a364 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:52:17, skipping insertion in model container [2018-01-23 14:52:17,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:52:17" (3/3) ... [2018-01-23 14:52:17,410 INFO L105 eAbstractionObserver]: Analyzing ICFG dll-01_true-unreach-call_true-valid-memsafety.i [2018-01-23 14:52:17,419 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-23 14:52:17,427 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-23 14:52:17,483 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:52:17,483 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:52:17,483 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:52:17,483 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:52:17,484 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:52:17,484 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:52:17,484 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:52:17,484 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-23 14:52:17,485 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:52:17,509 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states. [2018-01-23 14:52:17,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-23 14:52:17,516 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:52:17,517 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-23 14:52:17,517 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-23 14:52:17,522 INFO L82 PathProgramCache]: Analyzing trace with hash 396895, now seen corresponding path program 1 times [2018-01-23 14:52:17,525 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:52:17,526 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:52:17,587 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:52:17,587 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:52:17,587 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:52:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:52:17,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:52:17,650 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:52:17,658 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:52:17,667 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:52:17,667 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:52:17,668 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:52:17,668 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:52:17,668 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:52:17,668 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:52:17,668 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:52:17,668 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-23 14:52:17,668 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:52:17,672 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states. [2018-01-23 14:52:17,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-23 14:52:17,675 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:52:17,675 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] [2018-01-23 14:52:17,675 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:52:17,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1539010196, now seen corresponding path program 1 times [2018-01-23 14:52:17,676 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:52:17,676 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:52:17,677 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:52:17,677 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:52:17,677 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:52:17,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:52:17,702 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:52:17,828 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:52:17,830 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:52:17,830 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:52:17,832 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:52:17,846 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:52:17,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:52:17,849 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 2 states. [2018-01-23 14:52:17,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:52:17,879 INFO L93 Difference]: Finished difference Result 244 states and 348 transitions. [2018-01-23 14:52:17,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:52:17,880 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-01-23 14:52:17,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:52:17,889 INFO L225 Difference]: With dead ends: 244 [2018-01-23 14:52:17,890 INFO L226 Difference]: Without dead ends: 124 [2018-01-23 14:52:17,894 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:52:17,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-23 14:52:17,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-01-23 14:52:17,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-23 14:52:17,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 133 transitions. [2018-01-23 14:52:17,937 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 133 transitions. Word has length 24 [2018-01-23 14:52:17,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:52:17,937 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 133 transitions. [2018-01-23 14:52:17,937 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:52:17,937 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 133 transitions. [2018-01-23 14:52:17,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-23 14:52:17,938 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:52:17,938 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] [2018-01-23 14:52:17,939 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:52:17,939 INFO L82 PathProgramCache]: Analyzing trace with hash 849242386, now seen corresponding path program 1 times [2018-01-23 14:52:17,939 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:52:17,939 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:52:17,940 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:52:17,940 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:52:17,940 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:52:17,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:52:17,964 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:52:18,102 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:52:18,103 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:52:18,103 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-23 14:52:18,104 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:52:18,105 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:52:18,105 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:52:18,105 INFO L87 Difference]: Start difference. First operand 124 states and 133 transitions. Second operand 5 states. [2018-01-23 14:52:18,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:52:18,381 INFO L93 Difference]: Finished difference Result 287 states and 310 transitions. [2018-01-23 14:52:18,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-23 14:52:18,381 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-01-23 14:52:18,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:52:18,387 INFO L225 Difference]: With dead ends: 287 [2018-01-23 14:52:18,387 INFO L226 Difference]: Without dead ends: 192 [2018-01-23 14:52:18,388 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:52:18,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-01-23 14:52:18,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 128. [2018-01-23 14:52:18,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-01-23 14:52:18,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 137 transitions. [2018-01-23 14:52:18,403 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 137 transitions. Word has length 37 [2018-01-23 14:52:18,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:52:18,403 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 137 transitions. [2018-01-23 14:52:18,403 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:52:18,403 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2018-01-23 14:52:18,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-23 14:52:18,405 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:52:18,405 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, 1] [2018-01-23 14:52:18,405 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:52:18,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1513386891, now seen corresponding path program 1 times [2018-01-23 14:52:18,405 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:52:18,406 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:52:18,407 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:52:18,407 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:52:18,407 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:52:18,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:52:18,427 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:52:18,489 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:52:18,490 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:52:18,490 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-23 14:52:18,490 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:52:18,491 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:52:18,491 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:52:18,491 INFO L87 Difference]: Start difference. First operand 128 states and 137 transitions. Second operand 5 states. [2018-01-23 14:52:18,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:52:18,615 INFO L93 Difference]: Finished difference Result 213 states and 229 transitions. [2018-01-23 14:52:18,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-23 14:52:18,616 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-01-23 14:52:18,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:52:18,618 INFO L225 Difference]: With dead ends: 213 [2018-01-23 14:52:18,619 INFO L226 Difference]: Without dead ends: 186 [2018-01-23 14:52:18,619 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:52:18,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-01-23 14:52:18,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 132. [2018-01-23 14:52:18,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-01-23 14:52:18,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 141 transitions. [2018-01-23 14:52:18,634 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 141 transitions. Word has length 39 [2018-01-23 14:52:18,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:52:18,634 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 141 transitions. [2018-01-23 14:52:18,634 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:52:18,634 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 141 transitions. [2018-01-23 14:52:18,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-23 14:52:18,637 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:52:18,637 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] [2018-01-23 14:52:18,637 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:52:18,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1547435689, now seen corresponding path program 1 times [2018-01-23 14:52:18,638 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:52:18,638 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:52:18,639 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:52:18,639 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:52:18,639 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:52:18,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:52:18,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:52:18,699 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:52:18,710 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:52:18,721 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:52:18,721 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:52:18,739 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:52:18,740 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:52:18,740 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:52:18,740 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:52:18,740 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:52:18,740 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:52:18,740 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:52:18,740 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-23 14:52:18,740 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:52:18,742 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states. [2018-01-23 14:52:18,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-23 14:52:18,744 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:52:18,744 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] [2018-01-23 14:52:18,744 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-23 14:52:18,744 INFO L82 PathProgramCache]: Analyzing trace with hash 565995656, now seen corresponding path program 1 times [2018-01-23 14:52:18,744 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:52:18,744 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:52:18,745 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:52:18,746 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:52:18,746 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:52:18,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:52:18,753 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:52:18,763 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:52:18,764 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:52:18,764 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:52:18,764 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:52:18,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:52:18,764 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:52:18,765 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 2 states. [2018-01-23 14:52:18,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:52:18,773 INFO L93 Difference]: Finished difference Result 244 states and 348 transitions. [2018-01-23 14:52:18,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:52:18,773 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-01-23 14:52:18,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:52:18,775 INFO L225 Difference]: With dead ends: 244 [2018-01-23 14:52:18,775 INFO L226 Difference]: Without dead ends: 122 [2018-01-23 14:52:18,776 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:52:18,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-01-23 14:52:18,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-01-23 14:52:18,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-23 14:52:18,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 131 transitions. [2018-01-23 14:52:18,786 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 131 transitions. Word has length 22 [2018-01-23 14:52:18,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:52:18,787 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 131 transitions. [2018-01-23 14:52:18,787 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:52:18,787 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 131 transitions. [2018-01-23 14:52:18,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-23 14:52:18,788 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:52:18,788 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] [2018-01-23 14:52:18,789 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-23 14:52:18,789 INFO L82 PathProgramCache]: Analyzing trace with hash -673975890, now seen corresponding path program 1 times [2018-01-23 14:52:18,789 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:52:18,789 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:52:18,790 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:52:18,790 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:52:18,791 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:52:18,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:52:18,804 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:52:18,858 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:52:18,858 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:52:18,859 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-23 14:52:18,859 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:52:18,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:52:18,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:52:18,860 INFO L87 Difference]: Start difference. First operand 122 states and 131 transitions. Second operand 5 states. [2018-01-23 14:52:19,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:52:19,023 INFO L93 Difference]: Finished difference Result 283 states and 305 transitions. [2018-01-23 14:52:19,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-23 14:52:19,024 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-01-23 14:52:19,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:52:19,025 INFO L225 Difference]: With dead ends: 283 [2018-01-23 14:52:19,025 INFO L226 Difference]: Without dead ends: 190 [2018-01-23 14:52:19,026 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:52:19,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-01-23 14:52:19,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 126. [2018-01-23 14:52:19,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-23 14:52:19,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 135 transitions. [2018-01-23 14:52:19,036 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 135 transitions. Word has length 35 [2018-01-23 14:52:19,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:52:19,037 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 135 transitions. [2018-01-23 14:52:19,037 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:52:19,037 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 135 transitions. [2018-01-23 14:52:19,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-23 14:52:19,038 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:52:19,038 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] [2018-01-23 14:52:19,039 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-23 14:52:19,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1839763921, now seen corresponding path program 1 times [2018-01-23 14:52:19,040 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:52:19,040 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:52:19,041 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:52:19,041 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:52:19,041 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:52:19,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:52:19,053 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:52:19,110 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:52:19,110 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:52:19,110 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-23 14:52:19,110 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:52:19,111 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:52:19,111 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:52:19,111 INFO L87 Difference]: Start difference. First operand 126 states and 135 transitions. Second operand 5 states. [2018-01-23 14:52:19,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:52:19,328 INFO L93 Difference]: Finished difference Result 209 states and 225 transitions. [2018-01-23 14:52:19,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-23 14:52:19,328 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-01-23 14:52:19,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:52:19,330 INFO L225 Difference]: With dead ends: 209 [2018-01-23 14:52:19,330 INFO L226 Difference]: Without dead ends: 184 [2018-01-23 14:52:19,330 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:52:19,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-01-23 14:52:19,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 130. [2018-01-23 14:52:19,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-01-23 14:52:19,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 139 transitions. [2018-01-23 14:52:19,340 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 139 transitions. Word has length 37 [2018-01-23 14:52:19,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:52:19,340 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 139 transitions. [2018-01-23 14:52:19,341 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:52:19,341 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 139 transitions. [2018-01-23 14:52:19,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-01-23 14:52:19,342 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:52:19,342 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] [2018-01-23 14:52:19,342 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-23 14:52:19,343 INFO L82 PathProgramCache]: Analyzing trace with hash 171442437, now seen corresponding path program 1 times [2018-01-23 14:52:19,343 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:52:19,343 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:52:19,344 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:52:19,344 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:52:19,344 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:52:19,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:52:19,363 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:52:19,538 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:52:19,538 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:52:19,538 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:52:19,553 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:52:19,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:52:19,602 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:52:19,712 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:52:19,748 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:52:19,784 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:52:19,784 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6] total 8 [2018-01-23 14:52:19,785 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-23 14:52:19,786 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-23 14:52:19,786 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=43, Unknown=1, NotChecked=12, Total=72 [2018-01-23 14:52:19,786 INFO L87 Difference]: Start difference. First operand 130 states and 139 transitions. Second operand 9 states. [2018-01-23 14:52:20,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:52:20,170 INFO L93 Difference]: Finished difference Result 214 states and 229 transitions. [2018-01-23 14:52:20,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-23 14:52:20,171 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2018-01-23 14:52:20,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:52:20,173 INFO L225 Difference]: With dead ends: 214 [2018-01-23 14:52:20,173 INFO L226 Difference]: Without dead ends: 211 [2018-01-23 14:52:20,173 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 56 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:52:20,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-01-23 14:52:20,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 178. [2018-01-23 14:52:20,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-01-23 14:52:20,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 192 transitions. [2018-01-23 14:52:20,186 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 192 transitions. Word has length 57 [2018-01-23 14:52:20,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:52:20,186 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 192 transitions. [2018-01-23 14:52:20,187 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-23 14:52:20,187 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 192 transitions. [2018-01-23 14:52:20,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-23 14:52:20,188 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:52:20,188 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] [2018-01-23 14:52:20,188 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation]=== [2018-01-23 14:52:20,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1525904848, now seen corresponding path program 1 times [2018-01-23 14:52:20,189 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:52:20,189 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:52:20,190 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:52:20,190 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:52:20,190 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:52:20,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:52:20,207 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:52:20,372 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:52:20,372 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:52:20,372 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-23 14:52:20,373 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-23 14:52:20,373 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-23 14:52:20,373 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-23 14:52:20,373 INFO L87 Difference]: Start difference. First operand 178 states and 192 transitions. Second operand 7 states. [2018-01-23 14:52:21,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:52:21,041 INFO L93 Difference]: Finished difference Result 273 states and 294 transitions. [2018-01-23 14:52:21,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-23 14:52:21,041 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2018-01-23 14:52:21,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:52:21,042 INFO L225 Difference]: With dead ends: 273 [2018-01-23 14:52:21,042 INFO L226 Difference]: Without dead ends: 248 [2018-01-23 14:52:21,043 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-01-23 14:52:21,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-01-23 14:52:21,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 220. [2018-01-23 14:52:21,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-01-23 14:52:21,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 238 transitions. [2018-01-23 14:52:21,052 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 238 transitions. Word has length 62 [2018-01-23 14:52:21,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:52:21,052 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 238 transitions. [2018-01-23 14:52:21,052 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-23 14:52:21,053 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 238 transitions. [2018-01-23 14:52:21,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-01-23 14:52:21,053 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:52:21,054 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] [2018-01-23 14:52:21,054 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation]=== [2018-01-23 14:52:21,054 INFO L82 PathProgramCache]: Analyzing trace with hash 628326227, now seen corresponding path program 1 times [2018-01-23 14:52:21,054 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:52:21,054 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:52:21,055 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:52:21,055 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:52:21,055 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:52:21,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:52:21,073 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:52:21,241 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:52:21,241 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:52:21,241 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-23 14:52:21,241 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-23 14:52:21,242 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-23 14:52:21,242 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-01-23 14:52:21,242 INFO L87 Difference]: Start difference. First operand 220 states and 238 transitions. Second operand 11 states. [2018-01-23 14:52:21,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:52:21,793 INFO L93 Difference]: Finished difference Result 441 states and 474 transitions. [2018-01-23 14:52:21,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-23 14:52:21,794 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2018-01-23 14:52:21,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:52:21,795 INFO L225 Difference]: With dead ends: 441 [2018-01-23 14:52:21,796 INFO L226 Difference]: Without dead ends: 342 [2018-01-23 14:52:21,797 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2018-01-23 14:52:21,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-01-23 14:52:21,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 215. [2018-01-23 14:52:21,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-01-23 14:52:21,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 232 transitions. [2018-01-23 14:52:21,810 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 232 transitions. Word has length 64 [2018-01-23 14:52:21,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:52:21,810 INFO L432 AbstractCegarLoop]: Abstraction has 215 states and 232 transitions. [2018-01-23 14:52:21,811 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-23 14:52:21,811 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 232 transitions. [2018-01-23 14:52:21,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-01-23 14:52:21,812 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:52:21,812 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, 1] [2018-01-23 14:52:21,812 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation]=== [2018-01-23 14:52:21,812 INFO L82 PathProgramCache]: Analyzing trace with hash -135358828, now seen corresponding path program 2 times [2018-01-23 14:52:21,812 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:52:21,813 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:52:21,813 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:52:21,813 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:52:21,814 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:52:21,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:52:21,825 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:52:21,985 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:52:21,985 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:52:21,985 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:52:21,993 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-23 14:52:22,008 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:52:22,020 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:52:22,021 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:52:22,025 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:52:22,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-23 14:52:22,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-23 14:52:22,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:52:22,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:52:22,080 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:52:22,080 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-01-23 14:52:22,134 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:52:22,154 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:52:22,154 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-01-23 14:52:22,154 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-23 14:52:22,155 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-23 14:52:22,155 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-01-23 14:52:22,155 INFO L87 Difference]: Start difference. First operand 215 states and 232 transitions. Second operand 17 states. [2018-01-23 14:52:22,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:52:22,515 INFO L93 Difference]: Finished difference Result 393 states and 425 transitions. [2018-01-23 14:52:22,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-23 14:52:22,515 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2018-01-23 14:52:22,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:52:22,517 INFO L225 Difference]: With dead ends: 393 [2018-01-23 14:52:22,517 INFO L226 Difference]: Without dead ends: 296 [2018-01-23 14:52:22,518 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2018-01-23 14:52:22,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-01-23 14:52:22,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 218. [2018-01-23 14:52:22,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-01-23 14:52:22,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 233 transitions. [2018-01-23 14:52:22,534 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 233 transitions. Word has length 66 [2018-01-23 14:52:22,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:52:22,534 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 233 transitions. [2018-01-23 14:52:22,534 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-23 14:52:22,534 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 233 transitions. [2018-01-23 14:52:22,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-01-23 14:52:22,535 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:52:22,535 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] [2018-01-23 14:52:22,536 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation]=== [2018-01-23 14:52:22,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1992096144, now seen corresponding path program 1 times [2018-01-23 14:52:22,536 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:52:22,536 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:52:22,537 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:52:22,537 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:52:22,537 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:52:22,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:52:22,549 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:52:22,657 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:52:22,657 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:52:22,658 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-23 14:52:22,658 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-23 14:52:22,658 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-23 14:52:22,658 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-23 14:52:22,658 INFO L87 Difference]: Start difference. First operand 218 states and 233 transitions. Second operand 7 states. [2018-01-23 14:52:22,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:52:22,845 INFO L93 Difference]: Finished difference Result 294 states and 311 transitions. [2018-01-23 14:52:22,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-23 14:52:22,845 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2018-01-23 14:52:22,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:52:22,847 INFO L225 Difference]: With dead ends: 294 [2018-01-23 14:52:22,847 INFO L226 Difference]: Without dead ends: 236 [2018-01-23 14:52:22,847 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-01-23 14:52:22,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-01-23 14:52:22,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 224. [2018-01-23 14:52:22,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-01-23 14:52:22,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 239 transitions. [2018-01-23 14:52:22,860 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 239 transitions. Word has length 70 [2018-01-23 14:52:22,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:52:22,860 INFO L432 AbstractCegarLoop]: Abstraction has 224 states and 239 transitions. [2018-01-23 14:52:22,860 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-23 14:52:22,861 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 239 transitions. [2018-01-23 14:52:22,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-01-23 14:52:22,861 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:52:22,862 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, 1] [2018-01-23 14:52:22,862 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation]=== [2018-01-23 14:52:22,862 INFO L82 PathProgramCache]: Analyzing trace with hash -938083547, now seen corresponding path program 1 times [2018-01-23 14:52:22,862 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:52:22,862 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:52:22,863 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:52:22,863 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:52:22,864 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:52:22,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:52:22,882 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:52:23,758 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:52:23,758 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:52:23,758 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:52:23,764 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:52:23,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:52:23,786 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:52:23,855 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:52:23,857 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:52:23,857 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:52:23,858 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:52:23,859 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:52:23,859 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:3 [2018-01-23 14:52:23,919 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:52:23,943 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:52:23,943 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 22 [2018-01-23 14:52:23,943 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-23 14:52:23,944 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-23 14:52:23,944 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=417, Unknown=0, NotChecked=0, Total=462 [2018-01-23 14:52:23,944 INFO L87 Difference]: Start difference. First operand 224 states and 239 transitions. Second operand 22 states. [2018-01-23 14:52:26,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:52:26,240 INFO L93 Difference]: Finished difference Result 428 states and 454 transitions. [2018-01-23 14:52:26,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-01-23 14:52:26,240 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 75 [2018-01-23 14:52:26,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:52:26,242 INFO L225 Difference]: With dead ends: 428 [2018-01-23 14:52:26,242 INFO L226 Difference]: Without dead ends: 275 [2018-01-23 14:52:26,243 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 673 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=366, Invalid=3056, Unknown=0, NotChecked=0, Total=3422 [2018-01-23 14:52:26,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-01-23 14:52:26,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 226. [2018-01-23 14:52:26,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-01-23 14:52:26,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 243 transitions. [2018-01-23 14:52:26,252 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 243 transitions. Word has length 75 [2018-01-23 14:52:26,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:52:26,252 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 243 transitions. [2018-01-23 14:52:26,252 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-23 14:52:26,252 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 243 transitions. [2018-01-23 14:52:26,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-01-23 14:52:26,253 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:52:26,253 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] [2018-01-23 14:52:26,253 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation]=== [2018-01-23 14:52:26,253 INFO L82 PathProgramCache]: Analyzing trace with hash -670239325, now seen corresponding path program 1 times [2018-01-23 14:52:26,253 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:52:26,253 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:52:26,254 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:52:26,254 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:52:26,254 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:52:26,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:52:26,263 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:52:26,346 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:52:26,346 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:52:26,346 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-23 14:52:26,346 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:52:26,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:52:26,347 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:52:26,347 INFO L87 Difference]: Start difference. First operand 226 states and 243 transitions. Second operand 5 states. [2018-01-23 14:52:26,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:52:26,759 INFO L93 Difference]: Finished difference Result 429 states and 464 transitions. [2018-01-23 14:52:26,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-23 14:52:26,760 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2018-01-23 14:52:26,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:52:26,761 INFO L225 Difference]: With dead ends: 429 [2018-01-23 14:52:26,761 INFO L226 Difference]: Without dead ends: 242 [2018-01-23 14:52:26,761 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-23 14:52:26,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-01-23 14:52:26,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 230. [2018-01-23 14:52:26,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-01-23 14:52:26,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 247 transitions. [2018-01-23 14:52:26,769 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 247 transitions. Word has length 83 [2018-01-23 14:52:26,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:52:26,770 INFO L432 AbstractCegarLoop]: Abstraction has 230 states and 247 transitions. [2018-01-23 14:52:26,770 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:52:26,770 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 247 transitions. [2018-01-23 14:52:26,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-01-23 14:52:26,770 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:52:26,770 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] [2018-01-23 14:52:26,771 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation]=== [2018-01-23 14:52:26,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1776602016, now seen corresponding path program 1 times [2018-01-23 14:52:26,771 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:52:26,771 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:52:26,771 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:52:26,772 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:52:26,772 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:52:26,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:52:26,783 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:52:27,247 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:52:27,247 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:52:27,247 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:52:27,253 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:52:27,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:52:27,286 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:52:27,290 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:52:27,290 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:52:27,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:52:27,292 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-23 14:52:27,310 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:52:27,310 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:52:27,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-23 14:52:27,313 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:52:27,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:52:27,318 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-01-23 14:52:27,340 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:52:27,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-23 14:52:27,342 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:52:27,344 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:52:27,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:52:27,357 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-01-23 14:52:27,399 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:52:27,401 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 30 treesize of output 34 [2018-01-23 14:52:27,403 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:52:27,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:52:27,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:52:27,411 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:52:27,411 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-01-23 14:52:27,481 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:52:27,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-01-23 14:52:27,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-23 14:52:27,486 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:52:27,490 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:52:27,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 46 [2018-01-23 14:52:27,532 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 2 case distinctions, treesize of input 16 treesize of output 31 [2018-01-23 14:52:27,533 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-23 14:52:27,545 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:52:27,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-23 14:52:27,564 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:58, output treesize:108 [2018-01-23 14:52:27,659 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 97 treesize of output 84 [2018-01-23 14:52:27,665 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:52:27,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 28 treesize of output 47 [2018-01-23 14:52:27,666 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:52:27,678 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:52:27,716 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 89 treesize of output 79 [2018-01-23 14:52:27,724 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:52:27,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 28 treesize of output 47 [2018-01-23 14:52:27,725 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:52:27,766 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:52:27,796 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 97 treesize of output 87 [2018-01-23 14:52:27,799 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:52:27,799 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 28 treesize of output 47 [2018-01-23 14:52:27,800 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-23 14:52:27,809 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:52:27,834 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 89 treesize of output 76 [2018-01-23 14:52:27,836 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:52:27,837 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 28 treesize of output 47 [2018-01-23 14:52:27,837 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-23 14:52:27,845 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:52:27,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:52:27,865 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:195, output treesize:163 [2018-01-23 14:52:27,922 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 95 treesize of output 75 [2018-01-23 14:52:27,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 29 [2018-01-23 14:52:27,930 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:52:27,950 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:52:27,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 14 [2018-01-23 14:52:27,951 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:52:27,958 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:52:27,977 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 44 treesize of output 32 [2018-01-23 14:52:27,982 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:52:27,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 10 [2018-01-23 14:52:27,982 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-23 14:52:27,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-01-23 14:52:27,988 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-23 14:52:27,991 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:52:28,006 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 95 treesize of output 73 [2018-01-23 14:52:28,010 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 46 treesize of output 33 [2018-01-23 14:52:28,010 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-23 14:52:28,024 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:52:28,025 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 21 treesize of output 14 [2018-01-23 14:52:28,025 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-23 14:52:28,033 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:52:28,046 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 40 treesize of output 30 [2018-01-23 14:52:28,048 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 22 treesize of output 13 [2018-01-23 14:52:28,048 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-23 14:52:28,054 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:52:28,055 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:52:28,055 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-23 14:52:28,057 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:52:28,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:52:28,063 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:191, output treesize:9 [2018-01-23 14:52:28,145 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:52:28,165 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:52:28,166 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 29 [2018-01-23 14:52:28,166 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-23 14:52:28,166 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-23 14:52:28,167 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=740, Unknown=0, NotChecked=0, Total=812 [2018-01-23 14:52:28,167 INFO L87 Difference]: Start difference. First operand 230 states and 247 transitions. Second operand 29 states. [2018-01-23 14:52:30,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:52:30,308 INFO L93 Difference]: Finished difference Result 518 states and 557 transitions. [2018-01-23 14:52:30,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-23 14:52:30,308 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 85 [2018-01-23 14:52:30,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:52:30,310 INFO L225 Difference]: With dead ends: 518 [2018-01-23 14:52:30,310 INFO L226 Difference]: Without dead ends: 486 [2018-01-23 14:52:30,311 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=471, Invalid=2721, Unknown=0, NotChecked=0, Total=3192 [2018-01-23 14:52:30,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2018-01-23 14:52:30,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 375. [2018-01-23 14:52:30,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-01-23 14:52:30,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 404 transitions. [2018-01-23 14:52:30,334 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 404 transitions. Word has length 85 [2018-01-23 14:52:30,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:52:30,334 INFO L432 AbstractCegarLoop]: Abstraction has 375 states and 404 transitions. [2018-01-23 14:52:30,334 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-23 14:52:30,334 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 404 transitions. [2018-01-23 14:52:30,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-01-23 14:52:30,336 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:52:30,336 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, 1, 1, 1, 1] [2018-01-23 14:52:30,336 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation]=== [2018-01-23 14:52:30,336 INFO L82 PathProgramCache]: Analyzing trace with hash 2030876237, now seen corresponding path program 1 times [2018-01-23 14:52:30,336 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:52:30,337 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:52:30,337 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:52:30,338 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:52:30,338 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:52:30,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:52:30,376 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:52:31,494 WARN L146 SmtUtils]: Spent 178ms on a formula simplification. DAG size of input: 99 DAG size of output 57 [2018-01-23 14:52:31,633 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 59 DAG size of output 50 [2018-01-23 14:52:31,782 WARN L146 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 68 DAG size of output 57 [2018-01-23 14:52:32,024 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:52:32,024 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:52:32,024 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:52:32,030 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:52:32,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:52:32,074 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:52:32,081 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:52:32,082 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:52:32,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:52:32,083 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-23 14:52:32,189 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:52:32,190 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:52:32,191 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:52:32,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:52:32,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:52:32,201 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:25 [2018-01-23 14:52:32,237 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:52:32,239 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:52:32,239 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:52:32,241 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:52:32,249 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:52:32,250 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-01-23 14:52:32,317 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:52:32,320 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 47 treesize of output 51 [2018-01-23 14:52:32,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-23 14:52:32,323 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:52:32,329 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:52:32,337 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:52:32,337 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:50 [2018-01-23 14:52:32,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 52 [2018-01-23 14:52:32,473 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 2 case distinctions, treesize of input 16 treesize of output 23 [2018-01-23 14:52:32,474 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-23 14:52:32,487 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:52:32,509 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 2 xjuncts. [2018-01-23 14:52:32,509 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:100 [2018-01-23 14:52:32,564 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:52:32,565 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:52:32,566 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:52:32,567 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:52:32,567 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:52:32,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:52:32,574 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:43 [2018-01-23 14:52:32,607 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:52:32,610 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:52:32,617 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:52:32,622 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:52:32,623 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:52:32,632 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:52:32,641 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:52:32,642 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:55 [2018-01-23 14:52:32,714 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:52:32,720 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:52:32,723 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:52:32,723 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:52:32,735 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:52:32,757 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:52:32,758 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:68 [2018-01-23 14:52:32,852 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:52:32,856 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:52:32,856 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:52:32,865 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:52:32,873 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:52:32,874 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:110, output treesize:96 [2018-01-23 14:52:36,976 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:52:36,979 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:52:36,993 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 24 treesize of output 17 [2018-01-23 14:52:36,993 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:52:37,041 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:52:37,041 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:52:37,083 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:52:37,084 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:52:37,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:52:37,115 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:52:37,115 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:103, output treesize:4 [2018-01-23 14:52:37,369 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:52:37,397 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:52:37,398 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21] total 44 [2018-01-23 14:52:37,398 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-01-23 14:52:37,398 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-01-23 14:52:37,399 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1670, Unknown=2, NotChecked=0, Total=1892 [2018-01-23 14:52:37,399 INFO L87 Difference]: Start difference. First operand 375 states and 404 transitions. Second operand 44 states. [2018-01-23 14:52:38,761 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 109 DAG size of output 58 [2018-01-23 14:52:39,057 WARN L146 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 144 DAG size of output 60 [2018-01-23 14:52:45,630 WARN L146 SmtUtils]: Spent 6168ms on a formula simplification. DAG size of input: 165 DAG size of output 82 [2018-01-23 14:52:51,826 WARN L146 SmtUtils]: Spent 6158ms on a formula simplification. DAG size of input: 131 DAG size of output 80 [2018-01-23 14:52:58,063 WARN L146 SmtUtils]: Spent 6179ms on a formula simplification. DAG size of input: 174 DAG size of output 84 [2018-01-23 14:53:04,307 WARN L146 SmtUtils]: Spent 6163ms on a formula simplification. DAG size of input: 137 DAG size of output 87 [2018-01-23 14:53:05,115 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 111 DAG size of output 59 [2018-01-23 14:53:06,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:53:06,629 INFO L93 Difference]: Finished difference Result 627 states and 674 transitions. [2018-01-23 14:53:06,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-01-23 14:53:06,629 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 90 [2018-01-23 14:53:06,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:53:06,631 INFO L225 Difference]: With dead ends: 627 [2018-01-23 14:53:06,631 INFO L226 Difference]: Without dead ends: 592 [2018-01-23 14:53:06,632 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2466 ImplicationChecksByTransitivity, 33.2s TimeCoverageRelationStatistics Valid=1425, Invalid=6750, Unknown=15, NotChecked=0, Total=8190 [2018-01-23 14:53:06,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2018-01-23 14:53:06,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 387. [2018-01-23 14:53:06,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-01-23 14:53:06,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 417 transitions. [2018-01-23 14:53:06,655 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 417 transitions. Word has length 90 [2018-01-23 14:53:06,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:53:06,656 INFO L432 AbstractCegarLoop]: Abstraction has 387 states and 417 transitions. [2018-01-23 14:53:06,656 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-01-23 14:53:06,656 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 417 transitions. [2018-01-23 14:53:06,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-01-23 14:53:06,657 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:53:06,657 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, 1, 1, 1, 1] [2018-01-23 14:53:06,658 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation]=== [2018-01-23 14:53:06,658 INFO L82 PathProgramCache]: Analyzing trace with hash -667837716, now seen corresponding path program 2 times [2018-01-23 14:53:06,658 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:53:06,658 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:53:06,659 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:53:06,659 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:53:06,659 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:53:06,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:53:06,684 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:53:08,184 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:53:08,184 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:53:08,184 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:53:08,189 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-23 14:53:08,202 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:53:08,215 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:53:08,219 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:53:08,223 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:53:08,361 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:53:08,363 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:53:08,363 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:53:08,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:53:08,374 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:53:08,376 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:53:08,376 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:53:08,385 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:53:08,407 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:53:08,407 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:89, output treesize:83 [2018-01-23 14:53:08,505 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:53:08,508 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 62 treesize of output 66 [2018-01-23 14:53:08,510 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:53:08,510 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:53:08,519 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:53:08,546 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:53:08,549 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 62 treesize of output 66 [2018-01-23 14:53:08,551 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:53:08,551 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:53:08,561 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:53:08,586 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:53:08,586 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:125, output treesize:109 [2018-01-23 14:53:08,779 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:53:08,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 65 [2018-01-23 14:53:08,793 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 2 case distinctions, treesize of input 16 treesize of output 23 [2018-01-23 14:53:08,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-23 14:53:08,809 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:53:08,851 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:53:08,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 61 [2018-01-23 14:53:08,862 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:53:08,867 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 2 case distinctions, treesize of input 16 treesize of output 27 [2018-01-23 14:53:08,868 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-23 14:53:08,885 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:53:08,929 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 4 xjuncts. [2018-01-23 14:53:08,929 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:133, output treesize:215 [2018-01-23 14:53:09,019 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:53:09,023 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:53:09,025 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:53:09,025 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:53:09,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:53:09,034 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:53:09,058 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:53:09,061 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:53:09,064 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:53:09,064 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:53:09,064 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:53:09,074 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:53:09,092 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:53:09,092 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:135, output treesize:119 [2018-01-23 14:53:09,226 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:53:09,228 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:53:09,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-01-23 14:53:09,231 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:53:09,246 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:53:09,247 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:53:09,247 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:53:09,257 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:53:09,299 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:53:09,301 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:53:09,304 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:53:09,305 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:53:09,305 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-23 14:53:09,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 18 [2018-01-23 14:53:09,344 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-23 14:53:09,351 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:53:09,388 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:53:09,389 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:133, output treesize:55 [2018-01-23 14:53:09,520 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:53:09,523 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:53:09,758 WARN L1029 $PredicateComparison]: unable to prove that (or (and (not (= c_main_~list~5.offset 0)) (exists ((v_prenex_15 Int)) (let ((.cse0 (store |c_old(#valid)| v_prenex_15 1))) (and (not (= 0 v_prenex_15)) (= 0 (select |c_old(#valid)| v_prenex_15)) (= |c_#valid| (store (store .cse0 c_main_~list~5.base 1) v_prenex_15 0)) (= (select .cse0 c_main_~list~5.base) 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:53:09,767 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:53:09,851 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 11 not checked. [2018-01-23 14:53:09,871 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:53:09,872 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21] total 43 [2018-01-23 14:53:09,872 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-01-23 14:53:09,872 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-01-23 14:53:09,872 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1412, Unknown=21, NotChecked=316, Total=1892 [2018-01-23 14:53:09,873 INFO L87 Difference]: Start difference. First operand 387 states and 417 transitions. Second operand 44 states. [2018-01-23 14:53:12,579 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 97 DAG size of output 74 [2018-01-23 14:53:13,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:53:13,576 INFO L93 Difference]: Finished difference Result 595 states and 639 transitions. [2018-01-23 14:53:13,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-01-23 14:53:13,577 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 105 [2018-01-23 14:53:13,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:53:13,579 INFO L225 Difference]: With dead ends: 595 [2018-01-23 14:53:13,579 INFO L226 Difference]: Without dead ends: 592 [2018-01-23 14:53:13,580 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 93 SyntacticMatches, 4 SemanticMatches, 68 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 985 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=460, Invalid=3824, Unknown=22, NotChecked=524, Total=4830 [2018-01-23 14:53:13,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2018-01-23 14:53:13,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 530. [2018-01-23 14:53:13,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-01-23 14:53:13,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 573 transitions. [2018-01-23 14:53:13,612 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 573 transitions. Word has length 105 [2018-01-23 14:53:13,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:53:13,613 INFO L432 AbstractCegarLoop]: Abstraction has 530 states and 573 transitions. [2018-01-23 14:53:13,613 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-01-23 14:53:13,613 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 573 transitions. [2018-01-23 14:53:13,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-01-23 14:53:13,615 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:53:13,615 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:53:13,615 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0EnsuresViolation]=== [2018-01-23 14:53:13,615 INFO L82 PathProgramCache]: Analyzing trace with hash 564030745, now seen corresponding path program 2 times [2018-01-23 14:53:13,615 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:53:13,615 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:53:13,616 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:53:13,616 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:53:13,616 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:53:13,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:53:13,648 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:53:14,846 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-23 14:53:14,847 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:53:14,847 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:53:14,869 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-23 14:53:14,890 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:53:14,913 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:53:14,921 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:53:14,927 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:53:14,933 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:53:14,934 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:53:14,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:53:14,935 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-23 14:53:15,105 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:53:15,111 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:53:15,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-23 14:53:15,112 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:53:15,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:53:15,121 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-01-23 14:53:15,159 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:53:15,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-23 14:53:15,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:53:15,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:53:15,175 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:53:15,177 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:53:15,178 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:53:15,179 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:53:15,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:53:15,188 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-01-23 14:53:15,258 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:53:15,261 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 29 treesize of output 30 Received shutdown request... [2018-01-23 14:53:15,263 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:53:15,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:53:15,265 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-23 14:53:15,265 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-23 14:53:15,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.01 02:53:15 BoogieIcfgContainer [2018-01-23 14:53:15,267 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-23 14:53:15,268 INFO L168 Benchmark]: Toolchain (without parser) took 58600.67 ms. Allocated memory was 304.6 MB in the beginning and 757.6 MB in the end (delta: 453.0 MB). Free memory was 262.9 MB in the beginning and 572.0 MB in the end (delta: -309.1 MB). Peak memory consumption was 143.9 MB. Max. memory is 5.3 GB. [2018-01-23 14:53:15,269 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 304.6 MB. Free memory is still 268.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-23 14:53:15,269 INFO L168 Benchmark]: CACSL2BoogieTranslator took 216.25 ms. Allocated memory is still 304.6 MB. Free memory was 261.9 MB in the beginning and 249.8 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 5.3 GB. [2018-01-23 14:53:15,269 INFO L168 Benchmark]: Boogie Preprocessor took 38.82 ms. Allocated memory is still 304.6 MB. Free memory was 249.8 MB in the beginning and 246.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. [2018-01-23 14:53:15,269 INFO L168 Benchmark]: RCFGBuilder took 473.53 ms. Allocated memory is still 304.6 MB. Free memory was 246.8 MB in the beginning and 214.2 MB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 5.3 GB. [2018-01-23 14:53:15,270 INFO L168 Benchmark]: TraceAbstraction took 57864.14 ms. Allocated memory was 304.6 MB in the beginning and 757.6 MB in the end (delta: 453.0 MB). Free memory was 214.2 MB in the beginning and 572.0 MB in the end (delta: -357.8 MB). Peak memory consumption was 95.1 MB. Max. memory is 5.3 GB. [2018-01-23 14:53:15,271 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.14 ms. Allocated memory is still 304.6 MB. Free memory is still 268.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 216.25 ms. Allocated memory is still 304.6 MB. Free memory was 261.9 MB in the beginning and 249.8 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.82 ms. Allocated memory is still 304.6 MB. Free memory was 249.8 MB in the beginning and 246.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 473.53 ms. Allocated memory is still 304.6 MB. Free memory was 246.8 MB in the beginning and 214.2 MB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 57864.14 ms. Allocated memory was 304.6 MB in the beginning and 757.6 MB in the end (delta: 453.0 MB). Free memory was 214.2 MB in the beginning and 572.0 MB in the end (delta: -357.8 MB). Peak memory consumption was 95.1 MB. 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, 127 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=127occurred 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: [L992] EXPR, FCALL malloc(sizeof(SLL)) VAL [malloc(sizeof(SLL))={14:0}] [L992] SLL* list = malloc(sizeof(SLL)); VAL [list={14:0}, malloc(sizeof(SLL))={14:0}] [L993] FCALL list->next = ((void*)0) VAL [list={14:0}, malloc(sizeof(SLL))={14:0}] [L994] FCALL list->prev = ((void*)0) VAL [list={14:0}, malloc(sizeof(SLL))={14:0}] [L995] COND FALSE !(!(list != ((void*)0))) VAL [list={14:0}, malloc(sizeof(SLL))={14:0}] [L995] COND FALSE !(0) VAL [list={14:0}, malloc(sizeof(SLL))={14:0}] [L995] COND TRUE __VERIFIER_nondet_int() [L995] FCALL list->inner = ((void*)0) VAL [list={14:0}, malloc(sizeof(SLL))={14:0}] [L995] EXPR, FCALL list->inner VAL [list={14:0}, list->inner={0:0}, malloc(sizeof(SLL))={14:0}] [L995] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={14:0}, list->inner={0:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=0, malloc(sizeof(SLL))={14:0}] [L995] EXPR, FCALL list->inner VAL [list={14:0}, list->inner={0:0}, list->inner={0:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=0, malloc(sizeof(SLL))={14:0}] [L995] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={14:0}, list->inner={0:0}, list->inner={0:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1, malloc(sizeof(SLL))={14:0}] [L995] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L995] COND FALSE !(0) VAL [list={14:0}, malloc(sizeof(SLL))={14:0}] [L997] SLL* end = list; VAL [end={14:0}, list={14:0}, malloc(sizeof(SLL))={14:0}] [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1011] end = ((void*)0) [L1012] end = list VAL [end={14:0}, list={14:0}, malloc(sizeof(SLL))={14:0}] [L1015] COND FALSE !(!(((void*)0) != end)) VAL [end={14:0}, list={14:0}, malloc(sizeof(SLL))={14:0}] [L1015] COND FALSE !(0) VAL [end={14:0}, list={14:0}, malloc(sizeof(SLL))={14:0}] [L1017] COND TRUE ((void*)0) != end [L1019] int len = 0; VAL [end={14:0}, len=0, list={14:0}, malloc(sizeof(SLL))={14:0}] [L1020] EXPR, FCALL end->inner VAL [end={14:0}, end->inner={0:0}, len=0, list={14:0}, malloc(sizeof(SLL))={14:0}] [L1020] SLL* inner = end->inner; [L1021] COND FALSE !(((void*)0) != inner) VAL [end={14:0}, inner={0:0}, len=0, list={14:0}, malloc(sizeof(SLL))={14:0}] [L1032] COND FALSE !(!(len <= 1)) VAL [end={14:0}, inner={0:0}, len=0, list={14:0}, malloc(sizeof(SLL))={14:0}] [L1032] COND FALSE !(0) VAL [end={14:0}, inner={0:0}, len=0, list={14:0}, malloc(sizeof(SLL))={14:0}] [L1034] EXPR, FCALL end->next VAL [end={14:0}, end->next={0:0}, inner={0:0}, len=0, list={14:0}, malloc(sizeof(SLL))={14:0}] [L1034] end = end->next [L1017] COND FALSE !(((void*)0) != end) VAL [end={0:0}, inner={0:0}, len=0, list={14:0}, malloc(sizeof(SLL))={14:0}] [L1038] COND TRUE ((void*)0) != list VAL [end={0:0}, inner={0:0}, len=0, list={14:0}, malloc(sizeof(SLL))={14:0}] [L1040] EXPR, FCALL list->inner VAL [end={0:0}, inner={0:0}, len=0, list={14:0}, list->inner={0:0}, malloc(sizeof(SLL))={14:0}] [L1040] end = list->inner [L1042] COND FALSE !(((void*)0) != end) VAL [end={0:0}, inner={0:0}, len=0, list={14:0}, malloc(sizeof(SLL))={14:0}] [L1050] EXPR, FCALL list->next VAL [end={0:0}, inner={0:0}, len=0, list={14:0}, list->next={0:0}, malloc(sizeof(SLL))={14:0}] [L1050] end = list->next [L1051] FCALL free(list) VAL [end={0:0}, inner={0:0}, len=0, list={14:0}, malloc(sizeof(SLL))={14:0}] [L1052] list = end VAL [end={0:0}, inner={0:0}, len=0, list={0:0}, malloc(sizeof(SLL))={14:0}] [L1038] COND FALSE !(((void*)0) != list) VAL [end={0:0}, inner={0:0}, len=0, list={0:0}, malloc(sizeof(SLL))={14:0}] [L1055] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 3 procedures, 127 locations, 3 error locations. UNSAFE Result, 1.0s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 357 SDtfs, 432 SDslu, 434 SDs, 0 SdLazy, 175 SolverSat, 7 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=132occurred 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, 118 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 159 NumberOfCodeBlocks, 159 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 97 ConstructedInterpolants, 0 QuantifiedInterpolants, 7895 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: 989]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 989). Cancelled while BasicCegarLoop was analyzing trace of length 111 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 20. - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 3 procedures, 127 locations, 3 error locations. TIMEOUT Result, 56.5s OverallTime, 14 OverallIterations, 3 TraceHistogramMax, 40.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1714 SDtfs, 5488 SDslu, 14386 SDs, 0 SdLazy, 9575 SolverSat, 548 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 808 GetRequests, 445 SyntacticMatches, 12 SemanticMatches, 351 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 4812 ImplicationChecksByTransitivity, 42.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=530occurred in iteration=13, 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, 13 MinimizatonAttempts, 835 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 13.4s InterpolantComputationTime, 1329 NumberOfCodeBlocks, 1329 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1310 ConstructedInterpolants, 112 QuantifiedInterpolants, 2983681 SizeOfPredicates, 71 NumberOfNonLiveVariables, 1240 ConjunctsInSsa, 184 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/dll-01_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-23_14-53-15-277.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-01_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-23_14-53-15-277.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-01_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-23_14-53-15-277.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-01_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-23_14-53-15-277.csv Completed graceful shutdown