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/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_1_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 03:28:54,172 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 03:28:54,174 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 03:28:54,193 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 03:28:54,194 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 03:28:54,195 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 03:28:54,196 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 03:28:54,198 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 03:28:54,200 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 03:28:54,201 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 03:28:54,202 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 03:28:54,202 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 03:28:54,204 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 03:28:54,205 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 03:28:54,207 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 03:28:54,209 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 03:28:54,212 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 03:28:54,214 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 03:28:54,215 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 03:28:54,217 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 03:28:54,219 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 03:28:54,219 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 03:28:54,220 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 03:28:54,221 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 03:28:54,222 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 03:28:54,223 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 03:28:54,224 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 03:28:54,224 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 03:28:54,224 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 03:28:54,225 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 03:28:54,225 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 03:28:54,226 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf [2018-01-25 03:28:54,238 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 03:28:54,238 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 03:28:54,239 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 03:28:54,239 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 03:28:54,239 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 03:28:54,240 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 03:28:54,240 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 03:28:54,240 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 03:28:54,240 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 03:28:54,241 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 03:28:54,241 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 03:28:54,241 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 03:28:54,242 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 03:28:54,242 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 03:28:54,242 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 03:28:54,242 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 03:28:54,242 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 03:28:54,242 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 03:28:54,243 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 03:28:54,243 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 03:28:54,243 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 03:28:54,243 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 03:28:54,243 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 03:28:54,244 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 03:28:54,244 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 03:28:54,244 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 03:28:54,244 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 03:28:54,244 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 03:28:54,245 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 03:28:54,245 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 03:28:54,245 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 03:28:54,245 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 03:28:54,245 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 03:28:54,246 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 03:28:54,246 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 03:28:54,247 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 03:28:54,247 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 03:28:54,293 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 03:28:54,312 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 03:28:54,318 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 03:28:54,320 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 03:28:54,320 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 03:28:54,321 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_1_false-valid-memtrack_true-termination.i [2018-01-25 03:28:54,580 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 03:28:54,586 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 03:28:54,587 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 03:28:54,587 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 03:28:54,592 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 03:28:54,593 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:28:54" (1/1) ... [2018-01-25 03:28:54,597 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31d3d535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:28:54, skipping insertion in model container [2018-01-25 03:28:54,597 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:28:54" (1/1) ... [2018-01-25 03:28:54,617 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:28:54,675 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:28:54,817 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:28:54,833 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:28:54,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:28:54 WrapperNode [2018-01-25 03:28:54,841 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 03:28:54,842 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 03:28:54,842 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 03:28:54,842 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 03:28:54,859 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:28:54" (1/1) ... [2018-01-25 03:28:54,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:28:54" (1/1) ... [2018-01-25 03:28:54,871 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:28:54" (1/1) ... [2018-01-25 03:28:54,871 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:28:54" (1/1) ... [2018-01-25 03:28:54,874 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:28:54" (1/1) ... [2018-01-25 03:28:54,877 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:28:54" (1/1) ... [2018-01-25 03:28:54,878 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:28:54" (1/1) ... [2018-01-25 03:28:54,880 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 03:28:54,881 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 03:28:54,881 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 03:28:54,881 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 03:28:54,882 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:28:54" (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-25 03:28:54,943 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 03:28:54,943 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 03:28:54,943 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-25 03:28:54,943 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-25 03:28:54,943 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 03:28:54,943 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 03:28:54,944 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 03:28:54,944 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 03:28:54,944 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 03:28:54,944 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 03:28:54,944 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 03:28:54,944 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 03:28:54,944 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 03:28:54,944 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-25 03:28:54,944 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-25 03:28:54,944 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 03:28:54,945 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 03:28:54,945 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 03:28:55,201 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 03:28:55,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:28:55 BoogieIcfgContainer [2018-01-25 03:28:55,202 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 03:28:55,203 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 03:28:55,203 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 03:28:55,205 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 03:28:55,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 03:28:54" (1/3) ... [2018-01-25 03:28:55,206 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@564e679a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:28:55, skipping insertion in model container [2018-01-25 03:28:55,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:28:54" (2/3) ... [2018-01-25 03:28:55,207 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@564e679a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:28:55, skipping insertion in model container [2018-01-25 03:28:55,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:28:55" (3/3) ... [2018-01-25 03:28:55,208 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test18_1_false-valid-memtrack_true-termination.i [2018-01-25 03:28:55,215 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 03:28:55,221 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-01-25 03:28:55,262 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 03:28:55,262 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 03:28:55,262 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 03:28:55,263 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 03:28:55,263 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 03:28:55,263 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 03:28:55,263 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 03:28:55,263 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 03:28:55,264 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 03:28:55,284 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2018-01-25 03:28:55,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 03:28:55,290 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:28:55,291 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:28:55,291 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 03:28:55,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1647065445, now seen corresponding path program 1 times [2018-01-25 03:28:55,297 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:28:55,346 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:28:55,346 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:28:55,347 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:28:55,347 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:28:55,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:28:55,403 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:28:55,552 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-25 03:28:55,554 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:28:55,555 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 03:28:55,555 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:28:55,558 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 03:28:55,574 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 03:28:55,575 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 03:28:55,577 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 3 states. [2018-01-25 03:28:55,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:28:55,949 INFO L93 Difference]: Finished difference Result 86 states and 104 transitions. [2018-01-25 03:28:55,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 03:28:55,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-25 03:28:55,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:28:55,959 INFO L225 Difference]: With dead ends: 86 [2018-01-25 03:28:55,959 INFO L226 Difference]: Without dead ends: 62 [2018-01-25 03:28:55,962 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 03:28:55,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-25 03:28:55,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2018-01-25 03:28:55,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-25 03:28:55,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2018-01-25 03:28:56,000 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 17 [2018-01-25 03:28:56,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:28:56,000 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2018-01-25 03:28:56,000 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 03:28:56,000 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2018-01-25 03:28:56,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 03:28:56,002 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:28:56,002 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:28:56,002 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 03:28:56,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1810172163, now seen corresponding path program 1 times [2018-01-25 03:28:56,002 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:28:56,004 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:28:56,005 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:28:56,005 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:28:56,005 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:28:56,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:28:56,028 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:28:56,164 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-25 03:28:56,164 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:28:56,164 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 03:28:56,164 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:28:56,166 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 03:28:56,166 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 03:28:56,166 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:28:56,167 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand 6 states. [2018-01-25 03:28:56,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:28:56,240 INFO L93 Difference]: Finished difference Result 80 states and 96 transitions. [2018-01-25 03:28:56,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 03:28:56,240 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-25 03:28:56,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:28:56,242 INFO L225 Difference]: With dead ends: 80 [2018-01-25 03:28:56,243 INFO L226 Difference]: Without dead ends: 76 [2018-01-25 03:28:56,244 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:28:56,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-25 03:28:56,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 54. [2018-01-25 03:28:56,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-25 03:28:56,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2018-01-25 03:28:56,252 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 19 [2018-01-25 03:28:56,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:28:56,252 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2018-01-25 03:28:56,252 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 03:28:56,253 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2018-01-25 03:28:56,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 03:28:56,254 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:28:56,254 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] [2018-01-25 03:28:56,254 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 03:28:56,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1893738511, now seen corresponding path program 1 times [2018-01-25 03:28:56,254 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:28:56,256 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:28:56,256 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:28:56,256 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:28:56,256 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:28:56,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:28:56,273 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:28:56,495 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-25 03:28:56,495 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:28:56,495 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 03:28:56,495 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:28:56,496 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:28:56,496 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:28:56,496 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:28:56,496 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand 5 states. [2018-01-25 03:28:56,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:28:56,532 INFO L93 Difference]: Finished difference Result 86 states and 100 transitions. [2018-01-25 03:28:56,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:28:56,532 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-25 03:28:56,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:28:56,534 INFO L225 Difference]: With dead ends: 86 [2018-01-25 03:28:56,534 INFO L226 Difference]: Without dead ends: 42 [2018-01-25 03:28:56,535 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:28:56,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-01-25 03:28:56,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-01-25 03:28:56,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-25 03:28:56,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-01-25 03:28:56,542 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 20 [2018-01-25 03:28:56,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:28:56,542 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-01-25 03:28:56,543 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:28:56,543 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-01-25 03:28:56,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 03:28:56,544 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:28:56,544 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:28:56,544 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 03:28:56,544 INFO L82 PathProgramCache]: Analyzing trace with hash 389514349, now seen corresponding path program 1 times [2018-01-25 03:28:56,545 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:28:56,546 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:28:56,546 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:28:56,547 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:28:56,547 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:28:56,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:28:56,569 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:28:56,630 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-25 03:28:56,631 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:28:56,631 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 03:28:56,631 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:28:56,631 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 03:28:56,632 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 03:28:56,632 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:28:56,632 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 6 states. [2018-01-25 03:28:56,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:28:56,831 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-01-25 03:28:56,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 03:28:56,831 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-25 03:28:56,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:28:56,832 INFO L225 Difference]: With dead ends: 50 [2018-01-25 03:28:56,832 INFO L226 Difference]: Without dead ends: 49 [2018-01-25 03:28:56,832 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:28:56,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-25 03:28:56,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-01-25 03:28:56,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-25 03:28:56,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-01-25 03:28:56,837 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 22 [2018-01-25 03:28:56,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:28:56,838 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-01-25 03:28:56,838 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 03:28:56,838 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-01-25 03:28:56,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 03:28:56,838 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:28:56,839 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:28:56,839 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 03:28:56,839 INFO L82 PathProgramCache]: Analyzing trace with hash 389514350, now seen corresponding path program 1 times [2018-01-25 03:28:56,839 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:28:56,840 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:28:56,840 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:28:56,840 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:28:56,840 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:28:56,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:28:56,852 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:28:56,901 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-25 03:28:56,901 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:28:56,902 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 03:28:56,902 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:28:56,902 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 03:28:56,902 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 03:28:56,903 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-25 03:28:56,903 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 4 states. [2018-01-25 03:28:56,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:28:56,930 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2018-01-25 03:28:56,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 03:28:56,930 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-01-25 03:28:56,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:28:56,931 INFO L225 Difference]: With dead ends: 86 [2018-01-25 03:28:56,931 INFO L226 Difference]: Without dead ends: 68 [2018-01-25 03:28:56,932 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-25 03:28:56,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-25 03:28:56,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 48. [2018-01-25 03:28:56,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-25 03:28:56,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-01-25 03:28:56,938 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 22 [2018-01-25 03:28:56,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:28:56,938 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-01-25 03:28:56,938 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 03:28:56,938 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-01-25 03:28:56,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 03:28:56,939 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:28:56,939 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] [2018-01-25 03:28:56,939 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 03:28:56,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1824781139, now seen corresponding path program 1 times [2018-01-25 03:28:56,940 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:28:56,941 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:28:56,941 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:28:56,941 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:28:56,941 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:28:56,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:28:56,952 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:28:57,067 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-25 03:28:57,067 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:28:57,067 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 03:28:57,067 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:28:57,068 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:28:57,068 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:28:57,068 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:28:57,068 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 5 states. [2018-01-25 03:28:57,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:28:57,112 INFO L93 Difference]: Finished difference Result 98 states and 111 transitions. [2018-01-25 03:28:57,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:28:57,113 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-01-25 03:28:57,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:28:57,114 INFO L225 Difference]: With dead ends: 98 [2018-01-25 03:28:57,115 INFO L226 Difference]: Without dead ends: 62 [2018-01-25 03:28:57,115 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:28:57,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-25 03:28:57,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 50. [2018-01-25 03:28:57,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-25 03:28:57,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-01-25 03:28:57,124 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 26 [2018-01-25 03:28:57,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:28:57,124 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-01-25 03:28:57,125 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:28:57,125 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-01-25 03:28:57,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 03:28:57,126 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:28:57,126 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] [2018-01-25 03:28:57,126 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 03:28:57,126 INFO L82 PathProgramCache]: Analyzing trace with hash -85684427, now seen corresponding path program 1 times [2018-01-25 03:28:57,127 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:28:57,128 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:28:57,128 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:28:57,128 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:28:57,129 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:28:57,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:28:57,148 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:28:57,367 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:28:57,367 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:28:57,367 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 03:28:57,368 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-01-25 03:28:57,370 INFO L201 CegarAbsIntRunner]: [3], [6], [7], [8], [10], [11], [12], [16], [18], [22], [26], [31], [33], [38], [40], [70], [72], [73], [74], [76], [77], [78], [79] [2018-01-25 03:28:57,427 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 03:28:57,428 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 03:28:59,330 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-25 03:28:59,332 INFO L268 AbstractInterpreter]: Visited 23 different actions 28 times. Never merged. Never widened. Never found a fixpoint. Largest state had 19 variables. [2018-01-25 03:28:59,342 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-25 03:29:00,306 INFO L232 lantSequenceWeakener]: Weakened 16 states. On average, predicates are now at 76.37% of their original sizes. [2018-01-25 03:29:00,306 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-25 03:29:00,681 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-25 03:29:00,682 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-25 03:29:00,682 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [8] total 21 [2018-01-25 03:29:00,682 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:29:00,683 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-25 03:29:00,683 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-25 03:29:00,683 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=159, Unknown=2, NotChecked=0, Total=210 [2018-01-25 03:29:00,683 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 15 states. [2018-01-25 03:29:11,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:29:11,914 INFO L93 Difference]: Finished difference Result 108 states and 121 transitions. [2018-01-25 03:29:11,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-25 03:29:11,914 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-01-25 03:29:11,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:29:11,916 INFO L225 Difference]: With dead ends: 108 [2018-01-25 03:29:11,916 INFO L226 Difference]: Without dead ends: 92 [2018-01-25 03:29:11,916 INFO L525 BasicCegarLoop]: 2 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=85, Invalid=293, Unknown=2, NotChecked=0, Total=380 [2018-01-25 03:29:11,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-01-25 03:29:11,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 64. [2018-01-25 03:29:11,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-25 03:29:11,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2018-01-25 03:29:11,929 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 28 [2018-01-25 03:29:11,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:29:11,929 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2018-01-25 03:29:11,929 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-25 03:29:11,929 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2018-01-25 03:29:11,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 03:29:11,930 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:29:11,931 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] [2018-01-25 03:29:11,931 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 03:29:11,931 INFO L82 PathProgramCache]: Analyzing trace with hash -85684426, now seen corresponding path program 1 times [2018-01-25 03:29:11,931 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:29:11,933 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:29:11,933 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:29:11,933 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:29:11,933 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:29:11,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:29:11,953 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:29:12,401 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:29:12,401 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:29:12,401 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 03:29:12,401 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-01-25 03:29:12,401 INFO L201 CegarAbsIntRunner]: [3], [6], [7], [8], [10], [11], [12], [16], [18], [22], [26], [31], [33], [38], [41], [70], [72], [73], [74], [76], [77], [78], [79] [2018-01-25 03:29:12,402 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 03:29:12,403 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 03:29:13,376 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 03:29:13,376 INFO L268 AbstractInterpreter]: Visited 23 different actions 28 times. Never merged. Never widened. Never found a fixpoint. Largest state had 19 variables. [2018-01-25 03:29:13,379 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 03:29:13,379 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:29:13,379 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-25 03:29:13,392 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:29:13,392 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 03:29:13,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:29:13,429 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:29:13,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-01-25 03:29:13,528 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 03:29:13,561 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 23 treesize of output 22 [2018-01-25 03:29:13,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 03:29:13,571 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 25 treesize of output 24 [2018-01-25 03:29:13,572 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 03:29:13,597 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 22 treesize of output 21 [2018-01-25 03:29:13,597 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 03:29:13,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 03:29:13,619 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-25 03:29:13,886 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 03:29:13,886 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 03:29:13,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2018-01-25 03:29:13,888 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 03:29:13,938 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 03:29:13,940 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 03:29:13,941 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 47 treesize of output 60 [2018-01-25 03:29:13,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 03:29:14,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-01-25 03:29:14,040 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 03:29:14,078 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 03:29:14,079 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 03:29:14,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-01-25 03:29:14,080 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 03:29:14,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-01-25 03:29:14,116 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-01-25 03:29:14,282 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:29:14,283 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:29:15,257 WARN L146 SmtUtils]: Spent 795ms on a formula simplification. DAG size of input: 46 DAG size of output 34 [2018-01-25 03:29:15,279 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 27 [2018-01-25 03:29:19,516 WARN L146 SmtUtils]: Spent 4103ms on a formula simplification. DAG size of input: 84 DAG size of output 31 [2018-01-25 03:29:19,539 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-01-25 03:29:20,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-01-25 03:29:20,020 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 03:29:20,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2018-01-25 03:29:20,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-01-25 03:29:20,053 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 03:29:20,059 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 03:29:20,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-01-25 03:29:20,085 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 03:29:20,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 03:29:20,107 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:86, output treesize:15 [2018-01-25 03:29:20,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 55 [2018-01-25 03:29:20,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 5 [2018-01-25 03:29:20,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 03:29:20,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 03:29:20,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-01-25 03:29:20,907 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 03:29:20,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-01-25 03:29:20,936 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 03:29:20,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-25 03:29:20,961 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:118, output treesize:53 [2018-01-25 03:29:22,230 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:29:22,264 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:29:22,264 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 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 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 03:29:22,269 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:29:22,269 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 03:29:22,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:29:22,322 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:29:22,330 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 23 treesize of output 22 [2018-01-25 03:29:22,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 03:29:22,356 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 26 treesize of output 25 [2018-01-25 03:29:22,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 03:29:22,373 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 22 treesize of output 21 [2018-01-25 03:29:22,373 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 03:29:22,433 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 25 treesize of output 24 [2018-01-25 03:29:22,434 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 03:29:22,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 03:29:22,454 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-25 03:29:22,692 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 03:29:22,693 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 03:29:22,694 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 54 treesize of output 67 [2018-01-25 03:29:22,694 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 03:29:22,749 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 03:29:22,750 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 03:29:22,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-01-25 03:29:22,751 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 03:29:22,798 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 03:29:22,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 48 [2018-01-25 03:29:22,801 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 03:29:22,849 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 03:29:22,850 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 03:29:22,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2018-01-25 03:29:22,851 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 03:29:22,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-01-25 03:29:22,888 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-01-25 03:29:22,989 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:29:22,989 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:29:23,063 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 27 [2018-01-25 03:29:32,100 WARN L146 SmtUtils]: Spent 4737ms on a formula simplification. DAG size of input: 84 DAG size of output 31 [2018-01-25 03:29:32,113 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-01-25 03:29:40,350 WARN L146 SmtUtils]: Spent 3906ms on a formula simplification. DAG size of input: 73 DAG size of output 40 [2018-01-25 03:29:40,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 37 [2018-01-25 03:29:40,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-01-25 03:29:40,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 03:29:40,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 03:29:40,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-01-25 03:29:40,544 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 03:29:40,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-01-25 03:29:40,560 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 03:29:40,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 03:29:40,572 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:86, output treesize:15 [2018-01-25 03:29:41,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-01-25 03:29:41,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 03:29:42,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2018-01-25 03:29:42,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 03:29:42,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 49 [2018-01-25 03:29:42,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 5 [2018-01-25 03:29:42,084 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 03:29:42,094 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 03:29:42,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-25 03:29:42,125 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:118, output treesize:53 [2018-01-25 03:29:42,294 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:29:42,296 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 03:29:42,297 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10, 10, 10] total 29 [2018-01-25 03:29:42,297 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 03:29:42,297 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-25 03:29:42,298 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-25 03:29:42,298 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=778, Unknown=5, NotChecked=0, Total=870 [2018-01-25 03:29:42,298 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. Second operand 19 states. [2018-01-25 03:29:44,894 WARN L146 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 67 DAG size of output 64 Received shutdown request... [2018-01-25 03:29:47,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 03:29:52,040 WARN L491 AbstractCegarLoop]: Verification canceled Cannot interrupt operation gracefully because timeout expired. Forcing shutdown