java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-20 22:31:16,128 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-20 22:31:16,145 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-20 22:31:16,160 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-20 22:31:16,160 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-20 22:31:16,161 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-20 22:31:16,161 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-20 22:31:16,162 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-20 22:31:16,165 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-20 22:31:16,165 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-20 22:31:16,166 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-20 22:31:16,167 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-20 22:31:16,167 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-20 22:31:16,168 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-20 22:31:16,169 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-20 22:31:16,171 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-20 22:31:16,173 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-20 22:31:16,175 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-20 22:31:16,177 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-20 22:31:16,178 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-20 22:31:16,180 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-20 22:31:16,181 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-20 22:31:16,181 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-20 22:31:16,181 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-20 22:31:16,182 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-20 22:31:16,183 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-20 22:31:16,184 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-20 22:31:16,184 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-20 22:31:16,185 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-20 22:31:16,185 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-20 22:31:16,185 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-20 22:31:16,186 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-20 22:31:16,195 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-20 22:31:16,196 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-20 22:31:16,197 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-20 22:31:16,197 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-20 22:31:16,197 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-20 22:31:16,197 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-20 22:31:16,197 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-20 22:31:16,198 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-20 22:31:16,198 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-20 22:31:16,198 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-20 22:31:16,199 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-20 22:31:16,199 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-20 22:31:16,199 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-20 22:31:16,199 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-20 22:31:16,199 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-20 22:31:16,200 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-20 22:31:16,200 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-20 22:31:16,200 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-20 22:31:16,200 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-20 22:31:16,200 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-20 22:31:16,201 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-20 22:31:16,201 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-20 22:31:16,201 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-20 22:31:16,201 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-20 22:31:16,201 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-20 22:31:16,202 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 22:31:16,202 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-20 22:31:16,202 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-20 22:31:16,202 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-20 22:31:16,202 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-20 22:31:16,203 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-20 22:31:16,203 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-20 22:31:16,203 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-20 22:31:16,203 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-20 22:31:16,203 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-20 22:31:16,204 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-20 22:31:16,204 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-20 22:31:16,240 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-20 22:31:16,249 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-20 22:31:16,251 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-20 22:31:16,252 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-20 22:31:16,253 INFO L276 PluginConnector]: CDTParser initialized [2018-01-20 22:31:16,253 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-01-20 22:31:16,418 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-20 22:31:16,423 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-20 22:31:16,423 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-20 22:31:16,423 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-20 22:31:16,428 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-20 22:31:16,429 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 10:31:16" (1/1) ... [2018-01-20 22:31:16,431 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41741684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:31:16, skipping insertion in model container [2018-01-20 22:31:16,432 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 10:31:16" (1/1) ... [2018-01-20 22:31:16,450 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 22:31:16,492 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 22:31:16,608 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 22:31:16,627 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 22:31:16,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:31:16 WrapperNode [2018-01-20 22:31:16,637 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-20 22:31:16,638 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-20 22:31:16,638 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-20 22:31:16,638 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-20 22:31:16,654 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:31:16" (1/1) ... [2018-01-20 22:31:16,655 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:31:16" (1/1) ... [2018-01-20 22:31:16,666 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:31:16" (1/1) ... [2018-01-20 22:31:16,666 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:31:16" (1/1) ... [2018-01-20 22:31:16,670 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:31:16" (1/1) ... [2018-01-20 22:31:16,675 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:31:16" (1/1) ... [2018-01-20 22:31:16,677 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:31:16" (1/1) ... [2018-01-20 22:31:16,679 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-20 22:31:16,679 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-20 22:31:16,680 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-20 22:31:16,680 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-20 22:31:16,681 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:31:16" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 22:31:16,726 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-20 22:31:16,726 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-20 22:31:16,726 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-20 22:31:16,726 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-20 22:31:16,726 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-20 22:31:16,727 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-20 22:31:16,727 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-20 22:31:16,727 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-20 22:31:16,727 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-20 22:31:16,727 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-20 22:31:16,727 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-20 22:31:16,727 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-20 22:31:16,727 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-20 22:31:16,727 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-20 22:31:16,728 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-20 22:31:16,728 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-20 22:31:16,728 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-20 22:31:17,073 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-20 22:31:17,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:31:17 BoogieIcfgContainer [2018-01-20 22:31:17,074 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-20 22:31:17,075 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-20 22:31:17,076 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-20 22:31:17,078 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-20 22:31:17,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.01 10:31:16" (1/3) ... [2018-01-20 22:31:17,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d67935e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:31:17, skipping insertion in model container [2018-01-20 22:31:17,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:31:16" (2/3) ... [2018-01-20 22:31:17,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d67935e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:31:17, skipping insertion in model container [2018-01-20 22:31:17,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:31:17" (3/3) ... [2018-01-20 22:31:17,082 INFO L105 eAbstractionObserver]: Analyzing ICFG sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-01-20 22:31:17,088 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-20 22:31:17,094 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-20 22:31:17,137 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:31:17,137 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:31:17,137 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:31:17,137 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:31:17,137 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:31:17,137 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:31:17,137 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:31:17,138 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-20 22:31:17,138 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:31:17,153 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2018-01-20 22:31:17,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-20 22:31:17,158 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:31:17,159 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-20 22:31:17,159 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-20 22:31:17,162 INFO L82 PathProgramCache]: Analyzing trace with hash 207316, now seen corresponding path program 1 times [2018-01-20 22:31:17,164 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:31:17,164 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:31:17,212 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:17,212 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:31:17,212 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:17,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:31:17,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:31:17,258 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 22:31:17,263 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:31:17,269 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:31:17,269 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:31:17,270 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:31:17,270 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:31:17,270 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:31:17,270 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:31:17,270 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:31:17,270 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-20 22:31:17,270 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:31:17,272 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2018-01-20 22:31:17,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-20 22:31:17,274 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:31:17,274 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] [2018-01-20 22:31:17,274 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:31:17,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1129106172, now seen corresponding path program 1 times [2018-01-20 22:31:17,275 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:31:17,275 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:31:17,276 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:17,276 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:31:17,276 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:17,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:31:17,311 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:31:17,443 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-20 22:31:17,445 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:31:17,445 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:31:17,447 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 22:31:17,459 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 22:31:17,459 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:31:17,461 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 2 states. [2018-01-20 22:31:17,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:31:17,489 INFO L93 Difference]: Finished difference Result 123 states and 160 transitions. [2018-01-20 22:31:17,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 22:31:17,491 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2018-01-20 22:31:17,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:31:17,499 INFO L225 Difference]: With dead ends: 123 [2018-01-20 22:31:17,499 INFO L226 Difference]: Without dead ends: 75 [2018-01-20 22:31:17,501 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-20 22:31:17,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-20 22:31:17,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-01-20 22:31:17,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-20 22:31:17,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2018-01-20 22:31:17,533 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 25 [2018-01-20 22:31:17,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:31:17,533 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2018-01-20 22:31:17,533 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 22:31:17,533 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2018-01-20 22:31:17,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-20 22:31:17,535 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:31:17,535 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:31:17,535 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:31:17,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1421482513, now seen corresponding path program 1 times [2018-01-20 22:31:17,535 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:31:17,535 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:31:17,536 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:17,537 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:31:17,537 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:17,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:31:17,568 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:31:17,685 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-20 22:31:17,685 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:31:17,685 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-20 22:31:17,687 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-20 22:31:17,687 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-20 22:31:17,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-20 22:31:17,688 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 8 states. [2018-01-20 22:31:17,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:31:17,991 INFO L93 Difference]: Finished difference Result 133 states and 146 transitions. [2018-01-20 22:31:17,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-20 22:31:17,992 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-01-20 22:31:17,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:31:17,997 INFO L225 Difference]: With dead ends: 133 [2018-01-20 22:31:17,997 INFO L226 Difference]: Without dead ends: 113 [2018-01-20 22:31:17,998 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-01-20 22:31:17,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-01-20 22:31:18,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 77. [2018-01-20 22:31:18,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-20 22:31:18,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2018-01-20 22:31:18,006 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 34 [2018-01-20 22:31:18,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:31:18,007 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2018-01-20 22:31:18,007 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-20 22:31:18,007 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2018-01-20 22:31:18,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-20 22:31:18,008 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:31:18,008 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-20 22:31:18,008 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:31:18,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1799396031, now seen corresponding path program 1 times [2018-01-20 22:31:18,008 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:31:18,008 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:31:18,009 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:18,010 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:31:18,010 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:18,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:31:18,030 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:31:18,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:31:18,162 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:31:18,162 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-20 22:31:18,179 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:31:18,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:31:18,216 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:31:18,255 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-20 22:31:18,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:18,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:18,264 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-20 22:31:18,323 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:18,324 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:18,326 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-20 22:31:18,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:18,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:18,329 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-01-20 22:31:18,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 22:31:18,388 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-20 22:31:18,389 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 12 [2018-01-20 22:31:18,389 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-20 22:31:18,389 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-20 22:31:18,389 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-01-20 22:31:18,390 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 12 states. [2018-01-20 22:31:18,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:31:18,806 INFO L93 Difference]: Finished difference Result 122 states and 132 transitions. [2018-01-20 22:31:18,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-20 22:31:18,806 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2018-01-20 22:31:18,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:31:18,808 INFO L225 Difference]: With dead ends: 122 [2018-01-20 22:31:18,808 INFO L226 Difference]: Without dead ends: 116 [2018-01-20 22:31:18,809 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=332, Unknown=0, NotChecked=0, Total=462 [2018-01-20 22:31:18,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-20 22:31:18,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 79. [2018-01-20 22:31:18,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-20 22:31:18,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2018-01-20 22:31:18,816 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 40 [2018-01-20 22:31:18,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:31:18,816 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2018-01-20 22:31:18,816 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-20 22:31:18,817 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2018-01-20 22:31:18,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-20 22:31:18,818 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:31:18,818 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] [2018-01-20 22:31:18,818 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:31:18,818 INFO L82 PathProgramCache]: Analyzing trace with hash -225210580, now seen corresponding path program 1 times [2018-01-20 22:31:18,818 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:31:18,819 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:31:18,820 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:18,820 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:31:18,820 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:18,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:31:18,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:31:18,881 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 22:31:18,893 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:31:18,903 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:31:18,904 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:31:18,919 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:31:18,919 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:31:18,919 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:31:18,919 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:31:18,920 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:31:18,920 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:31:18,920 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:31:18,920 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-20 22:31:18,920 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:31:18,922 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2018-01-20 22:31:18,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-20 22:31:18,922 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:31:18,923 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:31:18,923 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-20 22:31:18,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1643515977, now seen corresponding path program 1 times [2018-01-20 22:31:18,923 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:31:18,923 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:31:18,925 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:18,925 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:31:18,925 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:18,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:31:18,935 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:31:18,947 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-20 22:31:18,947 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:31:18,947 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:31:18,947 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 22:31:18,948 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 22:31:18,948 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:31:18,948 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 2 states. [2018-01-20 22:31:18,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:31:18,953 INFO L93 Difference]: Finished difference Result 123 states and 160 transitions. [2018-01-20 22:31:18,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 22:31:18,953 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2018-01-20 22:31:18,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:31:18,954 INFO L225 Difference]: With dead ends: 123 [2018-01-20 22:31:18,954 INFO L226 Difference]: Without dead ends: 73 [2018-01-20 22:31:18,954 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-20 22:31:18,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-20 22:31:18,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-01-20 22:31:18,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-20 22:31:18,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2018-01-20 22:31:18,960 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 23 [2018-01-20 22:31:18,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:31:18,960 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2018-01-20 22:31:18,960 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 22:31:18,960 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2018-01-20 22:31:18,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-20 22:31:18,961 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:31:18,962 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-20 22:31:18,962 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-20 22:31:18,962 INFO L82 PathProgramCache]: Analyzing trace with hash 144495766, now seen corresponding path program 1 times [2018-01-20 22:31:18,962 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:31:18,962 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:31:18,963 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:18,964 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:31:18,964 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:18,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:31:18,974 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:31:19,032 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-20 22:31:19,032 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:31:19,033 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-20 22:31:19,033 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-20 22:31:19,033 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-20 22:31:19,033 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-20 22:31:19,033 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 8 states. [2018-01-20 22:31:19,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:31:19,163 INFO L93 Difference]: Finished difference Result 129 states and 141 transitions. [2018-01-20 22:31:19,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-20 22:31:19,164 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-01-20 22:31:19,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:31:19,165 INFO L225 Difference]: With dead ends: 129 [2018-01-20 22:31:19,165 INFO L226 Difference]: Without dead ends: 111 [2018-01-20 22:31:19,166 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-01-20 22:31:19,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-20 22:31:19,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 75. [2018-01-20 22:31:19,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-20 22:31:19,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2018-01-20 22:31:19,173 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 32 [2018-01-20 22:31:19,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:31:19,173 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2018-01-20 22:31:19,173 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-20 22:31:19,174 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2018-01-20 22:31:19,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-20 22:31:19,175 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:31:19,175 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] [2018-01-20 22:31:19,175 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-20 22:31:19,175 INFO L82 PathProgramCache]: Analyzing trace with hash -293099324, now seen corresponding path program 1 times [2018-01-20 22:31:19,175 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:31:19,175 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:31:19,176 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:19,177 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:31:19,177 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:19,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:31:19,188 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:31:19,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:31:19,331 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:31:19,332 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-20 22:31:19,340 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:31:19,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:31:19,364 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:31:19,367 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-20 22:31:19,367 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:19,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:19,369 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-20 22:31:19,388 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:19,388 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:19,389 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-20 22:31:19,389 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:19,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:19,390 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-01-20 22:31:19,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 22:31:19,426 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-20 22:31:19,426 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 12 [2018-01-20 22:31:19,426 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-20 22:31:19,427 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-20 22:31:19,427 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-01-20 22:31:19,427 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 12 states. [2018-01-20 22:31:19,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:31:19,724 INFO L93 Difference]: Finished difference Result 118 states and 128 transitions. [2018-01-20 22:31:19,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-20 22:31:19,725 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2018-01-20 22:31:19,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:31:19,726 INFO L225 Difference]: With dead ends: 118 [2018-01-20 22:31:19,726 INFO L226 Difference]: Without dead ends: 114 [2018-01-20 22:31:19,726 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=332, Unknown=0, NotChecked=0, Total=462 [2018-01-20 22:31:19,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-01-20 22:31:19,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 77. [2018-01-20 22:31:19,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-20 22:31:19,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2018-01-20 22:31:19,732 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 38 [2018-01-20 22:31:19,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:31:19,733 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2018-01-20 22:31:19,733 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-20 22:31:19,733 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2018-01-20 22:31:19,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-20 22:31:19,734 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:31:19,734 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-20 22:31:19,734 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-20 22:31:19,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1425462385, now seen corresponding path program 1 times [2018-01-20 22:31:19,734 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:31:19,734 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:31:19,735 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:19,735 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:31:19,735 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:19,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:31:19,749 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:31:20,110 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 27 DAG size of output 19 [2018-01-20 22:31:20,289 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:31:20,289 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:31:20,289 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-20 22:31:20,295 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:31:20,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:31:20,315 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:31:20,543 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:31:20,572 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:31:20,572 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-01-20 22:31:20,572 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-20 22:31:20,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-20 22:31:20,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=247, Unknown=16, NotChecked=0, Total=306 [2018-01-20 22:31:20,573 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 18 states. [2018-01-20 22:31:22,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:31:22,011 INFO L93 Difference]: Finished difference Result 146 states and 158 transitions. [2018-01-20 22:31:22,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-20 22:31:22,011 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 46 [2018-01-20 22:31:22,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:31:22,013 INFO L225 Difference]: With dead ends: 146 [2018-01-20 22:31:22,013 INFO L226 Difference]: Without dead ends: 142 [2018-01-20 22:31:22,013 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=125, Invalid=615, Unknown=16, NotChecked=0, Total=756 [2018-01-20 22:31:22,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-01-20 22:31:22,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 113. [2018-01-20 22:31:22,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-20 22:31:22,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2018-01-20 22:31:22,024 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 46 [2018-01-20 22:31:22,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:31:22,024 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2018-01-20 22:31:22,024 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-20 22:31:22,024 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2018-01-20 22:31:22,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-20 22:31:22,026 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:31:22,026 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] [2018-01-20 22:31:22,026 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation]=== [2018-01-20 22:31:22,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1227318824, now seen corresponding path program 1 times [2018-01-20 22:31:22,026 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:31:22,026 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:31:22,028 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:22,028 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:31:22,029 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:22,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:31:22,041 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:31:22,150 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:31:22,150 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:31:22,150 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-20 22:31:22,158 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:31:22,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:31:22,186 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:31:22,200 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-20 22:31:22,205 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-20 22:31:22,206 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:22,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:22,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:22,217 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-01-20 22:31:22,226 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-20 22:31:22,242 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-20 22:31:22,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:22,246 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:22,248 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-20 22:31:22,248 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-01-20 22:31:22,262 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 22:31:22,297 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-20 22:31:22,297 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2018-01-20 22:31:22,297 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-20 22:31:22,298 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-20 22:31:22,298 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-20 22:31:22,298 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand 9 states. [2018-01-20 22:31:22,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:31:22,712 INFO L93 Difference]: Finished difference Result 205 states and 224 transitions. [2018-01-20 22:31:22,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-20 22:31:22,713 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2018-01-20 22:31:22,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:31:22,714 INFO L225 Difference]: With dead ends: 205 [2018-01-20 22:31:22,714 INFO L226 Difference]: Without dead ends: 162 [2018-01-20 22:31:22,715 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-01-20 22:31:22,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-01-20 22:31:22,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 136. [2018-01-20 22:31:22,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-01-20 22:31:22,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2018-01-20 22:31:22,727 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 48 [2018-01-20 22:31:22,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:31:22,728 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2018-01-20 22:31:22,728 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-20 22:31:22,728 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2018-01-20 22:31:22,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-20 22:31:22,729 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:31:22,729 INFO L322 BasicCegarLoop]: trace histogram [3, 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] [2018-01-20 22:31:22,729 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation]=== [2018-01-20 22:31:22,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1924529378, now seen corresponding path program 2 times [2018-01-20 22:31:22,730 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:31:22,730 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:31:22,731 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:22,731 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:31:22,731 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:22,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:31:22,744 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:31:22,946 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:31:22,946 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:31:22,946 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-20 22:31:22,956 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-20 22:31:22,978 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:31:22,994 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:31:22,997 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:31:23,002 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:31:23,179 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-20 22:31:23,184 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-20 22:31:23,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:23,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:23,188 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-20 22:31:23,188 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-01-20 22:31:23,245 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:31:23,266 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:31:23,267 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 21 [2018-01-20 22:31:23,267 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-20 22:31:23,267 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-20 22:31:23,267 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2018-01-20 22:31:23,267 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand 21 states. [2018-01-20 22:31:24,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:31:24,009 INFO L93 Difference]: Finished difference Result 216 states and 234 transitions. [2018-01-20 22:31:24,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-20 22:31:24,009 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 54 [2018-01-20 22:31:24,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:31:24,010 INFO L225 Difference]: With dead ends: 216 [2018-01-20 22:31:24,010 INFO L226 Difference]: Without dead ends: 147 [2018-01-20 22:31:24,012 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=198, Invalid=1062, Unknown=0, NotChecked=0, Total=1260 [2018-01-20 22:31:24,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-01-20 22:31:24,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 115. [2018-01-20 22:31:24,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-01-20 22:31:24,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2018-01-20 22:31:24,019 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 54 [2018-01-20 22:31:24,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:31:24,020 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2018-01-20 22:31:24,020 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-20 22:31:24,020 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2018-01-20 22:31:24,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-01-20 22:31:24,021 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:31:24,021 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] [2018-01-20 22:31:24,021 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation]=== [2018-01-20 22:31:24,021 INFO L82 PathProgramCache]: Analyzing trace with hash 828488614, now seen corresponding path program 1 times [2018-01-20 22:31:24,021 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:31:24,022 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:31:24,022 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:24,023 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:31:24,023 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:24,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:31:24,037 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:31:24,349 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:31:24,349 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:31:24,349 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-20 22:31:24,355 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:31:24,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:31:24,381 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:31:24,399 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-20 22:31:24,399 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:24,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:24,406 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-20 22:31:24,453 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 12 treesize of output 11 [2018-01-20 22:31:24,454 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:24,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:24,458 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-20 22:31:24,568 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:24,569 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:24,571 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:24,572 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-01-20 22:31:24,573 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:24,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:24,578 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-01-20 22:31:24,615 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-20 22:31:24,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-20 22:31:24,617 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:24,619 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:24,625 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-20 22:31:24,625 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-01-20 22:31:24,708 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:24,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2018-01-20 22:31:24,717 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-20 22:31:24,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:24,723 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:24,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:24,727 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-01-20 22:31:24,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 49 [2018-01-20 22:31:24,757 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:24,758 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 30 treesize of output 18 [2018-01-20 22:31:24,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:24,763 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:24,767 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-20 22:31:24,767 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:28 [2018-01-20 22:31:24,822 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 35 treesize of output 23 [2018-01-20 22:31:24,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-01-20 22:31:24,829 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:24,834 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-20 22:31:24,834 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:24,836 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:24,839 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-20 22:31:24,839 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:35, output treesize:4 [2018-01-20 22:31:24,880 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 22:31:24,901 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:31:24,902 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 29 [2018-01-20 22:31:24,902 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-20 22:31:24,902 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-20 22:31:24,902 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=718, Unknown=0, NotChecked=0, Total=812 [2018-01-20 22:31:24,903 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand 29 states. [2018-01-20 22:31:25,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:31:25,926 INFO L93 Difference]: Finished difference Result 239 states and 259 transitions. [2018-01-20 22:31:25,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-20 22:31:25,926 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 57 [2018-01-20 22:31:25,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:31:25,927 INFO L225 Difference]: With dead ends: 239 [2018-01-20 22:31:25,928 INFO L226 Difference]: Without dead ends: 225 [2018-01-20 22:31:25,928 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=410, Invalid=1846, Unknown=0, NotChecked=0, Total=2256 [2018-01-20 22:31:25,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-01-20 22:31:25,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 184. [2018-01-20 22:31:25,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-01-20 22:31:25,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 201 transitions. [2018-01-20 22:31:25,940 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 201 transitions. Word has length 57 [2018-01-20 22:31:25,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:31:25,941 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 201 transitions. [2018-01-20 22:31:25,941 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-20 22:31:25,941 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 201 transitions. [2018-01-20 22:31:25,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-20 22:31:25,942 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:31:25,942 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] [2018-01-20 22:31:25,942 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation]=== [2018-01-20 22:31:25,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1108780887, now seen corresponding path program 1 times [2018-01-20 22:31:25,943 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:31:25,943 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:31:25,944 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:25,944 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:31:25,945 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:25,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:31:25,967 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:31:26,586 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 22:31:26,586 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:31:26,586 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-20 22:31:26,593 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:31:26,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:31:26,625 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:31:26,635 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-20 22:31:26,636 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:26,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:26,638 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-20 22:31:26,689 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 12 treesize of output 11 [2018-01-20 22:31:26,690 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:26,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:26,693 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-20 22:31:26,754 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:26,755 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:26,757 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:26,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2018-01-20 22:31:26,758 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:26,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:26,768 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:30 [2018-01-20 22:31:26,803 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-20 22:31:26,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-20 22:31:26,806 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:26,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:26,861 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-20 22:31:26,861 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:42 [2018-01-20 22:31:26,972 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:26,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2018-01-20 22:31:26,977 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-20 22:31:26,977 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:26,983 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:26,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:26,990 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:54, output treesize:50 [2018-01-20 22:31:27,026 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:27,029 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 59 treesize of output 58 [2018-01-20 22:31:27,031 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:27,032 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 22 treesize of output 14 [2018-01-20 22:31:27,032 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:27,039 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:27,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:27,047 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:69, output treesize:50 [2018-01-20 22:31:27,050 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:27,051 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:27,052 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:27,052 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:27,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 33 [2018-01-20 22:31:27,053 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:27,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:27,061 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:47 [2018-01-20 22:31:27,101 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:27,104 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:27,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 55 [2018-01-20 22:31:27,108 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 20 treesize of output 12 [2018-01-20 22:31:27,109 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:27,117 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:27,125 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-20 22:31:27,125 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:52 [2018-01-20 22:31:27,241 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:27,242 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:27,248 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 79 [2018-01-20 22:31:27,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-20 22:31:27,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:27,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:27,268 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-20 22:31:27,268 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:79, output treesize:67 [2018-01-20 22:31:27,316 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 84 [2018-01-20 22:31:27,320 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:27,321 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 38 treesize of output 22 [2018-01-20 22:31:27,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:27,329 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:27,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-20 22:31:27,336 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:115, output treesize:72 [2018-01-20 22:31:27,513 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-20 22:31:27,515 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-20 22:31:27,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:27,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:27,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-20 22:31:27,525 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:90, output treesize:75 [2018-01-20 22:31:27,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 48 [2018-01-20 22:31:27,613 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 26 treesize of output 15 [2018-01-20 22:31:27,613 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:27,621 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 19 treesize of output 13 [2018-01-20 22:31:27,621 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:27,625 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-20 22:31:27,625 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:27,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:27,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:27,630 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:79, output treesize:4 [2018-01-20 22:31:27,703 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:31:27,739 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:31:27,739 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 25] total 43 [2018-01-20 22:31:27,739 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-01-20 22:31:27,740 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-01-20 22:31:27,740 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1673, Unknown=0, NotChecked=0, Total=1806 [2018-01-20 22:31:27,740 INFO L87 Difference]: Start difference. First operand 184 states and 201 transitions. Second operand 43 states. [2018-01-20 22:31:31,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:31:31,320 INFO L93 Difference]: Finished difference Result 343 states and 375 transitions. [2018-01-20 22:31:31,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-01-20 22:31:31,320 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 63 [2018-01-20 22:31:31,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:31:31,321 INFO L225 Difference]: With dead ends: 343 [2018-01-20 22:31:31,322 INFO L226 Difference]: Without dead ends: 298 [2018-01-20 22:31:31,323 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1543 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1074, Invalid=6066, Unknown=0, NotChecked=0, Total=7140 [2018-01-20 22:31:31,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-01-20 22:31:31,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 206. [2018-01-20 22:31:31,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-01-20 22:31:31,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 224 transitions. [2018-01-20 22:31:31,334 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 224 transitions. Word has length 63 [2018-01-20 22:31:31,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:31:31,335 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 224 transitions. [2018-01-20 22:31:31,335 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-01-20 22:31:31,335 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 224 transitions. [2018-01-20 22:31:31,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-20 22:31:31,336 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:31:31,336 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:31:31,336 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation]=== [2018-01-20 22:31:31,336 INFO L82 PathProgramCache]: Analyzing trace with hash 2107407403, now seen corresponding path program 1 times [2018-01-20 22:31:31,336 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:31:31,336 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:31:31,337 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:31,338 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:31:31,338 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:31,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:31:31,347 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:31:31,526 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-20 22:31:31,527 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:31:31,527 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 22:31:31,527 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 22:31:31,527 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 22:31:31,527 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:31:31,528 INFO L87 Difference]: Start difference. First operand 206 states and 224 transitions. Second operand 5 states. [2018-01-20 22:31:31,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:31:31,598 INFO L93 Difference]: Finished difference Result 230 states and 249 transitions. [2018-01-20 22:31:31,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 22:31:31,598 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-01-20 22:31:31,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:31:31,599 INFO L225 Difference]: With dead ends: 230 [2018-01-20 22:31:31,599 INFO L226 Difference]: Without dead ends: 172 [2018-01-20 22:31:31,600 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-20 22:31:31,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-01-20 22:31:31,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 157. [2018-01-20 22:31:31,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-01-20 22:31:31,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 167 transitions. [2018-01-20 22:31:31,607 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 167 transitions. Word has length 68 [2018-01-20 22:31:31,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:31:31,607 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 167 transitions. [2018-01-20 22:31:31,607 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 22:31:31,607 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 167 transitions. [2018-01-20 22:31:31,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-20 22:31:31,608 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:31:31,608 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-01-20 22:31:31,608 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation]=== [2018-01-20 22:31:31,608 INFO L82 PathProgramCache]: Analyzing trace with hash 850899281, now seen corresponding path program 2 times [2018-01-20 22:31:31,608 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:31:31,608 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:31:31,609 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:31,610 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:31:31,610 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:31,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:31:31,626 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:31:32,106 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 22:31:32,106 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:31:32,107 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-20 22:31:32,113 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-20 22:31:32,128 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:31:32,141 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:31:32,145 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:31:32,150 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:31:32,152 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-20 22:31:32,153 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:32,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:32,160 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-20 22:31:32,198 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 12 treesize of output 11 [2018-01-20 22:31:32,199 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:32,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:32,210 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-01-20 22:31:32,295 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:32,296 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:32,297 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:32,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2018-01-20 22:31:32,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:32,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:32,307 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:33 [2018-01-20 22:31:32,335 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-20 22:31:32,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-20 22:31:32,337 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:32,338 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:32,348 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-20 22:31:32,349 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:45 [2018-01-20 22:31:32,431 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:32,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2018-01-20 22:31:32,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-20 22:31:32,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:32,451 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:32,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:32,460 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:53 [2018-01-20 22:31:32,492 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:32,496 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 59 treesize of output 58 [2018-01-20 22:31:32,499 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:32,500 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 22 treesize of output 14 [2018-01-20 22:31:32,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:32,508 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:32,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:32,517 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2018-01-20 22:31:32,520 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:32,521 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:32,522 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:32,527 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:32,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 33 [2018-01-20 22:31:32,528 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:32,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:32,538 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:58, output treesize:50 [2018-01-20 22:31:32,578 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:32,579 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:32,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 55 [2018-01-20 22:31:32,586 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 20 treesize of output 12 [2018-01-20 22:31:32,586 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:32,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:32,602 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-20 22:31:32,603 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:55 [2018-01-20 22:31:32,699 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:32,702 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:32,707 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 79 [2018-01-20 22:31:32,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-20 22:31:32,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:32,719 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:32,729 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-20 22:31:32,729 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:82, output treesize:70 [2018-01-20 22:31:32,776 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 84 [2018-01-20 22:31:32,779 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:32,780 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 38 treesize of output 22 [2018-01-20 22:31:32,780 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:32,787 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:32,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-20 22:31:32,796 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:118, output treesize:75 [2018-01-20 22:31:33,004 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-20 22:31:33,006 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-20 22:31:33,006 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:33,008 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:33,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-20 22:31:33,019 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:93, output treesize:78 [2018-01-20 22:31:33,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 48 [2018-01-20 22:31:33,146 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 21 treesize of output 15 [2018-01-20 22:31:33,147 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:33,153 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-20 22:31:33,154 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:33,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-01-20 22:31:33,159 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:33,162 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:33,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:33,165 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:79, output treesize:4 [2018-01-20 22:31:33,194 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 22:31:33,215 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:31:33,216 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 24] total 40 [2018-01-20 22:31:33,217 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-01-20 22:31:33,217 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-01-20 22:31:33,218 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1390, Unknown=0, NotChecked=0, Total=1560 [2018-01-20 22:31:33,218 INFO L87 Difference]: Start difference. First operand 157 states and 167 transitions. Second operand 40 states. [2018-01-20 22:31:36,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:31:36,547 INFO L93 Difference]: Finished difference Result 349 states and 374 transitions. [2018-01-20 22:31:36,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-01-20 22:31:36,547 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 68 [2018-01-20 22:31:36,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:31:36,550 INFO L225 Difference]: With dead ends: 349 [2018-01-20 22:31:36,550 INFO L226 Difference]: Without dead ends: 335 [2018-01-20 22:31:36,552 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1611 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1128, Invalid=5352, Unknown=0, NotChecked=0, Total=6480 [2018-01-20 22:31:36,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-01-20 22:31:36,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 187. [2018-01-20 22:31:36,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-01-20 22:31:36,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 200 transitions. [2018-01-20 22:31:36,565 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 200 transitions. Word has length 68 [2018-01-20 22:31:36,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:31:36,566 INFO L432 AbstractCegarLoop]: Abstraction has 187 states and 200 transitions. [2018-01-20 22:31:36,566 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-01-20 22:31:36,566 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 200 transitions. [2018-01-20 22:31:36,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-01-20 22:31:36,567 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:31:36,567 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-01-20 22:31:36,567 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation]=== [2018-01-20 22:31:36,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1581316287, now seen corresponding path program 3 times [2018-01-20 22:31:36,568 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:31:36,568 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:31:36,569 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:36,569 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:31:36,569 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:36,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:31:36,588 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:31:38,331 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:31:38,331 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:31:38,331 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-20 22:31:38,336 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-20 22:31:38,348 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 22:31:38,358 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 22:31:38,405 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 22:31:38,408 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:31:38,412 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:31:38,633 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-20 22:31:38,635 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-20 22:31:38,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:38,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:38,650 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-20 22:31:38,651 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:70 [2018-01-20 22:31:38,820 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:38,823 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 58 treesize of output 59 [2018-01-20 22:31:38,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-20 22:31:38,826 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:38,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:38,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:38,850 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:82, output treesize:78 [2018-01-20 22:31:38,920 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:38,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 80 [2018-01-20 22:31:38,927 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:38,928 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 30 treesize of output 18 [2018-01-20 22:31:38,929 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:38,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:38,951 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-20 22:31:38,952 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:106, output treesize:75 [2018-01-20 22:31:39,425 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:39,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2018-01-20 22:31:39,429 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-20 22:31:39,430 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:39,442 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 39 treesize of output 28 [2018-01-20 22:31:39,442 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:39,450 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:39,460 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-20 22:31:39,460 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:79, output treesize:49 [2018-01-20 22:31:40,042 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 22:31:40,074 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:31:40,074 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2018-01-20 22:31:40,074 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-01-20 22:31:40,075 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-01-20 22:31:40,075 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1471, Unknown=57, NotChecked=0, Total=1640 [2018-01-20 22:31:40,075 INFO L87 Difference]: Start difference. First operand 187 states and 200 transitions. Second operand 41 states. [2018-01-20 22:31:43,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:31:43,462 INFO L93 Difference]: Finished difference Result 261 states and 279 transitions. [2018-01-20 22:31:43,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-20 22:31:43,463 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 71 [2018-01-20 22:31:43,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:31:43,464 INFO L225 Difference]: With dead ends: 261 [2018-01-20 22:31:43,464 INFO L226 Difference]: Without dead ends: 257 [2018-01-20 22:31:43,465 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 56 SyntacticMatches, 11 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 755 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=308, Invalid=3540, Unknown=58, NotChecked=0, Total=3906 [2018-01-20 22:31:43,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-01-20 22:31:43,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 230. [2018-01-20 22:31:43,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-01-20 22:31:43,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 246 transitions. [2018-01-20 22:31:43,477 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 246 transitions. Word has length 71 [2018-01-20 22:31:43,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:31:43,478 INFO L432 AbstractCegarLoop]: Abstraction has 230 states and 246 transitions. [2018-01-20 22:31:43,478 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-01-20 22:31:43,478 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 246 transitions. [2018-01-20 22:31:43,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-01-20 22:31:43,479 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:31:43,479 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:31:43,479 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation]=== [2018-01-20 22:31:43,480 INFO L82 PathProgramCache]: Analyzing trace with hash -228632408, now seen corresponding path program 1 times [2018-01-20 22:31:43,480 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:31:43,480 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:31:43,481 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:43,481 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:31:43,481 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:43,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:31:43,494 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:31:43,926 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-20 22:31:43,926 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:31:43,926 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-20 22:31:43,932 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:31:43,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:31:43,965 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:31:43,998 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 39 treesize of output 33 [2018-01-20 22:31:44,000 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 33 treesize of output 24 [2018-01-20 22:31:44,000 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:44,003 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:44,007 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-20 22:31:44,007 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:31 [2018-01-20 22:31:44,090 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 35 treesize of output 30 [2018-01-20 22:31:44,093 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 23 treesize of output 14 [2018-01-20 22:31:44,093 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:44,103 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 14 treesize of output 12 [2018-01-20 22:31:44,103 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:44,110 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:44,112 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-20 22:31:44,112 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:35, output treesize:8 [2018-01-20 22:31:44,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, 1 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-20 22:31:44,142 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:44,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:44,144 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:10 [2018-01-20 22:31:44,154 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-20 22:31:44,175 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:31:44,175 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 22 [2018-01-20 22:31:44,175 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-20 22:31:44,175 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-20 22:31:44,176 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2018-01-20 22:31:44,176 INFO L87 Difference]: Start difference. First operand 230 states and 246 transitions. Second operand 22 states. [2018-01-20 22:31:45,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:31:45,314 INFO L93 Difference]: Finished difference Result 376 states and 409 transitions. [2018-01-20 22:31:45,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-01-20 22:31:45,315 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 73 [2018-01-20 22:31:45,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:31:45,316 INFO L225 Difference]: With dead ends: 376 [2018-01-20 22:31:45,316 INFO L226 Difference]: Without dead ends: 334 [2018-01-20 22:31:45,317 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 63 SyntacticMatches, 7 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=339, Invalid=1917, Unknown=0, NotChecked=0, Total=2256 [2018-01-20 22:31:45,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-01-20 22:31:45,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 274. [2018-01-20 22:31:45,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-01-20 22:31:45,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 297 transitions. [2018-01-20 22:31:45,329 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 297 transitions. Word has length 73 [2018-01-20 22:31:45,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:31:45,329 INFO L432 AbstractCegarLoop]: Abstraction has 274 states and 297 transitions. [2018-01-20 22:31:45,329 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-20 22:31:45,329 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 297 transitions. [2018-01-20 22:31:45,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-01-20 22:31:45,330 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:31:45,330 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-01-20 22:31:45,330 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation]=== [2018-01-20 22:31:45,330 INFO L82 PathProgramCache]: Analyzing trace with hash 619410687, now seen corresponding path program 4 times [2018-01-20 22:31:45,330 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:31:45,330 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:31:45,331 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:45,331 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:31:45,331 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:45,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:31:45,342 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:31:45,488 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-01-20 22:31:45,489 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:31:45,489 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-20 22:31:45,495 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-20 22:31:45,520 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:31:45,522 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:31:45,567 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-20 22:31:45,569 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-20 22:31:45,569 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:45,572 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:45,581 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-20 22:31:45,583 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-20 22:31:45,583 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:45,586 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:45,604 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-20 22:31:45,606 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-20 22:31:45,606 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:45,608 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:45,615 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-20 22:31:45,617 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-20 22:31:45,617 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:45,618 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:45,622 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-20 22:31:45,622 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:47, output treesize:9 [2018-01-20 22:31:45,660 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-01-20 22:31:45,693 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:31:45,693 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-01-20 22:31:45,694 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-20 22:31:45,694 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-20 22:31:45,694 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-20 22:31:45,694 INFO L87 Difference]: Start difference. First operand 274 states and 297 transitions. Second operand 9 states. [2018-01-20 22:31:46,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:31:46,025 INFO L93 Difference]: Finished difference Result 316 states and 340 transitions. [2018-01-20 22:31:46,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-20 22:31:46,026 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 74 [2018-01-20 22:31:46,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:31:46,027 INFO L225 Difference]: With dead ends: 316 [2018-01-20 22:31:46,027 INFO L226 Difference]: Without dead ends: 312 [2018-01-20 22:31:46,027 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 68 SyntacticMatches, 7 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2018-01-20 22:31:46,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-01-20 22:31:46,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 227. [2018-01-20 22:31:46,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-01-20 22:31:46,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 245 transitions. [2018-01-20 22:31:46,036 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 245 transitions. Word has length 74 [2018-01-20 22:31:46,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:31:46,037 INFO L432 AbstractCegarLoop]: Abstraction has 227 states and 245 transitions. [2018-01-20 22:31:46,037 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-20 22:31:46,037 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 245 transitions. [2018-01-20 22:31:46,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-01-20 22:31:46,038 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:31:46,038 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:31:46,038 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0EnsuresViolation]=== [2018-01-20 22:31:46,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1476207124, now seen corresponding path program 1 times [2018-01-20 22:31:46,038 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:31:46,038 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:31:46,039 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:46,039 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:31:46,039 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:46,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:31:46,051 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:31:46,525 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-20 22:31:46,525 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:31:46,525 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-20 22:31:46,531 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:31:46,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:31:46,558 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:31:46,560 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-20 22:31:46,560 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:46,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:46,561 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-20 22:31:46,591 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 12 treesize of output 11 [2018-01-20 22:31:46,591 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:46,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:46,593 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-20 22:31:46,649 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:46,650 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:46,651 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:46,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2018-01-20 22:31:46,652 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:46,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:46,662 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:30 [2018-01-20 22:31:46,691 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-20 22:31:46,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-20 22:31:46,692 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:46,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:46,702 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-20 22:31:46,702 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:42 [2018-01-20 22:31:46,786 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:46,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2018-01-20 22:31:46,791 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-20 22:31:46,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:46,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:46,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:46,805 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:54, output treesize:50 [2018-01-20 22:31:46,838 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:46,841 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 59 treesize of output 58 [2018-01-20 22:31:46,843 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:46,844 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 22 treesize of output 14 [2018-01-20 22:31:46,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:46,851 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:46,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:46,859 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:69, output treesize:50 [2018-01-20 22:31:46,863 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:46,864 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:46,864 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:46,866 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:46,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 67 [2018-01-20 22:31:46,867 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:46,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:46,880 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:61, output treesize:75 [2018-01-20 22:31:46,922 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:46,924 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:46,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2018-01-20 22:31:46,927 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 27 treesize of output 17 [2018-01-20 22:31:46,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:46,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:46,949 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-20 22:31:46,950 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:86, output treesize:80 [2018-01-20 22:31:47,070 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:47,071 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:47,076 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 97 [2018-01-20 22:31:47,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-20 22:31:47,078 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:47,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:47,103 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-20 22:31:47,104 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:111, output treesize:99 [2018-01-20 22:31:47,156 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:47,161 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 98 [2018-01-20 22:31:47,164 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:47,165 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 22 treesize of output 14 [2018-01-20 22:31:47,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:47,178 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:47,191 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-20 22:31:47,191 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:99 [2018-01-20 22:31:47,195 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:47,196 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:47,196 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:47,197 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:47,198 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:47,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 85 [2018-01-20 22:31:47,199 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:47,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:31:47,213 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:104, output treesize:95 [2018-01-20 22:31:47,257 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:47,259 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:47,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 94 [2018-01-20 22:31:47,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2018-01-20 22:31:47,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:47,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:47,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:31:47,288 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:106, output treesize:104 [2018-01-20 22:31:47,412 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:47,412 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:47,413 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:47,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 134 [2018-01-20 22:31:47,425 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 8 treesize of output 7 [2018-01-20 22:31:47,425 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:47,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:47,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-20 22:31:47,456 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:159, output treesize:155 [2018-01-20 22:31:47,511 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 207 treesize of output 131 [2018-01-20 22:31:47,514 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:47,515 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 46 treesize of output 26 [2018-01-20 22:31:47,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:47,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:47,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-20 22:31:47,540 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:207, output treesize:152 [2018-01-20 22:31:47,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 81 [2018-01-20 22:31:47,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-01-20 22:31:47,627 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:47,641 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 21 treesize of output 15 [2018-01-20 22:31:47,641 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:47,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-01-20 22:31:47,647 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:47,652 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-20 22:31:47,652 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:47,654 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:47,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:47,657 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:159, output treesize:4 [2018-01-20 22:31:47,735 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 22:31:47,755 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:31:47,755 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 26] total 46 [2018-01-20 22:31:47,756 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-01-20 22:31:47,756 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-01-20 22:31:47,756 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1909, Unknown=0, NotChecked=0, Total=2070 [2018-01-20 22:31:47,756 INFO L87 Difference]: Start difference. First operand 227 states and 245 transitions. Second operand 46 states. [2018-01-20 22:31:52,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:31:52,657 INFO L93 Difference]: Finished difference Result 369 states and 397 transitions. [2018-01-20 22:31:52,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-01-20 22:31:52,658 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 74 [2018-01-20 22:31:52,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:31:52,659 INFO L225 Difference]: With dead ends: 369 [2018-01-20 22:31:52,659 INFO L226 Difference]: Without dead ends: 355 [2018-01-20 22:31:52,661 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2340 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1456, Invalid=8644, Unknown=0, NotChecked=0, Total=10100 [2018-01-20 22:31:52,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-01-20 22:31:52,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 180. [2018-01-20 22:31:52,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-01-20 22:31:52,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 194 transitions. [2018-01-20 22:31:52,675 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 194 transitions. Word has length 74 [2018-01-20 22:31:52,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:31:52,675 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 194 transitions. [2018-01-20 22:31:52,675 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-01-20 22:31:52,675 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 194 transitions. [2018-01-20 22:31:52,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-01-20 22:31:52,677 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:31:52,677 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-01-20 22:31:52,677 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0EnsuresViolation]=== [2018-01-20 22:31:52,678 INFO L82 PathProgramCache]: Analyzing trace with hash -742251772, now seen corresponding path program 2 times [2018-01-20 22:31:52,678 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:31:52,678 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:31:52,679 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:52,679 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:31:52,679 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:52,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:31:52,702 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:31:53,812 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:31:53,812 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:31:53,812 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:31:53,817 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-20 22:31:53,829 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:31:53,843 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:31:53,848 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:31:53,851 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:31:53,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-20 22:31:53,853 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:53,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:53,854 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-20 22:31:53,897 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 12 treesize of output 11 [2018-01-20 22:31:53,898 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:53,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:53,901 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-01-20 22:31:53,984 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:53,985 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:53,986 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:53,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2018-01-20 22:31:53,987 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:53,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:53,998 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:36 [2018-01-20 22:31:54,056 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-20 22:31:54,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-20 22:31:54,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:54,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:54,074 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-20 22:31:54,076 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-20 22:31:54,076 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:54,078 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:54,088 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-20 22:31:54,088 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:55, output treesize:52 [2018-01-20 22:31:54,130 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-20 22:31:54,132 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 7 [2018-01-20 22:31:54,132 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:54,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:54,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:54,142 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:60, output treesize:49 [2018-01-20 22:31:54,221 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:54,223 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:54,223 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 44 treesize of output 54 [2018-01-20 22:31:54,225 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 18 treesize of output 16 [2018-01-20 22:31:54,225 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:54,233 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:54,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:54,241 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:60, output treesize:48 [2018-01-20 22:31:54,285 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:54,285 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:54,287 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:54,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 73 [2018-01-20 22:31:54,290 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:54,299 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 45 treesize of output 43 [2018-01-20 22:31:54,300 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-20 22:31:54,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:54,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:54,322 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:48 [2018-01-20 22:31:54,326 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:54,327 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:54,327 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:54,328 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:54,329 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:54,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 33 [2018-01-20 22:31:54,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:54,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:54,341 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:45 [2018-01-20 22:31:54,384 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:54,384 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:54,385 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:54,386 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:54,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 62 [2018-01-20 22:31:54,399 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 50 [2018-01-20 22:31:54,400 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-20 22:31:54,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:54,422 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-20 22:31:54,423 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:50 [2018-01-20 22:31:54,535 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:54,535 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:54,536 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:54,538 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:54,540 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 87 [2018-01-20 22:31:54,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-20 22:31:54,542 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:54,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:54,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:54,559 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:74, output treesize:62 [2018-01-20 22:31:54,603 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:54,606 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:54,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 92 [2018-01-20 22:31:54,611 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:54,612 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 38 treesize of output 22 [2018-01-20 22:31:54,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:54,620 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:54,627 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-20 22:31:54,627 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:67 [2018-01-20 22:31:54,843 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:54,844 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:31:54,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 57 [2018-01-20 22:31:54,856 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 29 [2018-01-20 22:31:54,857 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:54,863 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-20 22:31:54,863 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:54,871 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-20 22:31:54,872 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-20 22:31:54,876 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:31:54,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:31:54,880 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:75, output treesize:9 [2018-01-20 22:31:54,981 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-20 22:31:55,001 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:31:55,001 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 25] total 49 [2018-01-20 22:31:55,002 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-01-20 22:31:55,002 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-01-20 22:31:55,002 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=2186, Unknown=0, NotChecked=0, Total=2352 [2018-01-20 22:31:55,002 INFO L87 Difference]: Start difference. First operand 180 states and 194 transitions. Second operand 49 states. [2018-01-20 22:31:56,186 WARN L146 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 125 DAG size of output 68 [2018-01-20 22:31:56,376 WARN L146 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 146 DAG size of output 73 [2018-01-20 22:31:58,828 WARN L146 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 107 DAG size of output 80 [2018-01-20 22:31:59,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:31:59,558 INFO L93 Difference]: Finished difference Result 308 states and 331 transitions. [2018-01-20 22:31:59,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-01-20 22:31:59,558 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 77 [2018-01-20 22:31:59,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:31:59,559 INFO L225 Difference]: With dead ends: 308 [2018-01-20 22:31:59,559 INFO L226 Difference]: Without dead ends: 304 [2018-01-20 22:31:59,561 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 57 SyntacticMatches, 4 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1813 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1135, Invalid=7607, Unknown=0, NotChecked=0, Total=8742 [2018-01-20 22:31:59,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-01-20 22:31:59,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 187. [2018-01-20 22:31:59,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-01-20 22:31:59,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 201 transitions. [2018-01-20 22:31:59,571 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 201 transitions. Word has length 77 [2018-01-20 22:31:59,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:31:59,571 INFO L432 AbstractCegarLoop]: Abstraction has 187 states and 201 transitions. [2018-01-20 22:31:59,571 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-01-20 22:31:59,571 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 201 transitions. [2018-01-20 22:31:59,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-01-20 22:31:59,572 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:31:59,572 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-01-20 22:31:59,572 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0EnsuresViolation]=== [2018-01-20 22:31:59,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1733977582, now seen corresponding path program 5 times [2018-01-20 22:31:59,573 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:31:59,573 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:31:59,574 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:59,574 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:31:59,574 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:31:59,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:31:59,585 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:31:59,865 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 18 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-20 22:31:59,865 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:31:59,865 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:31:59,870 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-20 22:31:59,879 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:31:59,883 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:31:59,888 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:31:59,899 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:31:59,901 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:31:59,904 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:31:59,907 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 19 treesize of output 16 [2018-01-20 22:31:59,908 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 16 treesize of output 1 [2018-01-20 22:31:59,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:59,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:59,909 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-20 22:31:59,909 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:1 [2018-01-20 22:31:59,959 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-20 22:31:59,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-01-20 22:31:59,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:31:59,961 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:31:59,964 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-20 22:31:59,964 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:19 [2018-01-20 22:32:00,050 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 23 treesize of output 24 [2018-01-20 22:32:00,052 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 17 treesize of output 15 [2018-01-20 22:32:00,052 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:00,059 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-20 22:32:00,059 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:00,062 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:00,063 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-20 22:32:00,063 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:23, output treesize:3 [2018-01-20 22:32:00,153 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-20 22:32:00,173 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:32:00,174 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 27 [2018-01-20 22:32:00,174 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-20 22:32:00,174 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-20 22:32:00,174 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=643, Unknown=0, NotChecked=0, Total=702 [2018-01-20 22:32:00,174 INFO L87 Difference]: Start difference. First operand 187 states and 201 transitions. Second operand 27 states. [2018-01-20 22:32:01,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:32:01,064 INFO L93 Difference]: Finished difference Result 251 states and 270 transitions. [2018-01-20 22:32:01,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-20 22:32:01,064 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 79 [2018-01-20 22:32:01,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:32:01,065 INFO L225 Difference]: With dead ends: 251 [2018-01-20 22:32:01,065 INFO L226 Difference]: Without dead ends: 215 [2018-01-20 22:32:01,066 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=140, Invalid=1266, Unknown=0, NotChecked=0, Total=1406 [2018-01-20 22:32:01,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-01-20 22:32:01,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 185. [2018-01-20 22:32:01,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-01-20 22:32:01,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 198 transitions. [2018-01-20 22:32:01,079 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 198 transitions. Word has length 79 [2018-01-20 22:32:01,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:32:01,079 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 198 transitions. [2018-01-20 22:32:01,079 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-20 22:32:01,079 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 198 transitions. [2018-01-20 22:32:01,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-01-20 22:32:01,080 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:32:01,080 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:32:01,080 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0EnsuresViolation]=== [2018-01-20 22:32:01,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1443081366, now seen corresponding path program 2 times [2018-01-20 22:32:01,080 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:32:01,080 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:32:01,081 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:01,081 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:32:01,081 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:01,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:32:01,091 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:32:01,624 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:32:01,624 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:32:01,625 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:32:01,630 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-20 22:32:01,642 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:32:01,655 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:32:01,659 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:32:01,662 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:32:01,664 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-20 22:32:01,665 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:01,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:01,667 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-20 22:32:01,712 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:01,713 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:01,713 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-20 22:32:01,713 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:01,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:01,718 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-01-20 22:32:01,739 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-20 22:32:01,741 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-20 22:32:01,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:01,742 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:01,750 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-20 22:32:01,752 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-20 22:32:01,752 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:01,753 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:01,759 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-20 22:32:01,759 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:25 [2018-01-20 22:32:01,782 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-20 22:32:01,783 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 7 [2018-01-20 22:32:01,783 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:01,785 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:01,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:01,789 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:22 [2018-01-20 22:32:01,831 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:01,833 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 27 treesize of output 28 [2018-01-20 22:32:01,835 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-20 22:32:01,835 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:01,839 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:01,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:01,844 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-01-20 22:32:01,872 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 51 treesize of output 41 [2018-01-20 22:32:01,874 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:01,875 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 30 treesize of output 18 [2018-01-20 22:32:01,875 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:01,878 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:01,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:01,881 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:54, output treesize:23 [2018-01-20 22:32:02,096 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 47 treesize of output 31 [2018-01-20 22:32:02,098 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 13 [2018-01-20 22:32:02,098 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:02,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-20 22:32:02,106 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:02,108 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:02,118 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 39 treesize of output 33 [2018-01-20 22:32:02,119 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 26 treesize of output 17 [2018-01-20 22:32:02,119 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:02,122 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:02,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-20 22:32:02,130 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:87, output treesize:45 [2018-01-20 22:32:02,276 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 31 treesize of output 23 [2018-01-20 22:32:02,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2018-01-20 22:32:02,277 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:02,281 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-20 22:32:02,281 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:02,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:02,292 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 27 treesize of output 21 [2018-01-20 22:32:02,293 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-20 22:32:02,293 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:02,297 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-20 22:32:02,297 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:02,299 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:02,304 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-20 22:32:02,304 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:59, output treesize:9 [2018-01-20 22:32:02,422 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:32:02,442 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:32:02,443 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 47 [2018-01-20 22:32:02,443 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-01-20 22:32:02,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-01-20 22:32:02,444 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=2038, Unknown=0, NotChecked=0, Total=2162 [2018-01-20 22:32:02,444 INFO L87 Difference]: Start difference. First operand 185 states and 198 transitions. Second operand 47 states. [2018-01-20 22:32:04,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:32:04,589 INFO L93 Difference]: Finished difference Result 303 states and 325 transitions. [2018-01-20 22:32:04,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-20 22:32:04,589 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 79 [2018-01-20 22:32:04,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:32:04,591 INFO L225 Difference]: With dead ends: 303 [2018-01-20 22:32:04,591 INFO L226 Difference]: Without dead ends: 279 [2018-01-20 22:32:04,592 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1118 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=515, Invalid=4597, Unknown=0, NotChecked=0, Total=5112 [2018-01-20 22:32:04,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-01-20 22:32:04,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 233. [2018-01-20 22:32:04,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-01-20 22:32:04,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 250 transitions. [2018-01-20 22:32:04,606 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 250 transitions. Word has length 79 [2018-01-20 22:32:04,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:32:04,606 INFO L432 AbstractCegarLoop]: Abstraction has 233 states and 250 transitions. [2018-01-20 22:32:04,606 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-01-20 22:32:04,606 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 250 transitions. [2018-01-20 22:32:04,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-01-20 22:32:04,607 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:32:04,607 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-01-20 22:32:04,607 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0EnsuresViolation]=== [2018-01-20 22:32:04,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1729080810, now seen corresponding path program 1 times [2018-01-20 22:32:04,607 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:32:04,608 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:32:04,608 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:04,608 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:32:04,608 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:04,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:32:04,616 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:32:05,099 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:32:05,099 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:32:05,099 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:32:05,104 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:32:05,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:32:05,131 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:32:05,133 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-20 22:32:05,134 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:05,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:05,135 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-20 22:32:05,175 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:05,176 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:05,176 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-20 22:32:05,176 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:05,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:05,181 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-01-20 22:32:05,202 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-20 22:32:05,204 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-20 22:32:05,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:05,205 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:05,212 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-20 22:32:05,214 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-20 22:32:05,214 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:05,215 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:05,220 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-20 22:32:05,221 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:22 [2018-01-20 22:32:05,240 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-20 22:32:05,241 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-20 22:32:05,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:05,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:05,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:05,245 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:19 [2018-01-20 22:32:05,285 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:05,288 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 27 treesize of output 28 [2018-01-20 22:32:05,289 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-20 22:32:05,289 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:05,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:05,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:05,298 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2018-01-20 22:32:05,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2018-01-20 22:32:05,325 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 26 treesize of output 11 [2018-01-20 22:32:05,326 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:05,328 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:05,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:05,331 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:20 [2018-01-20 22:32:05,509 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 39 treesize of output 33 [2018-01-20 22:32:05,511 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 26 treesize of output 17 [2018-01-20 22:32:05,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:05,514 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:05,525 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 47 treesize of output 31 [2018-01-20 22:32:05,527 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-20 22:32:05,527 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:05,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 13 [2018-01-20 22:32:05,531 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:05,534 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:05,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-20 22:32:05,542 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:87, output treesize:45 [2018-01-20 22:32:05,711 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 27 treesize of output 21 [2018-01-20 22:32:05,712 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-20 22:32:05,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:05,716 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-20 22:32:05,716 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:05,718 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:05,727 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 31 treesize of output 27 [2018-01-20 22:32:05,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2018-01-20 22:32:05,728 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:05,733 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-20 22:32:05,733 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:05,735 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:05,740 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-20 22:32:05,740 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:59, output treesize:9 [2018-01-20 22:32:05,860 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:32:05,880 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:32:05,880 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-01-20 22:32:05,881 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-01-20 22:32:05,881 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-01-20 22:32:05,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=2126, Unknown=0, NotChecked=0, Total=2256 [2018-01-20 22:32:05,881 INFO L87 Difference]: Start difference. First operand 233 states and 250 transitions. Second operand 48 states. Received shutdown request... [2018-01-20 22:32:06,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-20 22:32:06,638 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-20 22:32:06,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.01 10:32:06 BoogieIcfgContainer [2018-01-20 22:32:06,641 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-20 22:32:06,642 INFO L168 Benchmark]: Toolchain (without parser) took 50223.44 ms. Allocated memory was 304.6 MB in the beginning and 814.7 MB in the end (delta: 510.1 MB). Free memory was 262.9 MB in the beginning and 768.3 MB in the end (delta: -505.4 MB). Peak memory consumption was 4.7 MB. Max. memory is 5.3 GB. [2018-01-20 22:32:06,643 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 304.6 MB. Free memory is still 268.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 22:32:06,643 INFO L168 Benchmark]: CACSL2BoogieTranslator took 214.05 ms. Allocated memory is still 304.6 MB. Free memory was 261.9 MB in the beginning and 249.9 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. [2018-01-20 22:32:06,643 INFO L168 Benchmark]: Boogie Preprocessor took 41.38 ms. Allocated memory is still 304.6 MB. Free memory was 249.9 MB in the beginning and 247.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-20 22:32:06,643 INFO L168 Benchmark]: RCFGBuilder took 395.05 ms. Allocated memory is still 304.6 MB. Free memory was 247.8 MB in the beginning and 222.2 MB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 5.3 GB. [2018-01-20 22:32:06,644 INFO L168 Benchmark]: TraceAbstraction took 49565.44 ms. Allocated memory was 304.6 MB in the beginning and 814.7 MB in the end (delta: 510.1 MB). Free memory was 222.2 MB in the beginning and 768.3 MB in the end (delta: -546.1 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 22:32:06,645 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 304.6 MB. Free memory is still 268.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 214.05 ms. Allocated memory is still 304.6 MB. Free memory was 261.9 MB in the beginning and 249.9 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 41.38 ms. Allocated memory is still 304.6 MB. Free memory was 249.9 MB in the beginning and 247.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 395.05 ms. Allocated memory is still 304.6 MB. Free memory was 247.8 MB in the beginning and 222.2 MB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 49565.44 ms. Allocated memory was 304.6 MB in the beginning and 814.7 MB in the end (delta: 510.1 MB). Free memory was 222.2 MB in the beginning and 768.3 MB in the end (delta: -546.1 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 3 procedures, 78 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=78occurred 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: [L994] EXPR, FCALL malloc(sizeof(SLL)) VAL [malloc(sizeof(SLL))={13:0}] [L994] SLL* null = malloc(sizeof(SLL)); VAL [malloc(sizeof(SLL))={13:0}, null={13:0}] [L995] FCALL null->colour = BLACK VAL [malloc(sizeof(SLL))={13:0}, null={13:0}] [L996] FCALL null->next = ((void*)0) VAL [malloc(sizeof(SLL))={13:0}, null={13:0}] [L998] EXPR, FCALL malloc(sizeof(SLL)) VAL [malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={13:0}, null={13:0}] [L998] SLL* list = malloc(sizeof(SLL)); VAL [list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={13:0}, null={13:0}] [L999] FCALL list->next = null VAL [list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={13:0}, null={13:0}] [L1000] FCALL list->colour = BLACK VAL [list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={13:0}, null={13:0}] [L1002] SLL* end = list; VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={13:0}, null={13:0}] [L1005] COND FALSE !(__VERIFIER_nondet_int()) [L1026] end = null [L1027] end = list VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={13:0}, null={13:0}] [L1030] COND FALSE !(!(null != end)) VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={13:0}, null={13:0}] [L1030] COND FALSE !(0) VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={13:0}, null={13:0}] [L1031] EXPR, FCALL end->colour VAL [end={12:0}, end->colour=1, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={13:0}, null={13:0}] [L1031] COND FALSE !(!(BLACK == end->colour)) [L1031] COND FALSE !(0) VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={13:0}, null={13:0}] [L1033] COND TRUE null != end VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={13:0}, null={13:0}] [L1035] EXPR, FCALL end->colour VAL [end={12:0}, end->colour=1, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={13:0}, null={13:0}] [L1035] COND FALSE !(RED == end->colour) [L1042] EXPR, FCALL end->next VAL [end={12:0}, end->next={13:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={13:0}, null={13:0}] [L1042] end = end->next [L1033] COND FALSE !(null != end) VAL [end={13:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={13:0}, null={13:0}] [L1046] COND TRUE null != list VAL [end={13:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={13:0}, null={13:0}] [L1048] EXPR, FCALL list->colour VAL [end={13:0}, list={12:0}, list->colour=1, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={13:0}, null={13:0}] [L1048] COND FALSE !(RED == list->colour) [L1057] EXPR, FCALL list->next VAL [end={13:0}, list={12:0}, list->next={13:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={13:0}, null={13:0}] [L1057] end = list->next [L1058] FCALL free(list) VAL [end={13:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={13:0}, null={13:0}] [L1059] list = end VAL [end={13:0}, list={13:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={13:0}, null={13:0}] [L1046] COND FALSE !(null != list) VAL [end={13:0}, list={13:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={13:0}, null={13:0}] [L1063] FCALL free(null) VAL [end={13:0}, list={13:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={13:0}, null={13:0}] [L1065] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 3 procedures, 78 locations, 3 error locations. UNSAFE Result, 1.6s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 183 SDtfs, 1139 SDslu, 259 SDs, 0 SdLazy, 290 SolverSat, 87 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 73 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 187 NumberOfCodeBlocks, 187 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 135 ConstructedInterpolants, 0 QuantifiedInterpolants, 14124 SizeOfPredicates, 4 NumberOfNonLiveVariables, 121 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 2/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (233states) and interpolant automaton (currently 13 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (61 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 3 procedures, 78 locations, 3 error locations. TIMEOUT Result, 47.7s OverallTime, 18 OverallIterations, 4 TraceHistogramMax, 29.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1127 SDtfs, 9870 SDslu, 13949 SDs, 0 SdLazy, 18177 SolverSat, 2033 SolverUnsat, 137 SolverUnknown, 0 SolverNotchecked, 10.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1639 GetRequests, 792 SyntacticMatches, 55 SemanticMatches, 792 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11340 ImplicationChecksByTransitivity, 29.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=274occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 996 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 16.9s InterpolantComputationTime, 2089 NumberOfCodeBlocks, 2084 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 2056 ConstructedInterpolants, 227 QuantifiedInterpolants, 2999958 SizeOfPredicates, 238 NumberOfNonLiveVariables, 2915 ConjunctsInSsa, 640 ConjunctsInUnsatCore, 33 InterpolantComputations, 5 PerfectInterpolantSequences, 125/563 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-20_22-32-06-653.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-20_22-32-06-653.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-20_22-32-06-653.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-20_22-32-06-653.csv Completed graceful shutdown