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-47db877 [2018-01-23 14:57:20,209 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-23 14:57:20,211 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-23 14:57:20,226 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-23 14:57:20,226 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-23 14:57:20,227 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-23 14:57:20,228 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-23 14:57:20,230 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-23 14:57:20,232 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-23 14:57:20,233 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-23 14:57:20,233 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-23 14:57:20,233 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-23 14:57:20,234 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-23 14:57:20,235 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-23 14:57:20,236 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-23 14:57:20,238 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-23 14:57:20,240 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-23 14:57:20,242 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-23 14:57:20,242 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-23 14:57:20,243 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-23 14:57:20,245 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-23 14:57:20,245 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-23 14:57:20,245 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-23 14:57:20,246 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-23 14:57:20,246 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-23 14:57:20,247 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-23 14:57:20,247 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-23 14:57:20,247 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-23 14:57:20,248 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-23 14:57:20,248 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-23 14:57:20,248 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-23 14:57:20,248 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf [2018-01-23 14:57:20,258 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-23 14:57:20,259 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-23 14:57:20,259 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-23 14:57:20,259 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-23 14:57:20,260 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-23 14:57:20,260 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-23 14:57:20,260 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-23 14:57:20,260 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-23 14:57:20,260 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-23 14:57:20,261 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-23 14:57:20,261 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-23 14:57:20,261 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-23 14:57:20,261 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-23 14:57:20,261 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-23 14:57:20,261 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-23 14:57:20,261 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-23 14:57:20,262 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-23 14:57:20,262 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-23 14:57:20,262 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-23 14:57:20,262 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-23 14:57:20,262 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-23 14:57:20,262 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-23 14:57:20,263 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-23 14:57:20,263 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-23 14:57:20,263 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-23 14:57:20,263 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-23 14:57:20,263 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-23 14:57:20,263 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-23 14:57:20,264 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-23 14:57:20,264 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-23 14:57:20,264 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-23 14:57:20,264 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-23 14:57:20,264 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-23 14:57:20,264 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-23 14:57:20,264 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-23 14:57:20,265 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-23 14:57:20,265 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-23 14:57:20,298 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-23 14:57:20,309 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-23 14:57:20,313 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-23 14:57:20,314 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-23 14:57:20,314 INFO L276 PluginConnector]: CDTParser initialized [2018-01-23 14:57:20,315 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-23 14:57:20,484 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-23 14:57:20,487 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-23 14:57:20,488 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-23 14:57:20,488 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-23 14:57:20,493 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-23 14:57:20,493 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:57:20" (1/1) ... [2018-01-23 14:57:20,496 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27608974 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:57:20, skipping insertion in model container [2018-01-23 14:57:20,496 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:57:20" (1/1) ... [2018-01-23 14:57:20,509 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:57:20,551 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:57:20,674 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:57:20,695 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:57:20,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:57:20 WrapperNode [2018-01-23 14:57:20,705 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-23 14:57:20,706 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-23 14:57:20,706 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-23 14:57:20,706 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-23 14:57:20,723 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:57:20" (1/1) ... [2018-01-23 14:57:20,723 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:57:20" (1/1) ... [2018-01-23 14:57:20,733 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:57:20" (1/1) ... [2018-01-23 14:57:20,733 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:57:20" (1/1) ... [2018-01-23 14:57:20,738 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:57:20" (1/1) ... [2018-01-23 14:57:20,743 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:57:20" (1/1) ... [2018-01-23 14:57:20,745 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:57:20" (1/1) ... [2018-01-23 14:57:20,747 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-23 14:57:20,748 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-23 14:57:20,748 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-23 14:57:20,748 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-23 14:57:20,749 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:57:20" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-23 14:57:20,808 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-23 14:57:20,809 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-23 14:57:20,809 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-23 14:57:20,809 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-23 14:57:20,809 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-23 14:57:20,809 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-23 14:57:20,809 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-23 14:57:20,810 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-23 14:57:20,810 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-23 14:57:20,810 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-23 14:57:20,810 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-23 14:57:20,810 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-23 14:57:20,810 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-23 14:57:20,811 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-23 14:57:20,811 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-23 14:57:20,811 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-23 14:57:20,811 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-23 14:57:21,216 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-23 14:57:21,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:57:21 BoogieIcfgContainer [2018-01-23 14:57:21,217 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-23 14:57:21,218 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-23 14:57:21,218 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-23 14:57:21,221 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-23 14:57:21,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.01 02:57:20" (1/3) ... [2018-01-23 14:57:21,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@566e2043 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:57:21, skipping insertion in model container [2018-01-23 14:57:21,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:57:20" (2/3) ... [2018-01-23 14:57:21,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@566e2043 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:57:21, skipping insertion in model container [2018-01-23 14:57:21,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:57:21" (3/3) ... [2018-01-23 14:57:21,226 INFO L105 eAbstractionObserver]: Analyzing ICFG sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-01-23 14:57:21,233 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-23 14:57:21,239 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-23 14:57:21,285 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:57:21,285 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:57:21,285 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:57:21,285 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:57:21,285 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:57:21,285 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:57:21,285 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:57:21,286 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-23 14:57:21,286 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:57:21,304 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2018-01-23 14:57:21,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-23 14:57:21,310 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:57:21,312 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-23 14:57:21,312 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-23 14:57:21,316 INFO L82 PathProgramCache]: Analyzing trace with hash 207316, now seen corresponding path program 1 times [2018-01-23 14:57:21,317 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:57:21,318 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:57:21,367 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:57:21,368 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:57:21,368 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:57:21,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:57:21,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:57:21,448 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:57:21,454 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:57:21,463 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:57:21,463 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:57:21,463 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:57:21,464 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:57:21,464 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:57:21,464 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:57:21,464 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:57:21,464 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-23 14:57:21,464 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:57:21,468 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2018-01-23 14:57:21,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-23 14:57:21,470 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:57:21,470 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-23 14:57:21,471 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:57:21,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1129106172, now seen corresponding path program 1 times [2018-01-23 14:57:21,471 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:57:21,471 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:57:21,473 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:57:21,473 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:57:21,473 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:57:21,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:57:21,513 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:57:21,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:57:21,649 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:57:21,650 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:57:21,651 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:57:21,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:57:21,664 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:57:21,666 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 2 states. [2018-01-23 14:57:21,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:57:21,689 INFO L93 Difference]: Finished difference Result 123 states and 160 transitions. [2018-01-23 14:57:21,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:57:21,690 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2018-01-23 14:57:21,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:57:21,701 INFO L225 Difference]: With dead ends: 123 [2018-01-23 14:57:21,701 INFO L226 Difference]: Without dead ends: 75 [2018-01-23 14:57:21,704 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:57:21,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-23 14:57:21,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-01-23 14:57:21,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-23 14:57:21,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2018-01-23 14:57:21,739 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 25 [2018-01-23 14:57:21,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:57:21,739 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2018-01-23 14:57:21,739 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:57:21,740 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2018-01-23 14:57:21,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-23 14:57:21,741 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:57:21,741 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:57:21,741 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:57:21,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1421482513, now seen corresponding path program 1 times [2018-01-23 14:57:21,742 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:57:21,742 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:57:21,743 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:57:21,743 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:57:21,744 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:57:21,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:57:21,776 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:57:21,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:57:21,914 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:57:21,915 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-23 14:57:21,916 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-23 14:57:21,917 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-23 14:57:21,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-23 14:57:21,917 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 8 states. [2018-01-23 14:57:22,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:57:22,242 INFO L93 Difference]: Finished difference Result 133 states and 146 transitions. [2018-01-23 14:57:22,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-23 14:57:22,242 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-01-23 14:57:22,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:57:22,247 INFO L225 Difference]: With dead ends: 133 [2018-01-23 14:57:22,247 INFO L226 Difference]: Without dead ends: 113 [2018-01-23 14:57:22,248 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-23 14:57:22,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-01-23 14:57:22,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 77. [2018-01-23 14:57:22,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-23 14:57:22,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2018-01-23 14:57:22,256 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 34 [2018-01-23 14:57:22,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:57:22,256 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2018-01-23 14:57:22,256 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-23 14:57:22,256 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2018-01-23 14:57:22,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-23 14:57:22,257 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:57:22,257 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:57:22,257 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:57:22,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1799396031, now seen corresponding path program 1 times [2018-01-23 14:57:22,258 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:57:22,258 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:57:22,259 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:57:22,259 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:57:22,259 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:57:22,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:57:22,277 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:57:22,426 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-23 14:57:22,426 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:57:22,426 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:57:22,436 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:57:22,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:57:22,471 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:57:22,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-23 14:57:22,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:22,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:22,528 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-23 14:57:22,573 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:22,574 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:22,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-23 14:57:22,577 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:22,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:22,579 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-01-23 14:57:22,605 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-23 14:57:22,638 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-23 14:57:22,638 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 12 [2018-01-23 14:57:22,639 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-23 14:57:22,639 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-23 14:57:22,639 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-01-23 14:57:22,640 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 12 states. [2018-01-23 14:57:23,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:57:23,077 INFO L93 Difference]: Finished difference Result 122 states and 132 transitions. [2018-01-23 14:57:23,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-23 14:57:23,077 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2018-01-23 14:57:23,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:57:23,079 INFO L225 Difference]: With dead ends: 122 [2018-01-23 14:57:23,079 INFO L226 Difference]: Without dead ends: 116 [2018-01-23 14:57:23,079 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-23 14:57:23,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-23 14:57:23,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 79. [2018-01-23 14:57:23,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-23 14:57:23,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2018-01-23 14:57:23,086 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 40 [2018-01-23 14:57:23,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:57:23,086 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2018-01-23 14:57:23,086 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-23 14:57:23,087 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2018-01-23 14:57:23,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-23 14:57:23,088 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:57:23,088 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-23 14:57:23,088 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:57:23,088 INFO L82 PathProgramCache]: Analyzing trace with hash -225210580, now seen corresponding path program 1 times [2018-01-23 14:57:23,088 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:57:23,088 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:57:23,090 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:57:23,090 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:57:23,090 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:57:23,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:57:23,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:57:23,146 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:57:23,158 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:57:23,166 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:57:23,167 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:57:23,179 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:57:23,179 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:57:23,179 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:57:23,179 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:57:23,179 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:57:23,179 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:57:23,180 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:57:23,180 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-23 14:57:23,180 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:57:23,181 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2018-01-23 14:57:23,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-23 14:57:23,182 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:57:23,182 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:57:23,182 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-23 14:57:23,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1643515977, now seen corresponding path program 1 times [2018-01-23 14:57:23,183 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:57:23,183 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:57:23,184 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:57:23,184 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:57:23,184 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:57:23,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:57:23,191 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:57:23,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:57:23,203 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:57:23,204 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:57:23,204 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:57:23,204 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:57:23,204 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:57:23,204 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 2 states. [2018-01-23 14:57:23,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:57:23,210 INFO L93 Difference]: Finished difference Result 123 states and 160 transitions. [2018-01-23 14:57:23,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:57:23,210 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2018-01-23 14:57:23,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:57:23,211 INFO L225 Difference]: With dead ends: 123 [2018-01-23 14:57:23,211 INFO L226 Difference]: Without dead ends: 73 [2018-01-23 14:57:23,212 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:57:23,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-23 14:57:23,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-01-23 14:57:23,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-23 14:57:23,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2018-01-23 14:57:23,218 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 23 [2018-01-23 14:57:23,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:57:23,218 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2018-01-23 14:57:23,219 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:57:23,219 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2018-01-23 14:57:23,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-23 14:57:23,220 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:57:23,220 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:57:23,220 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-23 14:57:23,220 INFO L82 PathProgramCache]: Analyzing trace with hash 144495766, now seen corresponding path program 1 times [2018-01-23 14:57:23,220 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:57:23,221 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:57:23,222 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:57:23,222 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:57:23,222 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:57:23,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:57:23,235 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:57:23,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:57:23,293 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:57:23,293 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-23 14:57:23,293 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-23 14:57:23,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-23 14:57:23,294 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-23 14:57:23,294 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 8 states. [2018-01-23 14:57:23,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:57:23,439 INFO L93 Difference]: Finished difference Result 129 states and 141 transitions. [2018-01-23 14:57:23,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-23 14:57:23,439 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-01-23 14:57:23,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:57:23,440 INFO L225 Difference]: With dead ends: 129 [2018-01-23 14:57:23,441 INFO L226 Difference]: Without dead ends: 111 [2018-01-23 14:57:23,441 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-23 14:57:23,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-23 14:57:23,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 75. [2018-01-23 14:57:23,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-23 14:57:23,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2018-01-23 14:57:23,447 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 32 [2018-01-23 14:57:23,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:57:23,448 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2018-01-23 14:57:23,448 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-23 14:57:23,448 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2018-01-23 14:57:23,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-23 14:57:23,449 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:57:23,450 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-23 14:57:23,450 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-23 14:57:23,450 INFO L82 PathProgramCache]: Analyzing trace with hash -293099324, now seen corresponding path program 1 times [2018-01-23 14:57:23,450 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:57:23,450 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:57:23,451 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:57:23,451 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:57:23,451 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:57:23,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:57:23,464 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:57:23,572 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-23 14:57:23,572 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:57:23,573 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:57:23,589 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:57:23,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:57:23,613 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:57:23,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-23 14:57:23,616 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:23,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:23,617 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-23 14:57:23,637 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:23,638 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:23,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-23 14:57:23,639 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:23,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:23,640 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-01-23 14:57:23,656 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-23 14:57:23,688 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-23 14:57:23,688 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 12 [2018-01-23 14:57:23,688 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-23 14:57:23,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-23 14:57:23,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-01-23 14:57:23,689 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 12 states. [2018-01-23 14:57:23,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:57:23,980 INFO L93 Difference]: Finished difference Result 118 states and 128 transitions. [2018-01-23 14:57:23,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-23 14:57:23,980 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2018-01-23 14:57:23,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:57:23,981 INFO L225 Difference]: With dead ends: 118 [2018-01-23 14:57:23,981 INFO L226 Difference]: Without dead ends: 114 [2018-01-23 14:57:23,982 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-23 14:57:23,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-01-23 14:57:23,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 77. [2018-01-23 14:57:23,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-23 14:57:23,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2018-01-23 14:57:23,990 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 38 [2018-01-23 14:57:23,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:57:23,990 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2018-01-23 14:57:23,990 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-23 14:57:23,991 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2018-01-23 14:57:23,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-23 14:57:23,992 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:57:23,992 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:57:23,992 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-23 14:57:23,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1425462385, now seen corresponding path program 1 times [2018-01-23 14:57:23,993 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:57:23,993 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:57:23,994 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:57:23,994 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:57:23,994 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:57:24,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:57:24,008 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:57:24,410 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-23 14:57:24,410 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:57:24,410 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:57:24,415 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:57:24,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:57:24,434 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:57:24,662 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-23 14:57:24,683 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:57:24,683 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-01-23 14:57:24,684 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-23 14:57:24,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-23 14:57:24,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=247, Unknown=16, NotChecked=0, Total=306 [2018-01-23 14:57:24,685 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 18 states. [2018-01-23 14:57:25,714 WARN L146 SmtUtils]: Spent 262ms on a formula simplification. DAG size of input: 44 DAG size of output 37 [2018-01-23 14:57:25,950 WARN L146 SmtUtils]: Spent 150ms on a formula simplification. DAG size of input: 34 DAG size of output 29 [2018-01-23 14:57:26,208 WARN L146 SmtUtils]: Spent 181ms on a formula simplification. DAG size of input: 43 DAG size of output 36 [2018-01-23 14:57:26,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:57:26,436 INFO L93 Difference]: Finished difference Result 146 states and 158 transitions. [2018-01-23 14:57:26,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-23 14:57:26,437 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 46 [2018-01-23 14:57:26,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:57:26,438 INFO L225 Difference]: With dead ends: 146 [2018-01-23 14:57:26,439 INFO L226 Difference]: Without dead ends: 142 [2018-01-23 14:57:26,439 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=125, Invalid=615, Unknown=16, NotChecked=0, Total=756 [2018-01-23 14:57:26,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-01-23 14:57:26,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 113. [2018-01-23 14:57:26,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-23 14:57:26,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2018-01-23 14:57:26,450 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 46 [2018-01-23 14:57:26,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:57:26,451 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2018-01-23 14:57:26,451 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-23 14:57:26,451 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2018-01-23 14:57:26,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-23 14:57:26,452 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:57:26,452 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-23 14:57:26,452 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation]=== [2018-01-23 14:57:26,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1227318824, now seen corresponding path program 1 times [2018-01-23 14:57:26,453 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:57:26,453 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:57:26,454 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:57:26,454 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:57:26,455 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:57:26,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:57:26,467 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:57:26,579 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:57:26,579 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:57:26,579 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:57:26,590 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:57:26,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:57:26,619 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:57:26,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-23 14:57:26,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-23 14:57:26,628 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:26,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:26,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:26,633 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-01-23 14:57:26,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-23 14:57:26,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-23 14:57:26,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:26,644 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:26,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:26,645 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-01-23 14:57:26,677 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:57:26,698 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-23 14:57:26,698 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2018-01-23 14:57:26,698 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-23 14:57:26,699 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-23 14:57:26,699 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-23 14:57:26,699 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand 9 states. [2018-01-23 14:57:27,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:57:27,309 INFO L93 Difference]: Finished difference Result 205 states and 224 transitions. [2018-01-23 14:57:27,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-23 14:57:27,310 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2018-01-23 14:57:27,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:57:27,311 INFO L225 Difference]: With dead ends: 205 [2018-01-23 14:57:27,311 INFO L226 Difference]: Without dead ends: 162 [2018-01-23 14:57:27,311 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-01-23 14:57:27,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-01-23 14:57:27,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 136. [2018-01-23 14:57:27,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-01-23 14:57:27,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2018-01-23 14:57:27,323 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 48 [2018-01-23 14:57:27,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:57:27,324 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2018-01-23 14:57:27,324 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-23 14:57:27,324 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2018-01-23 14:57:27,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-23 14:57:27,325 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:57:27,325 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-23 14:57:27,325 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation]=== [2018-01-23 14:57:27,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1924529378, now seen corresponding path program 2 times [2018-01-23 14:57:27,326 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:57:27,326 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:57:27,327 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:57:27,327 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:57:27,327 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:57:27,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:57:27,338 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:57:27,468 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-23 14:57:27,468 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:57:27,468 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:57:27,473 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-23 14:57:27,488 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:57:27,498 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:57:27,499 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:57:27,503 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:57:27,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-23 14:57:27,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-23 14:57:27,598 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:27,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:27,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:27,601 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-01-23 14:57:27,667 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-23 14:57:27,688 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:57:27,688 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 21 [2018-01-23 14:57:27,689 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-23 14:57:27,689 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-23 14:57:27,689 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2018-01-23 14:57:27,689 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand 21 states. [2018-01-23 14:57:28,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:57:28,232 INFO L93 Difference]: Finished difference Result 216 states and 234 transitions. [2018-01-23 14:57:28,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-23 14:57:28,232 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 54 [2018-01-23 14:57:28,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:57:28,233 INFO L225 Difference]: With dead ends: 216 [2018-01-23 14:57:28,233 INFO L226 Difference]: Without dead ends: 147 [2018-01-23 14:57:28,235 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=198, Invalid=1062, Unknown=0, NotChecked=0, Total=1260 [2018-01-23 14:57:28,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-01-23 14:57:28,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 115. [2018-01-23 14:57:28,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-01-23 14:57:28,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2018-01-23 14:57:28,244 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 54 [2018-01-23 14:57:28,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:57:28,244 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2018-01-23 14:57:28,244 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-23 14:57:28,245 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2018-01-23 14:57:28,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-01-23 14:57:28,245 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:57:28,246 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-23 14:57:28,246 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation]=== [2018-01-23 14:57:28,246 INFO L82 PathProgramCache]: Analyzing trace with hash 828488614, now seen corresponding path program 1 times [2018-01-23 14:57:28,246 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:57:28,246 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:57:28,247 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:57:28,247 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:57:28,248 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:57:28,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:57:28,264 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:57:28,627 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-23 14:57:28,628 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:57:28,628 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:57:28,633 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:57:28,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:57:28,657 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:57:28,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-23 14:57:28,673 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:28,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:28,682 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-23 14:57:28,736 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-23 14:57:28,736 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:28,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:28,740 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-23 14:57:28,828 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:28,829 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:28,830 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:28,830 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-23 14:57:28,831 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:28,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:28,839 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-01-23 14:57:28,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-23 14:57:28,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-23 14:57:28,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:28,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:28,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:28,872 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-01-23 14:57:28,963 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:28,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2018-01-23 14:57:28,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-23 14:57:28,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:28,975 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:28,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:28,981 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-01-23 14:57:29,015 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-23 14:57:29,018 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:29,019 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-23 14:57:29,019 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:29,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:29,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:57:29,034 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:28 [2018-01-23 14:57:29,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, 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-23 14:57:29,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-01-23 14:57:29,100 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:29,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-23 14:57:29,105 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:29,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:29,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:29,110 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:35, output treesize:4 [2018-01-23 14:57:29,145 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:57:29,166 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:57:29,166 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 29 [2018-01-23 14:57:29,166 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-23 14:57:29,167 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-23 14:57:29,167 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=718, Unknown=0, NotChecked=0, Total=812 [2018-01-23 14:57:29,167 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand 29 states. [2018-01-23 14:57:30,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:57:30,178 INFO L93 Difference]: Finished difference Result 239 states and 259 transitions. [2018-01-23 14:57:30,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-23 14:57:30,178 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 57 [2018-01-23 14:57:30,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:57:30,179 INFO L225 Difference]: With dead ends: 239 [2018-01-23 14:57:30,179 INFO L226 Difference]: Without dead ends: 225 [2018-01-23 14:57:30,180 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-23 14:57:30,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-01-23 14:57:30,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 184. [2018-01-23 14:57:30,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-01-23 14:57:30,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 201 transitions. [2018-01-23 14:57:30,191 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 201 transitions. Word has length 57 [2018-01-23 14:57:30,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:57:30,192 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 201 transitions. [2018-01-23 14:57:30,192 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-23 14:57:30,192 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 201 transitions. [2018-01-23 14:57:30,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-23 14:57:30,193 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:57:30,193 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-23 14:57:30,193 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation]=== [2018-01-23 14:57:30,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1108780887, now seen corresponding path program 1 times [2018-01-23 14:57:30,194 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:57:30,194 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:57:30,195 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:57:30,195 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:57:30,195 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:57:30,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:57:30,216 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:57:30,829 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:57:30,829 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:57:30,829 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:57:30,835 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:57:30,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:57:30,865 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:57:30,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-23 14:57:30,870 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:30,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:30,875 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-23 14:57:30,914 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-23 14:57:30,915 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:30,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:30,918 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-23 14:57:30,985 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:30,986 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:30,987 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:30,988 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-23 14:57:30,989 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:30,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:30,998 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:30 [2018-01-23 14:57:31,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-23 14:57:31,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-23 14:57:31,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:31,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:31,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:31,064 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:42 [2018-01-23 14:57:31,157 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:31,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2018-01-23 14:57:31,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-23 14:57:31,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:31,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:31,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:31,175 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:54, output treesize:50 [2018-01-23 14:57:31,210 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:31,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 58 [2018-01-23 14:57:31,215 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:31,216 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-23 14:57:31,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:31,223 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:31,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:31,231 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:69, output treesize:50 [2018-01-23 14:57:31,234 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:31,235 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:31,236 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:31,236 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:31,237 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-23 14:57:31,237 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:31,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:31,245 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:47 [2018-01-23 14:57:31,276 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:31,278 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:31,279 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-23 14:57:31,281 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-23 14:57:31,282 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:31,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:31,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:31,297 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:52 [2018-01-23 14:57:31,397 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:31,398 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:31,403 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-23 14:57:31,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-23 14:57:31,406 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:31,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:31,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:57:31,422 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:79, output treesize:67 [2018-01-23 14:57:31,465 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-23 14:57:31,468 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:31,469 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-23 14:57:31,469 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:31,476 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:31,483 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-23 14:57:31,484 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:115, output treesize:72 [2018-01-23 14:57:31,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-23 14:57:31,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-23 14:57:31,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:31,657 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:31,666 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-23 14:57:31,667 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:90, output treesize:75 [2018-01-23 14:57:31,754 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-23 14:57:31,757 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-23 14:57:31,757 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:31,764 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-23 14:57:31,765 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:31,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-23 14:57:31,769 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:31,771 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:31,773 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-23 14:57:31,773 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:79, output treesize:4 [2018-01-23 14:57:31,835 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-23 14:57:31,856 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:57:31,856 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 25] total 43 [2018-01-23 14:57:31,856 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-01-23 14:57:31,857 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-01-23 14:57:31,857 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1673, Unknown=0, NotChecked=0, Total=1806 [2018-01-23 14:57:31,858 INFO L87 Difference]: Start difference. First operand 184 states and 201 transitions. Second operand 43 states. [2018-01-23 14:57:35,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:57:35,351 INFO L93 Difference]: Finished difference Result 343 states and 375 transitions. [2018-01-23 14:57:35,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-01-23 14:57:35,351 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 63 [2018-01-23 14:57:35,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:57:35,353 INFO L225 Difference]: With dead ends: 343 [2018-01-23 14:57:35,353 INFO L226 Difference]: Without dead ends: 298 [2018-01-23 14:57:35,354 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-23 14:57:35,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-01-23 14:57:35,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 206. [2018-01-23 14:57:35,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-01-23 14:57:35,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 224 transitions. [2018-01-23 14:57:35,368 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 224 transitions. Word has length 63 [2018-01-23 14:57:35,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:57:35,368 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 224 transitions. [2018-01-23 14:57:35,369 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-01-23 14:57:35,369 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 224 transitions. [2018-01-23 14:57:35,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-23 14:57:35,369 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:57:35,370 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-23 14:57:35,370 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation]=== [2018-01-23 14:57:35,370 INFO L82 PathProgramCache]: Analyzing trace with hash 2107407403, now seen corresponding path program 1 times [2018-01-23 14:57:35,370 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:57:35,370 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:57:35,371 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:57:35,371 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:57:35,371 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:57:35,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:57:35,381 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:57:35,544 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-23 14:57:35,544 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:57:35,544 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-23 14:57:35,545 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:57:35,545 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:57:35,545 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:57:35,545 INFO L87 Difference]: Start difference. First operand 206 states and 224 transitions. Second operand 5 states. [2018-01-23 14:57:35,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:57:35,791 INFO L93 Difference]: Finished difference Result 230 states and 249 transitions. [2018-01-23 14:57:35,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-23 14:57:35,791 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-01-23 14:57:35,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:57:35,792 INFO L225 Difference]: With dead ends: 230 [2018-01-23 14:57:35,792 INFO L226 Difference]: Without dead ends: 172 [2018-01-23 14:57:35,792 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-23 14:57:35,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-01-23 14:57:35,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 157. [2018-01-23 14:57:35,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-01-23 14:57:35,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 167 transitions. [2018-01-23 14:57:35,798 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 167 transitions. Word has length 68 [2018-01-23 14:57:35,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:57:35,799 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 167 transitions. [2018-01-23 14:57:35,799 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:57:35,799 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 167 transitions. [2018-01-23 14:57:35,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-23 14:57:35,799 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:57:35,799 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-23 14:57:35,800 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation]=== [2018-01-23 14:57:35,800 INFO L82 PathProgramCache]: Analyzing trace with hash 850899281, now seen corresponding path program 2 times [2018-01-23 14:57:35,800 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:57:35,800 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:57:35,801 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:57:35,801 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:57:35,801 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:57:35,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:57:35,817 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:57:36,291 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-23 14:57:36,291 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:57:36,291 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:57:36,299 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-23 14:57:36,315 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:57:36,328 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:57:36,332 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:57:36,336 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:57:36,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-23 14:57:36,339 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:36,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:36,340 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-23 14:57:36,370 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-23 14:57:36,370 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:36,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:36,374 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-01-23 14:57:36,442 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:36,442 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:36,444 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:36,444 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-23 14:57:36,445 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:36,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:36,453 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:33 [2018-01-23 14:57:36,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-23 14:57:36,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-23 14:57:36,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:36,485 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:36,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:36,494 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:45 [2018-01-23 14:57:36,573 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:36,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2018-01-23 14:57:36,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-23 14:57:36,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:36,583 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:36,592 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:36,592 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:53 [2018-01-23 14:57:36,625 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:36,628 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-23 14:57:36,631 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:36,632 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-23 14:57:36,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:36,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:36,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:36,649 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2018-01-23 14:57:36,652 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:36,654 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:36,655 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:36,656 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:36,657 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-23 14:57:36,658 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:36,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:36,667 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:58, output treesize:50 [2018-01-23 14:57:36,707 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:36,709 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:36,710 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-23 14:57:36,712 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-23 14:57:36,713 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:36,720 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:36,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:36,729 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:55 [2018-01-23 14:57:36,823 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:36,824 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:36,829 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-23 14:57:36,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-23 14:57:36,832 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:36,842 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:36,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:57:36,852 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:82, output treesize:70 [2018-01-23 14:57:36,902 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-23 14:57:36,905 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:36,906 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-23 14:57:36,907 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:36,915 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:36,923 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-23 14:57:36,923 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:118, output treesize:75 [2018-01-23 14:57:37,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-23 14:57:37,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-23 14:57:37,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:37,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:37,133 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-23 14:57:37,133 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:93, output treesize:78 [2018-01-23 14:57:37,230 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-23 14:57:37,232 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-23 14:57:37,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:37,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-23 14:57:37,240 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:37,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-01-23 14:57:37,246 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:37,249 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:37,251 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-23 14:57:37,252 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:79, output treesize:4 [2018-01-23 14:57:37,290 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-23 14:57:37,312 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:57:37,312 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 24] total 40 [2018-01-23 14:57:37,313 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-01-23 14:57:37,313 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-01-23 14:57:37,313 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1390, Unknown=0, NotChecked=0, Total=1560 [2018-01-23 14:57:37,314 INFO L87 Difference]: Start difference. First operand 157 states and 167 transitions. Second operand 40 states. [2018-01-23 14:57:40,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:57:40,676 INFO L93 Difference]: Finished difference Result 349 states and 374 transitions. [2018-01-23 14:57:40,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-01-23 14:57:40,677 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 68 [2018-01-23 14:57:40,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:57:40,679 INFO L225 Difference]: With dead ends: 349 [2018-01-23 14:57:40,679 INFO L226 Difference]: Without dead ends: 335 [2018-01-23 14:57:40,681 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-23 14:57:40,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-01-23 14:57:40,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 187. [2018-01-23 14:57:40,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-01-23 14:57:40,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 200 transitions. [2018-01-23 14:57:40,695 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 200 transitions. Word has length 68 [2018-01-23 14:57:40,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:57:40,695 INFO L432 AbstractCegarLoop]: Abstraction has 187 states and 200 transitions. [2018-01-23 14:57:40,695 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-01-23 14:57:40,695 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 200 transitions. [2018-01-23 14:57:40,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-01-23 14:57:40,696 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:57:40,697 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-23 14:57:40,697 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation]=== [2018-01-23 14:57:40,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1581316287, now seen corresponding path program 3 times [2018-01-23 14:57:40,697 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:57:40,697 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:57:40,698 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:57:40,698 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:57:40,698 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:57:40,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:57:40,717 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:57:42,271 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-23 14:57:42,272 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:57:42,272 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:57:42,277 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-23 14:57:42,290 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-23 14:57:42,300 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-23 14:57:42,348 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-23 14:57:42,352 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:57:42,355 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:57:42,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-23 14:57:42,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-23 14:57:42,613 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:42,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:42,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:42,628 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:70 [2018-01-23 14:57:42,799 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:42,802 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-23 14:57:42,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-23 14:57:42,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:42,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:42,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:42,829 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:82, output treesize:78 [2018-01-23 14:57:42,902 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:42,906 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-23 14:57:42,909 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:42,911 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-23 14:57:42,911 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:42,920 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:42,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:57:42,934 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:106, output treesize:75 [2018-01-23 14:57:43,315 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:43,317 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-23 14:57:43,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-23 14:57:43,320 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:43,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 28 [2018-01-23 14:57:43,343 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:43,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:43,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:43,360 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:79, output treesize:49 [2018-01-23 14:57:43,921 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-23 14:57:43,956 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:57:43,956 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2018-01-23 14:57:43,956 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-01-23 14:57:43,957 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-01-23 14:57:43,957 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1471, Unknown=57, NotChecked=0, Total=1640 [2018-01-23 14:57:43,957 INFO L87 Difference]: Start difference. First operand 187 states and 200 transitions. Second operand 41 states. [2018-01-23 14:57:47,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:57:47,274 INFO L93 Difference]: Finished difference Result 261 states and 279 transitions. [2018-01-23 14:57:47,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-23 14:57:47,302 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 71 [2018-01-23 14:57:47,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:57:47,303 INFO L225 Difference]: With dead ends: 261 [2018-01-23 14:57:47,304 INFO L226 Difference]: Without dead ends: 257 [2018-01-23 14:57:47,305 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 56 SyntacticMatches, 11 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 755 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=308, Invalid=3540, Unknown=58, NotChecked=0, Total=3906 [2018-01-23 14:57:47,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-01-23 14:57:47,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 230. [2018-01-23 14:57:47,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-01-23 14:57:47,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 246 transitions. [2018-01-23 14:57:47,323 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 246 transitions. Word has length 71 [2018-01-23 14:57:47,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:57:47,324 INFO L432 AbstractCegarLoop]: Abstraction has 230 states and 246 transitions. [2018-01-23 14:57:47,324 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-01-23 14:57:47,324 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 246 transitions. [2018-01-23 14:57:47,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-01-23 14:57:47,326 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:57:47,326 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-23 14:57:47,326 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation]=== [2018-01-23 14:57:47,326 INFO L82 PathProgramCache]: Analyzing trace with hash -228632408, now seen corresponding path program 1 times [2018-01-23 14:57:47,327 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:57:47,327 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:57:47,328 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:57:47,328 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:57:47,328 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:57:47,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:57:47,344 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:57:47,734 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-23 14:57:47,734 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:57:47,734 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:57:47,741 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:57:47,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:57:47,768 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:57:47,795 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-23 14:57:47,796 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-23 14:57:47,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:47,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:47,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:57:47,803 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:31 [2018-01-23 14:57:47,925 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-23 14:57:47,927 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-23 14:57:47,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:47,936 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-23 14:57:47,937 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:47,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:47,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:47,956 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:35, output treesize:8 [2018-01-23 14:57:48,041 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-23 14:57:48,041 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:48,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:48,044 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:10 [2018-01-23 14:57:48,055 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-23 14:57:48,087 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:57:48,088 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 22 [2018-01-23 14:57:48,088 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-23 14:57:48,088 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-23 14:57:48,088 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2018-01-23 14:57:48,089 INFO L87 Difference]: Start difference. First operand 230 states and 246 transitions. Second operand 22 states. [2018-01-23 14:57:49,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:57:49,206 INFO L93 Difference]: Finished difference Result 376 states and 409 transitions. [2018-01-23 14:57:49,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-01-23 14:57:49,207 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 73 [2018-01-23 14:57:49,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:57:49,208 INFO L225 Difference]: With dead ends: 376 [2018-01-23 14:57:49,208 INFO L226 Difference]: Without dead ends: 334 [2018-01-23 14:57:49,209 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-23 14:57:49,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-01-23 14:57:49,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 274. [2018-01-23 14:57:49,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-01-23 14:57:49,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 297 transitions. [2018-01-23 14:57:49,221 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 297 transitions. Word has length 73 [2018-01-23 14:57:49,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:57:49,221 INFO L432 AbstractCegarLoop]: Abstraction has 274 states and 297 transitions. [2018-01-23 14:57:49,221 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-23 14:57:49,222 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 297 transitions. [2018-01-23 14:57:49,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-01-23 14:57:49,222 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:57:49,222 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-23 14:57:49,222 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation]=== [2018-01-23 14:57:49,223 INFO L82 PathProgramCache]: Analyzing trace with hash 619410687, now seen corresponding path program 4 times [2018-01-23 14:57:49,223 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:57:49,223 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:57:49,224 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:57:49,224 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:57:49,224 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:57:49,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:57:49,237 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:57:49,572 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-23 14:57:49,572 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:57:49,572 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:57:49,595 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-23 14:57:49,632 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:57:49,635 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:57:49,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-01-23 14:57:49,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-23 14:57:49,731 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:49,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:49,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-01-23 14:57:49,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-01-23 14:57:49,747 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:49,750 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:49,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-01-23 14:57:49,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-01-23 14:57:49,760 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:49,761 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:49,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-01-23 14:57:49,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-23 14:57:49,768 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:49,768 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:49,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:57:49,771 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:47, output treesize:9 [2018-01-23 14:57:49,792 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-23 14:57:49,813 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:57:49,814 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-01-23 14:57:49,814 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-23 14:57:49,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-23 14:57:49,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-23 14:57:49,815 INFO L87 Difference]: Start difference. First operand 274 states and 297 transitions. Second operand 9 states. [2018-01-23 14:57:50,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:57:50,137 INFO L93 Difference]: Finished difference Result 316 states and 340 transitions. [2018-01-23 14:57:50,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-23 14:57:50,138 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 74 [2018-01-23 14:57:50,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:57:50,139 INFO L225 Difference]: With dead ends: 316 [2018-01-23 14:57:50,139 INFO L226 Difference]: Without dead ends: 312 [2018-01-23 14:57:50,139 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 68 SyntacticMatches, 7 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2018-01-23 14:57:50,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-01-23 14:57:50,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 227. [2018-01-23 14:57:50,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-01-23 14:57:50,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 245 transitions. [2018-01-23 14:57:50,149 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 245 transitions. Word has length 74 [2018-01-23 14:57:50,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:57:50,149 INFO L432 AbstractCegarLoop]: Abstraction has 227 states and 245 transitions. [2018-01-23 14:57:50,149 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-23 14:57:50,149 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 245 transitions. [2018-01-23 14:57:50,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-01-23 14:57:50,150 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:57:50,150 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-23 14:57:50,150 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0EnsuresViolation]=== [2018-01-23 14:57:50,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1476207124, now seen corresponding path program 1 times [2018-01-23 14:57:50,150 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:57:50,150 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:57:50,151 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:57:50,151 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:57:50,151 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:57:50,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:57:50,164 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:57:50,692 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-23 14:57:50,693 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:57:50,693 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:57:50,698 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:57:50,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:57:50,728 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:57:50,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-23 14:57:50,730 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:50,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:50,731 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-23 14:57:50,763 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-23 14:57:50,763 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:50,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:50,766 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-23 14:57:50,825 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:50,826 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:50,827 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:50,828 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-23 14:57:50,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:50,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:50,837 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:30 [2018-01-23 14:57:50,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-23 14:57:50,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-23 14:57:50,875 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:50,876 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:50,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:50,885 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:42 [2018-01-23 14:57:50,973 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:50,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2018-01-23 14:57:50,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-23 14:57:50,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:50,986 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:50,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:50,994 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:54, output treesize:50 [2018-01-23 14:57:51,028 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:51,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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-23 14:57:51,033 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:51,034 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-23 14:57:51,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:51,041 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:51,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:51,049 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:69, output treesize:50 [2018-01-23 14:57:51,053 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:51,053 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:51,054 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:51,056 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:51,056 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-23 14:57:51,057 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:51,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:51,071 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:61, output treesize:75 [2018-01-23 14:57:51,114 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:51,116 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:51,117 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-23 14:57:51,119 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-23 14:57:51,119 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:51,129 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:51,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:51,142 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:86, output treesize:80 [2018-01-23 14:57:51,266 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:51,267 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:51,272 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-23 14:57:51,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-23 14:57:51,274 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:51,286 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:51,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:57:51,299 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:111, output treesize:99 [2018-01-23 14:57:51,355 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:51,360 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-23 14:57:51,363 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:51,364 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-23 14:57:51,364 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:51,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:51,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:57:51,390 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:99 [2018-01-23 14:57:51,394 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:51,395 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:51,395 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:51,396 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:51,397 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:51,398 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-23 14:57:51,398 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:51,413 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-23 14:57:51,413 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:104, output treesize:95 [2018-01-23 14:57:51,458 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:51,460 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:51,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 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-23 14:57:51,465 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-23 14:57:51,466 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:51,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:51,490 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-23 14:57:51,490 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:106, output treesize:104 [2018-01-23 14:57:51,620 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:51,620 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:51,621 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:51,632 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-23 14:57:51,634 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-23 14:57:51,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:51,651 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:51,665 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-23 14:57:51,665 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:159, output treesize:155 [2018-01-23 14:57:51,725 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-23 14:57:51,728 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:51,729 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-23 14:57:51,729 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:51,743 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:51,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-23 14:57:51,755 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:207, output treesize:152 [2018-01-23 14:57:51,837 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-23 14:57:51,840 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-23 14:57:51,841 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:51,854 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-23 14:57:51,854 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:51,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-01-23 14:57:51,871 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:51,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-23 14:57:51,876 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:51,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:51,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:51,881 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:159, output treesize:4 [2018-01-23 14:57:51,959 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-23 14:57:51,980 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:57:51,980 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 26] total 46 [2018-01-23 14:57:51,980 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-01-23 14:57:51,980 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-01-23 14:57:51,981 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1909, Unknown=0, NotChecked=0, Total=2070 [2018-01-23 14:57:51,981 INFO L87 Difference]: Start difference. First operand 227 states and 245 transitions. Second operand 46 states. [2018-01-23 14:57:57,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:57:57,025 INFO L93 Difference]: Finished difference Result 369 states and 397 transitions. [2018-01-23 14:57:57,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-01-23 14:57:57,025 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 74 [2018-01-23 14:57:57,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:57:57,026 INFO L225 Difference]: With dead ends: 369 [2018-01-23 14:57:57,026 INFO L226 Difference]: Without dead ends: 355 [2018-01-23 14:57:57,028 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2340 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1456, Invalid=8644, Unknown=0, NotChecked=0, Total=10100 [2018-01-23 14:57:57,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-01-23 14:57:57,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 180. [2018-01-23 14:57:57,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-01-23 14:57:57,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 194 transitions. [2018-01-23 14:57:57,042 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 194 transitions. Word has length 74 [2018-01-23 14:57:57,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:57:57,042 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 194 transitions. [2018-01-23 14:57:57,043 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-01-23 14:57:57,043 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 194 transitions. [2018-01-23 14:57:57,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-01-23 14:57:57,044 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:57:57,044 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-23 14:57:57,044 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0EnsuresViolation]=== [2018-01-23 14:57:57,044 INFO L82 PathProgramCache]: Analyzing trace with hash -742251772, now seen corresponding path program 2 times [2018-01-23 14:57:57,044 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:57:57,045 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:57:57,046 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:57:57,046 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:57:57,046 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:57:57,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:57:57,069 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:57:58,246 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-23 14:57:58,246 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:57:58,246 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-23 14:57:58,252 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-23 14:57:58,264 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:57:58,278 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:57:58,283 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:57:58,287 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:57:58,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-23 14:57:58,292 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:58,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:58,294 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-23 14:57:58,341 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-23 14:57:58,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:58,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:58,345 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-01-23 14:57:58,429 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:58,430 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:58,432 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:58,432 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-23 14:57:58,433 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:58,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:58,444 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:36 [2018-01-23 14:57:58,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-23 14:57:58,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-23 14:57:58,497 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:58,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:58,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-23 14:57:58,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-23 14:57:58,516 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:58,518 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:58,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:58,531 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:55, output treesize:52 [2018-01-23 14:57:58,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-23 14:57:58,576 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-23 14:57:58,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:58,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:58,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:58,587 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:60, output treesize:49 [2018-01-23 14:57:58,669 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:58,671 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:58,672 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-23 14:57:58,674 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-23 14:57:58,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:58,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:58,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:58,691 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:60, output treesize:48 [2018-01-23 14:57:58,735 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:58,736 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:58,738 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:58,738 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-23 14:57:58,741 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:58,751 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-23 14:57:58,752 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-23 14:57:58,766 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:58,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:58,775 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:48 [2018-01-23 14:57:58,782 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:58,783 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:58,784 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:58,784 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:58,785 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:58,786 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-23 14:57:58,786 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:58,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:58,799 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:45 [2018-01-23 14:57:58,840 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:58,841 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:58,842 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:58,842 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:58,843 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-23 14:57:58,856 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-23 14:57:58,857 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-23 14:57:58,872 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:58,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:58,881 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:50 [2018-01-23 14:57:58,998 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:58,998 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:58,999 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:59,002 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:59,005 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-23 14:57:59,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-23 14:57:59,007 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:59,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:59,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:59,025 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:74, output treesize:62 [2018-01-23 14:57:59,070 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:59,073 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:59,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, 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-23 14:57:59,078 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:59,079 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-23 14:57:59,080 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:59,088 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:57:59,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:57:59,095 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:67 [2018-01-23 14:57:59,294 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:59,295 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:57:59,297 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-23 14:57:59,308 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-23 14:57:59,309 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:59,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-23 14:57:59,316 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:57:59,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 17 [2018-01-23 14:57:59,325 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-23 14:57:59,329 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:57:59,334 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-23 14:57:59,334 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:75, output treesize:9 [2018-01-23 14:57:59,456 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-23 14:57:59,477 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:57:59,477 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 25] total 49 [2018-01-23 14:57:59,477 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-01-23 14:57:59,477 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-01-23 14:57:59,478 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=2186, Unknown=0, NotChecked=0, Total=2352 [2018-01-23 14:57:59,478 INFO L87 Difference]: Start difference. First operand 180 states and 194 transitions. Second operand 49 states. [2018-01-23 14:58:00,682 WARN L146 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 125 DAG size of output 68 [2018-01-23 14:58:00,877 WARN L146 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 146 DAG size of output 73 [2018-01-23 14:58:03,342 WARN L146 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 107 DAG size of output 80 [2018-01-23 14:58:04,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:58:04,060 INFO L93 Difference]: Finished difference Result 308 states and 331 transitions. [2018-01-23 14:58:04,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-01-23 14:58:04,060 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 77 [2018-01-23 14:58:04,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:58:04,061 INFO L225 Difference]: With dead ends: 308 [2018-01-23 14:58:04,061 INFO L226 Difference]: Without dead ends: 304 [2018-01-23 14:58:04,063 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 57 SyntacticMatches, 4 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1813 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1135, Invalid=7607, Unknown=0, NotChecked=0, Total=8742 [2018-01-23 14:58:04,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-01-23 14:58:04,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 187. [2018-01-23 14:58:04,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-01-23 14:58:04,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 201 transitions. [2018-01-23 14:58:04,073 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 201 transitions. Word has length 77 [2018-01-23 14:58:04,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:58:04,073 INFO L432 AbstractCegarLoop]: Abstraction has 187 states and 201 transitions. [2018-01-23 14:58:04,073 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-01-23 14:58:04,073 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 201 transitions. [2018-01-23 14:58:04,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-01-23 14:58:04,074 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:58:04,074 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-23 14:58:04,074 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0EnsuresViolation]=== [2018-01-23 14:58:04,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1733977582, now seen corresponding path program 5 times [2018-01-23 14:58:04,074 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:58:04,074 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:58:04,075 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:58:04,075 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:58:04,075 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:58:04,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:58:04,083 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:58:04,396 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-23 14:58:04,397 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:58:04,397 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-23 14:58:04,402 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-23 14:58:04,410 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:58:04,412 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:58:04,417 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:58:04,429 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:58:04,431 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:58:04,433 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:58:04,437 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-23 14:58:04,438 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-23 14:58:04,438 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:58:04,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:58:04,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:58:04,439 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:1 [2018-01-23 14:58:04,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-01-23 14:58:04,484 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-23 14:58:04,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:58:04,485 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:58:04,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:58:04,488 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:19 [2018-01-23 14:58:04,576 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-23 14:58:04,578 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-23 14:58:04,578 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:58:04,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-23 14:58:04,584 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:58:04,587 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:58:04,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:58:04,588 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:23, output treesize:3 [2018-01-23 14:58:04,674 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-23 14:58:04,694 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:58:04,695 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 27 [2018-01-23 14:58:04,695 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-23 14:58:04,695 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-23 14:58:04,695 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=643, Unknown=0, NotChecked=0, Total=702 [2018-01-23 14:58:04,695 INFO L87 Difference]: Start difference. First operand 187 states and 201 transitions. Second operand 27 states. [2018-01-23 14:58:05,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:58:05,573 INFO L93 Difference]: Finished difference Result 251 states and 270 transitions. [2018-01-23 14:58:05,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-23 14:58:05,574 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 79 [2018-01-23 14:58:05,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:58:05,575 INFO L225 Difference]: With dead ends: 251 [2018-01-23 14:58:05,575 INFO L226 Difference]: Without dead ends: 215 [2018-01-23 14:58:05,575 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=140, Invalid=1266, Unknown=0, NotChecked=0, Total=1406 [2018-01-23 14:58:05,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-01-23 14:58:05,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 185. [2018-01-23 14:58:05,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-01-23 14:58:05,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 198 transitions. [2018-01-23 14:58:05,591 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 198 transitions. Word has length 79 [2018-01-23 14:58:05,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:58:05,592 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 198 transitions. [2018-01-23 14:58:05,592 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-23 14:58:05,592 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 198 transitions. [2018-01-23 14:58:05,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-01-23 14:58:05,593 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:58:05,593 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-23 14:58:05,593 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0EnsuresViolation]=== [2018-01-23 14:58:05,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1443081366, now seen corresponding path program 2 times [2018-01-23 14:58:05,593 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:58:05,594 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:58:05,594 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:58:05,595 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:58:05,595 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:58:05,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:58:05,607 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:58:06,157 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-23 14:58:06,158 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:58:06,158 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-23 14:58:06,167 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-23 14:58:06,180 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:58:06,193 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:58:06,197 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:58:06,200 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:58:06,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-23 14:58:06,202 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:58:06,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:58:06,205 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-23 14:58:06,251 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:58:06,251 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:58:06,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-23 14:58:06,252 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:58:06,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:58:06,257 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-01-23 14:58:06,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-23 14:58:06,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-23 14:58:06,282 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:58:06,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:58:06,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-23 14:58:06,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-23 14:58:06,294 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:58:06,297 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:58:06,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:58:06,304 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:25 [2018-01-23 14:58:06,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-23 14:58:06,332 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-23 14:58:06,332 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:58:06,334 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:58:06,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:58:06,338 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:22 [2018-01-23 14:58:06,380 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:58:06,382 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-23 14:58:06,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-23 14:58:06,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:58:06,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:58:06,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:58:06,393 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-01-23 14:58:06,421 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-23 14:58:06,422 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:58:06,424 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-23 14:58:06,424 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:58:06,427 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:58:06,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:58:06,431 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:54, output treesize:23 [2018-01-23 14:58:06,645 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-23 14:58:06,647 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-23 14:58:06,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:58:06,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-01-23 14:58:06,656 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:58:06,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:58:06,676 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-23 14:58:06,679 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-23 14:58:06,679 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-23 14:58:06,692 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:58:06,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-23 14:58:06,702 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:87, output treesize:45 [2018-01-23 14:58:06,852 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-23 14:58:06,853 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-23 14:58:06,853 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:58:06,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-23 14:58:06,857 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:58:06,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:58:06,868 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-23 14:58:06,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-23 14:58:06,870 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-23 14:58:06,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-01-23 14:58:06,874 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-23 14:58:06,876 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:58:06,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:58:06,881 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:59, output treesize:9 [2018-01-23 14:58:07,000 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-23 14:58:07,020 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:58:07,021 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 47 [2018-01-23 14:58:07,021 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-01-23 14:58:07,021 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-01-23 14:58:07,022 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=2038, Unknown=0, NotChecked=0, Total=2162 [2018-01-23 14:58:07,022 INFO L87 Difference]: Start difference. First operand 185 states and 198 transitions. Second operand 47 states. [2018-01-23 14:58:09,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:58:09,172 INFO L93 Difference]: Finished difference Result 303 states and 325 transitions. [2018-01-23 14:58:09,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-23 14:58:09,172 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 79 [2018-01-23 14:58:09,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:58:09,173 INFO L225 Difference]: With dead ends: 303 [2018-01-23 14:58:09,173 INFO L226 Difference]: Without dead ends: 279 [2018-01-23 14:58:09,174 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1118 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=515, Invalid=4597, Unknown=0, NotChecked=0, Total=5112 [2018-01-23 14:58:09,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-01-23 14:58:09,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 233. [2018-01-23 14:58:09,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-01-23 14:58:09,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 250 transitions. [2018-01-23 14:58:09,188 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 250 transitions. Word has length 79 [2018-01-23 14:58:09,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:58:09,188 INFO L432 AbstractCegarLoop]: Abstraction has 233 states and 250 transitions. [2018-01-23 14:58:09,188 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-01-23 14:58:09,188 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 250 transitions. [2018-01-23 14:58:09,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-01-23 14:58:09,189 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:58:09,189 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-23 14:58:09,189 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0EnsuresViolation]=== [2018-01-23 14:58:09,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1729080810, now seen corresponding path program 1 times [2018-01-23 14:58:09,189 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:58:09,189 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:58:09,190 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:58:09,190 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:58:09,191 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:58:09,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:58:09,203 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:58:09,599 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-23 14:58:09,600 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:58:09,600 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-23 14:58:09,605 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:58:09,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:58:09,631 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:58:09,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-23 14:58:09,635 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:58:09,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:58:09,643 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-23 14:58:09,690 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:58:09,690 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:58:09,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-23 14:58:09,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:58:09,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:58:09,696 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-01-23 14:58:09,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-23 14:58:09,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-23 14:58:09,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:58:09,723 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:58:09,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-23 14:58:09,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-23 14:58:09,733 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:58:09,734 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:58:09,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:58:09,740 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:22 [2018-01-23 14:58:09,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-23 14:58:09,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-23 14:58:09,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:58:09,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:58:09,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:58:09,768 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:19 [2018-01-23 14:58:09,805 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:58:09,808 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-23 14:58:09,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-23 14:58:09,809 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:58:09,813 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:58:09,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:58:09,817 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2018-01-23 14:58:09,851 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-23 14:58:09,854 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-23 14:58:09,854 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:58:09,857 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:58:09,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:58:09,860 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:20 [2018-01-23 14:58:10,045 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-23 14:58:10,046 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-23 14:58:10,046 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:58:10,050 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:58:10,060 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-23 14:58:10,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-01-23 14:58:10,062 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:58:10,066 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-23 14:58:10,066 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-23 14:58:10,070 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:58:10,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-23 14:58:10,078 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:87, output treesize:45 [2018-01-23 14:58:10,257 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-23 14:58:10,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-23 14:58:10,258 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:58:10,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-01-23 14:58:10,262 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:58:10,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:58:10,273 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-23 14:58:10,276 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-23 14:58:10,276 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-23 14:58:10,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-23 14:58:10,281 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-23 14:58:10,283 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:58:10,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:58:10,289 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:59, output treesize:9 [2018-01-23 14:58:10,411 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. Received shutdown request... [2018-01-23 14:58:10,432 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:58:10,432 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-01-23 14:58:10,433 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-01-23 14:58:10,433 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-01-23 14:58:10,433 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=2126, Unknown=0, NotChecked=0, Total=2256 [2018-01-23 14:58:10,433 INFO L87 Difference]: Start difference. First operand 233 states and 250 transitions. Second operand 48 states. [2018-01-23 14:58:10,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:58:10,434 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-23 14:58:10,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.01 02:58:10 BoogieIcfgContainer [2018-01-23 14:58:10,437 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-23 14:58:10,437 INFO L168 Benchmark]: Toolchain (without parser) took 49953.31 ms. Allocated memory was 306.7 MB in the beginning and 769.7 MB in the end (delta: 462.9 MB). Free memory was 265.6 MB in the beginning and 442.5 MB in the end (delta: -176.8 MB). Peak memory consumption was 286.1 MB. Max. memory is 5.3 GB. [2018-01-23 14:58:10,438 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 306.7 MB. Free memory is still 271.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-23 14:58:10,438 INFO L168 Benchmark]: CACSL2BoogieTranslator took 217.74 ms. Allocated memory is still 306.7 MB. Free memory was 265.6 MB in the beginning and 253.7 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-23 14:58:10,439 INFO L168 Benchmark]: Boogie Preprocessor took 41.51 ms. Allocated memory is still 306.7 MB. Free memory was 253.7 MB in the beginning and 251.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-23 14:58:10,439 INFO L168 Benchmark]: RCFGBuilder took 469.27 ms. Allocated memory is still 306.7 MB. Free memory was 251.7 MB in the beginning and 224.8 MB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 5.3 GB. [2018-01-23 14:58:10,439 INFO L168 Benchmark]: TraceAbstraction took 49218.46 ms. Allocated memory was 306.7 MB in the beginning and 769.7 MB in the end (delta: 462.9 MB). Free memory was 224.8 MB in the beginning and 442.5 MB in the end (delta: -217.7 MB). Peak memory consumption was 245.2 MB. Max. memory is 5.3 GB. [2018-01-23 14:58:10,440 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.16 ms. Allocated memory is still 306.7 MB. Free memory is still 271.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 217.74 ms. Allocated memory is still 306.7 MB. Free memory was 265.6 MB in the beginning and 253.7 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 41.51 ms. Allocated memory is still 306.7 MB. Free memory was 253.7 MB in the beginning and 251.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 469.27 ms. Allocated memory is still 306.7 MB. Free memory was 251.7 MB in the beginning and 224.8 MB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 49218.46 ms. Allocated memory was 306.7 MB in the beginning and 769.7 MB in the end (delta: 462.9 MB). Free memory was 224.8 MB in the beginning and 442.5 MB in the end (delta: -217.7 MB). Peak memory consumption was 245.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 3 procedures, 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.7s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.8s 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.5s 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 2 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (1 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.2s OverallTime, 18 OverallIterations, 4 TraceHistogramMax, 28.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1102 SDtfs, 9540 SDslu, 13324 SDs, 0 SdLazy, 17416 SolverSat, 1928 SolverUnsat, 137 SolverUnknown, 0 SolverNotchecked, 10.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1629 GetRequests, 792 SyntacticMatches, 55 SemanticMatches, 782 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11213 ImplicationChecksByTransitivity, 29.2s 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.7s 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-23_14-58-10-448.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-23_14-58-10-448.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-23_14-58-10-448.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-23_14-58-10-448.csv Completed graceful shutdown