java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength_true-valid-memsafety.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 03:23:34,360 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 03:23:34,362 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 03:23:34,376 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 03:23:34,377 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 03:23:34,378 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 03:23:34,379 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 03:23:34,381 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 03:23:34,383 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 03:23:34,384 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 03:23:34,385 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 03:23:34,385 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 03:23:34,386 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 03:23:34,387 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 03:23:34,388 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 03:23:34,390 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 03:23:34,393 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 03:23:34,394 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 03:23:34,396 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 03:23:34,397 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 03:23:34,400 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 03:23:34,400 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 03:23:34,400 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 03:23:34,401 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 03:23:34,402 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 03:23:34,404 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 03:23:34,404 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 03:23:34,405 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 03:23:34,405 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 03:23:34,405 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 03:23:34,406 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 03:23:34,406 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf [2018-01-25 03:23:34,417 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 03:23:34,417 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 03:23:34,418 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 03:23:34,418 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 03:23:34,418 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 03:23:34,419 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 03:23:34,419 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 03:23:34,419 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 03:23:34,419 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 03:23:34,420 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 03:23:34,420 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 03:23:34,420 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 03:23:34,421 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 03:23:34,421 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 03:23:34,421 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 03:23:34,421 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 03:23:34,421 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 03:23:34,422 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 03:23:34,422 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 03:23:34,422 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 03:23:34,422 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 03:23:34,422 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 03:23:34,423 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 03:23:34,423 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 03:23:34,423 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 03:23:34,423 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 03:23:34,423 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 03:23:34,424 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 03:23:34,424 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 03:23:34,424 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 03:23:34,424 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 03:23:34,424 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 03:23:34,424 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 03:23:34,425 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 03:23:34,425 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 03:23:34,426 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 03:23:34,426 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 03:23:34,468 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 03:23:34,480 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 03:23:34,483 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 03:23:34,484 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 03:23:34,485 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 03:23:34,485 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength_true-valid-memsafety.c [2018-01-25 03:23:34,600 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 03:23:34,606 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 03:23:34,607 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 03:23:34,607 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 03:23:34,616 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 03:23:34,617 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:23:34" (1/1) ... [2018-01-25 03:23:34,620 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bb92429 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:23:34, skipping insertion in model container [2018-01-25 03:23:34,620 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:23:34" (1/1) ... [2018-01-25 03:23:34,641 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:23:34,663 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:23:34,795 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:23:34,812 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:23:34,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:23:34 WrapperNode [2018-01-25 03:23:34,818 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 03:23:34,819 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 03:23:34,819 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 03:23:34,819 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 03:23:34,830 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:23:34" (1/1) ... [2018-01-25 03:23:34,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:23:34" (1/1) ... [2018-01-25 03:23:34,838 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:23:34" (1/1) ... [2018-01-25 03:23:34,839 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:23:34" (1/1) ... [2018-01-25 03:23:34,841 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:23:34" (1/1) ... [2018-01-25 03:23:34,844 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:23:34" (1/1) ... [2018-01-25 03:23:34,845 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:23:34" (1/1) ... [2018-01-25 03:23:34,847 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 03:23:34,847 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 03:23:34,847 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 03:23:34,847 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 03:23:34,848 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:23:34" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 03:23:34,896 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 03:23:34,896 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 03:23:34,896 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-25 03:23:34,896 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 03:23:34,896 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 03:23:34,896 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 03:23:34,897 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 03:23:34,897 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 03:23:34,897 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 03:23:34,897 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-25 03:23:34,897 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 03:23:34,897 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 03:23:34,897 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 03:23:35,109 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 03:23:35,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:23:35 BoogieIcfgContainer [2018-01-25 03:23:35,110 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 03:23:35,111 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 03:23:35,111 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 03:23:35,113 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 03:23:35,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 03:23:34" (1/3) ... [2018-01-25 03:23:35,114 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43bfddf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:23:35, skipping insertion in model container [2018-01-25 03:23:35,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:23:34" (2/3) ... [2018-01-25 03:23:35,115 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43bfddf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:23:35, skipping insertion in model container [2018-01-25 03:23:35,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:23:35" (3/3) ... [2018-01-25 03:23:35,117 INFO L105 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength_true-valid-memsafety.c [2018-01-25 03:23:35,125 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 03:23:35,131 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2018-01-25 03:23:35,170 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 03:23:35,170 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 03:23:35,170 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 03:23:35,170 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 03:23:35,171 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 03:23:35,171 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 03:23:35,171 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 03:23:35,171 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 03:23:35,171 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 03:23:35,190 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-01-25 03:23:35,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 03:23:35,196 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:23:35,197 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:23:35,197 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 03:23:35,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1202729229, now seen corresponding path program 1 times [2018-01-25 03:23:35,203 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:23:35,246 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:23:35,246 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:23:35,247 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:23:35,247 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:23:35,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:23:35,305 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:23:35,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:23:35,351 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:23:35,352 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 03:23:35,352 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:23:35,354 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-25 03:23:35,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-25 03:23:35,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-25 03:23:35,369 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 2 states. [2018-01-25 03:23:35,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:23:35,394 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2018-01-25 03:23:35,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-25 03:23:35,395 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-01-25 03:23:35,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:23:35,402 INFO L225 Difference]: With dead ends: 90 [2018-01-25 03:23:35,402 INFO L226 Difference]: Without dead ends: 46 [2018-01-25 03:23:35,405 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-25 03:23:35,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-25 03:23:35,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-01-25 03:23:35,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-25 03:23:35,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-01-25 03:23:35,442 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 13 [2018-01-25 03:23:35,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:23:35,442 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-01-25 03:23:35,442 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-25 03:23:35,442 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-01-25 03:23:35,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 03:23:35,443 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:23:35,443 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:23:35,443 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 03:23:35,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1812590093, now seen corresponding path program 1 times [2018-01-25 03:23:35,444 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:23:35,445 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:23:35,445 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:23:35,446 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:23:35,446 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:23:35,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:23:35,464 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:23:35,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:23:35,548 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:23:35,548 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 03:23:35,548 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:23:35,551 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 03:23:35,551 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 03:23:35,551 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 03:23:35,552 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 3 states. [2018-01-25 03:23:35,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:23:35,767 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2018-01-25 03:23:35,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 03:23:35,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-01-25 03:23:35,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:23:35,771 INFO L225 Difference]: With dead ends: 83 [2018-01-25 03:23:35,771 INFO L226 Difference]: Without dead ends: 67 [2018-01-25 03:23:35,772 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-25 03:23:35,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-25 03:23:35,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2018-01-25 03:23:35,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-25 03:23:35,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-01-25 03:23:35,789 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 14 [2018-01-25 03:23:35,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:23:35,789 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-01-25 03:23:35,789 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 03:23:35,789 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-01-25 03:23:35,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 03:23:35,790 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:23:35,790 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:23:35,790 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 03:23:35,791 INFO L82 PathProgramCache]: Analyzing trace with hash -267768884, now seen corresponding path program 1 times [2018-01-25 03:23:35,791 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:23:35,792 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:23:35,792 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:23:35,792 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:23:35,793 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:23:35,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:23:35,815 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:23:35,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:23:35,984 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:23:35,984 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 03:23:35,984 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:23:35,985 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:23:35,985 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:23:35,985 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:23:35,985 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 5 states. [2018-01-25 03:23:36,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:23:36,122 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2018-01-25 03:23:36,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:23:36,123 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-01-25 03:23:36,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:23:36,124 INFO L225 Difference]: With dead ends: 113 [2018-01-25 03:23:36,124 INFO L226 Difference]: Without dead ends: 73 [2018-01-25 03:23:36,125 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:23:36,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-25 03:23:36,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 57. [2018-01-25 03:23:36,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-25 03:23:36,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2018-01-25 03:23:36,134 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 15 [2018-01-25 03:23:36,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:23:36,135 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2018-01-25 03:23:36,135 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:23:36,135 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2018-01-25 03:23:36,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 03:23:36,136 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:23:36,136 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:23:36,136 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 03:23:36,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1098181562, now seen corresponding path program 1 times [2018-01-25 03:23:36,137 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:23:36,138 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:23:36,138 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:23:36,138 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:23:36,139 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:23:36,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:23:36,152 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:23:36,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:23:36,183 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:23:36,184 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 03:23:36,184 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:23:36,184 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 03:23:36,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 03:23:36,185 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 03:23:36,185 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 3 states. [2018-01-25 03:23:36,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:23:36,217 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2018-01-25 03:23:36,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 03:23:36,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-01-25 03:23:36,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:23:36,220 INFO L225 Difference]: With dead ends: 57 [2018-01-25 03:23:36,220 INFO L226 Difference]: Without dead ends: 55 [2018-01-25 03:23:36,221 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 03:23:36,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-25 03:23:36,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-01-25 03:23:36,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-25 03:23:36,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-01-25 03:23:36,229 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 19 [2018-01-25 03:23:36,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:23:36,229 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-01-25 03:23:36,229 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 03:23:36,229 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-01-25 03:23:36,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 03:23:36,230 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:23:36,230 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:23:36,230 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 03:23:36,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1098181563, now seen corresponding path program 1 times [2018-01-25 03:23:36,231 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:23:36,232 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:23:36,232 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:23:36,232 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:23:36,232 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:23:36,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:23:36,245 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:23:36,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:23:36,345 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:23:36,345 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 03:23:36,345 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:23:36,345 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 03:23:36,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 03:23:36,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-25 03:23:36,346 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 4 states. [2018-01-25 03:23:36,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:23:36,477 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-01-25 03:23:36,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 03:23:36,477 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-01-25 03:23:36,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:23:36,478 INFO L225 Difference]: With dead ends: 67 [2018-01-25 03:23:36,478 INFO L226 Difference]: Without dead ends: 65 [2018-01-25 03:23:36,479 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-25 03:23:36,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-25 03:23:36,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 58. [2018-01-25 03:23:36,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-25 03:23:36,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2018-01-25 03:23:36,488 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 19 [2018-01-25 03:23:36,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:23:36,489 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2018-01-25 03:23:36,489 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 03:23:36,489 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-01-25 03:23:36,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 03:23:36,490 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:23:36,490 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:23:36,490 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 03:23:36,491 INFO L82 PathProgramCache]: Analyzing trace with hash -2060273317, now seen corresponding path program 1 times [2018-01-25 03:23:36,491 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:23:36,492 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:23:36,492 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:23:36,492 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:23:36,492 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:23:36,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:23:36,510 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:23:36,571 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-25 03:23:36,571 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:23:36,572 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 03:23:36,572 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:23:36,572 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:23:36,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:23:36,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:23:36,573 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 5 states. [2018-01-25 03:23:36,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:23:36,710 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2018-01-25 03:23:36,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:23:36,711 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-01-25 03:23:36,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:23:36,712 INFO L225 Difference]: With dead ends: 70 [2018-01-25 03:23:36,712 INFO L226 Difference]: Without dead ends: 69 [2018-01-25 03:23:36,713 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:23:36,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-25 03:23:36,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 61. [2018-01-25 03:23:36,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-25 03:23:36,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-01-25 03:23:36,729 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 28 [2018-01-25 03:23:36,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:23:36,730 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-01-25 03:23:36,730 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:23:36,730 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-01-25 03:23:36,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-25 03:23:36,731 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:23:36,731 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:23:36,732 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 03:23:36,732 INFO L82 PathProgramCache]: Analyzing trace with hash 556036660, now seen corresponding path program 1 times [2018-01-25 03:23:36,732 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:23:36,733 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:23:36,734 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:23:36,734 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:23:36,734 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:23:36,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:23:36,766 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:23:37,071 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:23:37,072 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:23:37,072 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 03:23:37,083 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-01-25 03:23:37,085 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [13], [16], [23], [24], [28], [29], [30], [34], [39], [41], [42], [45], [47], [82], [83], [84], [86], [87] [2018-01-25 03:23:37,147 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 03:23:37,147 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 03:23:38,161 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 03:23:38,162 INFO L268 AbstractInterpreter]: Visited 24 different actions 40 times. Merged at 7 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 21 variables. [2018-01-25 03:23:38,173 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 03:23:38,173 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:23:38,179 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 03:23:38,206 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:23:38,206 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 03:23:38,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:23:38,252 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:23:38,288 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-25 03:23:38,289 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 03:23:38,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 03:23:38,293 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 03:23:38,443 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-25 03:23:38,443 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:23:38,583 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-25 03:23:38,606 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 03:23:38,606 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [7] total 12 [2018-01-25 03:23:38,606 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:23:38,607 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 03:23:38,607 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 03:23:38,607 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-01-25 03:23:38,607 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 6 states. [2018-01-25 03:23:38,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:23:38,688 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-01-25 03:23:38,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 03:23:38,688 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-01-25 03:23:38,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:23:38,689 INFO L225 Difference]: With dead ends: 69 [2018-01-25 03:23:38,689 INFO L226 Difference]: Without dead ends: 68 [2018-01-25 03:23:38,689 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-01-25 03:23:38,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-25 03:23:38,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 62. [2018-01-25 03:23:38,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-25 03:23:38,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2018-01-25 03:23:38,696 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 29 [2018-01-25 03:23:38,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:23:38,696 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2018-01-25 03:23:38,696 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 03:23:38,696 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2018-01-25 03:23:38,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-25 03:23:38,697 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:23:38,697 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:23:38,697 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 03:23:38,697 INFO L82 PathProgramCache]: Analyzing trace with hash 556036659, now seen corresponding path program 1 times [2018-01-25 03:23:38,697 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:23:38,698 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:23:38,698 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:23:38,698 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:23:38,699 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:23:38,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:23:38,714 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:23:38,774 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:23:38,774 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:23:38,774 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 03:23:38,774 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:23:38,775 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:23:38,775 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:23:38,775 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:23:38,775 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand 5 states. [2018-01-25 03:23:38,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:23:38,897 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2018-01-25 03:23:38,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:23:38,898 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-01-25 03:23:38,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:23:38,899 INFO L225 Difference]: With dead ends: 62 [2018-01-25 03:23:38,899 INFO L226 Difference]: Without dead ends: 61 [2018-01-25 03:23:38,899 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:23:38,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-25 03:23:38,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-01-25 03:23:38,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-25 03:23:38,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-01-25 03:23:38,907 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 29 [2018-01-25 03:23:38,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:23:38,908 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-01-25 03:23:38,908 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:23:38,908 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-01-25 03:23:38,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-25 03:23:38,909 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:23:38,909 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:23:38,909 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 03:23:38,909 INFO L82 PathProgramCache]: Analyzing trace with hash -848422454, now seen corresponding path program 1 times [2018-01-25 03:23:38,909 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:23:38,910 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:23:38,910 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:23:38,910 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:23:38,910 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:23:38,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:23:38,925 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:23:39,153 WARN L146 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 18 DAG size of output 14 [2018-01-25 03:23:39,455 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-25 03:23:39,455 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:23:39,455 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 03:23:39,456 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:23:39,456 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 03:23:39,456 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 03:23:39,456 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:23:39,457 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 6 states. [2018-01-25 03:23:39,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:23:39,645 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2018-01-25 03:23:39,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 03:23:39,646 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-01-25 03:23:39,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:23:39,647 INFO L225 Difference]: With dead ends: 68 [2018-01-25 03:23:39,647 INFO L226 Difference]: Without dead ends: 66 [2018-01-25 03:23:39,647 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:23:39,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-25 03:23:39,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2018-01-25 03:23:39,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-25 03:23:39,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-01-25 03:23:39,665 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 32 [2018-01-25 03:23:39,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:23:39,665 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-01-25 03:23:39,666 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 03:23:39,666 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-01-25 03:23:39,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-25 03:23:39,667 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:23:39,667 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:23:39,667 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 03:23:39,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1529051221, now seen corresponding path program 1 times [2018-01-25 03:23:39,667 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:23:39,670 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:23:39,671 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:23:39,671 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:23:39,671 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:23:39,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:23:39,693 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:23:39,755 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-25 03:23:39,755 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:23:39,755 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 03:23:39,755 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-01-25 03:23:39,756 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [23], [24], [28], [29], [30], [34], [37], [39], [41], [42], [45], [47], [51], [55], [60], [61], [66], [68], [69], [70], [81], [82], [83], [84], [86], [87] [2018-01-25 03:23:39,757 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 03:23:39,757 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 03:23:41,670 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 03:23:41,715 INFO L268 AbstractInterpreter]: Visited 31 different actions 54 times. Merged at 16 different actions 16 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 21 variables. [2018-01-25 03:23:41,721 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 03:23:41,721 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:23:41,721 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 03:23:41,731 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:23:41,731 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 03:23:41,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:23:41,751 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:23:41,761 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-25 03:23:41,762 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:23:41,783 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-25 03:23:41,816 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:23:41,816 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 03:23:41,822 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:23:41,822 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 03:23:41,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:23:41,853 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:23:41,857 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-25 03:23:41,857 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:23:41,870 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-25 03:23:41,872 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 03:23:41,872 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4] total 7 [2018-01-25 03:23:41,872 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 03:23:41,872 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:23:41,873 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:23:41,873 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:23:41,873 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 5 states. [2018-01-25 03:23:41,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:23:41,959 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2018-01-25 03:23:41,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 03:23:41,959 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-01-25 03:23:41,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:23:41,960 INFO L225 Difference]: With dead ends: 101 [2018-01-25 03:23:41,960 INFO L226 Difference]: Without dead ends: 85 [2018-01-25 03:23:41,961 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:23:41,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-25 03:23:41,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 67. [2018-01-25 03:23:41,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-25 03:23:41,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2018-01-25 03:23:41,969 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 32 [2018-01-25 03:23:41,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:23:41,969 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2018-01-25 03:23:41,969 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:23:41,970 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2018-01-25 03:23:41,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-25 03:23:41,971 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:23:41,971 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:23:41,971 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 03:23:41,971 INFO L82 PathProgramCache]: Analyzing trace with hash -736270445, now seen corresponding path program 1 times [2018-01-25 03:23:41,971 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:23:41,972 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:23:41,972 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:23:41,972 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:23:41,973 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:23:41,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:23:41,984 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:23:42,164 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:23:42,164 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:23:42,165 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 03:23:42,165 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-01-25 03:23:42,165 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [12], [13], [14], [17], [19], [23], [24], [28], [29], [30], [34], [39], [41], [42], [45], [47], [82], [83], [84], [86], [87] [2018-01-25 03:23:42,166 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 03:23:42,166 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 03:23:43,048 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 03:23:43,048 INFO L268 AbstractInterpreter]: Visited 27 different actions 76 times. Merged at 17 different actions 35 times. Never widened. Found 5 fixpoints after 2 different actions. Largest state had 23 variables. [2018-01-25 03:23:43,055 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 03:23:43,055 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:23:43,055 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 03:23:43,065 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:23:43,065 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 03:23:43,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:23:43,087 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:23:43,255 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:23:43,256 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:23:43,324 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:23:43,345 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:23:43,345 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 03:23:43,348 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:23:43,349 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 03:23:43,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:23:43,379 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:23:43,386 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:23:43,387 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:23:43,431 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:23:43,433 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 03:23:43,433 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7, 7, 7] total 14 [2018-01-25 03:23:43,433 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 03:23:43,434 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-25 03:23:43,434 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-25 03:23:43,434 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-01-25 03:23:43,434 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand 14 states. [2018-01-25 03:23:43,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:23:43,874 INFO L93 Difference]: Finished difference Result 144 states and 156 transitions. [2018-01-25 03:23:43,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-25 03:23:43,875 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2018-01-25 03:23:43,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:23:43,877 INFO L225 Difference]: With dead ends: 144 [2018-01-25 03:23:43,877 INFO L226 Difference]: Without dead ends: 100 [2018-01-25 03:23:43,877 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 125 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2018-01-25 03:23:43,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-25 03:23:43,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 80. [2018-01-25 03:23:43,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-25 03:23:43,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2018-01-25 03:23:43,900 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 34 [2018-01-25 03:23:43,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:23:43,908 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2018-01-25 03:23:43,908 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-25 03:23:43,908 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2018-01-25 03:23:43,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-25 03:23:43,910 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:23:43,910 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:23:43,910 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 03:23:43,910 INFO L82 PathProgramCache]: Analyzing trace with hash 733800956, now seen corresponding path program 2 times [2018-01-25 03:23:43,910 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:23:43,913 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:23:43,913 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:23:43,913 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:23:43,914 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:23:43,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:23:43,930 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:23:43,985 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-25 03:23:43,986 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:23:43,986 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 03:23:43,986 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 03:23:43,986 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 03:23:43,986 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:23:43,986 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 03:23:43,994 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 03:23:43,994 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 03:23:44,006 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 03:23:44,035 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 03:23:44,038 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:23:44,367 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 03:23:44,368 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 5 [2018-01-25 03:23:44,369 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 03:23:44,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-25 03:23:44,395 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-25 03:23:44,497 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 03:23:44,498 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 5 [2018-01-25 03:23:44,498 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 03:23:44,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-25 03:23:44,521 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-25 03:23:44,677 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|main_~#b~3.base| Int)) (and (= (store |c_old(#valid)| |main_~#b~3.base| 0) |c_#valid|) (= 0 (select |c_old(#valid)| |main_~#b~3.base|)))) is different from true [2018-01-25 03:23:44,682 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-01-25 03:23:44,682 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:23:44,711 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_~#b~3.base_20| Int)) (or (not (= 0 (select |c_#valid| |v_main_~#b~3.base_20|))) (= (store |c_#valid| |v_main_~#b~3.base_20| 0) |c_old(#valid)|))) is different from false [2018-01-25 03:23:44,722 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-01-25 03:23:44,753 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 03:23:44,754 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [5] total 11 [2018-01-25 03:23:44,754 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:23:44,754 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 03:23:44,754 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 03:23:44,755 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=54, Unknown=2, NotChecked=30, Total=110 [2018-01-25 03:23:44,755 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand 6 states. [2018-01-25 03:23:44,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:23:44,899 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2018-01-25 03:23:44,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 03:23:44,900 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-01-25 03:23:44,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:23:44,901 INFO L225 Difference]: With dead ends: 81 [2018-01-25 03:23:44,901 INFO L226 Difference]: Without dead ends: 59 [2018-01-25 03:23:44,902 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 82 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=85, Unknown=2, NotChecked=38, Total=156 [2018-01-25 03:23:44,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-25 03:23:44,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-01-25 03:23:44,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-25 03:23:44,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2018-01-25 03:23:44,909 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 45 [2018-01-25 03:23:44,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:23:44,910 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2018-01-25 03:23:44,910 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 03:23:44,910 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2018-01-25 03:23:44,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-25 03:23:44,911 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:23:44,911 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:23:44,911 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 03:23:44,911 INFO L82 PathProgramCache]: Analyzing trace with hash 611219876, now seen corresponding path program 2 times [2018-01-25 03:23:44,912 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:23:44,912 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:23:44,912 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 03:23:44,913 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:23:44,913 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:23:44,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:23:44,933 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:23:45,277 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-25 03:23:45,277 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:23:45,277 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 03:23:45,277 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 03:23:45,277 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 03:23:45,277 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:23:45,277 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 03:23:45,288 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 03:23:45,289 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 03:23:45,298 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 03:23:45,306 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 03:23:45,307 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 03:23:45,310 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:23:45,360 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-25 03:23:45,360 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:23:45,445 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-25 03:23:45,470 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 03:23:45,470 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [12] total 16 [2018-01-25 03:23:45,470 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:23:45,471 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 03:23:45,471 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 03:23:45,471 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-01-25 03:23:45,471 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand 6 states. [2018-01-25 03:23:45,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:23:45,598 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2018-01-25 03:23:45,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 03:23:45,599 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-01-25 03:23:45,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:23:45,600 INFO L225 Difference]: With dead ends: 90 [2018-01-25 03:23:45,600 INFO L226 Difference]: Without dead ends: 61 [2018-01-25 03:23:45,601 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 87 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-01-25 03:23:45,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-25 03:23:45,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-01-25 03:23:45,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-25 03:23:45,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-01-25 03:23:45,612 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 47 [2018-01-25 03:23:45,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:23:45,612 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-01-25 03:23:45,612 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 03:23:45,612 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-01-25 03:23:45,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-25 03:23:45,616 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:23:45,617 INFO L322 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:23:45,617 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 03:23:45,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1268780948, now seen corresponding path program 3 times [2018-01-25 03:23:45,617 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:23:45,618 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:23:45,618 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 03:23:45,618 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:23:45,618 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:23:45,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:23:45,634 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:23:45,800 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-01-25 03:23:45,801 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:23:45,801 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 03:23:45,801 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 03:23:45,801 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 03:23:45,801 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:23:45,801 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 03:23:45,809 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-25 03:23:45,810 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-25 03:23:45,820 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 03:23:45,830 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 03:23:45,831 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 03:23:45,835 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:23:45,849 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-01-25 03:23:45,850 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:23:45,976 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-01-25 03:23:46,076 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:23:46,077 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) [2018-01-25 03:23:46,085 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-25 03:23:46,085 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 10 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 03:23:46,115 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 03:23:46,136 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 03:23:46,151 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 03:23:46,161 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:23:46,183 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-01-25 03:23:46,183 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:23:46,205 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-01-25 03:23:46,207 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 03:23:46,208 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5, 5, 5] total 12 [2018-01-25 03:23:46,208 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 03:23:46,208 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 03:23:46,209 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 03:23:46,209 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-01-25 03:23:46,210 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 9 states. [2018-01-25 03:23:46,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:23:46,329 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2018-01-25 03:23:46,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 03:23:46,329 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2018-01-25 03:23:46,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:23:46,330 INFO L225 Difference]: With dead ends: 61 [2018-01-25 03:23:46,330 INFO L226 Difference]: Without dead ends: 60 [2018-01-25 03:23:46,331 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2018-01-25 03:23:46,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-25 03:23:46,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-01-25 03:23:46,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-25 03:23:46,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2018-01-25 03:23:46,339 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 53 [2018-01-25 03:23:46,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:23:46,340 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2018-01-25 03:23:46,340 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 03:23:46,340 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-01-25 03:23:46,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-25 03:23:46,341 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:23:46,341 INFO L322 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:23:46,341 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 03:23:46,341 INFO L82 PathProgramCache]: Analyzing trace with hash -677503677, now seen corresponding path program 1 times [2018-01-25 03:23:46,341 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:23:46,344 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:23:46,344 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 03:23:46,344 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:23:46,344 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:23:46,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:23:46,371 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:23:46,568 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-01-25 03:23:46,569 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:23:46,569 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 03:23:46,569 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 55 with the following transitions: [2018-01-25 03:23:46,569 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [13], [14], [16], [17], [19], [23], [24], [28], [29], [30], [34], [39], [41], [42], [45], [47], [82], [83], [84], [86], [87] [2018-01-25 03:23:46,570 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 03:23:46,570 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 03:23:47,338 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 03:23:47,338 INFO L268 AbstractInterpreter]: Visited 27 different actions 76 times. Merged at 17 different actions 35 times. Never widened. Found 5 fixpoints after 2 different actions. Largest state had 23 variables. [2018-01-25 03:23:47,392 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 03:23:47,392 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:23:47,392 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-01-25 03:23:47,406 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:23:47,406 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 03:23:47,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:23:47,444 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:23:47,460 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-25 03:23:47,461 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 03:23:47,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 03:23:47,514 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 03:23:48,242 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-01-25 03:23:48,242 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:23:48,395 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-01-25 03:23:48,420 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:23:48,420 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 03:23:48,423 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:23:48,424 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 03:23:48,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:23:48,463 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:23:48,468 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-25 03:23:48,468 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 03:23:48,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 03:23:48,487 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 03:23:48,533 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-01-25 03:23:48,533 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:23:48,548 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-01-25 03:23:48,550 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 03:23:48,550 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5, 6, 5] total 16 [2018-01-25 03:23:48,550 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 03:23:48,550 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-25 03:23:48,551 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-25 03:23:48,551 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2018-01-25 03:23:48,551 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 13 states. [2018-01-25 03:23:48,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:23:48,765 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2018-01-25 03:23:48,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 03:23:48,766 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2018-01-25 03:23:48,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:23:48,766 INFO L225 Difference]: With dead ends: 74 [2018-01-25 03:23:48,766 INFO L226 Difference]: Without dead ends: 0 [2018-01-25 03:23:48,769 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 198 SyntacticMatches, 9 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2018-01-25 03:23:48,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-25 03:23:48,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-25 03:23:48,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-25 03:23:48,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-25 03:23:48,770 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2018-01-25 03:23:48,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:23:48,770 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-25 03:23:48,770 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-25 03:23:48,770 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-25 03:23:48,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-25 03:23:48,775 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-25 03:23:48,815 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-25 03:23:49,186 WARN L146 SmtUtils]: Spent 243ms on a formula simplification. DAG size of input: 34 DAG size of output 23 [2018-01-25 03:23:49,327 WARN L146 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 41 DAG size of output 1 [2018-01-25 03:23:49,453 WARN L146 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 34 DAG size of output 21 [2018-01-25 03:23:49,706 WARN L146 SmtUtils]: Spent 251ms on a formula simplification. DAG size of input: 70 DAG size of output 53 [2018-01-25 03:23:49,756 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 31) no Hoare annotation was computed. [2018-01-25 03:23:49,756 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 31) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 03:23:49,756 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 31) no Hoare annotation was computed. [2018-01-25 03:23:49,756 INFO L401 ceAbstractionStarter]: For program point fooFINAL(lines 12 18) no Hoare annotation was computed. [2018-01-25 03:23:49,756 INFO L397 ceAbstractionStarter]: At program point L14'''(lines 14 16) the Hoare annotation is: (let ((.cse0 (not (= 0 |foo_#in~b.offset|))) (.cse1 (not (= (select |#valid| |foo_#in~b.base|) 1))) (.cse2 (not (= 400 (select |#length| |foo_#in~b.base|)))) (.cse9 (< |foo_#in~n| |foo_#in~size|)) (.cse8 (= foo_~i~1 0))) (and (let ((.cse3 (<= foo_~size 99)) (.cse4 (= 1 (select |#valid| foo_~b.base))) (.cse5 (= (select |#length| foo_~b.base) 400)) (.cse6 (= foo_~b.offset 0)) (.cse7 (<= foo_~size foo_~n))) (or .cse0 (< 99 |foo_#in~size|) .cse1 .cse2 (and .cse3 (<= |foo_#in~size| foo_~size) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse3 .cse4 .cse5 .cse6 (<= 1 foo_~i~1) .cse7) .cse9)) (or .cse0 .cse1 (not (= 0 |foo_#in~size|)) .cse2 .cse9 (and (= foo_~size 0) .cse8)) (let ((.cse10 (<= foo_~size 1))) (or .cse0 (and .cse10 (= 1 foo_~i~1)) .cse1 .cse2 (< 1 |foo_#in~size|) .cse9 (and .cse10 .cse8))))) [2018-01-25 03:23:49,756 INFO L401 ceAbstractionStarter]: For program point fooEXIT(lines 12 18) no Hoare annotation was computed. [2018-01-25 03:23:49,757 INFO L401 ceAbstractionStarter]: For program point L14''(lines 14 16) no Hoare annotation was computed. [2018-01-25 03:23:49,757 INFO L401 ceAbstractionStarter]: For program point L14''''(lines 14 16) no Hoare annotation was computed. [2018-01-25 03:23:49,757 INFO L404 ceAbstractionStarter]: At program point fooENTRY(lines 12 18) the Hoare annotation is: true [2018-01-25 03:23:49,757 INFO L401 ceAbstractionStarter]: For program point fooErr2RequiresViolation(lines 1 31) no Hoare annotation was computed. [2018-01-25 03:23:49,757 INFO L401 ceAbstractionStarter]: For program point L14(lines 14 16) no Hoare annotation was computed. [2018-01-25 03:23:49,757 INFO L401 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2018-01-25 03:23:49,757 INFO L401 ceAbstractionStarter]: For program point fooErr1RequiresViolation(lines 1 31) no Hoare annotation was computed. [2018-01-25 03:23:49,757 INFO L401 ceAbstractionStarter]: For program point L15'(line 15) no Hoare annotation was computed. [2018-01-25 03:23:49,757 INFO L401 ceAbstractionStarter]: For program point L15''(line 15) no Hoare annotation was computed. [2018-01-25 03:23:49,757 INFO L401 ceAbstractionStarter]: For program point fooErr0AssertViolation(line 15) no Hoare annotation was computed. [2018-01-25 03:23:49,757 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 31) the Hoare annotation is: true [2018-01-25 03:23:49,758 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 31) no Hoare annotation was computed. [2018-01-25 03:23:49,758 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 31) the Hoare annotation is: true [2018-01-25 03:23:49,758 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 31) no Hoare annotation was computed. [2018-01-25 03:23:49,758 INFO L401 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 31) no Hoare annotation was computed. [2018-01-25 03:23:49,758 INFO L401 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2018-01-25 03:23:49,758 INFO L397 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: (and (= |#valid| (store |old(#valid)| |main_~#b~3.base| 1)) (= 0 |main_~#b~3.offset|) (= (select |#length| |main_~#b~3.base|) 400) (= 0 (select |old(#valid)| |main_~#b~3.base|)) (<= main_~i~3 99) (<= 0 (+ (* 4 main_~i~3) |main_~#b~3.offset|))) [2018-01-25 03:23:49,758 INFO L401 ceAbstractionStarter]: For program point L22(lines 22 24) no Hoare annotation was computed. [2018-01-25 03:23:49,758 INFO L401 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 31) no Hoare annotation was computed. [2018-01-25 03:23:49,758 INFO L401 ceAbstractionStarter]: For program point L25(lines 25 29) no Hoare annotation was computed. [2018-01-25 03:23:49,759 INFO L401 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-01-25 03:23:49,759 INFO L401 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2018-01-25 03:23:49,759 INFO L401 ceAbstractionStarter]: For program point L23'''(line 23) no Hoare annotation was computed. [2018-01-25 03:23:49,759 INFO L401 ceAbstractionStarter]: For program point mainErr2RequiresViolation(lines 1 31) no Hoare annotation was computed. [2018-01-25 03:23:49,759 INFO L401 ceAbstractionStarter]: For program point L23'(line 23) no Hoare annotation was computed. [2018-01-25 03:23:49,759 INFO L401 ceAbstractionStarter]: For program point L21'''''(line 21) no Hoare annotation was computed. [2018-01-25 03:23:49,759 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 20 31) no Hoare annotation was computed. [2018-01-25 03:23:49,759 INFO L401 ceAbstractionStarter]: For program point L22''(lines 22 24) no Hoare annotation was computed. [2018-01-25 03:23:49,759 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 20 31) no Hoare annotation was computed. [2018-01-25 03:23:49,760 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 20 31) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 03:23:49,760 INFO L401 ceAbstractionStarter]: For program point L22''''(lines 22 24) no Hoare annotation was computed. [2018-01-25 03:23:49,760 INFO L397 ceAbstractionStarter]: At program point L22'''(lines 22 24) the Hoare annotation is: (and (= |#valid| (store |old(#valid)| |main_~#b~3.base| 1)) (= 0 |main_~#b~3.offset|) (= (select |#length| |main_~#b~3.base|) 400) (= 0 (select |old(#valid)| |main_~#b~3.base|)) (<= 0 (+ (* 4 main_~i~3) |main_~#b~3.offset|))) [2018-01-25 03:23:49,760 INFO L401 ceAbstractionStarter]: For program point L26'(line 26) no Hoare annotation was computed. [2018-01-25 03:23:49,760 INFO L401 ceAbstractionStarter]: For program point L21''''(line 21) no Hoare annotation was computed. [2018-01-25 03:23:49,760 INFO L397 ceAbstractionStarter]: At program point L25'''(lines 25 29) the Hoare annotation is: (and (= |#valid| (store |old(#valid)| |main_~#b~3.base| 1)) (= 0 |main_~#b~3.offset|) (= (select |#length| |main_~#b~3.base|) 400) (= 0 (select |old(#valid)| |main_~#b~3.base|)) (<= 0 (+ (* 4 main_~i~3) |main_~#b~3.offset|))) [2018-01-25 03:23:49,760 INFO L401 ceAbstractionStarter]: For program point L21'''(line 21) no Hoare annotation was computed. [2018-01-25 03:23:49,760 INFO L401 ceAbstractionStarter]: For program point L21'(line 21) no Hoare annotation was computed. [2018-01-25 03:23:49,760 INFO L401 ceAbstractionStarter]: For program point mainErr3RequiresViolation(lines 1 31) no Hoare annotation was computed. [2018-01-25 03:23:49,761 INFO L401 ceAbstractionStarter]: For program point L25''''(lines 25 29) no Hoare annotation was computed. [2018-01-25 03:23:49,761 INFO L401 ceAbstractionStarter]: For program point L25''(lines 25 29) no Hoare annotation was computed. [2018-01-25 03:23:49,761 INFO L401 ceAbstractionStarter]: For program point L23''(line 23) no Hoare annotation was computed. [2018-01-25 03:23:49,761 INFO L401 ceAbstractionStarter]: For program point mainErr4EnsuresViolation(lines 20 31) no Hoare annotation was computed. [2018-01-25 03:23:49,761 INFO L401 ceAbstractionStarter]: For program point L21''(line 21) no Hoare annotation was computed. [2018-01-25 03:23:49,767 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 03:23:49,770 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 03:23:49,775 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 03:23:49,775 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 03:23:49,775 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 03:23:49,776 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 03:23:49,776 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 03:23:49,780 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 03:23:49,781 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 03:23:49,781 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 03:23:49,781 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 03:23:49,782 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 03:23:49,783 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 03:23:49,784 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 03:23:49,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 03:23:49 BoogieIcfgContainer [2018-01-25 03:23:49,786 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 03:23:49,787 INFO L168 Benchmark]: Toolchain (without parser) took 15186.39 ms. Allocated memory was 307.8 MB in the beginning and 697.3 MB in the end (delta: 389.5 MB). Free memory was 268.7 MB in the beginning and 501.6 MB in the end (delta: -233.0 MB). Peak memory consumption was 156.6 MB. Max. memory is 5.3 GB. [2018-01-25 03:23:49,788 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 307.8 MB. Free memory is still 272.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 03:23:49,788 INFO L168 Benchmark]: CACSL2BoogieTranslator took 211.65 ms. Allocated memory is still 307.8 MB. Free memory was 268.7 MB in the beginning and 258.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-25 03:23:49,789 INFO L168 Benchmark]: Boogie Preprocessor took 28.17 ms. Allocated memory is still 307.8 MB. Free memory is still 258.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 03:23:49,789 INFO L168 Benchmark]: RCFGBuilder took 262.99 ms. Allocated memory is still 307.8 MB. Free memory was 258.6 MB in the beginning and 241.7 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. [2018-01-25 03:23:49,789 INFO L168 Benchmark]: TraceAbstraction took 14675.17 ms. Allocated memory was 307.8 MB in the beginning and 697.3 MB in the end (delta: 389.5 MB). Free memory was 241.7 MB in the beginning and 501.6 MB in the end (delta: -260.0 MB). Peak memory consumption was 129.6 MB. Max. memory is 5.3 GB. [2018-01-25 03:23:49,798 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.17 ms. Allocated memory is still 307.8 MB. Free memory is still 272.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 211.65 ms. Allocated memory is still 307.8 MB. Free memory was 268.7 MB in the beginning and 258.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.17 ms. Allocated memory is still 307.8 MB. Free memory is still 258.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * RCFGBuilder took 262.99 ms. Allocated memory is still 307.8 MB. Free memory was 258.6 MB in the beginning and 241.7 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 14675.17 ms. Allocated memory was 307.8 MB in the beginning and 697.3 MB in the end (delta: 389.5 MB). Free memory was 241.7 MB in the beginning and 501.6 MB in the end (delta: -260.0 MB). Peak memory consumption was 129.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 23 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 188 LocStat_NO_SUPPORTING_DISEQUALITIES : 36 LocStat_NO_DISJUNCTIONS : -46 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 30 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 37 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 31 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.563996 RENAME_VARIABLES(MILLISECONDS) : 0.259115 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.502217 PROJECTAWAY(MILLISECONDS) : 0.221517 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.150696 DISJOIN(MILLISECONDS) : 0.240901 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.295627 ADD_EQUALITY(MILLISECONDS) : 0.056220 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.044172 #CONJOIN_DISJUNCTIVE : 50 #RENAME_VARIABLES : 99 #UNFREEZE : 0 #CONJOIN : 88 #PROJECTAWAY : 86 #ADD_WEAK_EQUALITY : 5 #DISJOIN : 11 #RENAME_VARIABLES_DISJUNCTIVE : 97 #ADD_EQUALITY : 38 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 1 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 30 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 210 LocStat_NO_SUPPORTING_DISEQUALITIES : 52 LocStat_NO_DISJUNCTIONS : -60 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 37 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 41 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 37 TransStat_MAX_NO_DISJUNCTIONS : 1 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.425633 RENAME_VARIABLES(MILLISECONDS) : 0.220095 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.385197 PROJECTAWAY(MILLISECONDS) : 0.180937 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.068222 DISJOIN(MILLISECONDS) : 0.287638 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.250821 ADD_EQUALITY(MILLISECONDS) : 0.042442 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.014146 #CONJOIN_DISJUNCTIVE : 79 #RENAME_VARIABLES : 162 #UNFREEZE : 0 #CONJOIN : 127 #PROJECTAWAY : 122 #ADD_WEAK_EQUALITY : 6 #DISJOIN : 16 #RENAME_VARIABLES_DISJUNCTIVE : 162 #ADD_EQUALITY : 42 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 25 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 210 LocStat_NO_SUPPORTING_DISEQUALITIES : 40 LocStat_NO_DISJUNCTIONS : -50 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 33 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 41 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 34 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.354773 RENAME_VARIABLES(MILLISECONDS) : 0.195171 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.320204 PROJECTAWAY(MILLISECONDS) : 0.148096 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.074758 DISJOIN(MILLISECONDS) : 0.255114 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.219144 ADD_EQUALITY(MILLISECONDS) : 0.028170 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.009361 #CONJOIN_DISJUNCTIVE : 91 #RENAME_VARIABLES : 187 #UNFREEZE : 0 #CONJOIN : 141 #PROJECTAWAY : 139 #ADD_WEAK_EQUALITY : 6 #DISJOIN : 13 #RENAME_VARIABLES_DISJUNCTIVE : 183 #ADD_EQUALITY : 42 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 1 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 25 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 219 LocStat_NO_SUPPORTING_DISEQUALITIES : 40 LocStat_NO_DISJUNCTIONS : -50 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 33 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 41 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 34 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.353966 RENAME_VARIABLES(MILLISECONDS) : 0.235583 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.315224 PROJECTAWAY(MILLISECONDS) : 0.147050 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.101599 DISJOIN(MILLISECONDS) : 0.257952 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.264587 ADD_EQUALITY(MILLISECONDS) : 0.035443 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.010789 #CONJOIN_DISJUNCTIVE : 91 #RENAME_VARIABLES : 187 #UNFREEZE : 0 #CONJOIN : 141 #PROJECTAWAY : 139 #ADD_WEAK_EQUALITY : 6 #DISJOIN : 13 #RENAME_VARIABLES_DISJUNCTIVE : 183 #ADD_EQUALITY : 42 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 1 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 22]: Loop Invariant [2018-01-25 03:23:49,817 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 03:23:49,823 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((\valid == \old(\valid)[b := 1] && 0 == b) && unknown-#length-unknown[b] == 400) && 0 == \old(\valid)[b]) && 0 <= 4 * i + b - InvariantResult [Line: 14]: Loop Invariant [2018-01-25 03:23:49,826 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 03:23:49,826 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 03:23:49,826 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 03:23:49,826 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 03:23:49,827 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 03:23:49,829 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 03:23:49,830 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 03:23:49,830 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 03:23:49,830 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 03:23:49,830 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((!(0 == b) || 99 < \old(size)) || !(\valid[b] == 1)) || !(400 == unknown-#length-unknown[b])) || ((((((size <= 99 && \old(size) <= size) && 1 == \valid[b]) && unknown-#length-unknown[b] == 400) && b == 0) && size <= n) && i == 0)) || (((((size <= 99 && 1 == \valid[b]) && unknown-#length-unknown[b] == 400) && b == 0) && 1 <= i) && size <= n)) || \old(n) < \old(size)) && (((((!(0 == b) || !(\valid[b] == 1)) || !(0 == \old(size))) || !(400 == unknown-#length-unknown[b])) || \old(n) < \old(size)) || (size == 0 && i == 0))) && ((((((!(0 == b) || (size <= 1 && 1 == i)) || !(\valid[b] == 1)) || !(400 == unknown-#length-unknown[b])) || 1 < \old(size)) || \old(n) < \old(size)) || (size <= 1 && i == 0)) - InvariantResult [Line: 25]: Loop Invariant [2018-01-25 03:23:49,831 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 03:23:49,832 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((\valid == \old(\valid)[b := 1] && 0 == b) && unknown-#length-unknown[b] == 400) && 0 == \old(\valid)[b]) && 0 <= 4 * i + b - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 49 locations, 8 error locations. SAFE Result, 14.5s OverallTime, 15 OverallIterations, 5 TraceHistogramMax, 2.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 515 SDtfs, 689 SDslu, 881 SDs, 0 SdLazy, 702 SolverSat, 90 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1025 GetRequests, 885 SyntacticMatches, 28 SemanticMatches, 112 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 4.7s AbstIntTime, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 106 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 21 PreInvPairs, 36 NumberOfFragments, 239 HoareAnnotationTreeSize, 21 FomulaSimplifications, 299 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 9 FomulaSimplificationsInter, 804 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 930 NumberOfCodeBlocks, 866 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1360 ConstructedInterpolants, 58 QuantifiedInterpolants, 251604 SizeOfPredicates, 29 NumberOfNonLiveVariables, 1279 ConjunctsInSsa, 94 ConjunctsInUnsatCore, 37 InterpolantComputations, 14 PerfectInterpolantSequences, 637/713 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_03-23-49-839.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_03-23-49-839.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_03-23-49-839.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-25_03-23-49-839.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-25_03-23-49-839.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-25_03-23-49-839.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-25_03-23-49-839.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-25_03-23-49-839.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-25_03-23-49-839.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_03-23-49-839.csv Received shutdown request...