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_mostprecise.epf -i ../../../trunk/examples/svcomp/array-memsafety/subseq-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 20:00:00,244 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 20:00:00,246 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 20:00:00,260 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 20:00:00,260 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 20:00:00,261 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 20:00:00,262 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 20:00:00,264 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 20:00:00,266 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 20:00:00,266 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 20:00:00,267 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 20:00:00,268 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 20:00:00,269 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 20:00:00,270 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 20:00:00,271 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 20:00:00,274 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 20:00:00,276 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 20:00:00,278 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 20:00:00,279 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 20:00:00,280 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 20:00:00,283 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 20:00:00,283 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 20:00:00,283 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 20:00:00,284 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 20:00:00,285 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 20:00:00,286 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 20:00:00,286 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 20:00:00,287 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 20:00:00,287 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 20:00:00,287 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 20:00:00,288 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 20:00:00,288 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_mostprecise.epf [2018-01-24 20:00:00,298 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 20:00:00,299 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 20:00:00,300 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 20:00:00,300 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 20:00:00,300 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 20:00:00,300 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-24 20:00:00,301 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 20:00:00,301 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-24 20:00:00,301 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 20:00:00,302 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 20:00:00,302 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 20:00:00,302 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 20:00:00,302 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 20:00:00,303 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 20:00:00,303 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 20:00:00,303 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 20:00:00,303 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 20:00:00,303 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 20:00:00,304 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 20:00:00,304 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 20:00:00,304 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 20:00:00,304 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 20:00:00,304 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 20:00:00,305 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 20:00:00,305 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 20:00:00,305 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 20:00:00,305 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 20:00:00,306 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 20:00:00,306 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 20:00:00,306 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 20:00:00,306 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 20:00:00,306 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 20:00:00,306 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 20:00:00,307 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 20:00:00,307 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 20:00:00,308 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 20:00:00,308 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 20:00:00,346 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 20:00:00,359 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 20:00:00,363 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 20:00:00,365 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 20:00:00,365 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 20:00:00,366 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/subseq-alloca_true-valid-memsafety_true-termination.i [2018-01-24 20:00:00,538 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 20:00:00,545 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 20:00:00,546 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 20:00:00,547 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 20:00:00,555 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 20:00:00,556 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 08:00:00" (1/1) ... [2018-01-24 20:00:00,559 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27f336ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:00:00, skipping insertion in model container [2018-01-24 20:00:00,559 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 08:00:00" (1/1) ... [2018-01-24 20:00:00,574 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 20:00:00,612 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 20:00:00,735 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 20:00:00,757 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 20:00:00,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:00:00 WrapperNode [2018-01-24 20:00:00,765 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 20:00:00,766 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 20:00:00,766 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 20:00:00,766 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 20:00:00,781 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:00:00" (1/1) ... [2018-01-24 20:00:00,781 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:00:00" (1/1) ... [2018-01-24 20:00:00,790 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:00:00" (1/1) ... [2018-01-24 20:00:00,791 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:00:00" (1/1) ... [2018-01-24 20:00:00,795 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:00:00" (1/1) ... [2018-01-24 20:00:00,799 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:00:00" (1/1) ... [2018-01-24 20:00:00,800 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:00:00" (1/1) ... [2018-01-24 20:00:00,802 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 20:00:00,803 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 20:00:00,803 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 20:00:00,803 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 20:00:00,804 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:00:00" (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 20:00:00,854 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 20:00:00,854 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 20:00:00,854 INFO L136 BoogieDeclarations]: Found implementation of procedure subseq [2018-01-24 20:00:00,855 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 20:00:00,855 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 20:00:00,855 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 20:00:00,855 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 20:00:00,855 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 20:00:00,856 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 20:00:00,856 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 20:00:00,856 INFO L128 BoogieDeclarations]: Found specification of procedure subseq [2018-01-24 20:00:00,856 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 20:00:00,856 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 20:00:00,856 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 20:00:01,083 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 20:00:01,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 08:00:01 BoogieIcfgContainer [2018-01-24 20:00:01,127 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 20:00:01,127 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 20:00:01,128 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 20:00:01,129 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 20:00:01,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 08:00:00" (1/3) ... [2018-01-24 20:00:01,131 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@150ec638 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 08:00:01, skipping insertion in model container [2018-01-24 20:00:01,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:00:00" (2/3) ... [2018-01-24 20:00:01,131 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@150ec638 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 08:00:01, skipping insertion in model container [2018-01-24 20:00:01,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 08:00:01" (3/3) ... [2018-01-24 20:00:01,133 INFO L105 eAbstractionObserver]: Analyzing ICFG subseq-alloca_true-valid-memsafety_true-termination.i [2018-01-24 20:00:01,139 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 20:00:01,146 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-24 20:00:01,194 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 20:00:01,194 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 20:00:01,194 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 20:00:01,194 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 20:00:01,194 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 20:00:01,195 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 20:00:01,195 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 20:00:01,195 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 20:00:01,195 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 20:00:01,212 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-01-24 20:00:01,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 20:00:01,218 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:00:01,219 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:00:01,219 INFO L371 AbstractCegarLoop]: === Iteration 1 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 20:00:01,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1068442526, now seen corresponding path program 1 times [2018-01-24 20:00:01,225 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:00:01,266 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:00:01,266 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:00:01,266 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:00:01,266 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:00:01,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:00:01,328 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:00:01,474 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 20:00:01,477 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:00:01,478 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 20:00:01,478 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:00:01,480 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 20:00:01,491 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 20:00:01,492 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 20:00:01,493 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 4 states. [2018-01-24 20:00:01,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:00:01,711 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2018-01-24 20:00:01,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 20:00:01,713 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-24 20:00:01,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:00:01,721 INFO L225 Difference]: With dead ends: 71 [2018-01-24 20:00:01,721 INFO L226 Difference]: Without dead ends: 51 [2018-01-24 20:00:01,724 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 20:00:01,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-24 20:00:01,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-24 20:00:01,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-24 20:00:01,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-01-24 20:00:01,759 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 13 [2018-01-24 20:00:01,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:00:01,760 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-01-24 20:00:01,760 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 20:00:01,760 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-01-24 20:00:01,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 20:00:01,761 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:00:01,761 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:00:01,761 INFO L371 AbstractCegarLoop]: === Iteration 2 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 20:00:01,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1068442527, now seen corresponding path program 1 times [2018-01-24 20:00:01,761 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:00:01,762 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:00:01,762 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:00:01,762 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:00:01,763 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:00:01,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:00:01,790 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:00:01,997 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 20:00:01,998 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:00:01,998 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 20:00:01,998 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:00:02,000 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 20:00:02,000 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 20:00:02,000 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-24 20:00:02,001 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 6 states. [2018-01-24 20:00:02,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:00:02,094 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-01-24 20:00:02,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 20:00:02,094 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-01-24 20:00:02,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:00:02,096 INFO L225 Difference]: With dead ends: 51 [2018-01-24 20:00:02,096 INFO L226 Difference]: Without dead ends: 50 [2018-01-24 20:00:02,097 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 20:00:02,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-24 20:00:02,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-24 20:00:02,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 20:00:02,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-01-24 20:00:02,107 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 13 [2018-01-24 20:00:02,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:00:02,107 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-01-24 20:00:02,107 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 20:00:02,107 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-01-24 20:00:02,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 20:00:02,107 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:00:02,108 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:00:02,108 INFO L371 AbstractCegarLoop]: === Iteration 3 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 20:00:02,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1238020018, now seen corresponding path program 1 times [2018-01-24 20:00:02,108 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:00:02,109 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:00:02,109 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:00:02,109 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:00:02,109 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:00:02,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:00:02,120 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:00:02,144 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 20:00:02,144 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:00:02,144 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 20:00:02,145 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:00:02,145 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 20:00:02,145 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 20:00:02,145 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 20:00:02,145 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 4 states. [2018-01-24 20:00:02,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:00:02,212 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-01-24 20:00:02,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 20:00:02,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 20:00:02,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:00:02,213 INFO L225 Difference]: With dead ends: 50 [2018-01-24 20:00:02,213 INFO L226 Difference]: Without dead ends: 49 [2018-01-24 20:00:02,214 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 20:00:02,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-24 20:00:02,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-24 20:00:02,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 20:00:02,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-01-24 20:00:02,221 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 14 [2018-01-24 20:00:02,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:00:02,222 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-01-24 20:00:02,222 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 20:00:02,222 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-01-24 20:00:02,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 20:00:02,223 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:00:02,223 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:00:02,223 INFO L371 AbstractCegarLoop]: === Iteration 4 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 20:00:02,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1238020017, now seen corresponding path program 1 times [2018-01-24 20:00:02,223 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:00:02,225 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:00:02,225 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:00:02,225 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:00:02,225 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:00:02,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:00:02,239 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:00:02,354 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 20:00:02,355 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:00:02,355 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 20:00:02,355 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:00:02,355 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 20:00:02,356 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 20:00:02,356 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 20:00:02,356 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 5 states. [2018-01-24 20:00:02,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:00:02,400 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-01-24 20:00:02,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 20:00:02,400 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 20:00:02,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:00:02,401 INFO L225 Difference]: With dead ends: 49 [2018-01-24 20:00:02,401 INFO L226 Difference]: Without dead ends: 48 [2018-01-24 20:00:02,402 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 20:00:02,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-24 20:00:02,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-24 20:00:02,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-24 20:00:02,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-01-24 20:00:02,407 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 14 [2018-01-24 20:00:02,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:00:02,407 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2018-01-24 20:00:02,407 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 20:00:02,407 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-01-24 20:00:02,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 20:00:02,408 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:00:02,408 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:00:02,408 INFO L371 AbstractCegarLoop]: === Iteration 5 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 20:00:02,408 INFO L82 PathProgramCache]: Analyzing trace with hash -9248999, now seen corresponding path program 1 times [2018-01-24 20:00:02,408 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:00:02,409 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:00:02,409 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:00:02,409 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:00:02,409 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:00:02,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:00:02,422 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:00:02,465 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 20:00:02,465 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:00:02,465 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 20:00:02,465 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:00:02,466 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 20:00:02,466 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 20:00:02,466 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 20:00:02,467 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 5 states. [2018-01-24 20:00:02,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:00:02,547 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-01-24 20:00:02,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 20:00:02,548 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-24 20:00:02,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:00:02,549 INFO L225 Difference]: With dead ends: 48 [2018-01-24 20:00:02,549 INFO L226 Difference]: Without dead ends: 46 [2018-01-24 20:00:02,550 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 20:00:02,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-24 20:00:02,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-01-24 20:00:02,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-24 20:00:02,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2018-01-24 20:00:02,556 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 18 [2018-01-24 20:00:02,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:00:02,557 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2018-01-24 20:00:02,557 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 20:00:02,557 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2018-01-24 20:00:02,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 20:00:02,558 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:00:02,558 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:00:02,558 INFO L371 AbstractCegarLoop]: === Iteration 6 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 20:00:02,559 INFO L82 PathProgramCache]: Analyzing trace with hash -9248998, now seen corresponding path program 1 times [2018-01-24 20:00:02,559 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:00:02,560 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:00:02,560 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:00:02,560 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:00:02,560 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:00:02,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:00:02,579 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:00:02,687 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 20:00:02,687 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:00:02,687 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 20:00:02,688 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:00:02,688 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 20:00:02,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 20:00:02,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 20:00:02,689 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand 8 states. [2018-01-24 20:00:02,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:00:02,822 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2018-01-24 20:00:02,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 20:00:02,823 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-01-24 20:00:02,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:00:02,826 INFO L225 Difference]: With dead ends: 69 [2018-01-24 20:00:02,827 INFO L226 Difference]: Without dead ends: 67 [2018-01-24 20:00:02,827 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-01-24 20:00:02,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-24 20:00:02,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 57. [2018-01-24 20:00:02,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-24 20:00:02,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2018-01-24 20:00:02,836 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 18 [2018-01-24 20:00:02,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:00:02,836 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2018-01-24 20:00:02,836 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 20:00:02,836 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2018-01-24 20:00:02,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 20:00:02,837 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:00:02,837 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] [2018-01-24 20:00:02,837 INFO L371 AbstractCegarLoop]: === Iteration 7 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 20:00:02,838 INFO L82 PathProgramCache]: Analyzing trace with hash -659041035, now seen corresponding path program 1 times [2018-01-24 20:00:02,838 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:00:02,839 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:00:02,839 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:00:02,839 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:00:02,839 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:00:02,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:00:02,853 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:00:02,898 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 20:00:02,899 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:00:02,899 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 20:00:02,899 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:00:02,900 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 20:00:02,900 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 20:00:02,900 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 20:00:02,901 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand 5 states. [2018-01-24 20:00:02,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:00:02,964 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2018-01-24 20:00:02,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 20:00:02,965 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-01-24 20:00:02,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:00:02,965 INFO L225 Difference]: With dead ends: 57 [2018-01-24 20:00:02,965 INFO L226 Difference]: Without dead ends: 54 [2018-01-24 20:00:02,966 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 20:00:02,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-24 20:00:02,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-24 20:00:02,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-24 20:00:02,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2018-01-24 20:00:02,970 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 21 [2018-01-24 20:00:02,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:00:02,971 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2018-01-24 20:00:02,971 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 20:00:02,971 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2018-01-24 20:00:02,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 20:00:02,971 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:00:02,971 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] [2018-01-24 20:00:02,972 INFO L371 AbstractCegarLoop]: === Iteration 8 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 20:00:02,972 INFO L82 PathProgramCache]: Analyzing trace with hash -659041034, now seen corresponding path program 1 times [2018-01-24 20:00:02,972 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:00:02,973 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:00:02,973 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:00:02,973 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:00:02,973 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:00:02,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:00:02,985 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:00:03,110 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 20:00:03,110 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:00:03,111 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 20:00:03,111 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:00:03,112 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 20:00:03,112 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 20:00:03,112 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-24 20:00:03,112 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand 8 states. [2018-01-24 20:00:03,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:00:03,237 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2018-01-24 20:00:03,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 20:00:03,237 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-01-24 20:00:03,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:00:03,238 INFO L225 Difference]: With dead ends: 73 [2018-01-24 20:00:03,238 INFO L226 Difference]: Without dead ends: 70 [2018-01-24 20:00:03,239 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-24 20:00:03,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-24 20:00:03,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2018-01-24 20:00:03,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-24 20:00:03,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2018-01-24 20:00:03,247 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 21 [2018-01-24 20:00:03,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:00:03,247 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2018-01-24 20:00:03,248 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 20:00:03,248 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2018-01-24 20:00:03,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 20:00:03,249 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:00:03,249 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 20:00:03,249 INFO L371 AbstractCegarLoop]: === Iteration 9 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 20:00:03,249 INFO L82 PathProgramCache]: Analyzing trace with hash 753859844, now seen corresponding path program 1 times [2018-01-24 20:00:03,249 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:00:03,250 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:00:03,250 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:00:03,251 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:00:03,251 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:00:03,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:00:03,262 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:00:03,285 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 20:00:03,285 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:00:03,286 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 20:00:03,286 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:00:03,286 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 20:00:03,286 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 20:00:03,286 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 20:00:03,287 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. Second operand 3 states. [2018-01-24 20:00:03,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:00:03,301 INFO L93 Difference]: Finished difference Result 107 states and 130 transitions. [2018-01-24 20:00:03,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 20:00:03,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-01-24 20:00:03,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:00:03,303 INFO L225 Difference]: With dead ends: 107 [2018-01-24 20:00:03,303 INFO L226 Difference]: Without dead ends: 67 [2018-01-24 20:00:03,303 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 20:00:03,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-24 20:00:03,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-01-24 20:00:03,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-24 20:00:03,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2018-01-24 20:00:03,309 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 27 [2018-01-24 20:00:03,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:00:03,309 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2018-01-24 20:00:03,309 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 20:00:03,309 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2018-01-24 20:00:03,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 20:00:03,310 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:00:03,310 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:00:03,310 INFO L371 AbstractCegarLoop]: === Iteration 10 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 20:00:03,310 INFO L82 PathProgramCache]: Analyzing trace with hash 199156551, now seen corresponding path program 1 times [2018-01-24 20:00:03,311 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:00:03,311 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:00:03,311 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:00:03,311 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:00:03,311 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:00:03,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:00:03,330 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:00:03,710 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 20:00:03,710 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:00:03,710 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-01-24 20:00:03,710 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:00:03,711 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 20:00:03,711 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 20:00:03,711 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-01-24 20:00:03,711 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand 15 states. [2018-01-24 20:00:04,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:00:04,141 INFO L93 Difference]: Finished difference Result 140 states and 161 transitions. [2018-01-24 20:00:04,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-24 20:00:04,141 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2018-01-24 20:00:04,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:00:04,143 INFO L225 Difference]: With dead ends: 140 [2018-01-24 20:00:04,143 INFO L226 Difference]: Without dead ends: 112 [2018-01-24 20:00:04,144 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=620, Unknown=0, NotChecked=0, Total=756 [2018-01-24 20:00:04,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-24 20:00:04,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 102. [2018-01-24 20:00:04,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-01-24 20:00:04,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 123 transitions. [2018-01-24 20:00:04,157 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 123 transitions. Word has length 29 [2018-01-24 20:00:04,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:00:04,158 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 123 transitions. [2018-01-24 20:00:04,158 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 20:00:04,158 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 123 transitions. [2018-01-24 20:00:04,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 20:00:04,159 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:00:04,159 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:00:04,159 INFO L371 AbstractCegarLoop]: === Iteration 11 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 20:00:04,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1606281783, now seen corresponding path program 1 times [2018-01-24 20:00:04,159 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:00:04,160 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:00:04,160 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:00:04,160 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:00:04,160 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:00:04,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:00:04,185 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:00:04,526 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 20:00:04,526 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 20:00:04,526 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 20:00:04,527 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-01-24 20:00:04,528 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [10], [11], [14], [15], [18], [26], [27], [30], [35], [39], [54], [59], [65], [67], [68], [69], [70], [71], [74], [85], [86], [87], [89] [2018-01-24 20:00:04,574 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 20:00:04,574 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 20:00:37,214 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 20:00:37,216 INFO L268 AbstractInterpreter]: Visited 28 different actions 56 times. Merged at 12 different actions 27 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 31 variables. [2018-01-24 20:00:37,230 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 20:00:37,230 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 20:00:37,230 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 20:00:37,246 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:00:37,246 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 20:00:37,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:00:37,287 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 20:00:37,325 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 20:00:37,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 20:00:37,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 20:00:37,370 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 20:00:37,532 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 20:00:37,533 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 20:00:37,534 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 20:00:37,534 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 20:00:37,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 20:00:37,538 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-24 20:00:37,574 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 20:00:37,576 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 20:00:37,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 20:00:37,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 20:00:37,584 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 20:00:37,584 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-01-24 20:00:37,627 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 20:00:37,631 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 20:00:37,632 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 20:00:37,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 20:00:37,667 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 20:00:37,668 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-01-24 20:00:38,621 WARN L143 SmtUtils]: Spent 667ms on a formula simplification that was a NOOP. DAG size: 43 [2018-01-24 20:00:38,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 53 [2018-01-24 20:00:38,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 47 [2018-01-24 20:00:38,806 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-01-24 20:00:38,893 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 31 treesize of output 23 [2018-01-24 20:00:38,894 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 20:00:38,895 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 35 treesize of output 27 [2018-01-24 20:00:38,896 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 20:00:38,899 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 34 treesize of output 26 [2018-01-24 20:00:38,900 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 20:00:38,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-01-24 20:00:38,981 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 20:00:39,166 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 37 treesize of output 29 [2018-01-24 20:00:39,166 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-24 20:00:39,245 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 34 treesize of output 26 [2018-01-24 20:00:39,246 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 20:00:39,315 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 29 treesize of output 27 [2018-01-24 20:00:39,316 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-01-24 20:00:39,408 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 26 treesize of output 24 [2018-01-24 20:00:39,408 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-01-24 20:00:39,448 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-01-24 20:00:39,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-24 20:00:39,503 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:63, output treesize:66 [2018-01-24 20:00:39,572 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:00:39,572 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 20:00:40,607 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 15 treesize of output 11 [2018-01-24 20:00:40,608 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 20:00:40,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2018-01-24 20:00:40,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2018-01-24 20:00:40,651 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 20:00:40,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-01-24 20:00:40,663 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 20:00:40,668 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 20:00:40,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 20:00:40,677 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:69, output treesize:7 [2018-01-24 20:00:40,713 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 20:00:40,733 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 20:00:40,734 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 20:00:40,737 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:00:40,737 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 20:00:40,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:00:40,791 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 20:00:40,799 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 20:00:40,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 20:00:40,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 20:00:40,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 20:00:40,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 20:00:40,808 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 20:00:40,875 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 20:00:40,876 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 20:00:40,876 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 20:00:40,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 20:00:40,884 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 20:00:40,885 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 20:00:40,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 20:00:40,890 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-24 20:00:40,957 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 20:00:40,959 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 20:00:40,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 20:00:40,961 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 20:00:40,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 20:00:40,966 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-01-24 20:00:41,011 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 20:00:41,013 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 20:00:41,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 20:00:41,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 20:00:41,023 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 20:00:41,023 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2018-01-24 20:00:41,183 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 20:00:41,185 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 20:00:41,186 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 20:00:41,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, 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 16 [2018-01-24 20:00:41,194 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 20:00:41,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 20:00:41,206 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 20:00:41,206 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:48, output treesize:34 [2018-01-24 20:00:41,397 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 20:00:41,397 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 20:00:41,774 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 20:00:41,785 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 20:00:41,786 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 20:00:41,788 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 20:00:41,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 20:00:41,795 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:21 [2018-01-24 20:00:41,968 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 20:00:41,970 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 20:00:41,970 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 13, 13, 11] total 61 [2018-01-24 20:00:41,970 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 20:00:41,971 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-24 20:00:41,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-24 20:00:41,971 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=3511, Unknown=0, NotChecked=0, Total=3782 [2018-01-24 20:00:41,972 INFO L87 Difference]: Start difference. First operand 102 states and 123 transitions. Second operand 30 states. [2018-01-24 20:00:44,114 WARN L146 SmtUtils]: Spent 1368ms on a formula simplification. DAG size of input: 76 DAG size of output 57 [2018-01-24 20:00:46,861 WARN L146 SmtUtils]: Spent 1296ms on a formula simplification. DAG size of input: 69 DAG size of output 57 [2018-01-24 20:00:47,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:00:47,147 INFO L93 Difference]: Finished difference Result 110 states and 130 transitions. [2018-01-24 20:00:47,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-24 20:00:47,147 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2018-01-24 20:00:47,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:00:47,149 INFO L225 Difference]: With dead ends: 110 [2018-01-24 20:00:47,149 INFO L226 Difference]: Without dead ends: 108 [2018-01-24 20:00:47,151 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 66 SyntacticMatches, 4 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1811 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=644, Invalid=6162, Unknown=0, NotChecked=0, Total=6806 [2018-01-24 20:00:47,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-01-24 20:00:47,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 89. [2018-01-24 20:00:47,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-24 20:00:47,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 105 transitions. [2018-01-24 20:00:47,161 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 105 transitions. Word has length 29 [2018-01-24 20:00:47,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:00:47,161 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 105 transitions. [2018-01-24 20:00:47,161 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-24 20:00:47,161 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 105 transitions. [2018-01-24 20:00:47,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 20:00:47,163 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:00:47,163 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] [2018-01-24 20:00:47,163 INFO L371 AbstractCegarLoop]: === Iteration 12 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 20:00:47,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1713594616, now seen corresponding path program 1 times [2018-01-24 20:00:47,163 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:00:47,164 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:00:47,164 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:00:47,165 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:00:47,165 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:00:47,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:00:47,180 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:00:47,255 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 20:00:47,256 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:00:47,256 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 20:00:47,256 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:00:47,256 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 20:00:47,256 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 20:00:47,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 20:00:47,256 INFO L87 Difference]: Start difference. First operand 89 states and 105 transitions. Second operand 6 states. [2018-01-24 20:00:47,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:00:47,333 INFO L93 Difference]: Finished difference Result 89 states and 105 transitions. [2018-01-24 20:00:47,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 20:00:47,333 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-01-24 20:00:47,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:00:47,333 INFO L225 Difference]: With dead ends: 89 [2018-01-24 20:00:47,334 INFO L226 Difference]: Without dead ends: 72 [2018-01-24 20:00:47,334 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 20:00:47,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-01-24 20:00:47,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2018-01-24 20:00:47,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-24 20:00:47,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2018-01-24 20:00:47,340 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 31 [2018-01-24 20:00:47,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:00:47,341 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2018-01-24 20:00:47,341 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 20:00:47,341 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2018-01-24 20:00:47,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 20:00:47,342 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:00:47,342 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:00:47,342 INFO L371 AbstractCegarLoop]: === Iteration 13 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 20:00:47,342 INFO L82 PathProgramCache]: Analyzing trace with hash -797033429, now seen corresponding path program 1 times [2018-01-24 20:00:47,343 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:00:47,343 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:00:47,344 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:00:47,344 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:00:47,344 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:00:47,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:00:47,357 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:00:47,506 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:00:47,506 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 20:00:47,506 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 20:00:47,506 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-01-24 20:00:47,506 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [11], [14], [15], [17], [18], [26], [27], [30], [37], [39], [54], [57], [65], [67], [68], [69], [70], [71], [74], [85], [86], [87], [89] [2018-01-24 20:00:47,508 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 20:00:47,508 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-24 20:00:55,705 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-24 20:00:55,706 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-24 20:00:55,706 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 20:00:55,706 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 20:00:55,706 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 20:00:55,711 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:00:55,712 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 20:00:55,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:00:55,729 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 20:00:55,734 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 20:00:55,735 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 20:00:55,738 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 20:00:55,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 08:00:55 BoogieIcfgContainer [2018-01-24 20:00:55,739 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 20:00:55,739 INFO L168 Benchmark]: Toolchain (without parser) took 55200.25 ms. Allocated memory was 308.3 MB in the beginning and 1.7 GB in the end (delta: 1.4 GB). Free memory was 268.2 MB in the beginning and 418.3 MB in the end (delta: -150.1 MB). Peak memory consumption was 1.2 GB. Max. memory is 5.3 GB. [2018-01-24 20:00:55,740 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 308.3 MB. Free memory is still 274.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 20:00:55,740 INFO L168 Benchmark]: CACSL2BoogieTranslator took 219.17 ms. Allocated memory is still 308.3 MB. Free memory was 267.2 MB in the beginning and 257.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-24 20:00:55,740 INFO L168 Benchmark]: Boogie Preprocessor took 36.68 ms. Allocated memory is still 308.3 MB. Free memory was 257.2 MB in the beginning and 255.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 20:00:55,740 INFO L168 Benchmark]: RCFGBuilder took 323.94 ms. Allocated memory is still 308.3 MB. Free memory was 255.2 MB in the beginning and 236.2 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 5.3 GB. [2018-01-24 20:00:55,741 INFO L168 Benchmark]: TraceAbstraction took 54611.15 ms. Allocated memory was 308.3 MB in the beginning and 1.7 GB in the end (delta: 1.4 GB). Free memory was 236.2 MB in the beginning and 418.3 MB in the end (delta: -182.1 MB). Peak memory consumption was 1.2 GB. Max. memory is 5.3 GB. [2018-01-24 20:00:55,742 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.21 ms. Allocated memory is still 308.3 MB. Free memory is still 274.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 219.17 ms. Allocated memory is still 308.3 MB. Free memory was 267.2 MB in the beginning and 257.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.68 ms. Allocated memory is still 308.3 MB. Free memory was 257.2 MB in the beginning and 255.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 323.94 ms. Allocated memory is still 308.3 MB. Free memory was 255.2 MB in the beginning and 236.2 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 54611.15 ms. Allocated memory was 308.3 MB in the beginning and 1.7 GB in the end (delta: 1.4 GB). Free memory was 236.2 MB in the beginning and 418.3 MB in the end (delta: -182.1 MB). Peak memory consumption was 1.2 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 27 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 380 LocStat_NO_SUPPORTING_DISEQUALITIES : 59 LocStat_NO_DISJUNCTIONS : -54 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 34 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 70 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 37 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 2.733512 RENAME_VARIABLES(MILLISECONDS) : 0.135948 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.293547 PROJECTAWAY(MILLISECONDS) : 0.031291 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.068400 DISJOIN(MILLISECONDS) : 0.448402 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.155552 ADD_EQUALITY(MILLISECONDS) : 0.014092 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.010801 #CONJOIN_DISJUNCTIVE : 100 #RENAME_VARIABLES : 177 #UNFREEZE : 0 #CONJOIN : 164 #PROJECTAWAY : 131 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 15 #RENAME_VARIABLES_DISJUNCTIVE : 161 #ADD_EQUALITY : 72 #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 550). Cancelled while BasicCegarLoop was analyzing trace of length 33 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 33 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 33 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 33 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 33 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 33 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 33 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 33 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 33 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 33 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was analyzing trace of length 33 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was analyzing trace of length 33 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was analyzing trace of length 33 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was analyzing trace of length 33 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 553]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 553). Cancelled while BasicCegarLoop was analyzing trace of length 33 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 55 locations, 15 error locations. TIMEOUT Result, 54.5s OverallTime, 13 OverallIterations, 2 TraceHistogramMax, 6.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 468 SDtfs, 660 SDslu, 1204 SDs, 0 SdLazy, 1360 SolverSat, 170 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 241 GetRequests, 80 SyntacticMatches, 6 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1988 ImplicationChecksByTransitivity, 8.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 40.9s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 48 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 306 NumberOfCodeBlocks, 306 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 348 ConstructedInterpolants, 28 QuantifiedInterpolants, 89085 SizeOfPredicates, 43 NumberOfNonLiveVariables, 272 ConjunctsInSsa, 74 ConjunctsInUnsatCore, 16 InterpolantComputations, 11 PerfectInterpolantSequences, 4/14 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/subseq-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_20-00-55-751.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/subseq-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_20-00-55-751.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/subseq-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_20-00-55-751.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/subseq-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_20-00-55-751.csv Completed graceful shutdown