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.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 15:19:00,575 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 15:19:00,577 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 15:19:00,592 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 15:19:00,593 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 15:19:00,594 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 15:19:00,595 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 15:19:00,597 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 15:19:00,598 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 15:19:00,599 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 15:19:00,599 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 15:19:00,599 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 15:19:00,600 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 15:19:00,601 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 15:19:00,601 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 15:19:00,604 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 15:19:00,606 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 15:19:00,608 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 15:19:00,610 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 15:19:00,611 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 15:19:00,613 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 15:19:00,613 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 15:19:00,614 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 15:19:00,615 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 15:19:00,615 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 15:19:00,617 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 15:19:00,617 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 15:19:00,618 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 15:19:00,618 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 15:19:00,618 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 15:19:00,619 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 15:19:00,619 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.epf [2018-01-24 15:19:00,629 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 15:19:00,629 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 15:19:00,630 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 15:19:00,630 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 15:19:00,631 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 15:19:00,631 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 15:19:00,631 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 15:19:00,632 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 15:19:00,632 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 15:19:00,632 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 15:19:00,632 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 15:19:00,632 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 15:19:00,633 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 15:19:00,633 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 15:19:00,633 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 15:19:00,633 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 15:19:00,633 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 15:19:00,634 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 15:19:00,634 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 15:19:00,634 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 15:19:00,634 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 15:19:00,635 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 15:19:00,635 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 15:19:00,635 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 15:19:00,635 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 15:19:00,635 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 15:19:00,636 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 15:19:00,636 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 15:19:00,636 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 15:19:00,636 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 15:19:00,636 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 15:19:00,637 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 15:19:00,637 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 15:19:00,638 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 15:19:00,638 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 15:19:00,673 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 15:19:00,687 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 15:19:00,691 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 15:19:00,693 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 15:19:00,693 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 15:19:00,694 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-01-24 15:19:00,893 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 15:19:00,899 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 15:19:00,900 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 15:19:00,900 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 15:19:00,906 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 15:19:00,907 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 03:19:00" (1/1) ... [2018-01-24 15:19:00,910 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1365a45b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:19:00, skipping insertion in model container [2018-01-24 15:19:00,910 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 03:19:00" (1/1) ... [2018-01-24 15:19:00,927 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 15:19:00,967 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 15:19:01,075 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 15:19:01,090 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 15:19:01,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:19:01 WrapperNode [2018-01-24 15:19:01,098 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 15:19:01,098 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 15:19:01,098 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 15:19:01,098 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 15:19:01,112 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:19:01" (1/1) ... [2018-01-24 15:19:01,112 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:19:01" (1/1) ... [2018-01-24 15:19:01,123 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:19:01" (1/1) ... [2018-01-24 15:19:01,123 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:19:01" (1/1) ... [2018-01-24 15:19:01,126 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:19:01" (1/1) ... [2018-01-24 15:19:01,129 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:19:01" (1/1) ... [2018-01-24 15:19:01,130 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:19:01" (1/1) ... [2018-01-24 15:19:01,132 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 15:19:01,132 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 15:19:01,132 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 15:19:01,132 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 15:19:01,133 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:19:01" (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-24 15:19:01,180 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 15:19:01,181 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 15:19:01,181 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcspn [2018-01-24 15:19:01,181 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 15:19:01,181 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 15:19:01,181 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 15:19:01,181 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 15:19:01,181 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 15:19:01,181 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 15:19:01,181 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 15:19:01,182 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcspn [2018-01-24 15:19:01,182 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 15:19:01,182 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 15:19:01,182 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 15:19:01,396 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 15:19:01,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 03:19:01 BoogieIcfgContainer [2018-01-24 15:19:01,397 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 15:19:01,397 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 15:19:01,397 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 15:19:01,400 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 15:19:01,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 03:19:00" (1/3) ... [2018-01-24 15:19:01,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68144f3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 03:19:01, skipping insertion in model container [2018-01-24 15:19:01,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:19:01" (2/3) ... [2018-01-24 15:19:01,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68144f3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 03:19:01, skipping insertion in model container [2018-01-24 15:19:01,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 03:19:01" (3/3) ... [2018-01-24 15:19:01,403 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-01-24 15:19:01,409 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 15:19:01,415 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-24 15:19:01,461 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 15:19:01,461 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 15:19:01,461 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 15:19:01,461 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 15:19:01,461 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 15:19:01,461 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 15:19:01,462 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 15:19:01,462 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 15:19:01,463 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 15:19:01,484 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-01-24 15:19:01,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 15:19:01,491 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:19:01,492 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:19:01,492 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:19:01,497 INFO L82 PathProgramCache]: Analyzing trace with hash -839073384, now seen corresponding path program 1 times [2018-01-24 15:19:01,500 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:19:01,548 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:19:01,549 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:19:01,549 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:19:01,549 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:19:01,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:19:01,608 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:19:01,776 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-24 15:19:01,778 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:19:01,778 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 15:19:01,778 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:19:01,780 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 15:19:01,856 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 15:19:01,857 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 15:19:01,860 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 4 states. [2018-01-24 15:19:01,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:19:01,949 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2018-01-24 15:19:01,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 15:19:01,951 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-24 15:19:01,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:19:01,963 INFO L225 Difference]: With dead ends: 70 [2018-01-24 15:19:01,963 INFO L226 Difference]: Without dead ends: 41 [2018-01-24 15:19:01,967 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:19:01,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-24 15:19:02,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-01-24 15:19:02,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-24 15:19:02,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-01-24 15:19:02,009 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 13 [2018-01-24 15:19:02,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:19:02,009 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-01-24 15:19:02,010 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 15:19:02,010 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-01-24 15:19:02,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 15:19:02,010 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:19:02,011 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:19:02,011 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:19:02,011 INFO L82 PathProgramCache]: Analyzing trace with hash -839073383, now seen corresponding path program 1 times [2018-01-24 15:19:02,011 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:19:02,012 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:19:02,013 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:19:02,013 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:19:02,013 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:19:02,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:19:02,033 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:19:02,193 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-24 15:19:02,193 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:19:02,193 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 15:19:02,193 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:19:02,195 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:19:02,196 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:19:02,196 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:19:02,196 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 6 states. [2018-01-24 15:19:02,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:19:02,314 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-01-24 15:19:02,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:19:02,314 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-01-24 15:19:02,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:19:02,315 INFO L225 Difference]: With dead ends: 41 [2018-01-24 15:19:02,315 INFO L226 Difference]: Without dead ends: 40 [2018-01-24 15:19:02,316 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-24 15:19:02,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-24 15:19:02,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-01-24 15:19:02,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-24 15:19:02,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-01-24 15:19:02,321 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 13 [2018-01-24 15:19:02,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:19:02,321 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-01-24 15:19:02,321 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:19:02,321 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-01-24 15:19:02,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 15:19:02,322 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:19:02,322 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:19:02,322 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:19:02,322 INFO L82 PathProgramCache]: Analyzing trace with hash -241471094, now seen corresponding path program 1 times [2018-01-24 15:19:02,322 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:19:02,323 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:19:02,323 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:19:02,323 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:19:02,323 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:19:02,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:19:02,338 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:19:02,377 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-24 15:19:02,378 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:19:02,378 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 15:19:02,378 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:19:02,378 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 15:19:02,379 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 15:19:02,379 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 15:19:02,379 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 4 states. [2018-01-24 15:19:02,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:19:02,446 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-01-24 15:19:02,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 15:19:02,446 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 15:19:02,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:19:02,447 INFO L225 Difference]: With dead ends: 40 [2018-01-24 15:19:02,447 INFO L226 Difference]: Without dead ends: 39 [2018-01-24 15:19:02,448 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:19:02,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-01-24 15:19:02,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-01-24 15:19:02,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-01-24 15:19:02,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-01-24 15:19:02,453 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 14 [2018-01-24 15:19:02,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:19:02,453 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-01-24 15:19:02,453 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 15:19:02,453 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-01-24 15:19:02,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 15:19:02,454 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:19:02,454 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:19:02,454 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:19:02,455 INFO L82 PathProgramCache]: Analyzing trace with hash -241471093, now seen corresponding path program 1 times [2018-01-24 15:19:02,455 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:19:02,456 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:19:02,456 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:19:02,456 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:19:02,456 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:19:02,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:19:02,471 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:19:02,557 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-24 15:19:02,558 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:19:02,558 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 15:19:02,558 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:19:02,558 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:19:02,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:19:02,559 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:19:02,559 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 5 states. [2018-01-24 15:19:02,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:19:02,601 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-01-24 15:19:02,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:19:02,601 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 15:19:02,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:19:02,602 INFO L225 Difference]: With dead ends: 39 [2018-01-24 15:19:02,602 INFO L226 Difference]: Without dead ends: 38 [2018-01-24 15:19:02,602 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:19:02,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-24 15:19:02,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-01-24 15:19:02,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-24 15:19:02,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-01-24 15:19:02,607 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 14 [2018-01-24 15:19:02,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:19:02,607 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-01-24 15:19:02,607 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:19:02,608 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-01-24 15:19:02,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 15:19:02,608 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:19:02,608 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-24 15:19:02,608 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:19:02,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1727701620, now seen corresponding path program 1 times [2018-01-24 15:19:02,608 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:19:02,609 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:19:02,609 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:19:02,609 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:19:02,610 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:19:02,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:19:02,620 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:19:02,659 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-24 15:19:02,660 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:19:02,660 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 15:19:02,660 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:19:02,661 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:19:02,661 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:19:02,661 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:19:02,661 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 6 states. [2018-01-24 15:19:02,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:19:02,770 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2018-01-24 15:19:02,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:19:02,771 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 15:19:02,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:19:02,771 INFO L225 Difference]: With dead ends: 38 [2018-01-24 15:19:02,771 INFO L226 Difference]: Without dead ends: 37 [2018-01-24 15:19:02,772 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-24 15:19:02,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-01-24 15:19:02,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-01-24 15:19:02,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-24 15:19:02,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-01-24 15:19:02,778 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 19 [2018-01-24 15:19:02,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:19:02,779 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-01-24 15:19:02,779 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:19:02,779 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-01-24 15:19:02,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 15:19:02,780 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:19:02,780 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-24 15:19:02,780 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:19:02,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1727701619, now seen corresponding path program 1 times [2018-01-24 15:19:02,781 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:19:02,782 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:19:02,782 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:19:02,782 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:19:02,782 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:19:02,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:19:02,798 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:19:02,934 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-24 15:19:02,934 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:19:02,934 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 15:19:02,934 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:19:02,935 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 15:19:02,935 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 15:19:02,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 15:19:02,936 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 9 states. [2018-01-24 15:19:03,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:19:03,036 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2018-01-24 15:19:03,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 15:19:03,036 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-01-24 15:19:03,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:19:03,037 INFO L225 Difference]: With dead ends: 42 [2018-01-24 15:19:03,037 INFO L226 Difference]: Without dead ends: 41 [2018-01-24 15:19:03,037 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-01-24 15:19:03,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-24 15:19:03,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-01-24 15:19:03,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-24 15:19:03,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-01-24 15:19:03,043 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 19 [2018-01-24 15:19:03,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:19:03,043 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-01-24 15:19:03,044 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 15:19:03,044 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-01-24 15:19:03,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 15:19:03,044 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:19:03,044 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-24 15:19:03,045 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:19:03,045 INFO L82 PathProgramCache]: Analyzing trace with hash 929099078, now seen corresponding path program 1 times [2018-01-24 15:19:03,045 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:19:03,046 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:19:03,046 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:19:03,046 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:19:03,046 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:19:03,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:19:03,060 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:19:03,111 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-24 15:19:03,112 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:19:03,112 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 15:19:03,112 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:19:03,112 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 15:19:03,112 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 15:19:03,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 15:19:03,113 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 7 states. [2018-01-24 15:19:03,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:19:03,244 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-01-24 15:19:03,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 15:19:03,244 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-01-24 15:19:03,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:19:03,245 INFO L225 Difference]: With dead ends: 41 [2018-01-24 15:19:03,245 INFO L226 Difference]: Without dead ends: 40 [2018-01-24 15:19:03,245 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-01-24 15:19:03,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-24 15:19:03,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-01-24 15:19:03,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-01-24 15:19:03,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-01-24 15:19:03,249 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 22 [2018-01-24 15:19:03,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:19:03,249 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-01-24 15:19:03,249 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 15:19:03,249 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-01-24 15:19:03,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 15:19:03,250 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:19:03,250 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-24 15:19:03,250 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:19:03,250 INFO L82 PathProgramCache]: Analyzing trace with hash 929099079, now seen corresponding path program 1 times [2018-01-24 15:19:03,251 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:19:03,251 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:19:03,251 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:19:03,251 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:19:03,251 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:19:03,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:19:03,263 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:19:03,400 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-24 15:19:03,400 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:19:03,400 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 15:19:03,400 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:19:03,401 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 15:19:03,401 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 15:19:03,401 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-24 15:19:03,402 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 10 states. [2018-01-24 15:19:03,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:19:03,502 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-01-24 15:19:03,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 15:19:03,503 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-01-24 15:19:03,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:19:03,503 INFO L225 Difference]: With dead ends: 44 [2018-01-24 15:19:03,503 INFO L226 Difference]: Without dead ends: 43 [2018-01-24 15:19:03,504 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-01-24 15:19:03,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-24 15:19:03,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2018-01-24 15:19:03,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-24 15:19:03,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-01-24 15:19:03,508 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 22 [2018-01-24 15:19:03,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:19:03,508 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-01-24 15:19:03,508 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 15:19:03,508 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-01-24 15:19:03,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 15:19:03,509 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:19:03,509 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] [2018-01-24 15:19:03,509 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:19:03,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1211791035, now seen corresponding path program 1 times [2018-01-24 15:19:03,509 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:19:03,510 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:19:03,510 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:19:03,510 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:19:03,510 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:19:03,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:19:03,526 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:19:03,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:19:03,709 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:19:03,709 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-24 15:19:03,709 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:19:03,709 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 15:19:03,709 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 15:19:03,709 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-01-24 15:19:03,710 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 12 states. [2018-01-24 15:19:03,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:19:03,968 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2018-01-24 15:19:03,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-24 15:19:03,969 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2018-01-24 15:19:03,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:19:03,970 INFO L225 Difference]: With dead ends: 101 [2018-01-24 15:19:03,970 INFO L226 Difference]: Without dead ends: 79 [2018-01-24 15:19:03,971 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2018-01-24 15:19:03,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-24 15:19:03,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 63. [2018-01-24 15:19:03,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-24 15:19:03,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-01-24 15:19:03,981 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 27 [2018-01-24 15:19:03,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:19:03,981 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-01-24 15:19:03,982 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 15:19:03,982 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-01-24 15:19:03,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 15:19:03,983 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:19:03,983 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] [2018-01-24 15:19:03,983 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:19:03,983 INFO L82 PathProgramCache]: Analyzing trace with hash 394142585, now seen corresponding path program 1 times [2018-01-24 15:19:03,983 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:19:03,984 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:19:03,984 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:19:03,984 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:19:03,984 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:19:04,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:19:04,001 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:19:04,229 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:19:04,229 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:19:04,258 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:19:04,259 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-01-24 15:19:04,261 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [11], [12], [15], [19], [20], [22], [23], [27], [33], [44], [49], [55], [57], [58], [59], [60], [61], [64], [75], [76], [77], [79] [2018-01-24 15:19:04,308 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:19:04,308 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:19:05,460 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:19:05,462 INFO L268 AbstractInterpreter]: Visited 26 different actions 36 times. Merged at 6 different actions 10 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 30 variables. [2018-01-24 15:19:05,478 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:19:05,478 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:19:05,478 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-24 15:19:05,490 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:19:05,491 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:19:05,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:19:05,530 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:19:05,568 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 14 treesize of output 11 [2018-01-24 15:19:05,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 11 treesize of output 10 [2018-01-24 15:19:05,571 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:19:05,574 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:19:05,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 15:19:05,580 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 15:19:05,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-24 15:19:05,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 15:19:05,832 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 15:19:05,839 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:19:05,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:19:05,850 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-01-24 15:19:05,948 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:19:05,948 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:19:06,239 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 12 [2018-01-24 15:19:06,239 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:19:06,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-24 15:19:06,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 15:19:06,258 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 15:19:06,259 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:19:06,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:19:06,265 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-01-24 15:19:06,286 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:19:06,306 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:19:06,306 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-24 15:19:06,310 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:19:06,310 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:19:06,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:19:06,391 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:19:06,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 15:19:06,395 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:19:06,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:19:06,413 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-24 15:19:06,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 15:19:06,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 15:19:06,497 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:19:06,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:19:06,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:19:06,505 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-24 15:19:07,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-24 15:19:07,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-24 15:19:07,306 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 15:19:07,308 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:19:07,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:19:07,314 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:30 [2018-01-24 15:19:07,453 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:19:07,454 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:19:07,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-24 15:19:07,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 15:19:07,605 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:19:07,607 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:19:07,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:19:07,612 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-01-24 15:19:07,689 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:19:07,691 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:19:07,691 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11, 13, 13] total 46 [2018-01-24 15:19:07,691 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:19:07,691 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-24 15:19:07,692 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-24 15:19:07,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1980, Unknown=1, NotChecked=0, Total=2162 [2018-01-24 15:19:07,693 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 21 states. [2018-01-24 15:19:08,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:19:08,997 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2018-01-24 15:19:08,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 15:19:08,997 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 27 [2018-01-24 15:19:08,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:19:08,999 INFO L225 Difference]: With dead ends: 79 [2018-01-24 15:19:09,000 INFO L226 Difference]: Without dead ends: 78 [2018-01-24 15:19:09,001 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 745 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=358, Invalid=3063, Unknown=1, NotChecked=0, Total=3422 [2018-01-24 15:19:09,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-24 15:19:09,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 68. [2018-01-24 15:19:09,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-24 15:19:09,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2018-01-24 15:19:09,013 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 27 [2018-01-24 15:19:09,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:19:09,014 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2018-01-24 15:19:09,014 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-24 15:19:09,014 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2018-01-24 15:19:09,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 15:19:09,015 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:19:09,015 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] [2018-01-24 15:19:09,015 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:19:09,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1089255981, now seen corresponding path program 1 times [2018-01-24 15:19:09,016 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:19:09,017 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:19:09,017 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:19:09,017 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:19:09,017 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:19:09,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:19:09,033 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:19:09,291 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:19:09,292 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:19:09,322 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:19:09,322 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-01-24 15:19:09,322 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [11], [12], [14], [15], [19], [20], [23], [27], [31], [44], [49], [53], [57], [58], [59], [60], [61], [64], [75], [76], [77], [79] [2018-01-24 15:19:09,323 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:19:09,323 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:19:11,423 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:19:11,423 INFO L268 AbstractInterpreter]: Visited 26 different actions 41 times. Merged at 10 different actions 15 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 30 variables. [2018-01-24 15:19:11,435 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:19:11,436 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:19:11,436 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:19:11,443 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:19:11,443 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:19:11,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:19:11,470 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:19:11,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 15:19:11,474 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:19:11,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:19:11,494 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 15:19:11,538 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:19:11,539 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:19:11,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 15:19:11,539 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:19:11,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:19:11,551 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-24 15:19:11,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-24 15:19:11,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 11 treesize of output 10 [2018-01-24 15:19:11,598 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:19:11,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:19:11,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 15:19:11,605 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-01-24 15:19:11,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-01-24 15:19:11,640 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 11 treesize of output 10 [2018-01-24 15:19:11,641 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:19:11,645 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:19:11,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-24 15:19:11,654 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-01-24 15:19:11,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2018-01-24 15:19:11,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-01-24 15:19:11,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:19:11,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 15:19:11,891 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 15:19:11,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:19:11,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:19:11,903 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2018-01-24 15:19:11,995 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:19:11,995 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:19:12,301 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 12 [2018-01-24 15:19:12,302 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:19:12,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-24 15:19:12,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 15:19:12,316 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 15:19:12,317 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:19:12,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:19:12,323 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:7 [2018-01-24 15:19:12,362 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:19:12,382 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:19:12,382 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 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 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:19:12,385 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:19:12,386 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:19:12,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:19:12,438 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:19:12,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 15:19:12,444 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:19:12,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 15:19:12,451 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:19:12,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:19:12,458 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 15:19:12,546 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:19:12,547 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:19:12,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 15:19:12,548 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:19:12,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-24 15:19:12,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:19:12,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:19:12,563 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-24 15:19:12,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 15:19:12,636 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 13 treesize of output 12 [2018-01-24 15:19:12,636 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:19:12,637 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:19:12,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:19:12,643 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-01-24 15:19:12,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-01-24 15:19:12,693 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 13 treesize of output 12 [2018-01-24 15:19:12,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:19:12,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:19:12,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 15:19:12,703 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2018-01-24 15:19:12,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-01-24 15:19:12,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-01-24 15:19:12,935 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:19:12,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-24 15:19:12,943 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 15:19:12,946 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:19:12,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:19:12,951 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:43, output treesize:30 [2018-01-24 15:19:13,152 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:19:13,153 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:19:13,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-24 15:19:13,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 15:19:13,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:19:13,472 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:19:13,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:19:13,477 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:21 [2018-01-24 15:19:13,646 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:19:13,648 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:19:13,648 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 12, 15, 14] total 59 [2018-01-24 15:19:13,648 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:19:13,648 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-24 15:19:13,649 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-24 15:19:13,649 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=3307, Unknown=0, NotChecked=0, Total=3540 [2018-01-24 15:19:13,650 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand 28 states. [2018-01-24 15:19:14,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:19:14,965 INFO L93 Difference]: Finished difference Result 101 states and 114 transitions. [2018-01-24 15:19:14,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-24 15:19:14,965 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2018-01-24 15:19:14,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:19:14,966 INFO L225 Difference]: With dead ends: 101 [2018-01-24 15:19:14,966 INFO L226 Difference]: Without dead ends: 100 [2018-01-24 15:19:14,967 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 64 SyntacticMatches, 4 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1314 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=444, Invalid=5106, Unknown=0, NotChecked=0, Total=5550 [2018-01-24 15:19:14,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-24 15:19:14,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2018-01-24 15:19:14,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-24 15:19:14,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 106 transitions. [2018-01-24 15:19:14,981 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 106 transitions. Word has length 28 [2018-01-24 15:19:14,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:19:14,982 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 106 transitions. [2018-01-24 15:19:14,982 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-24 15:19:14,982 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2018-01-24 15:19:14,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 15:19:14,983 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:19:14,983 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-24 15:19:14,983 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:19:14,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1759144044, now seen corresponding path program 1 times [2018-01-24 15:19:14,983 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:19:14,984 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:19:14,984 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:19:14,984 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:19:14,984 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:19:15,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:19:15,004 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:19:15,112 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-24 15:19:15,112 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:19:15,112 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 15:19:15,112 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:19:15,113 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:19:15,113 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:19:15,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:19:15,113 INFO L87 Difference]: Start difference. First operand 93 states and 106 transitions. Second operand 6 states. [2018-01-24 15:19:15,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:19:15,245 INFO L93 Difference]: Finished difference Result 93 states and 106 transitions. [2018-01-24 15:19:15,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 15:19:15,245 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-01-24 15:19:15,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:19:15,246 INFO L225 Difference]: With dead ends: 93 [2018-01-24 15:19:15,246 INFO L226 Difference]: Without dead ends: 82 [2018-01-24 15:19:15,247 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 15:19:15,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-01-24 15:19:15,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-01-24 15:19:15,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-24 15:19:15,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2018-01-24 15:19:15,265 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 32 [2018-01-24 15:19:15,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:19:15,266 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2018-01-24 15:19:15,266 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:19:15,266 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2018-01-24 15:19:15,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 15:19:15,267 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:19:15,267 INFO L322 BasicCegarLoop]: trace histogram [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] [2018-01-24 15:19:15,267 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:19:15,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1832996809, now seen corresponding path program 2 times [2018-01-24 15:19:15,268 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:19:15,268 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:19:15,268 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:19:15,269 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:19:15,269 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:19:15,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:19:15,283 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:19:15,560 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:19:15,560 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:19:15,560 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:19:15,560 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 15:19:15,560 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 15:19:15,560 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:19:15,561 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:19:15,566 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:19:15,566 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:19:15,577 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:19:15,582 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:19:15,584 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:19:15,587 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:19:15,602 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 14 treesize of output 11 [2018-01-24 15:19:15,603 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 11 treesize of output 10 [2018-01-24 15:19:15,603 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:19:15,604 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:19:15,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 15:19:15,608 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 15:19:15,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-01-24 15:19:15,889 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:19:15,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 35 [2018-01-24 15:19:15,901 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 15:19:15,910 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:19:15,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:19:15,923 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:43 [2018-01-24 15:19:15,996 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:19:15,996 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:19:16,461 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 12 [2018-01-24 15:19:16,462 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:19:16,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-01-24 15:19:16,483 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 15:19:16,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 15:19:16,485 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 15:19:16,488 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:19:16,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:19:16,493 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:52, output treesize:10 [2018-01-24 15:19:16,509 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:19:16,529 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:19:16,529 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 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 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:19:16,532 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:19:16,532 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:19:16,550 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:19:16,573 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:19:16,607 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:19:16,613 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:19:16,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 15:19:16,616 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:19:16,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:19:16,619 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 15:19:16,650 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 15 treesize of output 12 [2018-01-24 15:19:16,651 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 12 treesize of output 11 [2018-01-24 15:19:16,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:19:16,653 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:19:16,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:19:16,654 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-24 15:19:16,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-01-24 15:19:16,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-01-24 15:19:16,902 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 15:19:16,904 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:19:16,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:19:16,909 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-01-24 15:19:16,937 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:19:16,937 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:19:17,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2018-01-24 15:19:17,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-01-24 15:19:17,473 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:19:17,475 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:19:17,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:19:17,481 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:35 [2018-01-24 15:19:17,595 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:19:17,597 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:19:17,597 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15, 14, 14] total 56 [2018-01-24 15:19:17,597 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:19:17,597 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-24 15:19:17,597 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-24 15:19:17,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=3007, Unknown=0, NotChecked=0, Total=3192 [2018-01-24 15:19:17,598 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand 27 states. [2018-01-24 15:19:23,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:19:23,681 INFO L93 Difference]: Finished difference Result 141 states and 154 transitions. [2018-01-24 15:19:23,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-01-24 15:19:23,681 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 32 [2018-01-24 15:19:23,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:19:23,683 INFO L225 Difference]: With dead ends: 141 [2018-01-24 15:19:23,683 INFO L226 Difference]: Without dead ends: 140 [2018-01-24 15:19:23,685 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 82 SyntacticMatches, 3 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1944 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=918, Invalid=8982, Unknown=0, NotChecked=0, Total=9900 [2018-01-24 15:19:23,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-01-24 15:19:23,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 86. [2018-01-24 15:19:23,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-24 15:19:23,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2018-01-24 15:19:23,700 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 32 [2018-01-24 15:19:23,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:19:23,700 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2018-01-24 15:19:23,700 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-24 15:19:23,700 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2018-01-24 15:19:23,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-24 15:19:23,701 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:19:23,701 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:19:23,701 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:19:23,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1916750925, now seen corresponding path program 2 times [2018-01-24 15:19:23,702 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:19:23,702 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:19:23,703 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 15:19:23,703 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:19:23,703 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:19:23,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:19:23,713 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:19:24,117 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:19:24,118 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:19:24,118 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:19:24,118 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 15:19:24,118 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 15:19:24,118 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:19:24,118 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:19:24,122 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:19:24,123 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:19:24,133 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:19:24,140 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:19:24,142 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:19:24,145 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:19:24,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 15:19:24,149 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:19:24,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 15:19:24,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:19:24,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:19:24,157 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 15:19:24,193 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:19:24,193 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:19:24,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 15:19:24,194 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:19:24,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-24 15:19:24,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:19:24,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:19:24,204 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-24 15:19:24,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 15:19:24,245 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 13 treesize of output 12 [2018-01-24 15:19:24,246 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:19:24,247 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:19:24,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 15:19:24,252 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-01-24 15:19:24,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-01-24 15:19:24,284 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 13 treesize of output 12 [2018-01-24 15:19:24,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:19:24,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:19:24,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-24 15:19:24,293 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2018-01-24 15:19:24,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2018-01-24 15:19:24,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-01-24 15:19:24,597 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 15:19:24,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-01-24 15:19:24,605 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 15:19:24,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:19:24,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:19:24,618 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:52, output treesize:37 [2018-01-24 15:19:24,779 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:19:24,780 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:19:26,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-24 15:19:26,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 15:19:26,043 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:19:26,044 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:19:26,084 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-24 15:19:26,085 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:44 [2018-01-24 15:19:26,259 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:19:26,292 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:19:26,292 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 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 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:19:26,297 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:19:26,297 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:19:26,316 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:19:26,349 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:19:26,388 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:19:26,395 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:19:26,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 15:19:26,400 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:19:26,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 15:19:26,405 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:19:26,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:19:26,409 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 15:19:26,456 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:19:26,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-24 15:19:26,458 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:19:26,467 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:19:26,468 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:19:26,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 15:19:26,469 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:19:26,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:19:26,473 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-24 15:19:26,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-24 15:19:26,546 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 12 treesize of output 11 [2018-01-24 15:19:26,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:19:26,547 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:19:26,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:19:26,551 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-24 15:19:26,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-01-24 15:19:26,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 13 treesize of output 12 [2018-01-24 15:19:26,597 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:19:26,600 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:19:26,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 15:19:26,604 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-01-24 15:19:26,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2018-01-24 15:19:26,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-01-24 15:19:26,663 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:19:26,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-01-24 15:19:26,688 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 15:19:26,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:19:26,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:19:26,702 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:52, output treesize:37 [2018-01-24 15:19:26,712 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:19:26,712 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:19:26,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-24 15:19:26,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 15:19:26,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:19:26,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:19:26,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:19:26,915 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:35 [2018-01-24 15:19:27,444 WARN L143 SmtUtils]: Spent 395ms on a formula simplification that was a NOOP. DAG size: 34 [2018-01-24 15:19:27,873 WARN L143 SmtUtils]: Spent 368ms on a formula simplification that was a NOOP. DAG size: 34 [2018-01-24 15:19:27,889 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:19:27,891 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:19:27,891 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 15, 17, 15] total 51 [2018-01-24 15:19:27,892 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:19:27,892 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-24 15:19:27,892 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-24 15:19:27,893 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=2476, Unknown=0, NotChecked=0, Total=2652 [2018-01-24 15:19:27,893 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand 31 states. [2018-01-24 15:19:30,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:19:30,811 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2018-01-24 15:19:30,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-24 15:19:30,812 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 37 [2018-01-24 15:19:30,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:19:30,813 INFO L225 Difference]: With dead ends: 93 [2018-01-24 15:19:30,813 INFO L226 Difference]: Without dead ends: 62 [2018-01-24 15:19:30,814 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 107 SyntacticMatches, 6 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 930 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=453, Invalid=4239, Unknown=0, NotChecked=0, Total=4692 [2018-01-24 15:19:30,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-24 15:19:30,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 56. [2018-01-24 15:19:30,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-24 15:19:30,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2018-01-24 15:19:30,825 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 37 [2018-01-24 15:19:30,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:19:30,826 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2018-01-24 15:19:30,826 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-01-24 15:19:30,826 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2018-01-24 15:19:30,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-24 15:19:30,827 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:19:30,827 INFO L322 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:19:30,828 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:19:30,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1291649209, now seen corresponding path program 1 times [2018-01-24 15:19:30,828 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:19:30,829 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:19:30,829 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 15:19:30,829 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:19:30,829 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:19:30,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:19:30,841 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:19:31,051 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 44 proven. 15 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-01-24 15:19:31,052 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:19:31,070 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:19:31,075 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2018-01-24 15:19:31,076 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [11], [12], [15], [19], [20], [22], [23], [27], [31], [33], [44], [49], [55], [57], [58], [59], [60], [61], [64], [75], [76], [77], [79] [2018-01-24 15:19:31,077 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:19:31,077 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:19:31,851 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:19:31,851 INFO L268 AbstractInterpreter]: Visited 27 different actions 63 times. Merged at 11 different actions 30 times. Never widened. Found 8 fixpoints after 3 different actions. Largest state had 30 variables. [2018-01-24 15:19:31,855 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:19:31,855 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:19:31,855 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:19:31,861 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:19:31,861 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:19:31,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:19:31,898 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:19:31,908 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 14 treesize of output 11 [2018-01-24 15:19:31,910 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 11 treesize of output 10 [2018-01-24 15:19:31,911 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:19:31,913 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:19:31,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 15:19:31,915 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:14, output treesize:10 [2018-01-24 15:19:36,173 WARN L143 SmtUtils]: Spent 2005ms on a formula simplification that was a NOOP. DAG size: 15 [2018-01-24 15:19:40,024 WARN L143 SmtUtils]: Spent 2005ms on a formula simplification that was a NOOP. DAG size: 15 [2018-01-24 15:19:44,065 WARN L143 SmtUtils]: Spent 2004ms on a formula simplification that was a NOOP. DAG size: 15 [2018-01-24 15:19:44,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-01-24 15:19:44,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2018-01-24 15:19:44,069 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:19:44,070 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:19:44,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:19:44,071 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:25, output treesize:3 [2018-01-24 15:19:44,083 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 44 proven. 15 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-01-24 15:19:44,083 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:19:44,168 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 49 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-01-24 15:19:44,187 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:19:44,187 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 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 11 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:19:44,190 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:19:44,191 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:19:44,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:19:44,246 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:19:44,278 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 14 treesize of output 11 [2018-01-24 15:19:44,279 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 11 treesize of output 10 [2018-01-24 15:19:44,279 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:19:44,280 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:19:44,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 15:19:44,283 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-01-24 15:19:49,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-24 15:19:49,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-24 15:19:49,560 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:19:49,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:19:49,565 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-24 15:19:49,566 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-01-24 15:19:49,578 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 44 proven. 15 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-01-24 15:19:49,579 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:19:49,607 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 49 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-01-24 15:19:49,610 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:19:49,610 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 11, 16, 11] total 37 [2018-01-24 15:19:49,611 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:19:49,611 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-24 15:19:49,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-24 15:19:49,612 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1193, Unknown=7, NotChecked=0, Total=1332 [2018-01-24 15:19:49,612 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand 21 states. [2018-01-24 15:19:51,156 WARN L146 SmtUtils]: Spent 1278ms on a formula simplification. DAG size of input: 23 DAG size of output 22 [2018-01-24 15:19:53,827 WARN L146 SmtUtils]: Spent 2634ms on a formula simplification. DAG size of input: 33 DAG size of output 26 [2018-01-24 15:19:56,469 WARN L146 SmtUtils]: Spent 2597ms on a formula simplification. DAG size of input: 33 DAG size of output 27 Received shutdown request... [2018-01-24 15:19:59,098 WARN L146 SmtUtils]: Spent 2613ms on a formula simplification. DAG size of input: 36 DAG size of output 29 [2018-01-24 15:19:59,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 15:19:59,100 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 15:19:59,105 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 15:19:59,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 03:19:59 BoogieIcfgContainer [2018-01-24 15:19:59,106 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 15:19:59,107 INFO L168 Benchmark]: Toolchain (without parser) took 58213.66 ms. Allocated memory was 300.9 MB in the beginning and 807.9 MB in the end (delta: 507.0 MB). Free memory was 261.0 MB in the beginning and 361.1 MB in the end (delta: -100.1 MB). Peak memory consumption was 406.9 MB. Max. memory is 5.3 GB. [2018-01-24 15:19:59,108 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 300.9 MB. Free memory is still 267.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 15:19:59,108 INFO L168 Benchmark]: CACSL2BoogieTranslator took 197.90 ms. Allocated memory is still 300.9 MB. Free memory was 260.0 MB in the beginning and 249.8 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. [2018-01-24 15:19:59,108 INFO L168 Benchmark]: Boogie Preprocessor took 33.64 ms. Allocated memory is still 300.9 MB. Free memory was 249.8 MB in the beginning and 247.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 15:19:59,109 INFO L168 Benchmark]: RCFGBuilder took 264.58 ms. Allocated memory is still 300.9 MB. Free memory was 247.8 MB in the beginning and 230.2 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 5.3 GB. [2018-01-24 15:19:59,109 INFO L168 Benchmark]: TraceAbstraction took 57708.62 ms. Allocated memory was 300.9 MB in the beginning and 807.9 MB in the end (delta: 507.0 MB). Free memory was 230.2 MB in the beginning and 361.1 MB in the end (delta: -130.9 MB). Peak memory consumption was 376.1 MB. Max. memory is 5.3 GB. [2018-01-24 15:19:59,111 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.18 ms. Allocated memory is still 300.9 MB. Free memory is still 267.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 197.90 ms. Allocated memory is still 300.9 MB. Free memory was 260.0 MB in the beginning and 249.8 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.64 ms. Allocated memory is still 300.9 MB. Free memory was 249.8 MB in the beginning and 247.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 264.58 ms. Allocated memory is still 300.9 MB. Free memory was 247.8 MB in the beginning and 230.2 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 57708.62 ms. Allocated memory was 300.9 MB in the beginning and 807.9 MB in the end (delta: 507.0 MB). Free memory was 230.2 MB in the beginning and 361.1 MB in the end (delta: -130.9 MB). Peak memory consumption was 376.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 25 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 330 LocStat_NO_SUPPORTING_DISEQUALITIES : 56 LocStat_NO_DISJUNCTIONS : -50 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 32 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 63 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 33 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 3.125483 RENAME_VARIABLES(MILLISECONDS) : 0.492207 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 3.069746 PROJECTAWAY(MILLISECONDS) : 0.179392 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.102116 DISJOIN(MILLISECONDS) : 0.487191 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.528112 ADD_EQUALITY(MILLISECONDS) : 0.034762 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.013996 #CONJOIN_DISJUNCTIVE : 65 #RENAME_VARIABLES : 106 #UNFREEZE : 0 #CONJOIN : 116 #PROJECTAWAY : 88 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 10 #RENAME_VARIABLES_DISJUNCTIVE : 101 #ADD_EQUALITY : 65 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 25 LocStat_MAX_WEQGRAPH_SIZE : 9 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 325 LocStat_NO_SUPPORTING_DISEQUALITIES : 60 LocStat_NO_DISJUNCTIONS : -50 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 32 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 64 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 33 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 10.213965 RENAME_VARIABLES(MILLISECONDS) : 2.214121 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 10.153366 PROJECTAWAY(MILLISECONDS) : 32.449788 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.077088 DISJOIN(MILLISECONDS) : 0.571045 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 2.251342 ADD_EQUALITY(MILLISECONDS) : 0.021760 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.009666 #CONJOIN_DISJUNCTIVE : 76 #RENAME_VARIABLES : 126 #UNFREEZE : 0 #CONJOIN : 127 #PROJECTAWAY : 98 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 14 #RENAME_VARIABLES_DISJUNCTIVE : 121 #ADD_EQUALITY : 66 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 25 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 338 LocStat_NO_SUPPORTING_DISEQUALITIES : 54 LocStat_NO_DISJUNCTIONS : -50 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 33 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 64 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 34 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.537421 RENAME_VARIABLES(MILLISECONDS) : 0.195798 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.475611 PROJECTAWAY(MILLISECONDS) : 0.066862 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.064702 DISJOIN(MILLISECONDS) : 0.274155 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.223884 ADD_EQUALITY(MILLISECONDS) : 0.019980 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.010985 #CONJOIN_DISJUNCTIVE : 109 #RENAME_VARIABLES : 197 #UNFREEZE : 0 #CONJOIN : 163 #PROJECTAWAY : 135 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 12 #RENAME_VARIABLES_DISJUNCTIVE : 189 #ADD_EQUALITY : 66 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was constructing difference of abstraction (56states) and interpolant automaton (currently 15 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (40 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was constructing difference of abstraction (56states) and interpolant automaton (currently 15 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (40 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (56states) and interpolant automaton (currently 15 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (40 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (56states) and interpolant automaton (currently 15 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (40 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (56states) and interpolant automaton (currently 15 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (40 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was constructing difference of abstraction (56states) and interpolant automaton (currently 15 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (40 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (56states) and interpolant automaton (currently 15 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (40 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was constructing difference of abstraction (56states) and interpolant automaton (currently 15 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (40 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 554]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 554). Cancelled while BasicCegarLoop was constructing difference of abstraction (56states) and interpolant automaton (currently 15 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (40 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 45 locations, 9 error locations. TIMEOUT Result, 57.6s OverallTime, 15 OverallIterations, 6 TraceHistogramMax, 22.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 441 SDtfs, 1016 SDslu, 2547 SDs, 0 SdLazy, 2652 SolverSat, 245 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 971 GetRequests, 523 SyntacticMatches, 27 SemanticMatches, 421 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 5550 ImplicationChecksByTransitivity, 44.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 4.1s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 97 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 29.8s InterpolantComputationTime, 732 NumberOfCodeBlocks, 732 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1055 ConstructedInterpolants, 165 QuantifiedInterpolants, 414922 SizeOfPredicates, 193 NumberOfNonLiveVariables, 1754 ConjunctsInSsa, 421 ConjunctsInUnsatCore, 35 InterpolantComputations, 10 PerfectInterpolantSequences, 307/507 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_15-19-59-122.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_15-19-59-122.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_15-19-59-122.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_15-19-59-122.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_15-19-59-122.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-24_15-19-59-122.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-24_15-19-59-122.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_15-19-59-122.csv Completed graceful shutdown