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/memsafety/test-0521_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-47db877 [2018-01-23 14:28:27,688 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-23 14:28:27,690 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-23 14:28:27,705 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-23 14:28:27,705 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-23 14:28:27,706 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-23 14:28:27,706 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-23 14:28:27,708 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-23 14:28:27,710 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-23 14:28:27,711 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-23 14:28:27,711 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-23 14:28:27,712 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-23 14:28:27,713 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-23 14:28:27,714 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-23 14:28:27,715 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-23 14:28:27,717 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-23 14:28:27,720 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-23 14:28:27,722 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-23 14:28:27,723 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-23 14:28:27,724 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-23 14:28:27,726 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-23 14:28:27,726 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-23 14:28:27,727 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-23 14:28:27,728 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-23 14:28:27,728 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-23 14:28:27,730 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-23 14:28:27,730 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-23 14:28:27,731 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-23 14:28:27,731 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-23 14:28:27,731 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-23 14:28:27,732 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-23 14:28:27,732 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:28:27,742 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-23 14:28:27,742 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-23 14:28:27,743 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-23 14:28:27,743 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-23 14:28:27,743 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-23 14:28:27,743 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-23 14:28:27,744 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-23 14:28:27,744 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-23 14:28:27,744 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-23 14:28:27,745 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-23 14:28:27,745 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-23 14:28:27,745 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-23 14:28:27,745 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-23 14:28:27,745 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-23 14:28:27,746 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-23 14:28:27,746 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-23 14:28:27,746 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-23 14:28:27,746 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-23 14:28:27,746 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-23 14:28:27,747 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-23 14:28:27,747 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-23 14:28:27,747 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-23 14:28:27,747 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-23 14:28:27,747 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-23 14:28:27,748 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-23 14:28:27,748 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-23 14:28:27,748 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-23 14:28:27,748 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-23 14:28:27,748 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-23 14:28:27,749 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-23 14:28:27,749 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-23 14:28:27,749 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-23 14:28:27,749 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-23 14:28:27,749 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-23 14:28:27,750 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-23 14:28:27,750 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-23 14:28:27,751 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-23 14:28:27,786 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-23 14:28:27,799 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-23 14:28:27,803 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-23 14:28:27,804 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-23 14:28:27,805 INFO L276 PluginConnector]: CDTParser initialized [2018-01-23 14:28:27,805 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0521_true-valid-memsafety.i [2018-01-23 14:28:27,974 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-23 14:28:27,979 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-23 14:28:27,980 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-23 14:28:27,980 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-23 14:28:27,985 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-23 14:28:27,986 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:28:27" (1/1) ... [2018-01-23 14:28:27,988 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4366fcc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:28:27, skipping insertion in model container [2018-01-23 14:28:27,988 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:28:27" (1/1) ... [2018-01-23 14:28:28,003 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:28:28,045 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:28:28,165 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:28:28,190 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:28:28,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:28:28 WrapperNode [2018-01-23 14:28:28,202 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-23 14:28:28,202 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-23 14:28:28,202 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-23 14:28:28,203 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-23 14:28:28,219 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:28:28" (1/1) ... [2018-01-23 14:28:28,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:28:28" (1/1) ... [2018-01-23 14:28:28,234 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:28:28" (1/1) ... [2018-01-23 14:28:28,234 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:28:28" (1/1) ... [2018-01-23 14:28:28,246 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:28:28" (1/1) ... [2018-01-23 14:28:28,252 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:28:28" (1/1) ... [2018-01-23 14:28:28,255 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:28:28" (1/1) ... [2018-01-23 14:28:28,259 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-23 14:28:28,260 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-23 14:28:28,260 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-23 14:28:28,260 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-23 14:28:28,261 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:28:28" (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:28:28,322 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-23 14:28:28,323 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-23 14:28:28,323 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-23 14:28:28,323 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-23 14:28:28,323 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-23 14:28:28,323 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-23 14:28:28,324 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-23 14:28:28,324 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-23 14:28:28,324 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-23 14:28:28,324 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-23 14:28:28,324 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-23 14:28:28,324 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-23 14:28:28,324 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-23 14:28:28,325 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-23 14:28:28,325 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-23 14:28:28,325 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-23 14:28:28,956 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-23 14:28:28,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:28:28 BoogieIcfgContainer [2018-01-23 14:28:28,957 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-23 14:28:28,958 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-23 14:28:28,958 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-23 14:28:28,960 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-23 14:28:28,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.01 02:28:27" (1/3) ... [2018-01-23 14:28:28,962 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4180c68b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:28:28, skipping insertion in model container [2018-01-23 14:28:28,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:28:28" (2/3) ... [2018-01-23 14:28:28,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4180c68b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:28:28, skipping insertion in model container [2018-01-23 14:28:28,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:28:28" (3/3) ... [2018-01-23 14:28:28,965 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0521_true-valid-memsafety.i [2018-01-23 14:28:28,974 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-23 14:28:28,983 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-23 14:28:29,032 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:28:29,032 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:28:29,032 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:28:29,032 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:28:29,033 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:28:29,033 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:28:29,033 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:28:29,033 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-23 14:28:29,034 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:28:29,056 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states. [2018-01-23 14:28:29,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-23 14:28:29,063 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:28:29,064 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-23 14:28:29,064 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-23 14:28:29,069 INFO L82 PathProgramCache]: Analyzing trace with hash 373147, now seen corresponding path program 1 times [2018-01-23 14:28:29,072 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:28:29,072 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:28:29,124 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:29,124 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:28:29,124 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:29,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:28:29,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:28:29,178 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:28:29,185 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:28:29,193 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:28:29,193 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:28:29,193 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:28:29,193 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:28:29,193 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:28:29,193 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:28:29,193 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:28:29,193 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-23 14:28:29,193 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:28:29,198 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states. [2018-01-23 14:28:29,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-23 14:28:29,201 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:28:29,201 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:28:29,201 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:28:29,202 INFO L82 PathProgramCache]: Analyzing trace with hash -26575740, now seen corresponding path program 1 times [2018-01-23 14:28:29,202 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:28:29,202 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:28:29,203 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:29,203 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:28:29,203 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:29,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:28:29,223 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:28:29,256 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:28:29,259 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:28:29,274 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:28:29,275 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:28:29,361 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:28:29,362 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:28:29,364 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 2 states. [2018-01-23 14:28:29,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:28:29,398 INFO L93 Difference]: Finished difference Result 311 states and 385 transitions. [2018-01-23 14:28:29,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:28:29,400 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-01-23 14:28:29,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:28:29,415 INFO L225 Difference]: With dead ends: 311 [2018-01-23 14:28:29,415 INFO L226 Difference]: Without dead ends: 156 [2018-01-23 14:28:29,418 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:28:29,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-01-23 14:28:29,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-01-23 14:28:29,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-01-23 14:28:29,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 183 transitions. [2018-01-23 14:28:29,465 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 183 transitions. Word has length 24 [2018-01-23 14:28:29,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:28:29,465 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 183 transitions. [2018-01-23 14:28:29,466 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:28:29,466 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 183 transitions. [2018-01-23 14:28:29,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-23 14:28:29,468 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:28:29,468 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] [2018-01-23 14:28:29,468 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:28:29,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1949893135, now seen corresponding path program 1 times [2018-01-23 14:28:29,468 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:28:29,469 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:28:29,470 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:29,470 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:28:29,470 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:29,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:28:29,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:28:29,514 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:28:29,523 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:28:29,524 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-23 14:28:29,524 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-23 14:28:29,524 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-23 14:28:29,524 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-23 14:28:29,524 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-23 14:28:29,525 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-23 14:28:29,525 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-23 14:28:29,525 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-23 14:28:29,525 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-23 14:28:29,526 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-23 14:28:29,526 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-23 14:28:29,526 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-23 14:28:29,527 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-23 14:28:29,527 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-23 14:28:29,527 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-23 14:28:29,528 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-23 14:28:29,528 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-23 14:28:29,528 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-23 14:28:29,529 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-23 14:28:29,529 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-23 14:28:29,529 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-23 14:28:29,530 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-23 14:28:29,530 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-23 14:28:29,530 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-23 14:28:29,531 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-23 14:28:29,531 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-23 14:28:29,531 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-23 14:28:29,531 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-23 14:28:29,532 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-23 14:28:29,532 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-23 14:28:29,532 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-23 14:28:29,533 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-23 14:28:29,533 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-23 14:28:29,533 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-23 14:28:29,534 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-23 14:28:29,534 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-23 14:28:29,534 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-23 14:28:29,534 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-23 14:28:29,535 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-23 14:28:29,535 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-23 14:28:29,535 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-23 14:28:29,535 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-23 14:28:29,536 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-23 14:28:29,536 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-23 14:28:29,536 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-23 14:28:29,536 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-23 14:28:29,537 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-23 14:28:29,537 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-23 14:28:29,537 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-23 14:28:29,537 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-23 14:28:29,537 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-23 14:28:29,538 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-23 14:28:29,538 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-23 14:28:29,538 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-23 14:28:29,538 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-23 14:28:29,538 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-23 14:28:29,538 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-23 14:28:29,539 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-23 14:28:29,539 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:28:29,539 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-23 14:28:29,539 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-23 14:28:29,539 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-23 14:28:29,539 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-23 14:28:29,540 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:28:29,543 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~7.list [2018-01-23 14:28:29,544 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~7.list [2018-01-23 14:28:29,544 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~7.list [2018-01-23 14:28:29,544 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~7.list [2018-01-23 14:28:29,544 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~7.list [2018-01-23 14:28:29,545 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~7.list [2018-01-23 14:28:29,545 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~7.list [2018-01-23 14:28:29,545 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~7.list [2018-01-23 14:28:29,546 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~22.list [2018-01-23 14:28:29,546 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~22.list [2018-01-23 14:28:29,546 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~7.list [2018-01-23 14:28:29,547 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~7.list [2018-01-23 14:28:29,547 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~22.list [2018-01-23 14:28:29,547 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~7.list [2018-01-23 14:28:29,547 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~22.list [2018-01-23 14:28:29,548 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~7.list [2018-01-23 14:28:29,548 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~22.list [2018-01-23 14:28:29,548 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~22.list [2018-01-23 14:28:29,549 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~7.list [2018-01-23 14:28:29,549 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~22.list [2018-01-23 14:28:29,549 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~7.list [2018-01-23 14:28:29,555 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:28:29,555 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:28:29,555 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:28:29,555 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:28:29,555 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:28:29,555 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:28:29,555 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:28:29,555 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-23 14:28:29,555 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:28:29,557 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states. [2018-01-23 14:28:29,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-23 14:28:29,558 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:28:29,558 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:28:29,559 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-23 14:28:29,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1595501289, now seen corresponding path program 1 times [2018-01-23 14:28:29,559 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:28:29,559 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:28:29,560 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:29,560 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:28:29,560 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:29,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:28:29,568 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:28:29,580 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:28:29,580 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:28:29,580 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:28:29,580 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:28:29,581 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:28:29,581 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:28:29,581 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 2 states. [2018-01-23 14:28:29,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:28:29,594 INFO L93 Difference]: Finished difference Result 311 states and 385 transitions. [2018-01-23 14:28:29,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:28:29,594 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-01-23 14:28:29,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:28:29,596 INFO L225 Difference]: With dead ends: 311 [2018-01-23 14:28:29,596 INFO L226 Difference]: Without dead ends: 154 [2018-01-23 14:28:29,597 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:28:29,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-23 14:28:29,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-01-23 14:28:29,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-01-23 14:28:29,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 181 transitions. [2018-01-23 14:28:29,608 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 181 transitions. Word has length 22 [2018-01-23 14:28:29,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:28:29,609 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 181 transitions. [2018-01-23 14:28:29,609 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:28:29,609 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 181 transitions. [2018-01-23 14:28:29,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-23 14:28:29,610 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:28:29,611 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] [2018-01-23 14:28:29,611 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-23 14:28:29,611 INFO L82 PathProgramCache]: Analyzing trace with hash -359570538, now seen corresponding path program 1 times [2018-01-23 14:28:29,611 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:28:29,611 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:28:29,612 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:29,612 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:28:29,612 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:29,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:28:29,628 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:28:29,687 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:28:29,687 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:28:29,687 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:28:29,687 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:28:29,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:28:29,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:28:29,688 INFO L87 Difference]: Start difference. First operand 154 states and 181 transitions. Second operand 3 states. [2018-01-23 14:28:29,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:28:29,761 INFO L93 Difference]: Finished difference Result 243 states and 292 transitions. [2018-01-23 14:28:29,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:28:29,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-01-23 14:28:29,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:28:29,764 INFO L225 Difference]: With dead ends: 243 [2018-01-23 14:28:29,764 INFO L226 Difference]: Without dead ends: 240 [2018-01-23 14:28:29,765 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:28:29,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-01-23 14:28:29,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 228. [2018-01-23 14:28:29,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-01-23 14:28:29,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 276 transitions. [2018-01-23 14:28:29,783 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 276 transitions. Word has length 30 [2018-01-23 14:28:29,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:28:29,784 INFO L432 AbstractCegarLoop]: Abstraction has 228 states and 276 transitions. [2018-01-23 14:28:29,784 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:28:29,784 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 276 transitions. [2018-01-23 14:28:29,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-23 14:28:29,786 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:28:29,787 INFO L322 BasicCegarLoop]: trace histogram [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] [2018-01-23 14:28:29,787 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-23 14:28:29,787 INFO L82 PathProgramCache]: Analyzing trace with hash -123063933, now seen corresponding path program 1 times [2018-01-23 14:28:29,787 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:28:29,787 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:28:29,788 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:29,788 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:28:29,788 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:29,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:28:29,806 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:28:29,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:28:29,897 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:28:29,898 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-23 14:28:29,898 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-23 14:28:29,898 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-23 14:28:29,898 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:28:29,899 INFO L87 Difference]: Start difference. First operand 228 states and 276 transitions. Second operand 4 states. [2018-01-23 14:28:29,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:28:29,964 INFO L93 Difference]: Finished difference Result 489 states and 587 transitions. [2018-01-23 14:28:29,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-23 14:28:29,964 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-01-23 14:28:29,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:28:29,966 INFO L225 Difference]: With dead ends: 489 [2018-01-23 14:28:29,966 INFO L226 Difference]: Without dead ends: 313 [2018-01-23 14:28:29,968 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:28:29,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-01-23 14:28:29,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 236. [2018-01-23 14:28:29,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-01-23 14:28:29,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 285 transitions. [2018-01-23 14:28:29,982 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 285 transitions. Word has length 40 [2018-01-23 14:28:29,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:28:29,983 INFO L432 AbstractCegarLoop]: Abstraction has 236 states and 285 transitions. [2018-01-23 14:28:29,983 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-23 14:28:29,983 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 285 transitions. [2018-01-23 14:28:29,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-23 14:28:29,985 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:28:29,985 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] [2018-01-23 14:28:29,985 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-23 14:28:29,985 INFO L82 PathProgramCache]: Analyzing trace with hash 90705220, now seen corresponding path program 1 times [2018-01-23 14:28:29,986 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:28:29,986 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:28:29,987 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:29,987 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:28:29,987 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:30,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:28:30,006 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:28:30,081 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:28:30,081 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:28:30,081 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-23 14:28:30,081 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-23 14:28:30,081 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-23 14:28:30,082 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-23 14:28:30,082 INFO L87 Difference]: Start difference. First operand 236 states and 285 transitions. Second operand 6 states. [2018-01-23 14:28:30,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:28:30,311 INFO L93 Difference]: Finished difference Result 594 states and 707 transitions. [2018-01-23 14:28:30,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-23 14:28:30,312 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-01-23 14:28:30,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:28:30,314 INFO L225 Difference]: With dead ends: 594 [2018-01-23 14:28:30,315 INFO L226 Difference]: Without dead ends: 466 [2018-01-23 14:28:30,316 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-01-23 14:28:30,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2018-01-23 14:28:30,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 242. [2018-01-23 14:28:30,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-01-23 14:28:30,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 291 transitions. [2018-01-23 14:28:30,332 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 291 transitions. Word has length 46 [2018-01-23 14:28:30,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:28:30,332 INFO L432 AbstractCegarLoop]: Abstraction has 242 states and 291 transitions. [2018-01-23 14:28:30,333 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-23 14:28:30,333 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 291 transitions. [2018-01-23 14:28:30,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-23 14:28:30,334 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:28:30,335 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] [2018-01-23 14:28:30,335 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation]=== [2018-01-23 14:28:30,335 INFO L82 PathProgramCache]: Analyzing trace with hash 166146402, now seen corresponding path program 1 times [2018-01-23 14:28:30,335 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:28:30,336 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:28:30,336 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:30,337 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:28:30,337 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:30,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:28:30,346 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:28:30,377 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:28:30,378 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:28:30,378 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-23 14:28:30,378 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:28:30,379 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:28:30,379 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:28:30,379 INFO L87 Difference]: Start difference. First operand 242 states and 291 transitions. Second operand 3 states. [2018-01-23 14:28:30,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:28:30,394 INFO L93 Difference]: Finished difference Result 394 states and 475 transitions. [2018-01-23 14:28:30,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:28:30,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-01-23 14:28:30,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:28:30,396 INFO L225 Difference]: With dead ends: 394 [2018-01-23 14:28:30,397 INFO L226 Difference]: Without dead ends: 244 [2018-01-23 14:28:30,397 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:28:30,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-01-23 14:28:30,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2018-01-23 14:28:30,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-01-23 14:28:30,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 292 transitions. [2018-01-23 14:28:30,411 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 292 transitions. Word has length 47 [2018-01-23 14:28:30,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:28:30,412 INFO L432 AbstractCegarLoop]: Abstraction has 244 states and 292 transitions. [2018-01-23 14:28:30,412 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:28:30,412 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 292 transitions. [2018-01-23 14:28:30,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-23 14:28:30,413 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:28:30,414 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:28:30,414 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation]=== [2018-01-23 14:28:30,414 INFO L82 PathProgramCache]: Analyzing trace with hash -987135777, now seen corresponding path program 1 times [2018-01-23 14:28:30,414 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:28:30,414 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:28:30,415 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:30,416 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:28:30,416 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:30,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:28:30,424 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:28:30,494 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-23 14:28:30,495 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:28:30,495 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-23 14:28:30,495 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:28:30,495 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:28:30,495 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:28:30,496 INFO L87 Difference]: Start difference. First operand 244 states and 292 transitions. Second operand 5 states. [2018-01-23 14:28:30,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:28:30,582 INFO L93 Difference]: Finished difference Result 363 states and 429 transitions. [2018-01-23 14:28:30,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-23 14:28:30,583 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-01-23 14:28:30,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:28:30,584 INFO L225 Difference]: With dead ends: 363 [2018-01-23 14:28:30,584 INFO L226 Difference]: Without dead ends: 178 [2018-01-23 14:28:30,585 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:28:30,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-01-23 14:28:30,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 164. [2018-01-23 14:28:30,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-01-23 14:28:30,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 191 transitions. [2018-01-23 14:28:30,593 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 191 transitions. Word has length 49 [2018-01-23 14:28:30,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:28:30,593 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 191 transitions. [2018-01-23 14:28:30,594 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:28:30,594 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 191 transitions. [2018-01-23 14:28:30,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-23 14:28:30,595 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:28:30,595 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] [2018-01-23 14:28:30,595 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation]=== [2018-01-23 14:28:30,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1230398727, now seen corresponding path program 1 times [2018-01-23 14:28:30,595 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:28:30,596 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:28:30,597 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:30,597 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:28:30,597 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:30,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:28:30,616 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:28:30,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:28:30,724 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:28:30,724 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-23 14:28:30,725 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-23 14:28:30,725 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-23 14:28:30,725 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-23 14:28:30,725 INFO L87 Difference]: Start difference. First operand 164 states and 191 transitions. Second operand 7 states. [2018-01-23 14:28:31,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:28:31,048 INFO L93 Difference]: Finished difference Result 439 states and 510 transitions. [2018-01-23 14:28:31,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-23 14:28:31,049 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2018-01-23 14:28:31,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:28:31,051 INFO L225 Difference]: With dead ends: 439 [2018-01-23 14:28:31,051 INFO L226 Difference]: Without dead ends: 334 [2018-01-23 14:28:31,052 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-01-23 14:28:31,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-01-23 14:28:31,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 208. [2018-01-23 14:28:31,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-01-23 14:28:31,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 245 transitions. [2018-01-23 14:28:31,064 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 245 transitions. Word has length 51 [2018-01-23 14:28:31,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:28:31,065 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 245 transitions. [2018-01-23 14:28:31,065 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-23 14:28:31,065 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 245 transitions. [2018-01-23 14:28:31,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-01-23 14:28:31,066 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:28:31,067 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] [2018-01-23 14:28:31,067 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation]=== [2018-01-23 14:28:31,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1850402931, now seen corresponding path program 1 times [2018-01-23 14:28:31,067 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:28:31,067 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:28:31,068 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:31,069 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:28:31,069 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:31,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:28:31,097 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:28:31,190 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:28:31,190 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:28:31,191 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-23 14:28:31,191 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-23 14:28:31,191 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-23 14:28:31,191 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-23 14:28:31,191 INFO L87 Difference]: Start difference. First operand 208 states and 245 transitions. Second operand 8 states. [2018-01-23 14:28:31,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:28:31,674 INFO L93 Difference]: Finished difference Result 597 states and 689 transitions. [2018-01-23 14:28:31,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-23 14:28:31,674 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2018-01-23 14:28:31,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:28:31,676 INFO L225 Difference]: With dead ends: 597 [2018-01-23 14:28:31,677 INFO L226 Difference]: Without dead ends: 492 [2018-01-23 14:28:31,677 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2018-01-23 14:28:31,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2018-01-23 14:28:31,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 262. [2018-01-23 14:28:31,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-01-23 14:28:31,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 306 transitions. [2018-01-23 14:28:31,686 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 306 transitions. Word has length 65 [2018-01-23 14:28:31,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:28:31,686 INFO L432 AbstractCegarLoop]: Abstraction has 262 states and 306 transitions. [2018-01-23 14:28:31,686 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-23 14:28:31,686 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 306 transitions. [2018-01-23 14:28:31,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-01-23 14:28:31,687 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:28:31,687 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:31,687 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation]=== [2018-01-23 14:28:31,687 INFO L82 PathProgramCache]: Analyzing trace with hash 835647732, now seen corresponding path program 1 times [2018-01-23 14:28:31,687 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:28:31,687 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:28:31,688 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:31,688 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:28:31,688 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:31,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:28:31,700 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:28:31,812 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:28:31,813 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:28:31,813 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-23 14:28:31,813 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-23 14:28:31,813 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-23 14:28:31,813 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-23 14:28:31,814 INFO L87 Difference]: Start difference. First operand 262 states and 306 transitions. Second operand 7 states. [2018-01-23 14:28:32,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:28:32,047 INFO L93 Difference]: Finished difference Result 451 states and 522 transitions. [2018-01-23 14:28:32,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-23 14:28:32,047 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2018-01-23 14:28:32,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:28:32,049 INFO L225 Difference]: With dead ends: 451 [2018-01-23 14:28:32,049 INFO L226 Difference]: Without dead ends: 398 [2018-01-23 14:28:32,050 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-01-23 14:28:32,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-01-23 14:28:32,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 265. [2018-01-23 14:28:32,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-01-23 14:28:32,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 309 transitions. [2018-01-23 14:28:32,060 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 309 transitions. Word has length 66 [2018-01-23 14:28:32,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:28:32,061 INFO L432 AbstractCegarLoop]: Abstraction has 265 states and 309 transitions. [2018-01-23 14:28:32,061 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-23 14:28:32,061 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 309 transitions. [2018-01-23 14:28:32,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-23 14:28:32,062 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:28:32,062 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:32,062 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation]=== [2018-01-23 14:28:32,062 INFO L82 PathProgramCache]: Analyzing trace with hash -475061263, now seen corresponding path program 1 times [2018-01-23 14:28:32,063 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:28:32,063 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:28:32,063 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:32,064 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:28:32,064 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:32,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:28:32,081 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:28:32,271 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:28:32,271 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:28:32,271 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-23 14:28:32,271 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-23 14:28:32,272 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-23 14:28:32,272 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-01-23 14:28:32,272 INFO L87 Difference]: Start difference. First operand 265 states and 309 transitions. Second operand 12 states. [2018-01-23 14:28:32,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:28:32,833 INFO L93 Difference]: Finished difference Result 383 states and 446 transitions. [2018-01-23 14:28:32,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-23 14:28:32,833 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 68 [2018-01-23 14:28:32,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:28:32,835 INFO L225 Difference]: With dead ends: 383 [2018-01-23 14:28:32,835 INFO L226 Difference]: Without dead ends: 364 [2018-01-23 14:28:32,836 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=389, Unknown=0, NotChecked=0, Total=552 [2018-01-23 14:28:32,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-01-23 14:28:32,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 287. [2018-01-23 14:28:32,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-01-23 14:28:32,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 334 transitions. [2018-01-23 14:28:32,850 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 334 transitions. Word has length 68 [2018-01-23 14:28:32,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:28:32,850 INFO L432 AbstractCegarLoop]: Abstraction has 287 states and 334 transitions. [2018-01-23 14:28:32,850 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-23 14:28:32,851 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 334 transitions. [2018-01-23 14:28:32,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-01-23 14:28:32,852 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:28:32,852 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] [2018-01-23 14:28:32,852 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation]=== [2018-01-23 14:28:32,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1235268699, now seen corresponding path program 1 times [2018-01-23 14:28:32,852 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:28:32,852 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:28:32,853 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:32,854 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:28:32,854 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:32,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:28:32,869 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:28:33,165 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-23 14:28:33,165 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:28:33,166 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-23 14:28:33,166 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-23 14:28:33,166 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-23 14:28:33,166 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-01-23 14:28:33,166 INFO L87 Difference]: Start difference. First operand 287 states and 334 transitions. Second operand 14 states. [2018-01-23 14:28:34,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:28:34,095 INFO L93 Difference]: Finished difference Result 445 states and 523 transitions. [2018-01-23 14:28:34,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-23 14:28:34,133 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 74 [2018-01-23 14:28:34,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:28:34,134 INFO L225 Difference]: With dead ends: 445 [2018-01-23 14:28:34,135 INFO L226 Difference]: Without dead ends: 374 [2018-01-23 14:28:34,135 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=150, Invalid=720, Unknown=0, NotChecked=0, Total=870 [2018-01-23 14:28:34,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-01-23 14:28:34,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 302. [2018-01-23 14:28:34,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-01-23 14:28:34,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 351 transitions. [2018-01-23 14:28:34,150 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 351 transitions. Word has length 74 [2018-01-23 14:28:34,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:28:34,151 INFO L432 AbstractCegarLoop]: Abstraction has 302 states and 351 transitions. [2018-01-23 14:28:34,151 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-23 14:28:34,151 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 351 transitions. [2018-01-23 14:28:34,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-23 14:28:34,152 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:28:34,152 INFO L322 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2018-01-23 14:28:34,152 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation]=== [2018-01-23 14:28:34,153 INFO L82 PathProgramCache]: Analyzing trace with hash 906430885, now seen corresponding path program 1 times [2018-01-23 14:28:34,153 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:28:34,153 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:28:34,154 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:34,154 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:28:34,154 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:34,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:28:34,169 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:28:34,238 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-23 14:28:34,239 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:28:34,239 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:28:34,245 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:28:34,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:28:34,295 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:28:34,396 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-23 14:28:34,431 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:28:34,432 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-01-23 14:28:34,432 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:28:34,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:28:34,432 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:28:34,433 INFO L87 Difference]: Start difference. First operand 302 states and 351 transitions. Second operand 5 states. [2018-01-23 14:28:34,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:28:34,610 INFO L93 Difference]: Finished difference Result 1264 states and 1475 transitions. [2018-01-23 14:28:34,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-23 14:28:34,610 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2018-01-23 14:28:34,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:28:34,613 INFO L225 Difference]: With dead ends: 1264 [2018-01-23 14:28:34,613 INFO L226 Difference]: Without dead ends: 1031 [2018-01-23 14:28:34,614 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-01-23 14:28:34,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2018-01-23 14:28:34,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 318. [2018-01-23 14:28:34,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-01-23 14:28:34,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 370 transitions. [2018-01-23 14:28:34,633 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 370 transitions. Word has length 80 [2018-01-23 14:28:34,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:28:34,633 INFO L432 AbstractCegarLoop]: Abstraction has 318 states and 370 transitions. [2018-01-23 14:28:34,633 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:28:34,633 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 370 transitions. [2018-01-23 14:28:34,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-23 14:28:34,634 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:28:34,634 INFO L322 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2018-01-23 14:28:34,634 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation]=== [2018-01-23 14:28:34,634 INFO L82 PathProgramCache]: Analyzing trace with hash -531617362, now seen corresponding path program 1 times [2018-01-23 14:28:34,635 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:28:34,635 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:28:34,635 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:34,635 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:28:34,636 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:34,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:28:34,649 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:28:34,761 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-23 14:28:34,762 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:28:34,762 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-23 14:28:34,762 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-23 14:28:34,762 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-23 14:28:34,763 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-23 14:28:34,763 INFO L87 Difference]: Start difference. First operand 318 states and 370 transitions. Second operand 7 states. [2018-01-23 14:28:35,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:28:35,404 INFO L93 Difference]: Finished difference Result 616 states and 723 transitions. [2018-01-23 14:28:35,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-23 14:28:35,405 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 80 [2018-01-23 14:28:35,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:28:35,407 INFO L225 Difference]: With dead ends: 616 [2018-01-23 14:28:35,407 INFO L226 Difference]: Without dead ends: 409 [2018-01-23 14:28:35,408 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-01-23 14:28:35,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2018-01-23 14:28:35,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 321. [2018-01-23 14:28:35,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-01-23 14:28:35,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 373 transitions. [2018-01-23 14:28:35,427 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 373 transitions. Word has length 80 [2018-01-23 14:28:35,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:28:35,427 INFO L432 AbstractCegarLoop]: Abstraction has 321 states and 373 transitions. [2018-01-23 14:28:35,427 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-23 14:28:35,427 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 373 transitions. [2018-01-23 14:28:35,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-01-23 14:28:35,428 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:28:35,428 INFO L322 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:28:35,429 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0EnsuresViolation]=== [2018-01-23 14:28:35,429 INFO L82 PathProgramCache]: Analyzing trace with hash -797912403, now seen corresponding path program 1 times [2018-01-23 14:28:35,429 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:28:35,429 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:28:35,430 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:35,431 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:28:35,431 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:35,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:28:35,449 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:28:35,526 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-23 14:28:35,526 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:28:35,526 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:28:35,537 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:28:35,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:28:35,593 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:28:35,608 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-23 14:28:35,644 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:28:35,645 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-01-23 14:28:35,645 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:28:35,645 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:28:35,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:28:35,646 INFO L87 Difference]: Start difference. First operand 321 states and 373 transitions. Second operand 5 states. [2018-01-23 14:28:35,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:28:35,773 INFO L93 Difference]: Finished difference Result 448 states and 521 transitions. [2018-01-23 14:28:35,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-23 14:28:35,774 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2018-01-23 14:28:35,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:28:35,776 INFO L225 Difference]: With dead ends: 448 [2018-01-23 14:28:35,777 INFO L226 Difference]: Without dead ends: 429 [2018-01-23 14:28:35,777 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-01-23 14:28:35,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2018-01-23 14:28:35,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 351. [2018-01-23 14:28:35,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-01-23 14:28:35,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 411 transitions. [2018-01-23 14:28:35,797 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 411 transitions. Word has length 81 [2018-01-23 14:28:35,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:28:35,797 INFO L432 AbstractCegarLoop]: Abstraction has 351 states and 411 transitions. [2018-01-23 14:28:35,798 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:28:35,798 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 411 transitions. [2018-01-23 14:28:35,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-01-23 14:28:35,799 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:28:35,799 INFO L322 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:28:35,799 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0EnsuresViolation]=== [2018-01-23 14:28:35,800 INFO L82 PathProgramCache]: Analyzing trace with hash 56966772, now seen corresponding path program 1 times [2018-01-23 14:28:35,800 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:28:35,800 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:28:35,801 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:35,801 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:28:35,801 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:35,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:28:35,819 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:28:36,162 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:28:36,163 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:28:36,163 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:28:36,172 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:28:36,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:28:36,217 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:28:36,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-01-23 14:28:36,396 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:28:36,396 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:28:36,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:36,430 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 12 treesize of output 10 [2018-01-23 14:28:36,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-23 14:28:36,432 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:28:36,434 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:36,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-01-23 14:28:36,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-23 14:28:36,445 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-23 14:28:36,448 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:36,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-01-23 14:28:36,456 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:28:36,457 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-23 14:28:36,475 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:36,516 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:28:36,517 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:47, output treesize:9 [2018-01-23 14:28:36,645 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-23 14:28:36,669 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:28:36,670 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2018-01-23 14:28:36,670 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-23 14:28:36,670 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-23 14:28:36,670 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2018-01-23 14:28:36,671 INFO L87 Difference]: Start difference. First operand 351 states and 411 transitions. Second operand 23 states. [2018-01-23 14:28:38,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:28:38,314 INFO L93 Difference]: Finished difference Result 665 states and 778 transitions. [2018-01-23 14:28:38,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-01-23 14:28:38,315 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 82 [2018-01-23 14:28:38,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:28:38,317 INFO L225 Difference]: With dead ends: 665 [2018-01-23 14:28:38,317 INFO L226 Difference]: Without dead ends: 648 [2018-01-23 14:28:38,319 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 82 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1047 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=635, Invalid=3787, Unknown=0, NotChecked=0, Total=4422 [2018-01-23 14:28:38,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2018-01-23 14:28:38,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 408. [2018-01-23 14:28:38,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-01-23 14:28:38,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 483 transitions. [2018-01-23 14:28:38,342 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 483 transitions. Word has length 82 [2018-01-23 14:28:38,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:28:38,342 INFO L432 AbstractCegarLoop]: Abstraction has 408 states and 483 transitions. [2018-01-23 14:28:38,342 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-23 14:28:38,342 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 483 transitions. [2018-01-23 14:28:38,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-01-23 14:28:38,344 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:28:38,344 INFO L322 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:28:38,344 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0EnsuresViolation]=== [2018-01-23 14:28:38,344 INFO L82 PathProgramCache]: Analyzing trace with hash 165004636, now seen corresponding path program 1 times [2018-01-23 14:28:38,345 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:28:38,345 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:28:38,346 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:38,346 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:28:38,346 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:38,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:28:38,369 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:28:39,137 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-23 14:28:39,153 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:28:39,153 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:28:39,158 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:28:39,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:28:39,203 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:28:39,359 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:28:39,361 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:28:39,361 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:28:39,363 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:39,370 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:28:39,370 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:38 [2018-01-23 14:28:39,408 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 48 treesize of output 39 [2018-01-23 14:28:39,411 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:28:39,413 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 39 treesize of output 50 [2018-01-23 14:28:39,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:28:39,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:39,435 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:28:39,435 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:38 [2018-01-23 14:28:39,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 38 [2018-01-23 14:28:39,584 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 31 [2018-01-23 14:28:39,586 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-23 14:28:39,604 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-23 14:28:39,605 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 46 treesize of output 38 [2018-01-23 14:28:39,610 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-01-23 14:28:39,611 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:28:39,617 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:28:39,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-23 14:28:39,640 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:93, output treesize:86 [2018-01-23 14:28:40,074 WARN L1029 $PredicateComparison]: unable to prove that (or (and (not (= 0 c_main_~data~4.offset)) (exists ((main_~node~32.base Int) (v_arrayElimCell_10 Int)) (let ((.cse0 (store |c_old(#valid)| v_arrayElimCell_10 1))) (and (= (select .cse0 c_main_~data~4.base) 0) (= (select |c_old(#valid)| v_arrayElimCell_10) 0) (= |c_#valid| (store (store .cse0 c_main_~data~4.base 1) main_~node~32.base 0)) (not (= 0 main_~node~32.base)))))) (and (exists ((v_prenex_6 Int)) (let ((.cse1 (store |c_old(#valid)| v_prenex_6 1))) (and (not (= 0 v_prenex_6)) (= 0 (select .cse1 c_main_~data~4.base)) (= |c_#valid| (store (store .cse1 c_main_~data~4.base 1) v_prenex_6 0)) (= 0 (select |c_old(#valid)| v_prenex_6))))) (not (= c_main_~data~4.base 0)))) is different from true [2018-01-23 14:28:40,090 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_6 Int) (main_~data~4.base Int)) (let ((.cse0 (store |c_old(#valid)| v_prenex_6 1))) (and (= |c_#valid| (store (store (store .cse0 main_~data~4.base 1) v_prenex_6 0) main_~data~4.base 0)) (not (= 0 v_prenex_6)) (not (= main_~data~4.base 0)) (= 0 (select .cse0 main_~data~4.base)) (= 0 (select |c_old(#valid)| v_prenex_6))))) is different from true [2018-01-23 14:28:40,152 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked. [2018-01-23 14:28:40,172 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:28:40,172 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 29 [2018-01-23 14:28:40,173 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-23 14:28:40,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-23 14:28:40,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=696, Unknown=2, NotChecked=106, Total=870 [2018-01-23 14:28:40,173 INFO L87 Difference]: Start difference. First operand 408 states and 483 transitions. Second operand 30 states. [2018-01-23 14:28:40,925 WARN L146 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 105 DAG size of output 56 [2018-01-23 14:28:41,260 WARN L146 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 107 DAG size of output 69 [2018-01-23 14:28:41,908 WARN L146 SmtUtils]: Spent 304ms on a formula simplification. DAG size of input: 136 DAG size of output 81 [2018-01-23 14:28:42,158 WARN L146 SmtUtils]: Spent 163ms on a formula simplification. DAG size of input: 140 DAG size of output 77 [2018-01-23 14:28:42,611 WARN L146 SmtUtils]: Spent 395ms on a formula simplification. DAG size of input: 152 DAG size of output 96 [2018-01-23 14:28:43,080 WARN L146 SmtUtils]: Spent 353ms on a formula simplification. DAG size of input: 123 DAG size of output 118 [2018-01-23 14:28:43,373 WARN L146 SmtUtils]: Spent 193ms on a formula simplification. DAG size of input: 105 DAG size of output 102 [2018-01-23 14:28:43,756 WARN L146 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 88 DAG size of output 80 [2018-01-23 14:28:44,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:28:44,166 INFO L93 Difference]: Finished difference Result 583 states and 686 transitions. [2018-01-23 14:28:44,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-23 14:28:44,166 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 88 [2018-01-23 14:28:44,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:28:44,168 INFO L225 Difference]: With dead ends: 583 [2018-01-23 14:28:44,168 INFO L226 Difference]: Without dead ends: 580 [2018-01-23 14:28:44,168 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 77 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=268, Invalid=1622, Unknown=10, NotChecked=170, Total=2070 [2018-01-23 14:28:44,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2018-01-23 14:28:44,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 551. [2018-01-23 14:28:44,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2018-01-23 14:28:44,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 653 transitions. [2018-01-23 14:28:44,187 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 653 transitions. Word has length 88 [2018-01-23 14:28:44,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:28:44,187 INFO L432 AbstractCegarLoop]: Abstraction has 551 states and 653 transitions. [2018-01-23 14:28:44,187 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-23 14:28:44,187 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 653 transitions. [2018-01-23 14:28:44,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-01-23 14:28:44,188 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:28:44,188 INFO L322 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:28:44,188 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0EnsuresViolation]=== [2018-01-23 14:28:44,188 INFO L82 PathProgramCache]: Analyzing trace with hash -269517244, now seen corresponding path program 2 times [2018-01-23 14:28:44,189 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:28:44,189 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:28:44,189 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:44,189 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:28:44,189 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:44,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:28:44,206 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:28:44,931 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-23 14:28:44,932 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:28:44,932 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:28:44,939 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-23 14:28:44,959 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:28:44,970 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:28:44,973 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:28:44,977 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:28:44,982 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 13 treesize of output 10 [2018-01-23 14:28:44,984 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 10 treesize of output 9 [2018-01-23 14:28:44,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:28:44,986 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:44,991 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 13 treesize of output 10 [2018-01-23 14:28:44,992 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 10 treesize of output 9 [2018-01-23 14:28:44,993 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:28:44,994 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:44,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:44,997 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:27, output treesize:1 [2018-01-23 14:28:45,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-01-23 14:28:45,170 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 21 treesize of output 13 [2018-01-23 14:28:45,170 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:28:45,172 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:45,177 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:28:45,177 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:21 [2018-01-23 14:28:45,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2018-01-23 14:28:45,278 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:28:45,278 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:28:45,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:45,286 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:28:45,286 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:3 [2018-01-23 14:28:45,403 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-23 14:28:45,425 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:28:45,425 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17] total 35 [2018-01-23 14:28:45,425 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-01-23 14:28:45,425 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-01-23 14:28:45,426 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1101, Unknown=0, NotChecked=0, Total=1190 [2018-01-23 14:28:45,426 INFO L87 Difference]: Start difference. First operand 551 states and 653 transitions. Second operand 35 states. [2018-01-23 14:28:47,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:28:47,424 INFO L93 Difference]: Finished difference Result 969 states and 1134 transitions. [2018-01-23 14:28:47,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-01-23 14:28:47,424 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 94 [2018-01-23 14:28:47,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:28:47,427 INFO L225 Difference]: With dead ends: 969 [2018-01-23 14:28:47,427 INFO L226 Difference]: Without dead ends: 949 [2018-01-23 14:28:47,429 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 86 SyntacticMatches, 4 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 859 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=564, Invalid=3596, Unknown=0, NotChecked=0, Total=4160 [2018-01-23 14:28:47,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2018-01-23 14:28:47,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 751. [2018-01-23 14:28:47,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 751 states. [2018-01-23 14:28:47,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 893 transitions. [2018-01-23 14:28:47,474 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 893 transitions. Word has length 94 [2018-01-23 14:28:47,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:28:47,475 INFO L432 AbstractCegarLoop]: Abstraction has 751 states and 893 transitions. [2018-01-23 14:28:47,475 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-01-23 14:28:47,475 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 893 transitions. [2018-01-23 14:28:47,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-01-23 14:28:47,477 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:28:47,478 INFO L322 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:28:47,478 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0EnsuresViolation]=== [2018-01-23 14:28:47,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1378522654, now seen corresponding path program 1 times [2018-01-23 14:28:47,478 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:28:47,478 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:28:47,479 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:47,479 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:28:47,479 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:47,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:28:47,494 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:28:47,646 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-01-23 14:28:47,647 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:28:47,647 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-23 14:28:47,647 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-23 14:28:47,648 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-23 14:28:47,648 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-01-23 14:28:47,648 INFO L87 Difference]: Start difference. First operand 751 states and 893 transitions. Second operand 11 states. [2018-01-23 14:28:47,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:28:47,999 INFO L93 Difference]: Finished difference Result 1162 states and 1382 transitions. [2018-01-23 14:28:47,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-23 14:28:48,000 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2018-01-23 14:28:48,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:28:48,002 INFO L225 Difference]: With dead ends: 1162 [2018-01-23 14:28:48,002 INFO L226 Difference]: Without dead ends: 854 [2018-01-23 14:28:48,003 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=328, Unknown=0, NotChecked=0, Total=462 [2018-01-23 14:28:48,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2018-01-23 14:28:48,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 736. [2018-01-23 14:28:48,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2018-01-23 14:28:48,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 874 transitions. [2018-01-23 14:28:48,044 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 874 transitions. Word has length 96 [2018-01-23 14:28:48,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:28:48,044 INFO L432 AbstractCegarLoop]: Abstraction has 736 states and 874 transitions. [2018-01-23 14:28:48,044 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-23 14:28:48,045 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 874 transitions. [2018-01-23 14:28:48,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-01-23 14:28:48,047 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:28:48,047 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1] [2018-01-23 14:28:48,047 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0EnsuresViolation]=== [2018-01-23 14:28:48,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1551133751, now seen corresponding path program 3 times [2018-01-23 14:28:48,048 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:28:48,048 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:28:48,048 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:48,049 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:28:48,049 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:48,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:28:48,071 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:28:48,381 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-23 14:28:48,381 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:28:48,381 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:28:48,388 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-23 14:28:48,409 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-23 14:28:48,419 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-23 14:28:48,429 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-23 14:28:48,433 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:28:48,438 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:28:48,471 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 13 treesize of output 10 [2018-01-23 14:28:48,473 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 10 treesize of output 9 [2018-01-23 14:28:48,473 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:28:48,474 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:48,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:48,477 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-01-23 14:28:48,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-01-23 14:28:48,496 INFO L682 Elim1Store]: detected equality via solver [2018-01-23 14:28:48,497 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 9 [2018-01-23 14:28:48,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:28:48,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:48,501 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:28:48,501 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:3 [2018-01-23 14:28:48,537 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-23 14:28:48,558 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:28:48,558 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 18 [2018-01-23 14:28:48,559 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-23 14:28:48,559 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-23 14:28:48,559 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2018-01-23 14:28:48,559 INFO L87 Difference]: Start difference. First operand 736 states and 874 transitions. Second operand 18 states. [2018-01-23 14:28:49,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:28:49,023 INFO L93 Difference]: Finished difference Result 792 states and 933 transitions. [2018-01-23 14:28:49,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-23 14:28:49,023 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 98 [2018-01-23 14:28:49,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:28:49,025 INFO L225 Difference]: With dead ends: 792 [2018-01-23 14:28:49,025 INFO L226 Difference]: Without dead ends: 695 [2018-01-23 14:28:49,026 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 93 SyntacticMatches, 8 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=147, Invalid=723, Unknown=0, NotChecked=0, Total=870 [2018-01-23 14:28:49,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2018-01-23 14:28:49,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 679. [2018-01-23 14:28:49,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 679 states. [2018-01-23 14:28:49,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 805 transitions. [2018-01-23 14:28:49,069 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 805 transitions. Word has length 98 [2018-01-23 14:28:49,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:28:49,069 INFO L432 AbstractCegarLoop]: Abstraction has 679 states and 805 transitions. [2018-01-23 14:28:49,069 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-23 14:28:49,069 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 805 transitions. [2018-01-23 14:28:49,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-01-23 14:28:49,072 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:28:49,072 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:28:49,072 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr0EnsuresViolation]=== [2018-01-23 14:28:49,072 INFO L82 PathProgramCache]: Analyzing trace with hash 195168974, now seen corresponding path program 1 times [2018-01-23 14:28:49,072 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:28:49,073 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:28:49,073 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:49,074 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:28:49,074 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:49,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:28:49,096 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:28:49,631 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-01-23 14:28:49,632 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:28:49,632 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-01-23 14:28:49,632 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-23 14:28:49,632 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-23 14:28:49,632 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2018-01-23 14:28:49,632 INFO L87 Difference]: Start difference. First operand 679 states and 805 transitions. Second operand 20 states. [2018-01-23 14:28:51,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:28:51,087 INFO L93 Difference]: Finished difference Result 946 states and 1107 transitions. [2018-01-23 14:28:51,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-23 14:28:51,087 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 100 [2018-01-23 14:28:51,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:28:51,089 INFO L225 Difference]: With dead ends: 946 [2018-01-23 14:28:51,090 INFO L226 Difference]: Without dead ends: 825 [2018-01-23 14:28:51,090 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=358, Invalid=1448, Unknown=0, NotChecked=0, Total=1806 [2018-01-23 14:28:51,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2018-01-23 14:28:51,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 667. [2018-01-23 14:28:51,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 667 states. [2018-01-23 14:28:51,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 789 transitions. [2018-01-23 14:28:51,113 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 789 transitions. Word has length 100 [2018-01-23 14:28:51,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:28:51,114 INFO L432 AbstractCegarLoop]: Abstraction has 667 states and 789 transitions. [2018-01-23 14:28:51,114 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-23 14:28:51,114 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 789 transitions. [2018-01-23 14:28:51,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-01-23 14:28:51,116 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:28:51,116 INFO L322 BasicCegarLoop]: trace histogram [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, 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:28:51,116 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr0EnsuresViolation]=== [2018-01-23 14:28:51,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1892895472, now seen corresponding path program 1 times [2018-01-23 14:28:51,117 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:28:51,117 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:28:51,117 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:51,117 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:28:51,118 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:51,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:28:51,128 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:28:51,145 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-23 14:28:51,145 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:28:51,145 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-23 14:28:51,145 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:28:51,146 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:28:51,146 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:28:51,146 INFO L87 Difference]: Start difference. First operand 667 states and 789 transitions. Second operand 3 states. [2018-01-23 14:28:51,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:28:51,171 INFO L93 Difference]: Finished difference Result 970 states and 1152 transitions. [2018-01-23 14:28:51,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:28:51,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2018-01-23 14:28:51,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:28:51,173 INFO L225 Difference]: With dead ends: 970 [2018-01-23 14:28:51,173 INFO L226 Difference]: Without dead ends: 669 [2018-01-23 14:28:51,174 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:28:51,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2018-01-23 14:28:51,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 669. [2018-01-23 14:28:51,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 669 states. [2018-01-23 14:28:51,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 791 transitions. [2018-01-23 14:28:51,196 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 791 transitions. Word has length 103 [2018-01-23 14:28:51,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:28:51,196 INFO L432 AbstractCegarLoop]: Abstraction has 669 states and 791 transitions. [2018-01-23 14:28:51,196 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:28:51,196 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 791 transitions. [2018-01-23 14:28:51,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-01-23 14:28:51,197 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:28:51,197 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:51,197 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr0EnsuresViolation]=== [2018-01-23 14:28:51,198 INFO L82 PathProgramCache]: Analyzing trace with hash 753424778, now seen corresponding path program 4 times [2018-01-23 14:28:51,198 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:28:51,198 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:28:51,198 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:51,198 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:28:51,198 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:51,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:28:51,212 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:28:51,422 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-23 14:28:51,422 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:28:51,423 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:28:51,427 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-23 14:28:51,461 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:28:51,464 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:28:51,491 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:28:51,492 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:28:51,492 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:28:51,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:51,496 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:28:51,496 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2018-01-23 14:28:51,528 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 18 treesize of output 14 [2018-01-23 14:28:51,533 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 15 [2018-01-23 14:28:51,533 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-23 14:28:51,535 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:28:51,538 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:28:51,538 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:11 [2018-01-23 14:28:51,585 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-23 14:28:51,606 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:28:51,606 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 23 [2018-01-23 14:28:51,606 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-23 14:28:51,606 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-23 14:28:51,606 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2018-01-23 14:28:51,607 INFO L87 Difference]: Start difference. First operand 669 states and 791 transitions. Second operand 23 states. [2018-01-23 14:28:52,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:28:52,576 INFO L93 Difference]: Finished difference Result 1604 states and 1895 transitions. [2018-01-23 14:28:52,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-01-23 14:28:52,577 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 104 [2018-01-23 14:28:52,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:28:52,580 INFO L225 Difference]: With dead ends: 1604 [2018-01-23 14:28:52,580 INFO L226 Difference]: Without dead ends: 1200 [2018-01-23 14:28:52,581 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 97 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=638, Invalid=1912, Unknown=0, NotChecked=0, Total=2550 [2018-01-23 14:28:52,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2018-01-23 14:28:52,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 735. [2018-01-23 14:28:52,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 735 states. [2018-01-23 14:28:52,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 869 transitions. [2018-01-23 14:28:52,620 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 869 transitions. Word has length 104 [2018-01-23 14:28:52,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:28:52,621 INFO L432 AbstractCegarLoop]: Abstraction has 735 states and 869 transitions. [2018-01-23 14:28:52,621 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-23 14:28:52,621 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 869 transitions. [2018-01-23 14:28:52,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-01-23 14:28:52,623 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:28:52,623 INFO L322 BasicCegarLoop]: trace histogram [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, 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:28:52,623 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr0EnsuresViolation]=== [2018-01-23 14:28:52,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1123512557, now seen corresponding path program 1 times [2018-01-23 14:28:52,624 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:28:52,624 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:28:52,625 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:52,625 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:28:52,625 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:52,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:28:52,640 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:28:52,712 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-23 14:28:52,713 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:28:52,713 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-23 14:28:52,713 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:28:52,713 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:28:52,714 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:28:52,714 INFO L87 Difference]: Start difference. First operand 735 states and 869 transitions. Second operand 5 states. [2018-01-23 14:28:52,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:28:52,859 INFO L93 Difference]: Finished difference Result 1152 states and 1337 transitions. [2018-01-23 14:28:52,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-23 14:28:52,859 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2018-01-23 14:28:52,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:28:52,861 INFO L225 Difference]: With dead ends: 1152 [2018-01-23 14:28:52,861 INFO L226 Difference]: Without dead ends: 904 [2018-01-23 14:28:52,862 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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:28:52,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2018-01-23 14:28:52,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 712. [2018-01-23 14:28:52,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2018-01-23 14:28:52,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 830 transitions. [2018-01-23 14:28:52,894 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 830 transitions. Word has length 105 [2018-01-23 14:28:52,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:28:52,895 INFO L432 AbstractCegarLoop]: Abstraction has 712 states and 830 transitions. [2018-01-23 14:28:52,895 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:28:52,895 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 830 transitions. [2018-01-23 14:28:52,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-01-23 14:28:52,897 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:28:52,897 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:28:52,897 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr0EnsuresViolation]=== [2018-01-23 14:28:52,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1057438692, now seen corresponding path program 1 times [2018-01-23 14:28:52,898 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:28:52,898 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:28:52,899 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:52,899 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:28:52,899 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:52,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:28:52,918 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:28:53,420 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-01-23 14:28:53,420 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:28:53,420 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:28:53,425 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:28:53,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:28:53,478 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:28:53,481 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:28:53,481 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:28:53,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:53,485 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-23 14:28:53,495 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 13 treesize of output 10 [2018-01-23 14:28:53,497 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 10 treesize of output 9 [2018-01-23 14:28:53,497 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:28:53,509 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:53,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:53,513 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-01-23 14:28:53,516 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 23 treesize of output 18 [2018-01-23 14:28:53,518 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 18 treesize of output 7 [2018-01-23 14:28:53,519 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:28:53,520 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:53,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:53,522 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:13 [2018-01-23 14:28:53,540 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:28:53,541 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:28:53,541 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:28:53,541 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:28:53,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:53,545 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:15 [2018-01-23 14:28:53,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-01-23 14:28:53,593 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:28:53,593 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:28:53,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:53,617 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:28:53,617 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-01-23 14:28:53,653 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 33 treesize of output 29 [2018-01-23 14:28:53,657 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:28:53,658 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 26 treesize of output 35 [2018-01-23 14:28:53,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:28:53,673 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:53,680 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:28:53,680 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:23 [2018-01-23 14:28:53,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 45 [2018-01-23 14:28:53,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-01-23 14:28:53,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:28:53,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 23 [2018-01-23 14:28:53,990 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-23 14:28:54,012 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 12 treesize of output 4 [2018-01-23 14:28:54,012 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:28:54,031 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-23 14:28:54,031 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-23 14:28:54,032 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2018-01-23 14:28:54,033 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-23 14:28:54,043 INFO L267 ElimStorePlain]: Start of recursive call 2: 6 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-23 14:28:54,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-23 14:28:54,047 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:33, output treesize:14 [2018-01-23 14:28:54,219 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-01-23 14:28:54,239 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:28:54,240 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 40 [2018-01-23 14:28:54,240 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-01-23 14:28:54,240 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-01-23 14:28:54,241 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1448, Unknown=0, NotChecked=0, Total=1560 [2018-01-23 14:28:54,241 INFO L87 Difference]: Start difference. First operand 712 states and 830 transitions. Second operand 40 states. [2018-01-23 14:28:57,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:28:57,571 INFO L93 Difference]: Finished difference Result 830 states and 957 transitions. [2018-01-23 14:28:57,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-23 14:28:57,571 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 106 [2018-01-23 14:28:57,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:28:57,573 INFO L225 Difference]: With dead ends: 830 [2018-01-23 14:28:57,573 INFO L226 Difference]: Without dead ends: 727 [2018-01-23 14:28:57,575 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 92 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 837 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=758, Invalid=4072, Unknown=0, NotChecked=0, Total=4830 [2018-01-23 14:28:57,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2018-01-23 14:28:57,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 556. [2018-01-23 14:28:57,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2018-01-23 14:28:57,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 647 transitions. [2018-01-23 14:28:57,592 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 647 transitions. Word has length 106 [2018-01-23 14:28:57,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:28:57,592 INFO L432 AbstractCegarLoop]: Abstraction has 556 states and 647 transitions. [2018-01-23 14:28:57,592 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-01-23 14:28:57,592 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 647 transitions. [2018-01-23 14:28:57,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-01-23 14:28:57,594 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:28:57,594 INFO L322 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 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:28:57,594 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr0EnsuresViolation]=== [2018-01-23 14:28:57,594 INFO L82 PathProgramCache]: Analyzing trace with hash -656092741, now seen corresponding path program 1 times [2018-01-23 14:28:57,595 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:28:57,595 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:28:57,595 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:57,595 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:28:57,596 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:57,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:28:57,610 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:28:57,686 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-23 14:28:57,686 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:28:57,686 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-23 14:28:57,687 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:28:57,687 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:28:57,687 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:28:57,687 INFO L87 Difference]: Start difference. First operand 556 states and 647 transitions. Second operand 5 states. [2018-01-23 14:28:57,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:28:57,847 INFO L93 Difference]: Finished difference Result 627 states and 724 transitions. [2018-01-23 14:28:57,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-23 14:28:57,848 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2018-01-23 14:28:57,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:28:57,850 INFO L225 Difference]: With dead ends: 627 [2018-01-23 14:28:57,851 INFO L226 Difference]: Without dead ends: 624 [2018-01-23 14:28:57,851 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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:28:57,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2018-01-23 14:28:57,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 433. [2018-01-23 14:28:57,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-01-23 14:28:57,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 502 transitions. [2018-01-23 14:28:57,879 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 502 transitions. Word has length 110 [2018-01-23 14:28:57,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:28:57,879 INFO L432 AbstractCegarLoop]: Abstraction has 433 states and 502 transitions. [2018-01-23 14:28:57,879 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:28:57,879 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 502 transitions. [2018-01-23 14:28:57,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-01-23 14:28:57,880 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:28:57,881 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:57,881 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr0EnsuresViolation]=== [2018-01-23 14:28:57,881 INFO L82 PathProgramCache]: Analyzing trace with hash -831562976, now seen corresponding path program 1 times [2018-01-23 14:28:57,881 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:28:57,881 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:28:57,882 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:57,882 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:28:57,882 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:57,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:28:57,895 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:28:57,986 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-23 14:28:57,986 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:28:57,986 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:28:58,000 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:28:58,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:28:58,053 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:28:58,152 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-01-23 14:28:58,173 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-23 14:28:58,173 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2018-01-23 14:28:58,174 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-23 14:28:58,174 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-23 14:28:58,174 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-01-23 14:28:58,174 INFO L87 Difference]: Start difference. First operand 433 states and 502 transitions. Second operand 12 states. [2018-01-23 14:28:58,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:28:58,461 INFO L93 Difference]: Finished difference Result 828 states and 955 transitions. [2018-01-23 14:28:58,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-23 14:28:58,461 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 115 [2018-01-23 14:28:58,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:28:58,463 INFO L225 Difference]: With dead ends: 828 [2018-01-23 14:28:58,463 INFO L226 Difference]: Without dead ends: 660 [2018-01-23 14:28:58,464 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=207, Invalid=723, Unknown=0, NotChecked=0, Total=930 [2018-01-23 14:28:58,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2018-01-23 14:28:58,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 432. [2018-01-23 14:28:58,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2018-01-23 14:28:58,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 500 transitions. [2018-01-23 14:28:58,480 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 500 transitions. Word has length 115 [2018-01-23 14:28:58,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:28:58,480 INFO L432 AbstractCegarLoop]: Abstraction has 432 states and 500 transitions. [2018-01-23 14:28:58,480 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-23 14:28:58,480 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 500 transitions. [2018-01-23 14:28:58,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-01-23 14:28:58,481 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:28:58,481 INFO L322 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:58,481 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr0EnsuresViolation]=== [2018-01-23 14:28:58,481 INFO L82 PathProgramCache]: Analyzing trace with hash -641750243, now seen corresponding path program 1 times [2018-01-23 14:28:58,482 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:28:58,482 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:28:58,482 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:58,482 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:28:58,482 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:28:58,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:28:58,498 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:28:59,038 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:28:59,038 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:28:59,038 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:28:59,045 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:28:59,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:28:59,089 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:28:59,140 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 13 treesize of output 10 [2018-01-23 14:28:59,141 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 10 treesize of output 9 [2018-01-23 14:28:59,141 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:28:59,142 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:59,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:59,145 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-01-23 14:28:59,210 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:28:59,211 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:28:59,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:28:59,212 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:28:59,213 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:28:59,213 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-01-23 14:28:59,279 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-23 14:28:59,300 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:28:59,300 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 11] total 33 [2018-01-23 14:28:59,300 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-23 14:28:59,300 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-23 14:28:59,301 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=985, Unknown=0, NotChecked=0, Total=1056 [2018-01-23 14:28:59,301 INFO L87 Difference]: Start difference. First operand 432 states and 500 transitions. Second operand 33 states. [2018-01-23 14:29:02,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:29:02,466 INFO L93 Difference]: Finished difference Result 881 states and 1013 transitions. [2018-01-23 14:29:02,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-01-23 14:29:02,467 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 117 [2018-01-23 14:29:02,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:29:02,469 INFO L225 Difference]: With dead ends: 881 [2018-01-23 14:29:02,469 INFO L226 Difference]: Without dead ends: 580 [2018-01-23 14:29:02,471 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 111 SyntacticMatches, 2 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2291 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1221, Invalid=8091, Unknown=0, NotChecked=0, Total=9312 [2018-01-23 14:29:02,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2018-01-23 14:29:02,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 395. [2018-01-23 14:29:02,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-01-23 14:29:02,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 451 transitions. [2018-01-23 14:29:02,489 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 451 transitions. Word has length 117 [2018-01-23 14:29:02,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:29:02,489 INFO L432 AbstractCegarLoop]: Abstraction has 395 states and 451 transitions. [2018-01-23 14:29:02,489 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-23 14:29:02,489 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 451 transitions. [2018-01-23 14:29:02,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-01-23 14:29:02,490 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:29:02,490 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 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:29:02,490 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr0EnsuresViolation]=== [2018-01-23 14:29:02,491 INFO L82 PathProgramCache]: Analyzing trace with hash 112460699, now seen corresponding path program 1 times [2018-01-23 14:29:02,491 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:29:02,491 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:29:02,492 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:29:02,492 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:29:02,492 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:29:02,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:29:02,505 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:29:02,922 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-01-23 14:29:02,922 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:29:02,922 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:29:02,928 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:29:02,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:29:02,999 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:29:03,025 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 13 treesize of output 10 [2018-01-23 14:29:03,027 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 10 treesize of output 9 [2018-01-23 14:29:03,027 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:03,029 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:03,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:03,031 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:1 [2018-01-23 14:29:03,133 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:29:03,135 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:29:03,135 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:03,136 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:03,138 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:29:03,138 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:3 [2018-01-23 14:29:03,289 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-01-23 14:29:03,320 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:29:03,320 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10] total 24 [2018-01-23 14:29:03,321 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-23 14:29:03,321 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-23 14:29:03,321 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=501, Unknown=0, NotChecked=0, Total=552 [2018-01-23 14:29:03,321 INFO L87 Difference]: Start difference. First operand 395 states and 451 transitions. Second operand 24 states. [2018-01-23 14:29:04,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:29:04,217 INFO L93 Difference]: Finished difference Result 434 states and 492 transitions. [2018-01-23 14:29:04,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-23 14:29:04,218 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 119 [2018-01-23 14:29:04,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:29:04,219 INFO L225 Difference]: With dead ends: 434 [2018-01-23 14:29:04,219 INFO L226 Difference]: Without dead ends: 326 [2018-01-23 14:29:04,220 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 116 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=331, Invalid=1649, Unknown=0, NotChecked=0, Total=1980 [2018-01-23 14:29:04,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-01-23 14:29:04,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 276. [2018-01-23 14:29:04,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-01-23 14:29:04,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 310 transitions. [2018-01-23 14:29:04,234 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 310 transitions. Word has length 119 [2018-01-23 14:29:04,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:29:04,234 INFO L432 AbstractCegarLoop]: Abstraction has 276 states and 310 transitions. [2018-01-23 14:29:04,234 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-23 14:29:04,234 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 310 transitions. [2018-01-23 14:29:04,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-01-23 14:29:04,235 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:29:04,235 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:04,235 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr0EnsuresViolation]=== [2018-01-23 14:29:04,235 INFO L82 PathProgramCache]: Analyzing trace with hash 2062551003, now seen corresponding path program 1 times [2018-01-23 14:29:04,235 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:29:04,235 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:29:04,236 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:29:04,236 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:29:04,236 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:29:04,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:29:04,301 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:29:06,459 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-23 14:29:06,460 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:29:06,460 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:29:06,465 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:29:06,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:29:06,523 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:29:06,526 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:29:06,526 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:06,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:06,529 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-23 14:29:06,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-23 14:29:06,562 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:06,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:06,566 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-01-23 14:29:06,627 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:29:06,628 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:29:06,628 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:06,629 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:06,634 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:29:06,635 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2018-01-23 14:29:06,669 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 31 treesize of output 24 [2018-01-23 14:29:06,671 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:06,672 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 24 treesize of output 33 [2018-01-23 14:29:06,672 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:06,676 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:06,682 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:29:06,682 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:26 [2018-01-23 14:29:06,919 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:06,920 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:06,946 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:06,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 42 [2018-01-23 14:29:06,947 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:06,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:06,956 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:46 [2018-01-23 14:29:07,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-23 14:29:07,004 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:29:07,004 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:07,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:07,022 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 37 treesize of output 38 [2018-01-23 14:29:07,024 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:29:07,024 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:07,029 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:07,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:07,040 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:68, output treesize:56 [2018-01-23 14:29:07,093 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:07,093 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:07,095 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:07,095 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:07,096 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:07,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 63 [2018-01-23 14:29:07,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:07,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:07,117 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:70, output treesize:84 [2018-01-23 14:29:07,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-01-23 14:29:07,259 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:29:07,259 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:07,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:07,289 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:07,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 74 [2018-01-23 14:29:07,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 12 treesize of output 11 [2018-01-23 14:29:07,297 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:07,308 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:07,328 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:29:07,328 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:110, output treesize:95 [2018-01-23 14:29:07,398 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:07,399 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:07,400 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:07,401 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:07,401 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:07,402 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:07,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 61 [2018-01-23 14:29:07,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:07,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:07,423 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:100, output treesize:91 [2018-01-23 14:29:07,490 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:07,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 91 [2018-01-23 14:29:07,501 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:29:07,501 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:07,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:07,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-01-23 14:29:07,544 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:29:07,544 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:07,548 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:07,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:07,568 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:113, output treesize:67 [2018-01-23 14:29:07,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-01-23 14:29:07,873 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:29:07,874 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:07,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:07,895 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:07,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 66 [2018-01-23 14:29:07,903 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 23 treesize of output 15 [2018-01-23 14:29:07,903 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:07,913 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:07,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:07,928 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:93, output treesize:44 [2018-01-23 14:29:07,993 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:08,006 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 60 [2018-01-23 14:29:08,009 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 53 treesize of output 52 [2018-01-23 14:29:08,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:08,042 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 36 treesize of output 41 [2018-01-23 14:29:08,043 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-23 14:29:08,061 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:29:08,083 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:08,085 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 21 treesize of output 22 [2018-01-23 14:29:08,087 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 10 treesize of output 9 [2018-01-23 14:29:08,087 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:08,091 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:08,112 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:29:08,112 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:70, output treesize:101 [2018-01-23 14:29:08,199 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 72 treesize of output 66 [2018-01-23 14:29:08,201 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 11 treesize of output 7 [2018-01-23 14:29:08,201 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:08,214 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 7 treesize of output 1 [2018-01-23 14:29:08,214 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:08,223 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:08,250 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:08,251 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 56 treesize of output 54 [2018-01-23 14:29:08,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-23 14:29:08,253 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:08,264 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 11 treesize of output 7 [2018-01-23 14:29:08,264 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:08,272 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:08,294 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:29:08,294 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:129, output treesize:91 [2018-01-23 14:29:08,380 INFO L682 Elim1Store]: detected equality via solver [2018-01-23 14:29:08,381 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:08,385 INFO L682 Elim1Store]: detected equality via solver [2018-01-23 14:29:08,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 61 treesize of output 64 [2018-01-23 14:29:08,397 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 20 treesize of output 12 [2018-01-23 14:29:08,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:08,406 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:08,426 INFO L682 Elim1Store]: detected equality via solver [2018-01-23 14:29:08,427 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:08,427 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:08,428 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:08,429 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 61 [2018-01-23 14:29:08,440 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 42 [2018-01-23 14:29:08,441 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-23 14:29:08,456 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:08,473 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:29:08,473 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:109, output treesize:75 [2018-01-23 14:29:08,558 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:08,559 INFO L682 Elim1Store]: detected equality via solver [2018-01-23 14:29:08,561 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 41 treesize of output 43 [2018-01-23 14:29:08,563 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 25 treesize of output 15 [2018-01-23 14:29:08,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:08,568 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:08,585 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:08,591 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 1 case distinctions, treesize of input 55 treesize of output 57 [2018-01-23 14:29:08,593 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 18 treesize of output 11 [2018-01-23 14:29:08,593 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:08,599 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:08,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-01-23 14:29:08,613 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:97, output treesize:75 [2018-01-23 14:29:08,730 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 65 [2018-01-23 14:29:08,734 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 55 treesize of output 60 [2018-01-23 14:29:08,734 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:08,772 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 2 case distinctions, treesize of input 42 treesize of output 59 [2018-01-23 14:29:08,773 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-23 14:29:08,798 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:29:08,830 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 34 treesize of output 29 [2018-01-23 14:29:08,832 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 14 treesize of output 15 [2018-01-23 14:29:08,832 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:08,838 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:08,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-01-23 14:29:08,863 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:91, output treesize:100 [2018-01-23 14:29:09,338 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2018-01-23 14:29:09,345 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 20 treesize of output 13 [2018-01-23 14:29:09,346 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:09,368 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 17 [2018-01-23 14:29:09,369 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-23 14:29:09,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:29:09,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 55 [2018-01-23 14:29:09,391 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 42 treesize of output 29 [2018-01-23 14:29:09,391 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:09,407 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 42 treesize of output 35 [2018-01-23 14:29:09,408 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:09,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2018-01-23 14:29:09,425 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-01-23 14:29:09,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2018-01-23 14:29:09,445 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:09,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-01-23 14:29:09,446 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:09,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 37 [2018-01-23 14:29:09,468 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 3 xjuncts. [2018-01-23 14:29:09,485 INFO L267 ElimStorePlain]: Start of recursive call 5: 5 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-23 14:29:09,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:29:09,500 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:96, output treesize:9 [2018-01-23 14:29:09,766 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 20 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-23 14:29:09,786 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:29:09,786 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 36] total 71 [2018-01-23 14:29:09,786 INFO L409 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-01-23 14:29:09,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-01-23 14:29:09,788 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=4713, Unknown=0, NotChecked=0, Total=4970 [2018-01-23 14:29:09,788 INFO L87 Difference]: Start difference. First operand 276 states and 310 transitions. Second operand 71 states. [2018-01-23 14:29:11,920 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 103 DAG size of output 90 [2018-01-23 14:29:12,248 WARN L146 SmtUtils]: Spent 141ms on a formula simplification. DAG size of input: 124 DAG size of output 105 [2018-01-23 14:29:12,448 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 102 DAG size of output 94 [2018-01-23 14:29:12,705 WARN L146 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 124 DAG size of output 105 [2018-01-23 14:29:12,956 WARN L146 SmtUtils]: Spent 164ms on a formula simplification. DAG size of input: 135 DAG size of output 111 [2018-01-23 14:29:13,237 WARN L146 SmtUtils]: Spent 178ms on a formula simplification. DAG size of input: 142 DAG size of output 115 Received shutdown request... [2018-01-23 14:29:13,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-23 14:29:13,366 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-23 14:29:13,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.01 02:29:13 BoogieIcfgContainer [2018-01-23 14:29:13,368 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-23 14:29:13,369 INFO L168 Benchmark]: Toolchain (without parser) took 45394.28 ms. Allocated memory was 302.5 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 260.8 MB in the beginning and 555.3 MB in the end (delta: -294.5 MB). Peak memory consumption was 918.7 MB. Max. memory is 5.3 GB. [2018-01-23 14:29:13,371 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 302.5 MB. Free memory is still 266.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-23 14:29:13,371 INFO L168 Benchmark]: CACSL2BoogieTranslator took 221.98 ms. Allocated memory is still 302.5 MB. Free memory was 259.8 MB in the beginning and 247.8 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-23 14:29:13,371 INFO L168 Benchmark]: Boogie Preprocessor took 56.95 ms. Allocated memory is still 302.5 MB. Free memory was 247.8 MB in the beginning and 244.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:29:13,372 INFO L168 Benchmark]: RCFGBuilder took 696.94 ms. Allocated memory is still 302.5 MB. Free memory was 244.8 MB in the beginning and 201.7 MB in the end (delta: 43.1 MB). Peak memory consumption was 43.1 MB. Max. memory is 5.3 GB. [2018-01-23 14:29:13,372 INFO L168 Benchmark]: TraceAbstraction took 44410.83 ms. Allocated memory was 302.5 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 200.7 MB in the beginning and 555.3 MB in the end (delta: -354.6 MB). Peak memory consumption was 858.6 MB. Max. memory is 5.3 GB. [2018-01-23 14:29:13,374 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.15 ms. Allocated memory is still 302.5 MB. Free memory is still 266.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 221.98 ms. Allocated memory is still 302.5 MB. Free memory was 259.8 MB in the beginning and 247.8 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 56.95 ms. Allocated memory is still 302.5 MB. Free memory was 247.8 MB in the beginning and 244.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 696.94 ms. Allocated memory is still 302.5 MB. Free memory was 244.8 MB in the beginning and 201.7 MB in the end (delta: 43.1 MB). Peak memory consumption was 43.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 44410.83 ms. Allocated memory was 302.5 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 200.7 MB in the beginning and 555.3 MB in the end (delta: -354.6 MB). Peak memory consumption was 858.6 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 Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~7.list - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~7.list - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~7.list - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~7.list - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~7.list - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~7.list - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~7.list - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~7.list - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~22.list - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~22.list - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~7.list - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~7.list - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~22.list - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~7.list - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~22.list - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~7.list - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~22.list - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~22.list - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~7.list - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~22.list - GenericResult: Unfinished Backtranslation unknown boogie variable ~iter~7.list * 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, 159 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=159occurred 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: [L634] struct list *data = ((void *)0); VAL [data={0:0}] [L636] COND FALSE !(__VERIFIER_nondet_int()) [L652] struct iterator iter; [L654] struct list *list = data; [L655] EXPR iter.list = list VAL [data={0:0}, iter={0:0}, list={0:0}] [L655] COND FALSE !((iter.list = list)) VAL [data={0:0}, iter={0:0}, list={0:0}] [L658] struct node *node; VAL [data={0:0}, iter={0:0}, list={0:0}] [L660] COND TRUE !iter.list [L661] node = ((void *)0) VAL [data={0:0}, iter={0:0}, list={0:0}, node={0:0}] [L673] COND FALSE !((node)) VAL [data={0:0}, iter={0:0}, list={0:0}, node={0:0}] [L692] struct list *list = data; VAL [data={0:0}, iter={0:0}, list={0:0}, list={0:0}, node={0:0}] [L693] list && list->next VAL [data={0:0}, iter={0:0}, list={0:0}, list={0:0}, list && list->next=0, node={0:0}] [L693] COND FALSE !(list && list->next) [L726] data = list [L729] struct iterator iter; [L731] struct list *list = data; [L732] EXPR iter.list = list VAL [data={0:0}, iter={0:0}, iter={0:0}, list={0:0}, list={0:0}, list={0:0}, node={0:0}] [L732] COND FALSE !((iter.list = list)) VAL [data={0:0}, iter={0:0}, iter={0:0}, list={0:0}, list={0:0}, list={0:0}, node={0:0}] [L735] struct node *node; VAL [data={0:0}, iter={0:0}, iter={0:0}, list={0:0}, list={0:0}, list={0:0}, node={0:0}] [L737] COND TRUE !iter.list [L738] node = ((void *)0) VAL [data={0:0}, iter={0:0}, iter={0:0}, list={0:0}, list={0:0}, list={0:0}, node={0:0}, node={0:0}] [L750] COND FALSE !((node)) VAL [data={0:0}, iter={0:0}, iter={0:0}, list={0:0}, list={0:0}, list={0:0}, node={0:0}, node={0:0}] [L769] COND FALSE !(\read(*data)) VAL [data={0:0}, iter={0:0}, iter={0:0}, list={0:0}, list={0:0}, list={0:0}, node={0:0}, node={0:0}] [L781] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 3 procedures, 159 locations, 3 error locations. UNSAFE Result, 0.3s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 186 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=159occurred 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: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 56 NumberOfCodeBlocks, 56 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 23 ConstructedInterpolants, 0 QuantifiedInterpolants, 529 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 632]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 632). Cancelled while BasicCegarLoop was constructing difference of abstraction (276states) and interpolant automaton (currently 25 states, 71 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 132. - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 3 procedures, 159 locations, 3 error locations. TIMEOUT Result, 43.8s OverallTime, 29 OverallIterations, 3 TraceHistogramMax, 26.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5868 SDtfs, 24556 SDslu, 36120 SDs, 0 SdLazy, 16454 SolverSat, 1143 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 9.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2036 GetRequests, 1201 SyntacticMatches, 54 SemanticMatches, 780 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 9138 ImplicationChecksByTransitivity, 24.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=751occurred in iteration=17, 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.5s AutomataMinimizationTime, 28 MinimizatonAttempts, 4085 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 14.8s InterpolantComputationTime, 3634 NumberOfCodeBlocks, 3623 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 3593 ConstructedInterpolants, 70 QuantifiedInterpolants, 3577873 SizeOfPredicates, 196 NumberOfNonLiveVariables, 4004 ConjunctsInSsa, 432 ConjunctsInUnsatCore, 41 InterpolantComputations, 18 PerfectInterpolantSequences, 482/635 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/test-0521_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-23_14-29-13-384.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0521_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-23_14-29-13-384.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0521_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-23_14-29-13-384.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0521_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-23_14-29-13-384.csv Completed graceful shutdown