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_Taipan+AI_EQ_mostprecise.epf -i ../../../trunk/examples/svcomp/memsafety/20051113-1.c_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 02:53:43,272 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 02:53:43,301 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 02:53:43,320 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 02:53:43,320 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 02:53:43,321 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 02:53:43,323 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 02:53:43,325 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 02:53:43,328 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 02:53:43,329 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 02:53:43,330 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 02:53:43,331 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 02:53:43,332 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 02:53:43,334 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 02:53:43,335 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 02:53:43,337 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 02:53:43,340 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 02:53:43,342 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 02:53:43,343 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 02:53:43,345 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 02:53:43,347 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 02:53:43,348 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 02:53:43,348 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 02:53:43,349 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 02:53:43,350 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 02:53:43,352 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 02:53:43,352 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 02:53:43,353 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 02:53:43,353 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 02:53:43,353 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 02:53:43,354 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 02:53:43,355 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf [2018-01-21 02:53:43,366 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 02:53:43,367 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 02:53:43,368 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 02:53:43,368 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 02:53:43,368 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 02:53:43,368 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-21 02:53:43,369 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 02:53:43,369 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-21 02:53:43,369 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 02:53:43,370 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 02:53:43,370 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 02:53:43,370 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 02:53:43,370 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 02:53:43,371 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 02:53:43,371 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 02:53:43,371 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 02:53:43,371 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 02:53:43,371 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 02:53:43,372 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 02:53:43,372 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 02:53:43,372 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 02:53:43,372 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 02:53:43,372 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 02:53:43,373 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 02:53:43,373 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 02:53:43,373 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 02:53:43,373 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 02:53:43,373 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 02:53:43,374 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 02:53:43,374 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 02:53:43,374 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 02:53:43,374 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 02:53:43,374 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 02:53:43,374 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 02:53:43,375 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 02:53:43,375 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 02:53:43,375 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 02:53:43,375 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 02:53:43,376 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 02:53:43,376 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 02:53:43,432 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 02:53:43,449 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 02:53:43,456 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 02:53:43,458 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 02:53:43,459 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 02:53:43,459 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/20051113-1.c_false-valid-memtrack.i [2018-01-21 02:53:43,728 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 02:53:43,734 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 02:53:43,735 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 02:53:43,735 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 02:53:43,741 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 02:53:43,743 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 02:53:43" (1/1) ... [2018-01-21 02:53:43,748 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3adf5c24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 02:53:43, skipping insertion in model container [2018-01-21 02:53:43,749 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 02:53:43" (1/1) ... [2018-01-21 02:53:43,767 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 02:53:43,823 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 02:53:43,971 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 02:53:43,996 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 02:53:44,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 02:53:44 WrapperNode [2018-01-21 02:53:44,006 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 02:53:44,007 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 02:53:44,007 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 02:53:44,007 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 02:53:44,027 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 02:53:44" (1/1) ... [2018-01-21 02:53:44,027 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 02:53:44" (1/1) ... [2018-01-21 02:53:44,039 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 02:53:44" (1/1) ... [2018-01-21 02:53:44,040 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 02:53:44" (1/1) ... [2018-01-21 02:53:44,045 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 02:53:44" (1/1) ... [2018-01-21 02:53:44,048 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 02:53:44" (1/1) ... [2018-01-21 02:53:44,050 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 02:53:44" (1/1) ... [2018-01-21 02:53:44,052 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 02:53:44,052 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 02:53:44,052 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 02:53:44,052 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 02:53:44,053 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 02:53:44" (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-21 02:53:44,121 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 02:53:44,121 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 02:53:44,121 INFO L136 BoogieDeclarations]: Found implementation of procedure Sum [2018-01-21 02:53:44,121 INFO L136 BoogieDeclarations]: Found implementation of procedure Sum2 [2018-01-21 02:53:44,122 INFO L136 BoogieDeclarations]: Found implementation of procedure dummy_abort [2018-01-21 02:53:44,122 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 02:53:44,122 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 02:53:44,122 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 02:53:44,122 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 02:53:44,122 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 02:53:44,122 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 02:53:44,122 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-01-21 02:53:44,123 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-01-21 02:53:44,123 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-01-21 02:53:44,123 INFO L128 BoogieDeclarations]: Found specification of procedure Sum [2018-01-21 02:53:44,123 INFO L128 BoogieDeclarations]: Found specification of procedure Sum2 [2018-01-21 02:53:44,123 INFO L128 BoogieDeclarations]: Found specification of procedure dummy_abort [2018-01-21 02:53:44,123 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 02:53:44,124 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 02:53:44,124 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 02:53:44,372 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 02:53:44,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 02:53:44 BoogieIcfgContainer [2018-01-21 02:53:44,373 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 02:53:44,374 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 02:53:44,374 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 02:53:44,376 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 02:53:44,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 02:53:43" (1/3) ... [2018-01-21 02:53:44,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74f68a3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 02:53:44, skipping insertion in model container [2018-01-21 02:53:44,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 02:53:44" (2/3) ... [2018-01-21 02:53:44,378 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74f68a3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 02:53:44, skipping insertion in model container [2018-01-21 02:53:44,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 02:53:44" (3/3) ... [2018-01-21 02:53:44,380 INFO L105 eAbstractionObserver]: Analyzing ICFG 20051113-1.c_false-valid-memtrack.i [2018-01-21 02:53:44,387 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 02:53:44,394 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-01-21 02:53:44,445 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 02:53:44,446 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 02:53:44,446 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 02:53:44,446 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 02:53:44,446 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 02:53:44,446 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 02:53:44,447 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 02:53:44,447 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == Sum2Err0EnsuresViolation======== [2018-01-21 02:53:44,448 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 02:53:44,472 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-01-21 02:53:44,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-21 02:53:44,481 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 02:53:44,483 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-21 02:53:44,483 INFO L371 AbstractCegarLoop]: === Iteration 1 === [Sum2Err0EnsuresViolation]=== [2018-01-21 02:53:44,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1865297126, now seen corresponding path program 1 times [2018-01-21 02:53:44,492 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 02:53:44,547 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:53:44,547 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 02:53:44,547 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:53:44,548 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 02:53:44,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 02:53:44,623 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 02:53:44,678 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-21 02:53:44,681 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 02:53:44,681 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 02:53:44,682 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 02:53:44,685 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 02:53:44,702 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 02:53:44,703 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 02:53:44,706 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 2 states. [2018-01-21 02:53:44,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 02:53:44,830 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2018-01-21 02:53:44,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 02:53:44,832 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-01-21 02:53:44,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 02:53:44,840 INFO L225 Difference]: With dead ends: 88 [2018-01-21 02:53:44,840 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 02:53:44,843 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-21 02:53:44,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 02:53:44,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 02:53:44,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 02:53:44,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 02:53:44,867 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2018-01-21 02:53:44,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 02:53:44,867 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 02:53:44,867 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 02:53:44,867 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 02:53:44,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 02:53:44,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-21 02:53:44,931 INFO L401 ceAbstractionStarter]: For program point Sum2FINAL(lines 658 666) no Hoare annotation was computed. [2018-01-21 02:53:44,931 INFO L401 ceAbstractionStarter]: For program point Sum2Err0EnsuresViolation(line 657) no Hoare annotation was computed. [2018-01-21 02:53:44,931 INFO L401 ceAbstractionStarter]: For program point L663(line 663) no Hoare annotation was computed. [2018-01-21 02:53:44,932 INFO L404 ceAbstractionStarter]: At program point L662''''(lines 662 664) the Hoare annotation is: true [2018-01-21 02:53:44,932 INFO L401 ceAbstractionStarter]: For program point L662(line 662) no Hoare annotation was computed. [2018-01-21 02:53:44,932 INFO L401 ceAbstractionStarter]: For program point L663'(line 663) no Hoare annotation was computed. [2018-01-21 02:53:44,932 INFO L401 ceAbstractionStarter]: For program point L662'(line 662) no Hoare annotation was computed. [2018-01-21 02:53:44,932 INFO L401 ceAbstractionStarter]: For program point L662'''''(lines 662 664) no Hoare annotation was computed. [2018-01-21 02:53:44,933 INFO L401 ceAbstractionStarter]: For program point L662'''(lines 662 664) no Hoare annotation was computed. [2018-01-21 02:53:44,933 INFO L404 ceAbstractionStarter]: At program point Sum2ENTRY(lines 658 666) the Hoare annotation is: true [2018-01-21 02:53:44,933 INFO L401 ceAbstractionStarter]: For program point Sum2EXIT(lines 658 666) no Hoare annotation was computed. [2018-01-21 02:53:44,933 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 686) no Hoare annotation was computed. [2018-01-21 02:53:44,933 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 686) no Hoare annotation was computed. [2018-01-21 02:53:44,933 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 686) the Hoare annotation is: true [2018-01-21 02:53:44,934 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 686) no Hoare annotation was computed. [2018-01-21 02:53:44,934 INFO L404 ceAbstractionStarter]: At program point #Ultimate.C_memsetENTRY(line -1) the Hoare annotation is: true [2018-01-21 02:53:44,934 INFO L404 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-01-21 02:53:44,934 INFO L401 ceAbstractionStarter]: For program point #Ultimate.C_memsetFINAL(line -1) no Hoare annotation was computed. [2018-01-21 02:53:44,934 INFO L401 ceAbstractionStarter]: For program point #Ultimate.C_memsetEXIT(line -1) no Hoare annotation was computed. [2018-01-21 02:53:44,934 INFO L404 ceAbstractionStarter]: At program point dummy_abortFINAL(lines 667 669) the Hoare annotation is: true [2018-01-21 02:53:44,934 INFO L401 ceAbstractionStarter]: For program point dummy_abortEXIT(lines 667 669) no Hoare annotation was computed. [2018-01-21 02:53:44,934 INFO L401 ceAbstractionStarter]: For program point dummy_abortErr0EnsuresViolation(lines 667 669) no Hoare annotation was computed. [2018-01-21 02:53:44,935 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 686) the Hoare annotation is: true [2018-01-21 02:53:44,935 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 686) no Hoare annotation was computed. [2018-01-21 02:53:44,935 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 686) the Hoare annotation is: true [2018-01-21 02:53:44,935 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 686) no Hoare annotation was computed. [2018-01-21 02:53:44,935 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 686) no Hoare annotation was computed. [2018-01-21 02:53:44,935 INFO L401 ceAbstractionStarter]: For program point L652'''(lines 652 654) no Hoare annotation was computed. [2018-01-21 02:53:44,935 INFO L401 ceAbstractionStarter]: For program point L652(line 652) no Hoare annotation was computed. [2018-01-21 02:53:44,935 INFO L401 ceAbstractionStarter]: For program point L652'''''(lines 652 654) no Hoare annotation was computed. [2018-01-21 02:53:44,935 INFO L401 ceAbstractionStarter]: For program point SumEXIT(lines 648 656) no Hoare annotation was computed. [2018-01-21 02:53:44,935 INFO L401 ceAbstractionStarter]: For program point L652'(line 652) no Hoare annotation was computed. [2018-01-21 02:53:44,936 INFO L404 ceAbstractionStarter]: At program point L652''''(lines 652 654) the Hoare annotation is: true [2018-01-21 02:53:44,936 INFO L401 ceAbstractionStarter]: For program point L653(line 653) no Hoare annotation was computed. [2018-01-21 02:53:44,936 INFO L404 ceAbstractionStarter]: At program point SumENTRY(lines 648 656) the Hoare annotation is: true [2018-01-21 02:53:44,936 INFO L401 ceAbstractionStarter]: For program point SumErr0EnsuresViolation(line 647) no Hoare annotation was computed. [2018-01-21 02:53:44,936 INFO L401 ceAbstractionStarter]: For program point L653'(line 653) no Hoare annotation was computed. [2018-01-21 02:53:44,936 INFO L401 ceAbstractionStarter]: For program point SumFINAL(lines 648 656) no Hoare annotation was computed. [2018-01-21 02:53:44,937 INFO L404 ceAbstractionStarter]: At program point L681(line 681) the Hoare annotation is: true [2018-01-21 02:53:44,937 INFO L401 ceAbstractionStarter]: For program point L680(line 680) no Hoare annotation was computed. [2018-01-21 02:53:44,937 INFO L404 ceAbstractionStarter]: At program point L683(line 683) the Hoare annotation is: true [2018-01-21 02:53:44,937 INFO L401 ceAbstractionStarter]: For program point L682(line 682) no Hoare annotation was computed. [2018-01-21 02:53:44,937 INFO L401 ceAbstractionStarter]: For program point L682''(lines 682 683) no Hoare annotation was computed. [2018-01-21 02:53:44,937 INFO L401 ceAbstractionStarter]: For program point L672'(line 672) no Hoare annotation was computed. [2018-01-21 02:53:44,937 INFO L401 ceAbstractionStarter]: For program point L682'(lines 682 683) no Hoare annotation was computed. [2018-01-21 02:53:44,937 INFO L404 ceAbstractionStarter]: At program point L680'(lines 680 681) the Hoare annotation is: true [2018-01-21 02:53:44,938 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 670 686) no Hoare annotation was computed. [2018-01-21 02:53:44,938 INFO L401 ceAbstractionStarter]: For program point L674(line 674) no Hoare annotation was computed. [2018-01-21 02:53:44,938 INFO L401 ceAbstractionStarter]: For program point L673(line 673) no Hoare annotation was computed. [2018-01-21 02:53:44,938 INFO L404 ceAbstractionStarter]: At program point L672(line 672) the Hoare annotation is: true [2018-01-21 02:53:44,938 INFO L401 ceAbstractionStarter]: For program point L671(line 671) no Hoare annotation was computed. [2018-01-21 02:53:44,938 INFO L401 ceAbstractionStarter]: For program point L678(line 678) no Hoare annotation was computed. [2018-01-21 02:53:44,938 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 670 686) no Hoare annotation was computed. [2018-01-21 02:53:44,939 INFO L401 ceAbstractionStarter]: For program point L673'(line 673) no Hoare annotation was computed. [2018-01-21 02:53:44,939 INFO L401 ceAbstractionStarter]: For program point L677(line 677) no Hoare annotation was computed. [2018-01-21 02:53:44,939 INFO L401 ceAbstractionStarter]: For program point L676(line 676) no Hoare annotation was computed. [2018-01-21 02:53:44,939 INFO L401 ceAbstractionStarter]: For program point L675(line 675) no Hoare annotation was computed. [2018-01-21 02:53:44,939 INFO L404 ceAbstractionStarter]: At program point L679(line 679) the Hoare annotation is: true [2018-01-21 02:53:44,939 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 670 686) no Hoare annotation was computed. [2018-01-21 02:53:44,939 INFO L404 ceAbstractionStarter]: At program point mainENTRY(lines 670 686) the Hoare annotation is: true [2018-01-21 02:53:44,943 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 02:53:44,943 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 02:53:44,944 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 02:53:44,944 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 02:53:44,944 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 02:53:44,944 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 02:53:44,944 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 02:53:44,944 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 02:53:44,945 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 02:53:44,947 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-01-21 02:53:44,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 02:53:44,948 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 02:53:44,948 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 02:53:44,948 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 02:53:44,948 INFO L82 PathProgramCache]: Analyzing trace with hash 128549, now seen corresponding path program 1 times [2018-01-21 02:53:44,948 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 02:53:44,949 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:53:44,950 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 02:53:44,950 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:53:44,950 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 02:53:44,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 02:53:44,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 02:53:44,978 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 02:53:44,982 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 02:53:44,986 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 02:53:44,987 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 02:53:44,987 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 02:53:44,987 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 02:53:44,987 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 02:53:44,987 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 02:53:44,987 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 02:53:44,987 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == dummy_abortErr0EnsuresViolation======== [2018-01-21 02:53:44,988 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 02:53:44,990 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-01-21 02:53:44,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-21 02:53:44,991 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 02:53:44,992 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] [2018-01-21 02:53:44,992 INFO L371 AbstractCegarLoop]: === Iteration 1 === [dummy_abortErr0EnsuresViolation]=== [2018-01-21 02:53:44,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1195103445, now seen corresponding path program 1 times [2018-01-21 02:53:44,992 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 02:53:44,993 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:53:44,993 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 02:53:44,994 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:53:44,994 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 02:53:45,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 02:53:45,019 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 02:53:45,045 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-21 02:53:45,045 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 02:53:45,046 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 02:53:45,046 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 02:53:45,046 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 02:53:45,046 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 02:53:45,046 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 02:53:45,047 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 2 states. [2018-01-21 02:53:45,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 02:53:45,054 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2018-01-21 02:53:45,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 02:53:45,055 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 29 [2018-01-21 02:53:45,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 02:53:45,055 INFO L225 Difference]: With dead ends: 88 [2018-01-21 02:53:45,055 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 02:53:45,056 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-21 02:53:45,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 02:53:45,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 02:53:45,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 02:53:45,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 02:53:45,057 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2018-01-21 02:53:45,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 02:53:45,057 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 02:53:45,057 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 02:53:45,058 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 02:53:45,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 02:53:45,060 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 02:53:45,060 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 02:53:45,060 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 02:53:45,060 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 02:53:45,060 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 02:53:45,060 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 02:53:45,060 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 02:53:45,061 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 02:53:45,061 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 02:53:45,062 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-01-21 02:53:45,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-21 02:53:45,065 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 02:53:45,065 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 02:53:45,065 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 02:53:45,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1502761729, now seen corresponding path program 1 times [2018-01-21 02:53:45,066 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 02:53:45,067 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:53:45,067 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 02:53:45,067 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:53:45,067 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 02:53:45,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 02:53:45,086 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 02:53:45,113 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-21 02:53:45,113 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 02:53:45,113 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 02:53:45,113 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 02:53:45,114 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 02:53:45,114 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 02:53:45,114 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 02:53:45,115 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 2 states. [2018-01-21 02:53:45,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 02:53:45,123 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2018-01-21 02:53:45,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 02:53:45,123 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 39 [2018-01-21 02:53:45,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 02:53:45,127 INFO L225 Difference]: With dead ends: 88 [2018-01-21 02:53:45,127 INFO L226 Difference]: Without dead ends: 54 [2018-01-21 02:53:45,128 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-21 02:53:45,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-21 02:53:45,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-21 02:53:45,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-21 02:53:45,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-01-21 02:53:45,148 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 39 [2018-01-21 02:53:45,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 02:53:45,149 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-01-21 02:53:45,149 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 02:53:45,149 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-01-21 02:53:45,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-21 02:53:45,151 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 02:53:45,152 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 02:53:45,152 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 02:53:45,152 INFO L82 PathProgramCache]: Analyzing trace with hash -809322687, now seen corresponding path program 1 times [2018-01-21 02:53:45,152 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 02:53:45,153 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:53:45,153 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 02:53:45,154 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:53:45,154 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 02:53:45,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 02:53:45,179 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 02:53:45,258 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-21 02:53:45,258 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 02:53:45,258 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 02:53:45,258 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 02:53:45,260 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 02:53:45,261 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 02:53:45,261 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 02:53:45,261 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 5 states. [2018-01-21 02:53:45,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 02:53:45,356 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2018-01-21 02:53:45,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 02:53:45,357 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-01-21 02:53:45,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 02:53:45,358 INFO L225 Difference]: With dead ends: 69 [2018-01-21 02:53:45,358 INFO L226 Difference]: Without dead ends: 64 [2018-01-21 02:53:45,359 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 02:53:45,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-21 02:53:45,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2018-01-21 02:53:45,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-21 02:53:45,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-01-21 02:53:45,368 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 43 [2018-01-21 02:53:45,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 02:53:45,368 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-01-21 02:53:45,368 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 02:53:45,368 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-01-21 02:53:45,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-21 02:53:45,369 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 02:53:45,369 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 02:53:45,369 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 02:53:45,369 INFO L82 PathProgramCache]: Analyzing trace with hash 2078335056, now seen corresponding path program 1 times [2018-01-21 02:53:45,370 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 02:53:45,370 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:53:45,370 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 02:53:45,371 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:53:45,371 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 02:53:45,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 02:53:45,387 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 02:53:45,459 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-21 02:53:45,460 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 02:53:45,460 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 02:53:45,460 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 02:53:45,461 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 02:53:45,461 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 02:53:45,461 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 02:53:45,461 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 4 states. [2018-01-21 02:53:45,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 02:53:45,571 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2018-01-21 02:53:45,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 02:53:45,572 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-01-21 02:53:45,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 02:53:45,573 INFO L225 Difference]: With dead ends: 62 [2018-01-21 02:53:45,573 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 02:53:45,574 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 02:53:45,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 02:53:45,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 02:53:45,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 02:53:45,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 02:53:45,575 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2018-01-21 02:53:45,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 02:53:45,576 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 02:53:45,576 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 02:53:45,576 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 02:53:45,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 02:53:45,578 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 02:53:45,578 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 02:53:45,578 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 02:53:45,579 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 02:53:45,579 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 02:53:45,579 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 02:53:45,579 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 02:53:45,579 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == SumErr0EnsuresViolation======== [2018-01-21 02:53:45,579 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 02:53:45,581 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-01-21 02:53:45,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-21 02:53:45,582 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 02:53:45,582 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-21 02:53:45,582 INFO L371 AbstractCegarLoop]: === Iteration 1 === [SumErr0EnsuresViolation]=== [2018-01-21 02:53:45,583 INFO L82 PathProgramCache]: Analyzing trace with hash 112235281, now seen corresponding path program 1 times [2018-01-21 02:53:45,583 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 02:53:45,584 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:53:45,584 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 02:53:45,584 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:53:45,584 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 02:53:45,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 02:53:45,595 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 02:53:45,608 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-21 02:53:45,608 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 02:53:45,608 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 02:53:45,608 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 02:53:45,609 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 02:53:45,609 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 02:53:45,609 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 02:53:45,610 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 2 states. [2018-01-21 02:53:45,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 02:53:45,615 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2018-01-21 02:53:45,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 02:53:45,615 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2018-01-21 02:53:45,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 02:53:45,615 INFO L225 Difference]: With dead ends: 88 [2018-01-21 02:53:45,616 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 02:53:45,616 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-21 02:53:45,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 02:53:45,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 02:53:45,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 02:53:45,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 02:53:45,617 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2018-01-21 02:53:45,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 02:53:45,617 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 02:53:45,617 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 02:53:45,617 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 02:53:45,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 02:53:45,618 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 02:53:45,619 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 02:53:45,619 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 02:53:45,619 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 02:53:45,619 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 02:53:45,619 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 02:53:45,619 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 02:53:45,619 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 02:53:45,619 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 02:53:45,620 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-01-21 02:53:45,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-21 02:53:45,622 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 02:53:45,622 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 02:53:45,622 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 02:53:45,622 INFO L82 PathProgramCache]: Analyzing trace with hash -2005137936, now seen corresponding path program 1 times [2018-01-21 02:53:45,622 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 02:53:45,623 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:53:45,624 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 02:53:45,624 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:53:45,624 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 02:53:45,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 02:53:45,634 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 02:53:45,648 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-21 02:53:45,649 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 02:53:45,649 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 02:53:45,649 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 02:53:45,649 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 02:53:45,649 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 02:53:45,650 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 02:53:45,650 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 2 states. [2018-01-21 02:53:45,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 02:53:45,655 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2018-01-21 02:53:45,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 02:53:45,655 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 37 [2018-01-21 02:53:45,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 02:53:45,657 INFO L225 Difference]: With dead ends: 88 [2018-01-21 02:53:45,657 INFO L226 Difference]: Without dead ends: 52 [2018-01-21 02:53:45,658 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-21 02:53:45,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-21 02:53:45,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-21 02:53:45,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-21 02:53:45,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-01-21 02:53:45,665 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 37 [2018-01-21 02:53:45,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 02:53:45,665 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-01-21 02:53:45,665 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 02:53:45,665 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-01-21 02:53:45,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-21 02:53:45,666 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 02:53:45,667 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 02:53:45,667 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 02:53:45,667 INFO L82 PathProgramCache]: Analyzing trace with hash -336037328, now seen corresponding path program 1 times [2018-01-21 02:53:45,667 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 02:53:45,668 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:53:45,668 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 02:53:45,668 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:53:45,668 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 02:53:45,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 02:53:45,683 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 02:53:45,733 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-21 02:53:45,733 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 02:53:45,733 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 02:53:45,733 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 02:53:45,734 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 02:53:45,734 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 02:53:45,734 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 02:53:45,734 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 5 states. [2018-01-21 02:53:45,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 02:53:45,760 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2018-01-21 02:53:45,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 02:53:45,760 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-01-21 02:53:45,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 02:53:45,762 INFO L225 Difference]: With dead ends: 65 [2018-01-21 02:53:45,762 INFO L226 Difference]: Without dead ends: 62 [2018-01-21 02:53:45,762 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 02:53:45,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-21 02:53:45,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2018-01-21 02:53:45,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-21 02:53:45,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2018-01-21 02:53:45,767 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 41 [2018-01-21 02:53:45,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 02:53:45,767 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2018-01-21 02:53:45,767 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 02:53:45,768 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2018-01-21 02:53:45,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-21 02:53:45,768 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 02:53:45,768 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 02:53:45,769 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-21 02:53:45,769 INFO L82 PathProgramCache]: Analyzing trace with hash 609983231, now seen corresponding path program 1 times [2018-01-21 02:53:45,769 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 02:53:45,769 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:53:45,770 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 02:53:45,770 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:53:45,770 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 02:53:45,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 02:53:45,784 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 02:53:45,835 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-21 02:53:45,835 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 02:53:45,835 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 02:53:45,836 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 02:53:45,836 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 02:53:45,836 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 02:53:45,836 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 02:53:45,837 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand 5 states. [2018-01-21 02:53:45,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 02:53:45,881 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2018-01-21 02:53:45,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 02:53:45,882 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-01-21 02:53:45,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 02:53:45,883 INFO L225 Difference]: With dead ends: 96 [2018-01-21 02:53:45,883 INFO L226 Difference]: Without dead ends: 69 [2018-01-21 02:53:45,884 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 02:53:45,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-21 02:53:45,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-01-21 02:53:45,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-21 02:53:45,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2018-01-21 02:53:45,891 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 44 [2018-01-21 02:53:45,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 02:53:45,891 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2018-01-21 02:53:45,891 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 02:53:45,892 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2018-01-21 02:53:45,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-21 02:53:45,893 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 02:53:45,893 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, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 02:53:45,893 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-21 02:53:45,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1680046266, now seen corresponding path program 1 times [2018-01-21 02:53:45,893 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 02:53:45,894 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:53:45,894 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 02:53:45,895 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:53:45,895 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 02:53:45,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 02:53:45,915 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 02:53:46,150 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-21 02:53:46,151 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 02:53:46,151 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 02:53:46,151 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 02:53:46,151 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 02:53:46,152 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 02:53:46,152 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-21 02:53:46,152 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand 6 states. [2018-01-21 02:53:46,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 02:53:46,318 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2018-01-21 02:53:46,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-21 02:53:46,332 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-01-21 02:53:46,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 02:53:46,355 INFO L225 Difference]: With dead ends: 76 [2018-01-21 02:53:46,357 INFO L226 Difference]: Without dead ends: 65 [2018-01-21 02:53:46,358 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-21 02:53:46,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-21 02:53:46,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2018-01-21 02:53:46,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-21 02:53:46,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-01-21 02:53:46,376 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 47 [2018-01-21 02:53:46,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 02:53:46,383 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-01-21 02:53:46,383 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 02:53:46,383 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-01-21 02:53:46,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-21 02:53:46,384 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 02:53:46,384 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 02:53:46,385 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation]=== [2018-01-21 02:53:46,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1025820889, now seen corresponding path program 1 times [2018-01-21 02:53:46,390 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 02:53:46,391 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:53:46,391 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 02:53:46,392 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:53:46,392 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 02:53:46,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 02:53:46,443 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 02:53:46,789 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 02:53:46,790 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 02:53:46,790 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 02:53:46,791 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 51 with the following transitions: [2018-01-21 02:53:46,792 INFO L201 CegarAbsIntRunner]: [0], [4], [5], [8], [10], [11], [12], [14], [18], [19], [21], [27], [28], [29], [31], [35], [36], [39], [49], [50], [52], [53], [55], [56], [57], [58], [59], [60], [61], [62], [66], [72], [78], [80], [82], [83], [84], [90], [91], [92], [93], [94], [95], [96], [97], [100], [101], [102] [2018-01-21 02:53:46,861 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 02:53:46,862 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 02:53:48,447 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 02:53:48,449 INFO L268 AbstractInterpreter]: Visited 48 different actions 60 times. Merged at 11 different actions 11 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 20 variables. [2018-01-21 02:53:48,487 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 02:53:48,488 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 02:53:48,488 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-21 02:53:48,501 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 02:53:48,501 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 02:53:48,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 02:53:48,543 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 02:53:48,584 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-21 02:53:48,584 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 02:53:48,655 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-21 02:53:48,692 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-21 02:53:48,692 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [8] total 12 [2018-01-21 02:53:48,693 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 02:53:48,693 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 02:53:48,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 02:53:48,694 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-01-21 02:53:48,695 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 4 states. [2018-01-21 02:53:48,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 02:53:48,878 INFO L93 Difference]: Finished difference Result 115 states and 127 transitions. [2018-01-21 02:53:48,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 02:53:48,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-01-21 02:53:48,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 02:53:48,883 INFO L225 Difference]: With dead ends: 115 [2018-01-21 02:53:48,883 INFO L226 Difference]: Without dead ends: 63 [2018-01-21 02:53:48,884 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 96 SyntacticMatches, 10 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-01-21 02:53:48,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-21 02:53:48,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-01-21 02:53:48,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-21 02:53:48,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2018-01-21 02:53:48,900 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 50 [2018-01-21 02:53:48,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 02:53:48,900 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2018-01-21 02:53:48,900 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 02:53:48,900 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2018-01-21 02:53:48,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-21 02:53:48,901 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 02:53:48,902 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 02:53:48,902 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation]=== [2018-01-21 02:53:48,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1453151358, now seen corresponding path program 1 times [2018-01-21 02:53:48,902 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 02:53:48,903 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:53:48,903 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 02:53:48,904 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:53:48,904 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 02:53:48,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 02:53:48,922 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 02:53:49,230 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-21 02:53:49,230 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 02:53:49,230 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 02:53:49,230 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 52 with the following transitions: [2018-01-21 02:53:49,230 INFO L201 CegarAbsIntRunner]: [0], [4], [5], [8], [10], [11], [12], [14], [18], [19], [21], [25], [27], [28], [29], [31], [35], [36], [39], [49], [50], [52], [53], [55], [56], [57], [58], [59], [60], [61], [62], [66], [72], [78], [80], [82], [83], [84], [90], [91], [92], [93], [94], [95], [96], [97], [100], [101], [102] [2018-01-21 02:53:49,232 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 02:53:49,233 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 02:53:53,491 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 02:53:53,491 INFO L268 AbstractInterpreter]: Visited 49 different actions 69 times. Merged at 14 different actions 17 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 20 variables. [2018-01-21 02:53:53,513 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 02:53:53,514 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 02:53:53,514 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-21 02:53:53,521 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 02:53:53,521 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 02:53:53,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 02:53:53,549 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 02:53:53,610 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-21 02:53:53,610 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 02:53:53,702 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-21 02:53:53,723 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 02:53:53,723 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 02:53:53,781 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 02:53:53,782 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 02:53:53,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 02:53:53,839 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 02:53:53,847 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-21 02:53:53,847 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 02:53:53,886 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-21 02:53:53,888 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 02:53:53,888 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5, 5, 5] total 14 [2018-01-21 02:53:53,888 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 02:53:53,889 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-21 02:53:53,889 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-21 02:53:53,889 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-01-21 02:53:53,889 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 11 states. [2018-01-21 02:53:54,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 02:53:54,074 INFO L93 Difference]: Finished difference Result 118 states and 130 transitions. [2018-01-21 02:53:54,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-21 02:53:54,075 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 51 [2018-01-21 02:53:54,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 02:53:54,076 INFO L225 Difference]: With dead ends: 118 [2018-01-21 02:53:54,076 INFO L226 Difference]: Without dead ends: 63 [2018-01-21 02:53:54,077 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 196 SyntacticMatches, 11 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-01-21 02:53:54,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-21 02:53:54,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2018-01-21 02:53:54,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-21 02:53:54,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-01-21 02:53:54,083 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 51 [2018-01-21 02:53:54,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 02:53:54,083 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-01-21 02:53:54,083 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-21 02:53:54,083 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-01-21 02:53:54,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-21 02:53:54,084 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 02:53:54,085 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 02:53:54,085 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation]=== [2018-01-21 02:53:54,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1200306608, now seen corresponding path program 1 times [2018-01-21 02:53:54,085 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 02:53:54,086 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:53:54,086 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 02:53:54,086 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:53:54,086 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 02:53:54,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 02:53:54,102 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 02:53:54,313 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-21 02:53:54,314 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 02:53:54,314 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 02:53:54,314 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2018-01-21 02:53:54,314 INFO L201 CegarAbsIntRunner]: [0], [4], [5], [8], [10], [11], [12], [14], [18], [19], [21], [25], [27], [28], [31], [35], [36], [39], [41], [42], [43], [45], [49], [50], [52], [53], [55], [56], [57], [58], [59], [60], [61], [62], [69], [72], [78], [80], [82], [83], [84], [90], [91], [92], [93], [96], [97], [100], [101], [102] [2018-01-21 02:53:54,317 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 02:53:54,317 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 02:53:56,763 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 02:53:56,763 INFO L268 AbstractInterpreter]: Visited 50 different actions 81 times. Merged at 24 different actions 27 times. Never widened. Found 6 fixpoints after 5 different actions. Largest state had 20 variables. [2018-01-21 02:53:56,769 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 02:53:56,770 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 02:53:56,770 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-21 02:53:56,786 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 02:53:56,786 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 02:53:56,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 02:53:56,809 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 02:53:56,874 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-21 02:53:56,877 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 02:53:57,115 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-21 02:53:57,150 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 02:53:57,150 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) [2018-01-21 02:53:57,159 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 02:53:57,160 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 02:53:57,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 02:53:57,219 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 02:53:57,238 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-21 02:53:57,239 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 02:53:57,297 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-21 02:53:57,298 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 02:53:57,298 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6, 6, 6] total 17 [2018-01-21 02:53:57,299 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 02:53:57,299 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-21 02:53:57,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-21 02:53:57,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-01-21 02:53:57,299 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 13 states. [2018-01-21 02:53:57,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 02:53:57,687 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2018-01-21 02:53:57,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-21 02:53:57,688 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2018-01-21 02:53:57,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 02:53:57,688 INFO L225 Difference]: With dead ends: 121 [2018-01-21 02:53:57,688 INFO L226 Difference]: Without dead ends: 70 [2018-01-21 02:53:57,689 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 210 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2018-01-21 02:53:57,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-21 02:53:57,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2018-01-21 02:53:57,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-21 02:53:57,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2018-01-21 02:53:57,694 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 55 [2018-01-21 02:53:57,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 02:53:57,694 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2018-01-21 02:53:57,694 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-21 02:53:57,695 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2018-01-21 02:53:57,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-21 02:53:57,695 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 02:53:57,696 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-01-21 02:53:57,696 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation]=== [2018-01-21 02:53:57,696 INFO L82 PathProgramCache]: Analyzing trace with hash -2066944597, now seen corresponding path program 2 times [2018-01-21 02:53:57,696 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 02:53:57,697 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:53:57,700 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 02:53:57,700 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:53:57,700 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 02:53:57,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 02:53:57,750 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 02:53:57,925 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-21 02:53:57,926 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 02:53:57,926 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 02:53:57,926 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 02:53:57,926 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 02:53:57,926 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 02:53:57,926 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-21 02:53:57,933 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-21 02:53:57,933 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 02:53:57,951 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 02:53:57,962 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 02:53:57,963 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 02:53:57,966 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 02:53:58,026 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-21 02:53:58,026 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 02:53:58,101 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-21 02:53:58,122 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 02:53:58,122 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 02:53:58,126 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-21 02:53:58,126 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 02:53:58,144 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 02:53:58,171 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 02:53:58,185 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 02:53:58,190 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 02:53:58,198 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-21 02:53:58,198 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 02:53:58,229 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-21 02:53:58,231 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 02:53:58,231 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7] total 17 [2018-01-21 02:53:58,231 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 02:53:58,231 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-21 02:53:58,232 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-21 02:53:58,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2018-01-21 02:53:58,232 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand 12 states. [2018-01-21 02:53:58,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 02:53:58,259 INFO L93 Difference]: Finished difference Result 122 states and 132 transitions. [2018-01-21 02:53:58,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-21 02:53:58,259 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2018-01-21 02:53:58,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 02:53:58,260 INFO L225 Difference]: With dead ends: 122 [2018-01-21 02:53:58,260 INFO L226 Difference]: Without dead ends: 68 [2018-01-21 02:53:58,261 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 236 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=191, Unknown=0, NotChecked=0, Total=306 [2018-01-21 02:53:58,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-21 02:53:58,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-01-21 02:53:58,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-21 02:53:58,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2018-01-21 02:53:58,266 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 62 [2018-01-21 02:53:58,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 02:53:58,267 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2018-01-21 02:53:58,267 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-21 02:53:58,267 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2018-01-21 02:53:58,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-21 02:53:58,268 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 02:53:58,268 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 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] [2018-01-21 02:53:58,268 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation]=== [2018-01-21 02:53:58,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1647895852, now seen corresponding path program 3 times [2018-01-21 02:53:58,269 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 02:53:58,269 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:53:58,270 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-21 02:53:58,270 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:53:58,270 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 02:53:58,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 02:53:58,286 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 02:53:58,386 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-21 02:53:58,387 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 02:53:58,387 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 02:53:58,387 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 02:53:58,387 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 02:53:58,387 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 02:53:58,387 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-21 02:53:58,395 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-21 02:53:58,395 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-21 02:53:58,413 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-21 02:53:58,428 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-21 02:53:58,431 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 02:53:58,437 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 02:53:58,468 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-21 02:53:58,471 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-21 02:53:58,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 02:53:58,472 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:53:58,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:53:58,475 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-21 02:53:58,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-21 02:53:58,489 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,490 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 31 [2018-01-21 02:53:58,492 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 02:53:58,497 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:53:58,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:53:58,503 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-01-21 02:53:58,536 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 30 treesize of output 23 [2018-01-21 02:53:58,544 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,545 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,545 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,546 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,547 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,547 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 78 [2018-01-21 02:53:58,549 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 02:53:58,559 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:53:58,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:53:58,565 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-01-21 02:53:58,583 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 39 treesize of output 30 [2018-01-21 02:53:58,587 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,588 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,589 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,590 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,600 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,601 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,602 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,603 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,608 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,609 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,610 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,611 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 149 [2018-01-21 02:53:58,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 02:53:58,647 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:53:58,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:53:58,653 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-01-21 02:53:58,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 37 [2018-01-21 02:53:58,678 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,678 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,679 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,680 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,680 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,681 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,681 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,682 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,683 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,683 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,684 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,685 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,685 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,686 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,687 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,688 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 206 [2018-01-21 02:53:58,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 02:53:58,712 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:53:58,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:53:58,720 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-01-21 02:53:58,744 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 57 treesize of output 44 [2018-01-21 02:53:58,748 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,749 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,749 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,750 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,751 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,751 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,752 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,752 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,753 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,754 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,754 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,755 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,755 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,756 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,756 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,757 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,758 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,758 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,759 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,759 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,760 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 253 [2018-01-21 02:53:58,762 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 02:53:58,808 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:53:58,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:53:58,818 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:60, output treesize:56 [2018-01-21 02:53:58,843 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 66 treesize of output 51 [2018-01-21 02:53:58,847 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,847 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,848 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,848 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,849 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,850 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,850 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,851 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,851 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,852 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,852 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,853 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,853 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,854 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,855 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,856 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,856 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,857 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,858 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,858 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,859 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,859 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,860 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,861 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,861 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,862 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,862 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:58,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 27 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 308 [2018-01-21 02:53:58,864 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 02:53:58,907 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:53:58,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:53:58,917 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:69, output treesize:65 [2018-01-21 02:53:59,155 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-21 02:53:59,156 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 02:53:59,157 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-21 02:53:59,157 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:121, output treesize:1 [2018-01-21 02:53:59,178 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-01-21 02:53:59,179 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 02:53:59,421 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-01-21 02:53:59,443 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 02:53:59,443 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 02:53:59,447 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-21 02:53:59,447 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-21 02:53:59,469 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-21 02:53:59,494 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-21 02:53:59,521 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 02:53:59,527 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 02:53:59,532 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-21 02:53:59,534 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-21 02:53:59,534 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 02:53:59,535 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:53:59,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:53:59,539 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-21 02:53:59,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-21 02:53:59,545 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,545 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 31 [2018-01-21 02:53:59,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 02:53:59,554 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:53:59,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:53:59,561 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-01-21 02:53:59,565 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 30 treesize of output 23 [2018-01-21 02:53:59,567 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,568 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,568 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,569 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,569 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,570 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 78 [2018-01-21 02:53:59,571 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 02:53:59,580 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:53:59,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:53:59,585 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-01-21 02:53:59,588 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 39 treesize of output 30 [2018-01-21 02:53:59,591 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,591 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,592 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,592 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,593 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,593 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,594 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,595 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,595 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,596 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,597 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,598 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 149 [2018-01-21 02:53:59,599 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 02:53:59,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:53:59,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:53:59,625 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-01-21 02:53:59,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 37 [2018-01-21 02:53:59,632 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,633 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,633 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,634 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,635 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,635 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,636 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,636 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,637 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,638 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,638 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,639 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,640 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,641 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,641 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,642 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 206 [2018-01-21 02:53:59,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 02:53:59,668 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:53:59,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:53:59,675 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-01-21 02:53:59,679 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 57 treesize of output 44 [2018-01-21 02:53:59,682 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,683 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,684 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,684 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,685 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,686 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,687 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,687 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,688 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,689 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,689 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,690 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,691 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,691 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,692 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,693 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,694 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,695 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,695 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,696 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,697 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 253 [2018-01-21 02:53:59,698 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 02:53:59,745 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:53:59,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:53:59,754 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:60, output treesize:56 [2018-01-21 02:53:59,758 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 66 treesize of output 51 [2018-01-21 02:53:59,761 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,762 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,762 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,763 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,763 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,764 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,765 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,765 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,766 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,766 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,767 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,767 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,768 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,768 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,769 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,769 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,770 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,771 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,771 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,772 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,772 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,773 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,773 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,774 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,774 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,775 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,776 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:53:59,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 27 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 308 [2018-01-21 02:53:59,777 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 02:53:59,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:53:59,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:53:59,833 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:69, output treesize:65 [2018-01-21 02:53:59,914 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-01-21 02:53:59,915 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 02:54:00,033 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-01-21 02:54:00,034 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 02:54:00,035 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 16, 7, 16, 7] total 28 [2018-01-21 02:54:00,035 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 02:54:00,035 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-21 02:54:00,035 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-21 02:54:00,036 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=633, Unknown=0, NotChecked=0, Total=756 [2018-01-21 02:54:00,036 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand 22 states. [2018-01-21 02:54:00,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 02:54:00,459 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2018-01-21 02:54:00,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-21 02:54:00,459 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 63 [2018-01-21 02:54:00,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 02:54:00,460 INFO L225 Difference]: With dead ends: 135 [2018-01-21 02:54:00,460 INFO L226 Difference]: Without dead ends: 78 [2018-01-21 02:54:00,461 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 217 SyntacticMatches, 16 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 730 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=252, Invalid=1308, Unknown=0, NotChecked=0, Total=1560 [2018-01-21 02:54:00,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-21 02:54:00,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2018-01-21 02:54:00,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-21 02:54:00,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2018-01-21 02:54:00,468 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 63 [2018-01-21 02:54:00,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 02:54:00,469 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2018-01-21 02:54:00,469 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-21 02:54:00,469 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2018-01-21 02:54:00,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-01-21 02:54:00,470 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 02:54:00,470 INFO L322 BasicCegarLoop]: trace histogram [5, 3, 3, 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] [2018-01-21 02:54:00,470 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation]=== [2018-01-21 02:54:00,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1961550311, now seen corresponding path program 4 times [2018-01-21 02:54:00,471 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 02:54:00,471 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:54:00,472 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-21 02:54:00,472 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:54:00,472 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 02:54:00,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 02:54:00,490 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 02:54:00,617 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 02:54:00,618 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 02:54:00,618 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 02:54:00,618 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 02:54:00,618 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 02:54:00,618 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 02:54:00,618 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-21 02:54:00,631 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-21 02:54:00,631 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-01-21 02:54:00,673 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 02:54:00,677 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 02:54:00,740 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 02:54:00,741 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 02:54:00,872 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 02:54:00,893 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 02:54:00,894 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 02:54:00,897 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-21 02:54:00,897 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-01-21 02:54:00,955 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 02:54:00,960 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 02:54:00,965 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 02:54:00,966 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 02:54:00,995 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 02:54:00,997 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 02:54:00,997 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 9] total 23 [2018-01-21 02:54:00,997 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 02:54:00,998 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-21 02:54:00,998 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-21 02:54:00,998 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=320, Unknown=0, NotChecked=0, Total=506 [2018-01-21 02:54:00,998 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 16 states. [2018-01-21 02:54:01,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 02:54:01,039 INFO L93 Difference]: Finished difference Result 136 states and 146 transitions. [2018-01-21 02:54:01,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-21 02:54:01,040 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 70 [2018-01-21 02:54:01,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 02:54:01,041 INFO L225 Difference]: With dead ends: 136 [2018-01-21 02:54:01,041 INFO L226 Difference]: Without dead ends: 76 [2018-01-21 02:54:01,041 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 264 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=203, Invalid=349, Unknown=0, NotChecked=0, Total=552 [2018-01-21 02:54:01,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-21 02:54:01,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-01-21 02:54:01,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-21 02:54:01,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2018-01-21 02:54:01,049 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 70 [2018-01-21 02:54:01,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 02:54:01,049 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2018-01-21 02:54:01,050 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-21 02:54:01,050 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2018-01-21 02:54:01,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-01-21 02:54:01,051 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 02:54:01,051 INFO L322 BasicCegarLoop]: trace histogram [6, 3, 3, 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] [2018-01-21 02:54:01,051 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation]=== [2018-01-21 02:54:01,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1168255472, now seen corresponding path program 5 times [2018-01-21 02:54:01,051 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 02:54:01,052 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:54:01,052 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-21 02:54:01,052 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:54:01,052 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 02:54:01,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 02:54:01,066 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 02:54:01,156 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 02:54:01,156 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 02:54:01,157 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 02:54:01,157 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 02:54:01,157 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 02:54:01,157 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 02:54:01,157 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-21 02:54:01,162 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-21 02:54:01,163 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 02:54:01,170 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 02:54:01,180 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 02:54:01,186 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 02:54:01,199 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 02:54:01,201 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 02:54:01,204 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 02:54:01,267 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 02:54:01,267 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 02:54:01,374 WARN L143 SmtUtils]: Spent 100ms on a formula simplification that was a NOOP. DAG size: 26 [2018-01-21 02:54:01,624 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 02:54:01,657 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 02:54:01,658 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 14 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 02:54:01,661 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-21 02:54:01,661 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 02:54:01,671 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 02:54:01,677 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 02:54:01,689 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 02:54:01,733 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 02:54:01,749 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 02:54:01,754 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 02:54:01,761 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 02:54:01,761 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 02:54:01,807 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 02:54:01,808 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 02:54:01,808 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10, 10, 10] total 26 [2018-01-21 02:54:01,808 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 02:54:01,809 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-21 02:54:01,809 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-21 02:54:01,809 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=413, Unknown=0, NotChecked=0, Total=650 [2018-01-21 02:54:01,809 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand 18 states. [2018-01-21 02:54:01,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 02:54:01,841 INFO L93 Difference]: Finished difference Result 137 states and 147 transitions. [2018-01-21 02:54:01,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-21 02:54:01,843 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 71 [2018-01-21 02:54:01,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 02:54:01,844 INFO L225 Difference]: With dead ends: 137 [2018-01-21 02:54:01,844 INFO L226 Difference]: Without dead ends: 77 [2018-01-21 02:54:01,844 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 266 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=256, Invalid=446, Unknown=0, NotChecked=0, Total=702 [2018-01-21 02:54:01,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-21 02:54:01,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-01-21 02:54:01,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-21 02:54:01,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2018-01-21 02:54:01,851 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 71 [2018-01-21 02:54:01,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 02:54:01,852 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2018-01-21 02:54:01,852 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-21 02:54:01,852 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2018-01-21 02:54:01,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-01-21 02:54:01,852 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 02:54:01,852 INFO L322 BasicCegarLoop]: trace histogram [7, 3, 3, 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] [2018-01-21 02:54:01,853 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation]=== [2018-01-21 02:54:01,853 INFO L82 PathProgramCache]: Analyzing trace with hash 592013063, now seen corresponding path program 6 times [2018-01-21 02:54:01,853 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 02:54:01,853 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:54:01,854 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-21 02:54:01,854 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:54:01,854 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 02:54:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 02:54:01,865 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 02:54:01,954 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 02:54:01,954 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 02:54:01,954 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 02:54:01,954 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 02:54:01,954 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 02:54:01,954 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 02:54:01,954 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-21 02:54:01,959 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-21 02:54:01,960 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder MIX_INSIDE_OUTSIDE (IT: FPandBP) [2018-01-21 02:54:01,974 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-21 02:54:01,983 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-21 02:54:01,990 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-21 02:54:02,020 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-21 02:54:02,035 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-21 02:54:02,037 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 02:54:02,040 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 02:54:02,095 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 02:54:02,095 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 02:54:02,271 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 02:54:02,304 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 02:54:02,304 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 16 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 02:54:02,308 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-21 02:54:02,308 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder MIX_INSIDE_OUTSIDE (IT: FPandBP) [2018-01-21 02:54:02,333 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-21 02:54:02,356 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-21 02:54:02,386 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-21 02:54:02,546 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-21 02:54:02,874 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-21 02:54:02,896 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 02:54:02,903 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 02:54:02,912 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 02:54:02,912 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 02:54:03,029 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 02:54:03,031 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 02:54:03,031 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 11, 11] total 29 [2018-01-21 02:54:03,032 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 02:54:03,032 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-21 02:54:03,032 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-21 02:54:03,033 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=518, Unknown=0, NotChecked=0, Total=812 [2018-01-21 02:54:03,033 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 20 states. [2018-01-21 02:54:03,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 02:54:03,068 INFO L93 Difference]: Finished difference Result 138 states and 148 transitions. [2018-01-21 02:54:03,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-21 02:54:03,068 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 72 [2018-01-21 02:54:03,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 02:54:03,069 INFO L225 Difference]: With dead ends: 138 [2018-01-21 02:54:03,069 INFO L226 Difference]: Without dead ends: 78 [2018-01-21 02:54:03,069 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 268 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=315, Invalid=555, Unknown=0, NotChecked=0, Total=870 [2018-01-21 02:54:03,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-21 02:54:03,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-01-21 02:54:03,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-21 02:54:03,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2018-01-21 02:54:03,074 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 72 [2018-01-21 02:54:03,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 02:54:03,074 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2018-01-21 02:54:03,074 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-21 02:54:03,074 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2018-01-21 02:54:03,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-01-21 02:54:03,075 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 02:54:03,075 INFO L322 BasicCegarLoop]: trace histogram [8, 3, 3, 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] [2018-01-21 02:54:03,075 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation]=== [2018-01-21 02:54:03,075 INFO L82 PathProgramCache]: Analyzing trace with hash -674237200, now seen corresponding path program 7 times [2018-01-21 02:54:03,075 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 02:54:03,076 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:54:03,076 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-21 02:54:03,076 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:54:03,076 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 02:54:03,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 02:54:03,091 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 02:54:03,225 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 02:54:03,225 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 02:54:03,225 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 02:54:03,226 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 02:54:03,226 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 02:54:03,226 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 02:54:03,226 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-21 02:54:03,231 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 02:54:03,232 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 02:54:03,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 02:54:03,252 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 02:54:03,315 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 02:54:03,316 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 02:54:03,477 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 02:54:03,498 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 02:54:03,498 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 18 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 02:54:03,501 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 02:54:03,501 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 02:54:03,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 02:54:03,571 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 02:54:03,580 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 02:54:03,580 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 02:54:03,627 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 02:54:03,628 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 02:54:03,628 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12, 12, 12] total 32 [2018-01-21 02:54:03,629 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 02:54:03,629 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-21 02:54:03,629 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-21 02:54:03,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=635, Unknown=0, NotChecked=0, Total=992 [2018-01-21 02:54:03,629 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 22 states. [2018-01-21 02:54:03,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 02:54:03,668 INFO L93 Difference]: Finished difference Result 139 states and 149 transitions. [2018-01-21 02:54:03,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-21 02:54:03,670 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 73 [2018-01-21 02:54:03,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 02:54:03,670 INFO L225 Difference]: With dead ends: 139 [2018-01-21 02:54:03,670 INFO L226 Difference]: Without dead ends: 79 [2018-01-21 02:54:03,671 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 270 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=380, Invalid=676, Unknown=0, NotChecked=0, Total=1056 [2018-01-21 02:54:03,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-21 02:54:03,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-01-21 02:54:03,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-21 02:54:03,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2018-01-21 02:54:03,675 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 73 [2018-01-21 02:54:03,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 02:54:03,676 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2018-01-21 02:54:03,676 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-21 02:54:03,676 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2018-01-21 02:54:03,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-01-21 02:54:03,677 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 02:54:03,677 INFO L322 BasicCegarLoop]: trace histogram [9, 3, 3, 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] [2018-01-21 02:54:03,677 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0EnsuresViolation]=== [2018-01-21 02:54:03,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1273289689, now seen corresponding path program 8 times [2018-01-21 02:54:03,677 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 02:54:03,677 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:54:03,678 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 02:54:03,678 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:54:03,678 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 02:54:03,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 02:54:03,691 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 02:54:03,810 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 02:54:03,810 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 02:54:03,810 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 02:54:03,811 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 02:54:03,811 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 02:54:03,811 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 02:54:03,811 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 02:54:03,820 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-21 02:54:03,820 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 02:54:03,836 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 02:54:03,849 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 02:54:03,851 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 02:54:03,854 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 02:54:04,012 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 02:54:04,012 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 02:54:04,227 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 02:54:04,248 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 02:54:04,248 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 20 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 02:54:04,251 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-21 02:54:04,252 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 02:54:04,272 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 02:54:04,302 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 02:54:04,320 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 02:54:04,324 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 02:54:04,330 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 02:54:04,330 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 02:54:04,372 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 02:54:04,373 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 02:54:04,374 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 13, 13] total 35 [2018-01-21 02:54:04,374 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 02:54:04,374 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-21 02:54:04,374 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-21 02:54:04,375 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=426, Invalid=764, Unknown=0, NotChecked=0, Total=1190 [2018-01-21 02:54:04,375 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 24 states. [2018-01-21 02:54:04,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 02:54:04,418 INFO L93 Difference]: Finished difference Result 140 states and 150 transitions. [2018-01-21 02:54:04,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-21 02:54:04,418 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 74 [2018-01-21 02:54:04,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 02:54:04,419 INFO L225 Difference]: With dead ends: 140 [2018-01-21 02:54:04,419 INFO L226 Difference]: Without dead ends: 80 [2018-01-21 02:54:04,419 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 272 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=451, Invalid=809, Unknown=0, NotChecked=0, Total=1260 [2018-01-21 02:54:04,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-01-21 02:54:04,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-01-21 02:54:04,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-21 02:54:04,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2018-01-21 02:54:04,424 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 74 [2018-01-21 02:54:04,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 02:54:04,424 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2018-01-21 02:54:04,424 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-21 02:54:04,424 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2018-01-21 02:54:04,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-01-21 02:54:04,425 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 02:54:04,425 INFO L322 BasicCegarLoop]: trace histogram [10, 3, 3, 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] [2018-01-21 02:54:04,425 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0EnsuresViolation]=== [2018-01-21 02:54:04,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1630919632, now seen corresponding path program 9 times [2018-01-21 02:54:04,425 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 02:54:04,425 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:54:04,426 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-21 02:54:04,426 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:54:04,426 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 02:54:04,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 02:54:04,437 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 02:54:04,558 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 02:54:04,558 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 02:54:04,558 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 02:54:04,558 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 02:54:04,558 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 02:54:04,559 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 02:54:04,559 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 02:54:04,564 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-21 02:54:04,564 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-21 02:54:04,577 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-21 02:54:04,587 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-21 02:54:04,601 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-21 02:54:04,603 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 02:54:04,606 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 02:54:04,621 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-21 02:54:04,623 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-21 02:54:04,623 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 02:54:04,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:54:04,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:54:04,628 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-01-21 02:54:04,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-01-21 02:54:04,642 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:04,643 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:04,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-01-21 02:54:04,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 02:54:04,647 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:54:04,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:54:04,652 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-01-21 02:54:04,667 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 32 treesize of output 25 [2018-01-21 02:54:04,669 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:04,670 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:04,670 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:04,671 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:04,672 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:04,672 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:04,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 88 [2018-01-21 02:54:04,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 02:54:04,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:54:04,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:54:04,687 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-01-21 02:54:05,063 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 48 [2018-01-21 02:54:05,068 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:05,068 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:05,069 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:05,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 3 [2018-01-21 02:54:05,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 02:54:05,073 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:54:05,074 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-21 02:54:05,075 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:3 [2018-01-21 02:54:05,103 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-01-21 02:54:05,104 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 02:54:05,678 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-21 02:54:05,679 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 02:54:05,679 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-21 02:54:05,679 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:1 [2018-01-21 02:54:05,694 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-01-21 02:54:05,716 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 02:54:05,716 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 22 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 02:54:05,720 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-21 02:54:05,720 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-21 02:54:05,743 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-21 02:54:05,768 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-21 02:54:05,846 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-21 02:54:05,882 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 02:54:05,888 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 02:54:05,897 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-21 02:54:05,899 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-21 02:54:05,899 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 02:54:05,901 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:54:05,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:54:05,904 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-21 02:54:05,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-21 02:54:05,935 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:05,936 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:05,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 31 [2018-01-21 02:54:05,937 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 02:54:05,942 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:54:05,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:54:05,947 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-01-21 02:54:05,976 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 30 treesize of output 23 [2018-01-21 02:54:05,978 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:05,979 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:05,979 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:05,980 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:05,981 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:05,981 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:05,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 78 [2018-01-21 02:54:05,982 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 02:54:05,991 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:54:05,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:54:05,996 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-01-21 02:54:06,039 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 39 treesize of output 30 [2018-01-21 02:54:06,042 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,043 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,044 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,044 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,045 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,046 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,046 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,047 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,048 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,048 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,049 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,050 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 149 [2018-01-21 02:54:06,051 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 02:54:06,067 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:54:06,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:54:06,074 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-01-21 02:54:06,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 37 [2018-01-21 02:54:06,117 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,118 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,118 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,119 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,120 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,120 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,121 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,121 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,122 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,123 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,123 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,124 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,125 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,126 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,127 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,127 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 206 [2018-01-21 02:54:06,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 02:54:06,161 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:54:06,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:54:06,177 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-01-21 02:54:06,216 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 57 treesize of output 44 [2018-01-21 02:54:06,218 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,219 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,220 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,220 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,221 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,221 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,222 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,223 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,223 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,224 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,224 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,225 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,225 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,226 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,227 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,227 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,228 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,229 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,230 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,230 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,231 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 253 [2018-01-21 02:54:06,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 02:54:06,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:54:06,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:54:06,271 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:60, output treesize:56 [2018-01-21 02:54:06,314 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 66 treesize of output 51 [2018-01-21 02:54:06,317 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,318 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,319 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,320 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,320 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,321 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,321 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,322 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,323 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,323 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,324 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,325 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,325 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,326 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,326 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,327 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,328 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,328 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,329 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,329 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,330 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,330 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,331 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,331 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,332 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,333 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,333 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:06,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 27 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 308 [2018-01-21 02:54:06,334 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 02:54:06,459 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:54:06,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:54:06,469 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:69, output treesize:65 [2018-01-21 02:54:07,220 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-01-21 02:54:07,220 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 02:54:07,686 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-01-21 02:54:07,688 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 02:54:07,688 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 12, 17, 8] total 57 [2018-01-21 02:54:07,688 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 02:54:07,689 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-21 02:54:07,689 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-21 02:54:07,690 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=2893, Unknown=0, NotChecked=0, Total=3192 [2018-01-21 02:54:07,690 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand 28 states. [2018-01-21 02:54:08,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 02:54:08,301 INFO L93 Difference]: Finished difference Result 154 states and 166 transitions. [2018-01-21 02:54:08,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-01-21 02:54:08,301 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 75 [2018-01-21 02:54:08,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 02:54:08,302 INFO L225 Difference]: With dead ends: 154 [2018-01-21 02:54:08,302 INFO L226 Difference]: Without dead ends: 94 [2018-01-21 02:54:08,303 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 245 SyntacticMatches, 13 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1830 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=373, Invalid=3787, Unknown=0, NotChecked=0, Total=4160 [2018-01-21 02:54:08,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-01-21 02:54:08,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2018-01-21 02:54:08,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-01-21 02:54:08,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2018-01-21 02:54:08,312 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 75 [2018-01-21 02:54:08,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 02:54:08,312 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2018-01-21 02:54:08,312 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-21 02:54:08,312 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2018-01-21 02:54:08,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-01-21 02:54:08,313 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 02:54:08,313 INFO L322 BasicCegarLoop]: trace histogram [11, 3, 3, 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] [2018-01-21 02:54:08,314 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0EnsuresViolation]=== [2018-01-21 02:54:08,314 INFO L82 PathProgramCache]: Analyzing trace with hash 580128904, now seen corresponding path program 1 times [2018-01-21 02:54:08,314 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 02:54:08,315 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:54:08,315 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-21 02:54:08,315 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:54:08,315 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 02:54:08,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 02:54:08,332 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 02:54:08,471 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 02:54:08,471 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 02:54:08,471 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 02:54:08,471 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 80 with the following transitions: [2018-01-21 02:54:08,471 INFO L201 CegarAbsIntRunner]: [0], [4], [5], [8], [10], [11], [12], [14], [18], [19], [21], [25], [27], [28], [29], [31], [35], [36], [39], [41], [42], [43], [45], [49], [50], [52], [53], [55], [56], [57], [58], [59], [60], [61], [62], [69], [72], [75], [80], [82], [83], [84], [90], [91], [92], [93], [96], [97], [98], [99], [100], [101], [102] [2018-01-21 02:54:08,473 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 02:54:08,474 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 02:54:10,058 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 02:54:10,058 INFO L268 AbstractInterpreter]: Visited 53 different actions 84 times. Merged at 24 different actions 27 times. Never widened. Found 7 fixpoints after 6 different actions. Largest state had 20 variables. [2018-01-21 02:54:10,061 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 02:54:10,061 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 02:54:10,061 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 02:54:10,066 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 02:54:10,066 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 02:54:10,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 02:54:10,095 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 02:54:10,231 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 02:54:10,231 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 02:54:10,714 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 02:54:10,735 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 02:54:10,736 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 24 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 02:54:10,739 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 02:54:10,739 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 02:54:10,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 02:54:10,791 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 02:54:10,797 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 02:54:10,798 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 02:54:10,846 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 02:54:10,848 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 02:54:10,848 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15, 15, 15] total 41 [2018-01-21 02:54:10,848 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 02:54:10,848 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-21 02:54:10,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-21 02:54:10,849 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=582, Invalid=1058, Unknown=0, NotChecked=0, Total=1640 [2018-01-21 02:54:10,849 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand 28 states. [2018-01-21 02:54:10,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 02:54:10,895 INFO L93 Difference]: Finished difference Result 164 states and 176 transitions. [2018-01-21 02:54:10,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-21 02:54:10,895 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 79 [2018-01-21 02:54:10,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 02:54:10,896 INFO L225 Difference]: With dead ends: 164 [2018-01-21 02:54:10,896 INFO L226 Difference]: Without dead ends: 93 [2018-01-21 02:54:10,897 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 288 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=611, Invalid=1111, Unknown=0, NotChecked=0, Total=1722 [2018-01-21 02:54:10,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-01-21 02:54:10,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-01-21 02:54:10,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-21 02:54:10,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2018-01-21 02:54:10,903 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 79 [2018-01-21 02:54:10,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 02:54:10,904 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2018-01-21 02:54:10,904 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-21 02:54:10,904 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2018-01-21 02:54:10,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-21 02:54:10,904 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 02:54:10,904 INFO L322 BasicCegarLoop]: trace histogram [12, 3, 3, 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] [2018-01-21 02:54:10,904 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0EnsuresViolation]=== [2018-01-21 02:54:10,905 INFO L82 PathProgramCache]: Analyzing trace with hash -50939265, now seen corresponding path program 2 times [2018-01-21 02:54:10,905 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 02:54:10,905 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:54:10,905 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 02:54:10,906 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:54:10,906 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 02:54:10,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 02:54:10,919 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 02:54:11,137 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 02:54:11,137 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 02:54:11,137 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 02:54:11,138 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 02:54:11,138 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 02:54:11,138 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 02:54:11,138 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 02:54:11,145 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-21 02:54:11,145 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 02:54:11,165 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 02:54:11,186 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 02:54:11,189 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 02:54:11,192 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 02:54:11,381 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 02:54:11,381 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 02:54:11,677 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 02:54:11,697 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 02:54:11,698 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 26 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 02:54:11,701 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-21 02:54:11,701 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 02:54:11,721 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 02:54:11,752 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 02:54:11,771 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 02:54:11,775 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 02:54:11,782 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 02:54:11,782 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 02:54:11,836 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 02:54:11,837 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 02:54:11,837 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16, 16, 16] total 44 [2018-01-21 02:54:11,837 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 02:54:11,838 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-21 02:54:11,838 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-21 02:54:11,838 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=669, Invalid=1223, Unknown=0, NotChecked=0, Total=1892 [2018-01-21 02:54:11,839 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand 30 states. [2018-01-21 02:54:11,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 02:54:11,879 INFO L93 Difference]: Finished difference Result 165 states and 177 transitions. [2018-01-21 02:54:11,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-21 02:54:11,879 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 80 [2018-01-21 02:54:11,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 02:54:11,880 INFO L225 Difference]: With dead ends: 165 [2018-01-21 02:54:11,880 INFO L226 Difference]: Without dead ends: 94 [2018-01-21 02:54:11,880 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 290 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=700, Invalid=1280, Unknown=0, NotChecked=0, Total=1980 [2018-01-21 02:54:11,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-01-21 02:54:11,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-01-21 02:54:11,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-21 02:54:11,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2018-01-21 02:54:11,886 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 80 [2018-01-21 02:54:11,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 02:54:11,886 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2018-01-21 02:54:11,886 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-21 02:54:11,887 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2018-01-21 02:54:11,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-01-21 02:54:11,887 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 02:54:11,887 INFO L322 BasicCegarLoop]: trace histogram [13, 3, 3, 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] [2018-01-21 02:54:11,887 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0EnsuresViolation]=== [2018-01-21 02:54:11,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1860783976, now seen corresponding path program 3 times [2018-01-21 02:54:11,888 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 02:54:11,889 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:54:11,889 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-21 02:54:11,889 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:54:11,889 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 02:54:11,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 02:54:11,905 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 02:54:12,169 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 02:54:12,170 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 02:54:12,170 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 02:54:12,170 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 02:54:12,170 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 02:54:12,170 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 02:54:12,170 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 02:54:12,189 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-21 02:54:12,189 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-21 02:54:12,206 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-21 02:54:12,216 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-21 02:54:12,230 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-21 02:54:12,234 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 02:54:12,237 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 02:54:12,256 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-21 02:54:12,258 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-21 02:54:12,258 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 02:54:12,259 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:54:12,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:54:12,262 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-21 02:54:12,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-21 02:54:12,278 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,279 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 31 [2018-01-21 02:54:12,279 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 02:54:12,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:54:12,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:54:12,289 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-01-21 02:54:12,307 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 30 treesize of output 23 [2018-01-21 02:54:12,309 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,310 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,311 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,312 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,312 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,313 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 78 [2018-01-21 02:54:12,314 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 02:54:12,323 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:54:12,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:54:12,329 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-01-21 02:54:12,350 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 39 treesize of output 30 [2018-01-21 02:54:12,353 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,354 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,354 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,355 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,355 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,356 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,357 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,357 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,358 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,359 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,359 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,360 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 149 [2018-01-21 02:54:12,361 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 02:54:12,379 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:54:12,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:54:12,386 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-01-21 02:54:12,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 37 [2018-01-21 02:54:12,415 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,416 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,416 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,417 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,418 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,418 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,419 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,419 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,420 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,421 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,421 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,422 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,423 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,424 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,424 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,425 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 206 [2018-01-21 02:54:12,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 02:54:12,474 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:54:12,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:54:12,483 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-01-21 02:54:12,512 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 57 treesize of output 44 [2018-01-21 02:54:12,515 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,516 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,517 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,517 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,518 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,519 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,519 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,520 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,521 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,521 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,522 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,523 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,523 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,524 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,525 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,526 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,526 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,527 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,528 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,529 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,530 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 253 [2018-01-21 02:54:12,531 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 02:54:12,568 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:54:12,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:54:12,578 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:60, output treesize:56 [2018-01-21 02:54:12,613 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 66 treesize of output 51 [2018-01-21 02:54:12,616 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,616 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,617 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,618 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,618 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,619 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,620 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,620 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,621 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,622 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,622 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,623 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,624 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,624 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,625 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,625 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,626 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,627 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,628 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,628 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,629 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,630 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,630 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,631 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,632 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,633 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,633 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:12,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 27 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 308 [2018-01-21 02:54:12,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 02:54:12,728 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:54:12,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:54:12,775 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:69, output treesize:65 [2018-01-21 02:54:13,045 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-01-21 02:54:13,046 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 02:54:13,300 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-01-21 02:54:13,322 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 02:54:13,322 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 28 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 02:54:13,325 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-21 02:54:13,325 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-21 02:54:13,345 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-21 02:54:13,370 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-21 02:54:13,439 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-21 02:54:13,474 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 02:54:13,480 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 02:54:13,485 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-21 02:54:13,487 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-21 02:54:13,488 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 02:54:13,489 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:54:13,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:54:13,495 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-21 02:54:13,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-21 02:54:13,500 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,501 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 31 [2018-01-21 02:54:13,501 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 02:54:13,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:54:13,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:54:13,510 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-01-21 02:54:13,513 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 30 treesize of output 23 [2018-01-21 02:54:13,515 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,515 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,516 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,516 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,517 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,518 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 78 [2018-01-21 02:54:13,518 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 02:54:13,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:54:13,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:54:13,532 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-01-21 02:54:13,535 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 39 treesize of output 30 [2018-01-21 02:54:13,537 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,537 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,538 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,538 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,539 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,540 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,540 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,541 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,541 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,542 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,542 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,543 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 149 [2018-01-21 02:54:13,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 02:54:13,559 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:54:13,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:54:13,565 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-01-21 02:54:13,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 37 [2018-01-21 02:54:13,608 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,608 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,609 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,609 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,610 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,610 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,611 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,612 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,612 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,613 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,613 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,614 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,615 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,615 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,616 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,616 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 206 [2018-01-21 02:54:13,617 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 02:54:13,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:54:13,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:54:13,648 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-01-21 02:54:13,651 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 57 treesize of output 44 [2018-01-21 02:54:13,654 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,654 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,655 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,656 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,656 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,657 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,657 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,658 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,658 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,659 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,659 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,660 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,660 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,661 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,661 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,662 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,663 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,664 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,664 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,665 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,666 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 253 [2018-01-21 02:54:13,667 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 02:54:13,698 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:54:13,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:54:13,707 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:60, output treesize:56 [2018-01-21 02:54:13,710 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 66 treesize of output 51 [2018-01-21 02:54:13,713 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,714 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,724 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,725 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,726 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,727 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,728 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,728 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,729 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,730 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,730 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,731 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,731 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,732 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,733 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,733 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,734 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,735 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,735 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,736 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,736 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,737 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,738 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,738 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,739 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,739 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,740 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 02:54:13,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 27 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 308 [2018-01-21 02:54:13,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 02:54:13,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:54:13,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:54:13,801 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:69, output treesize:65 [2018-01-21 02:54:14,112 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-01-21 02:54:14,113 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 02:54:14,352 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-01-21 02:54:14,354 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 02:54:14,354 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 8, 17, 8] total 48 [2018-01-21 02:54:14,354 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 02:54:14,354 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-01-21 02:54:14,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-01-21 02:54:14,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=1969, Unknown=0, NotChecked=0, Total=2256 [2018-01-21 02:54:14,355 INFO L87 Difference]: Start difference. First operand 94 states and 100 transitions. Second operand 32 states. [2018-01-21 02:54:15,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 02:54:15,023 INFO L93 Difference]: Finished difference Result 178 states and 191 transitions. [2018-01-21 02:54:15,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-01-21 02:54:15,024 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 81 [2018-01-21 02:54:15,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 02:54:15,025 INFO L225 Difference]: With dead ends: 178 [2018-01-21 02:54:15,025 INFO L226 Difference]: Without dead ends: 104 [2018-01-21 02:54:15,026 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 277 SyntacticMatches, 17 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1657 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=430, Invalid=3230, Unknown=0, NotChecked=0, Total=3660 [2018-01-21 02:54:15,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-01-21 02:54:15,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2018-01-21 02:54:15,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-01-21 02:54:15,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2018-01-21 02:54:15,032 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 81 [2018-01-21 02:54:15,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 02:54:15,032 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2018-01-21 02:54:15,032 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-01-21 02:54:15,032 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2018-01-21 02:54:15,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-01-21 02:54:15,033 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 02:54:15,033 INFO L322 BasicCegarLoop]: trace histogram [14, 4, 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] [2018-01-21 02:54:15,033 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0EnsuresViolation]=== [2018-01-21 02:54:15,033 INFO L82 PathProgramCache]: Analyzing trace with hash -777231677, now seen corresponding path program 4 times [2018-01-21 02:54:15,033 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 02:54:15,034 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:54:15,034 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-21 02:54:15,034 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:54:15,034 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 02:54:15,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 02:54:15,045 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 02:54:15,285 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-01-21 02:54:15,285 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 02:54:15,285 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 02:54:15,285 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 02:54:15,285 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 02:54:15,285 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 02:54:15,285 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 02:54:15,290 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-21 02:54:15,291 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-01-21 02:54:15,314 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 02:54:15,317 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 02:54:15,556 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 10 proven. 29 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-01-21 02:54:15,556 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 02:54:15,889 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2018-01-21 02:54:15,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2018-01-21 02:54:15,896 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-21 02:54:15,906 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-01-21 02:54:15,906 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 02:54:15,939 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-01-21 02:54:15,940 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 02:54:15,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-21 02:54:15,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-21 02:54:15,947 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:17, output treesize:10 [2018-01-21 02:54:15,985 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 11 proven. 28 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-01-21 02:54:16,011 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 02:54:16,012 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 30 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 02:54:16,017 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-21 02:54:16,017 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-01-21 02:54:16,074 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 02:54:16,080 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 02:54:16,120 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 10 proven. 29 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-01-21 02:54:16,120 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 02:54:16,230 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-21 02:54:16,230 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 02:54:16,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 02:54:16,231 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:1 [2018-01-21 02:54:16,296 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2018-01-21 02:54:16,298 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-01-21 02:54:16,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 02:54:16,305 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-01-21 02:54:16,305 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 02:54:16,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2018-01-21 02:54:16,315 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-21 02:54:16,318 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-21 02:54:16,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-21 02:54:16,321 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:17, output treesize:12 [2018-01-21 02:54:16,340 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 19 proven. 20 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-01-21 02:54:16,342 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 02:54:16,342 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 13, 14, 14] total 39 [2018-01-21 02:54:16,342 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 02:54:16,342 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-21 02:54:16,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-21 02:54:16,343 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=1242, Unknown=0, NotChecked=0, Total=1482 [2018-01-21 02:54:16,343 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand 30 states. Received shutdown request... [2018-01-21 02:54:33,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-21 02:54:33,763 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-21 02:54:33,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 02:54:33 BoogieIcfgContainer [2018-01-21 02:54:33,766 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 02:54:33,766 INFO L168 Benchmark]: Toolchain (without parser) took 50038.14 ms. Allocated memory was 307.2 MB in the beginning and 1.1 GB in the end (delta: 760.7 MB). Free memory was 265.5 MB in the beginning and 625.6 MB in the end (delta: -360.0 MB). Peak memory consumption was 400.7 MB. Max. memory is 5.3 GB. [2018-01-21 02:54:33,767 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 307.2 MB. Free memory is still 271.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 02:54:33,767 INFO L168 Benchmark]: CACSL2BoogieTranslator took 271.59 ms. Allocated memory is still 307.2 MB. Free memory was 264.5 MB in the beginning and 253.4 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. [2018-01-21 02:54:33,767 INFO L168 Benchmark]: Boogie Preprocessor took 44.88 ms. Allocated memory is still 307.2 MB. Free memory was 253.4 MB in the beginning and 251.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 02:54:33,768 INFO L168 Benchmark]: RCFGBuilder took 321.13 ms. Allocated memory is still 307.2 MB. Free memory was 251.4 MB in the beginning and 233.6 MB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 5.3 GB. [2018-01-21 02:54:33,768 INFO L168 Benchmark]: TraceAbstraction took 49392.03 ms. Allocated memory was 307.2 MB in the beginning and 1.1 GB in the end (delta: 760.7 MB). Free memory was 232.7 MB in the beginning and 625.6 MB in the end (delta: -392.9 MB). Peak memory consumption was 367.8 MB. Max. memory is 5.3 GB. [2018-01-21 02:54:33,769 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.23 ms. Allocated memory is still 307.2 MB. Free memory is still 271.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 271.59 ms. Allocated memory is still 307.2 MB. Free memory was 264.5 MB in the beginning and 253.4 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 44.88 ms. Allocated memory is still 307.2 MB. Free memory was 253.4 MB in the beginning and 251.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 321.13 ms. Allocated memory is still 307.2 MB. Free memory was 251.4 MB in the beginning and 233.6 MB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 49392.03 ms. Allocated memory was 307.2 MB in the beginning and 1.1 GB in the end (delta: 760.7 MB). Free memory was 232.7 MB in the beginning and 625.6 MB in the end (delta: -392.9 MB). Peak memory consumption was 367.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 47 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 430 LocStat_NO_SUPPORTING_DISEQUALITIES : 88 LocStat_NO_DISJUNCTIONS : -94 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 60 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 68 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 60 TransStat_MAX_NO_DISJUNCTIONS : 1 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.488069 RENAME_VARIABLES(MILLISECONDS) : 0.123622 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.434198 PROJECTAWAY(MILLISECONDS) : 0.075655 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.067091 DISJOIN(MILLISECONDS) : 0.000000 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.151184 ADD_EQUALITY(MILLISECONDS) : 0.017359 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.028054 #CONJOIN_DISJUNCTIVE : 83 #RENAME_VARIABLES : 150 #UNFREEZE : 0 #CONJOIN : 134 #PROJECTAWAY : 145 #ADD_WEAK_EQUALITY : 17 #DISJOIN : 0 #RENAME_VARIABLES_DISJUNCTIVE : 150 #ADD_EQUALITY : 75 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 47 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 430 LocStat_NO_SUPPORTING_DISEQUALITIES : 88 LocStat_NO_DISJUNCTIONS : -94 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 61 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 70 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 61 TransStat_MAX_NO_DISJUNCTIONS : 1 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.359939 RENAME_VARIABLES(MILLISECONDS) : 0.096595 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.321644 PROJECTAWAY(MILLISECONDS) : 0.061360 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.045815 DISJOIN(MILLISECONDS) : 0.403712 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.125230 ADD_EQUALITY(MILLISECONDS) : 0.013298 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.011425 #CONJOIN_DISJUNCTIVE : 101 #RENAME_VARIABLES : 196 #UNFREEZE : 0 #CONJOIN : 170 #PROJECTAWAY : 179 #ADD_WEAK_EQUALITY : 19 #DISJOIN : 3 #RENAME_VARIABLES_DISJUNCTIVE : 196 #ADD_EQUALITY : 78 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 47 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 419 LocStat_NO_SUPPORTING_DISEQUALITIES : 90 LocStat_NO_DISJUNCTIONS : -94 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 60 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 74 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 60 TransStat_MAX_NO_DISJUNCTIONS : 1 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.223273 RENAME_VARIABLES(MILLISECONDS) : 0.064745 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.197273 PROJECTAWAY(MILLISECONDS) : 0.039035 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.040478 DISJOIN(MILLISECONDS) : 0.243035 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.078904 ADD_EQUALITY(MILLISECONDS) : 0.009260 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.008321 #CONJOIN_DISJUNCTIVE : 113 #RENAME_VARIABLES : 218 #UNFREEZE : 0 #CONJOIN : 180 #PROJECTAWAY : 190 #ADD_WEAK_EQUALITY : 19 #DISJOIN : 3 #RENAME_VARIABLES_DISJUNCTIVE : 218 #ADD_EQUALITY : 82 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 2 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 50 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 438 LocStat_NO_SUPPORTING_DISEQUALITIES : 94 LocStat_NO_DISJUNCTIONS : -100 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 65 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 73 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 65 TransStat_MAX_NO_DISJUNCTIONS : 1 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.770510 RENAME_VARIABLES(MILLISECONDS) : 0.184875 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.738185 PROJECTAWAY(MILLISECONDS) : 0.117641 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.031020 DISJOIN(MILLISECONDS) : 0.201862 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.215577 ADD_EQUALITY(MILLISECONDS) : 0.014919 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.011873 #CONJOIN_DISJUNCTIVE : 116 #RENAME_VARIABLES : 229 #UNFREEZE : 0 #CONJOIN : 189 #PROJECTAWAY : 203 #ADD_WEAK_EQUALITY : 19 #DISJOIN : 3 #RENAME_VARIABLES_DISJUNCTIVE : 229 #ADD_EQUALITY : 81 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 657]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: Sum2Err0EnsuresViolation CFG has 7 procedures, 60 locations, 6 error locations. SAFE Result, 0.5s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 62 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 21 PreInvPairs, 24 NumberOfFragments, 16 HoareAnnotationTreeSize, 21 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 16 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 32 NumberOfCodeBlocks, 32 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 31 ConstructedInterpolants, 0 QuantifiedInterpolants, 961 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - 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 7 procedures, 60 locations, 6 error locations. UNSAFE Result, 0.0s 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=60occurred 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 - PositiveResult [Line: 667]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: dummy_abortErr0EnsuresViolation CFG has 7 procedures, 60 locations, 6 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 62 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 29 NumberOfCodeBlocks, 29 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 28 ConstructedInterpolants, 0 QuantifiedInterpolants, 784 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 7 procedures, 60 locations, 6 error locations. SAFE Result, 0.5s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 166 SDtfs, 31 SDslu, 178 SDs, 0 SdLazy, 67 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=2, 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, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 128 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 125 ConstructedInterpolants, 0 QuantifiedInterpolants, 8425 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 647]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: SumErr0EnsuresViolation CFG has 7 procedures, 60 locations, 6 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 62 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 25 NumberOfCodeBlocks, 25 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 24 ConstructedInterpolants, 0 QuantifiedInterpolants, 576 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 670]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 670). Cancelled while BasicCegarLoop was constructing difference of abstraction (101states) and interpolant automaton (currently 12 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (18 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 7 procedures, 60 locations, 6 error locations. TIMEOUT Result, 48.1s OverallTime, 19 OverallIterations, 14 TraceHistogramMax, 20.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 911 SDtfs, 310 SDslu, 7666 SDs, 0 SdLazy, 2177 SolverSat, 211 SolverUnsat, 9 SolverUnknown, 0 SolverNotchecked, 18.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4326 GetRequests, 3725 SyntacticMatches, 106 SemanticMatches, 495 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7932 ImplicationChecksByTransitivity, 9.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=101occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 10.0s AbstIntTime, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 21 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 14.2s InterpolantComputationTime, 3251 NumberOfCodeBlocks, 3173 NumberOfCodeBlocksAsserted, 80 NumberOfCheckSat, 5212 ConstructedInterpolants, 197 QuantifiedInterpolants, 1609360 SizeOfPredicates, 97 NumberOfNonLiveVariables, 5316 ConjunctsInSsa, 441 ConjunctsInUnsatCore, 77 InterpolantComputations, 6 PerfectInterpolantSequences, 2310/4281 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/20051113-1.c_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_02-54-33-782.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-21_02-54-33-782.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-21_02-54-33-782.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-21_02-54-33-782.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-21_02-54-33-782.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-21_02-54-33-782.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-21_02-54-33-782.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-21_02-54-33-782.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-21_02-54-33-782.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_02-54-33-782.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_02-54-33-782.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_02-54-33-782.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_02-54-33-782.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-4-2018-01-21_02-54-33-782.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-5-2018-01-21_02-54-33-782.csv Completed graceful shutdown