java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength6_true-valid-memsafety_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 20:34:19,766 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 20:34:19,767 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 20:34:19,779 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 20:34:19,779 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 20:34:19,780 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 20:34:19,780 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 20:34:19,782 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 20:34:19,783 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 20:34:19,784 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 20:34:19,784 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 20:34:19,785 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 20:34:19,785 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 20:34:19,786 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 20:34:19,787 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 20:34:19,790 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 20:34:19,792 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 20:34:19,794 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 20:34:19,795 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 20:34:19,797 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 20:34:19,799 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 20:34:19,799 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 20:34:19,800 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 20:34:19,801 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 20:34:19,801 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 20:34:19,803 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 20:34:19,803 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 20:34:19,804 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 20:34:19,804 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 20:34:19,804 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 20:34:19,805 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 20:34:19,805 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf [2018-01-24 20:34:19,815 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 20:34:19,815 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 20:34:19,816 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 20:34:19,816 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 20:34:19,817 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 20:34:19,817 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-24 20:34:19,817 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 20:34:19,817 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-24 20:34:19,817 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 20:34:19,818 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 20:34:19,818 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 20:34:19,818 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 20:34:19,819 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 20:34:19,819 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 20:34:19,819 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 20:34:19,819 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 20:34:19,819 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 20:34:19,820 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 20:34:19,820 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 20:34:19,820 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 20:34:19,820 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 20:34:19,820 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 20:34:19,821 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 20:34:19,821 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 20:34:19,821 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 20:34:19,821 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 20:34:19,822 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 20:34:19,822 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 20:34:19,822 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 20:34:19,822 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 20:34:19,822 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 20:34:19,822 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 20:34:19,823 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 20:34:19,823 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 20:34:19,823 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 20:34:19,824 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 20:34:19,824 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 20:34:19,858 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 20:34:19,870 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 20:34:19,874 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 20:34:19,875 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 20:34:19,876 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 20:34:19,877 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength6_true-valid-memsafety_true-termination.c [2018-01-24 20:34:19,999 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 20:34:20,003 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 20:34:20,004 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 20:34:20,004 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 20:34:20,009 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 20:34:20,009 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 08:34:19" (1/1) ... [2018-01-24 20:34:20,012 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15df6b88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:34:20, skipping insertion in model container [2018-01-24 20:34:20,012 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 08:34:19" (1/1) ... [2018-01-24 20:34:20,026 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 20:34:20,043 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 20:34:20,144 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 20:34:20,159 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 20:34:20,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:34:20 WrapperNode [2018-01-24 20:34:20,165 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 20:34:20,166 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 20:34:20,166 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 20:34:20,166 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 20:34:20,183 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:34:20" (1/1) ... [2018-01-24 20:34:20,183 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:34:20" (1/1) ... [2018-01-24 20:34:20,194 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:34:20" (1/1) ... [2018-01-24 20:34:20,195 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:34:20" (1/1) ... [2018-01-24 20:34:20,198 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:34:20" (1/1) ... [2018-01-24 20:34:20,202 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:34:20" (1/1) ... [2018-01-24 20:34:20,203 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:34:20" (1/1) ... [2018-01-24 20:34:20,205 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 20:34:20,206 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 20:34:20,206 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 20:34:20,206 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 20:34:20,207 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:34:20" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 20:34:20,261 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 20:34:20,261 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 20:34:20,261 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-24 20:34:20,262 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 20:34:20,262 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 20:34:20,262 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 20:34:20,262 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 20:34:20,262 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 20:34:20,263 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 20:34:20,263 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-24 20:34:20,263 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 20:34:20,263 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 20:34:20,263 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 20:34:20,462 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 20:34:20,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 08:34:20 BoogieIcfgContainer [2018-01-24 20:34:20,463 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 20:34:20,464 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 20:34:20,464 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 20:34:20,465 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 20:34:20,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 08:34:19" (1/3) ... [2018-01-24 20:34:20,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7815f7d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 08:34:20, skipping insertion in model container [2018-01-24 20:34:20,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:34:20" (2/3) ... [2018-01-24 20:34:20,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7815f7d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 08:34:20, skipping insertion in model container [2018-01-24 20:34:20,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 08:34:20" (3/3) ... [2018-01-24 20:34:20,469 INFO L105 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength6_true-valid-memsafety_true-termination.c [2018-01-24 20:34:20,476 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 20:34:20,482 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-01-24 20:34:20,525 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 20:34:20,525 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 20:34:20,525 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 20:34:20,525 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 20:34:20,525 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 20:34:20,525 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 20:34:20,526 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 20:34:20,526 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 20:34:20,526 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 20:34:20,541 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-01-24 20:34:20,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-24 20:34:20,545 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:34:20,546 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:34:20,547 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 20:34:20,552 INFO L82 PathProgramCache]: Analyzing trace with hash -215054890, now seen corresponding path program 1 times [2018-01-24 20:34:20,555 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:34:20,598 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:34:20,598 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:34:20,599 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:34:20,599 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:34:20,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:34:20,651 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:34:20,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:34:20,732 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:34:20,733 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 20:34:20,733 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:34:20,735 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 20:34:20,746 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 20:34:20,746 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 20:34:20,748 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-01-24 20:34:20,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:34:20,835 INFO L93 Difference]: Finished difference Result 101 states and 123 transitions. [2018-01-24 20:34:20,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 20:34:20,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-01-24 20:34:20,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:34:20,845 INFO L225 Difference]: With dead ends: 101 [2018-01-24 20:34:20,845 INFO L226 Difference]: Without dead ends: 59 [2018-01-24 20:34:20,848 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 20:34:20,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-24 20:34:20,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2018-01-24 20:34:20,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 20:34:20,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-01-24 20:34:20,947 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 11 [2018-01-24 20:34:20,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:34:20,947 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-01-24 20:34:20,947 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 20:34:20,947 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-01-24 20:34:20,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 20:34:20,948 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:34:20,948 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:34:20,948 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 20:34:20,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1100032001, now seen corresponding path program 1 times [2018-01-24 20:34:20,948 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:34:20,949 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:34:20,949 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:34:20,949 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:34:20,950 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:34:20,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:34:20,967 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:34:21,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:34:21,028 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:34:21,028 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 20:34:21,028 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:34:21,029 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 20:34:21,029 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 20:34:21,030 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-24 20:34:21,030 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 5 states. [2018-01-24 20:34:21,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:34:21,130 INFO L93 Difference]: Finished difference Result 95 states and 104 transitions. [2018-01-24 20:34:21,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 20:34:21,131 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-24 20:34:21,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:34:21,132 INFO L225 Difference]: With dead ends: 95 [2018-01-24 20:34:21,132 INFO L226 Difference]: Without dead ends: 57 [2018-01-24 20:34:21,134 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-24 20:34:21,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-24 20:34:21,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 52. [2018-01-24 20:34:21,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-24 20:34:21,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-01-24 20:34:21,141 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 16 [2018-01-24 20:34:21,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:34:21,142 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-01-24 20:34:21,142 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 20:34:21,142 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-01-24 20:34:21,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 20:34:21,143 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:34:21,143 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:34:21,143 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 20:34:21,144 INFO L82 PathProgramCache]: Analyzing trace with hash -258746290, now seen corresponding path program 1 times [2018-01-24 20:34:21,144 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:34:21,145 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:34:21,145 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:34:21,146 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:34:21,146 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:34:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:34:21,161 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:34:21,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:34:21,267 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:34:21,267 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 20:34:21,267 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:34:21,267 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 20:34:21,268 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 20:34:21,268 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 20:34:21,268 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 6 states. [2018-01-24 20:34:21,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:34:21,473 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2018-01-24 20:34:21,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 20:34:21,473 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-01-24 20:34:21,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:34:21,474 INFO L225 Difference]: With dead ends: 57 [2018-01-24 20:34:21,475 INFO L226 Difference]: Without dead ends: 56 [2018-01-24 20:34:21,475 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 20:34:21,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-24 20:34:21,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2018-01-24 20:34:21,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-24 20:34:21,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2018-01-24 20:34:21,484 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 17 [2018-01-24 20:34:21,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:34:21,484 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2018-01-24 20:34:21,484 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 20:34:21,485 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2018-01-24 20:34:21,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 20:34:21,485 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:34:21,485 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:34:21,486 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 20:34:21,486 INFO L82 PathProgramCache]: Analyzing trace with hash -258746291, now seen corresponding path program 1 times [2018-01-24 20:34:21,486 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:34:21,487 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:34:21,488 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:34:21,488 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:34:21,488 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:34:21,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:34:21,498 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:34:21,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:34:21,556 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:34:21,556 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 20:34:21,556 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:34:21,557 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 20:34:21,557 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 20:34:21,557 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 20:34:21,558 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 6 states. [2018-01-24 20:34:21,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:34:21,614 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-01-24 20:34:21,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 20:34:21,615 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-01-24 20:34:21,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:34:21,616 INFO L225 Difference]: With dead ends: 53 [2018-01-24 20:34:21,616 INFO L226 Difference]: Without dead ends: 52 [2018-01-24 20:34:21,617 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 20:34:21,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-24 20:34:21,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-24 20:34:21,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-24 20:34:21,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-01-24 20:34:21,626 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 17 [2018-01-24 20:34:21,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:34:21,626 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-01-24 20:34:21,626 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 20:34:21,626 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-01-24 20:34:21,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 20:34:21,627 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:34:21,627 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:34:21,627 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 20:34:21,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1933852231, now seen corresponding path program 1 times [2018-01-24 20:34:21,628 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:34:21,629 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:34:21,629 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:34:21,629 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:34:21,629 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:34:21,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:34:21,642 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:34:21,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:34:21,761 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 20:34:21,761 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 20:34:21,762 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-01-24 20:34:21,764 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [11], [12], [13], [14], [17], [19], [28], [29], [30], [34], [39], [41], [79], [80], [81], [83] [2018-01-24 20:34:21,824 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 20:34:21,824 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 20:34:22,485 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 20:34:22,486 INFO L268 AbstractInterpreter]: Visited 20 different actions 27 times. Merged at 7 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 20 variables. [2018-01-24 20:34:22,497 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 20:34:22,498 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 20:34:22,498 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 20:34:22,518 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:34:22,518 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 20:34:22,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:34:22,557 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 20:34:22,668 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:34:22,668 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 20:34:22,747 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:34:22,781 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 20:34:22,781 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 20:34:22,787 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:34:22,787 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 20:34:22,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:34:22,811 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 20:34:22,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:34:22,814 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 20:34:22,830 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:34:22,832 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 20:34:22,833 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 3, 3, 3, 3] total 12 [2018-01-24 20:34:22,833 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 20:34:22,833 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 20:34:22,834 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 20:34:22,834 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-01-24 20:34:22,834 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 11 states. [2018-01-24 20:34:23,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:34:23,017 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2018-01-24 20:34:23,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 20:34:23,017 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-01-24 20:34:23,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:34:23,018 INFO L225 Difference]: With dead ends: 103 [2018-01-24 20:34:23,018 INFO L226 Difference]: Without dead ends: 62 [2018-01-24 20:34:23,019 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2018-01-24 20:34:23,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-24 20:34:23,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-01-24 20:34:23,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-24 20:34:23,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-01-24 20:34:23,025 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 22 [2018-01-24 20:34:23,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:34:23,026 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-01-24 20:34:23,026 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 20:34:23,026 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-01-24 20:34:23,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 20:34:23,026 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:34:23,027 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:34:23,027 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 20:34:23,027 INFO L82 PathProgramCache]: Analyzing trace with hash 180123030, now seen corresponding path program 1 times [2018-01-24 20:34:23,027 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:34:23,028 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:34:23,028 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:34:23,028 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:34:23,028 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:34:23,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:34:23,040 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:34:23,438 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:34:23,438 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 20:34:23,438 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 20:34:23,438 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-01-24 20:34:23,439 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [11], [13], [14], [16], [17], [19], [28], [29], [30], [34], [39], [41], [79], [80], [81], [83] [2018-01-24 20:34:23,440 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 20:34:23,440 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 20:34:23,894 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 20:34:23,895 INFO L268 AbstractInterpreter]: Visited 20 different actions 27 times. Merged at 7 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 20 variables. [2018-01-24 20:34:23,900 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 20:34:23,900 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 20:34:23,900 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 20:34:23,915 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:34:23,915 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 20:34:23,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:34:23,935 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 20:34:23,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 20:34:23,960 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 20:34:23,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 20:34:23,990 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 20:34:24,195 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:34:24,195 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 20:34:24,382 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:34:24,403 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 20:34:24,403 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 20:34:24,408 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:34:24,409 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 20:34:24,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:34:24,432 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 20:34:24,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 20:34:24,440 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 20:34:24,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 20:34:24,462 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 20:34:24,484 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:34:24,484 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 20:34:24,503 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:34:24,505 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 20:34:24,505 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6, 6, 6] total 16 [2018-01-24 20:34:24,505 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 20:34:24,506 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 20:34:24,506 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 20:34:24,506 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-01-24 20:34:24,507 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 12 states. [2018-01-24 20:34:24,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:34:24,809 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-01-24 20:34:24,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 20:34:24,809 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2018-01-24 20:34:24,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:34:24,810 INFO L225 Difference]: With dead ends: 61 [2018-01-24 20:34:24,811 INFO L226 Difference]: Without dead ends: 60 [2018-01-24 20:34:24,811 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2018-01-24 20:34:24,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-24 20:34:24,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-01-24 20:34:24,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-24 20:34:24,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2018-01-24 20:34:24,819 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 23 [2018-01-24 20:34:24,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:34:24,819 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2018-01-24 20:34:24,819 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 20:34:24,819 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2018-01-24 20:34:24,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 20:34:24,821 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:34:24,821 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:34:24,821 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 20:34:24,821 INFO L82 PathProgramCache]: Analyzing trace with hash 687601263, now seen corresponding path program 1 times [2018-01-24 20:34:24,821 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:34:24,822 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:34:24,822 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:34:24,822 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:34:24,823 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:34:24,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:34:24,839 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:34:25,040 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:34:25,040 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 20:34:25,041 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 20:34:25,041 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: [2018-01-24 20:34:25,041 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [13], [14], [17], [19], [23], [24], [28], [29], [30], [34], [39], [40], [41], [43], [45], [79], [80], [81], [83], [84] [2018-01-24 20:34:25,043 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 20:34:25,043 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 20:34:27,041 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 20:34:27,041 INFO L268 AbstractInterpreter]: Visited 26 different actions 96 times. Merged at 16 different actions 45 times. Never widened. Found 7 fixpoints after 3 different actions. Largest state had 21 variables. [2018-01-24 20:34:27,045 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 20:34:27,045 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 20:34:27,045 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 20:34:27,056 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:34:27,056 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 20:34:27,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:34:27,078 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 20:34:27,360 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:34:27,360 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 20:34:27,517 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:34:27,538 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 20:34:27,539 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 20:34:27,544 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:34:27,544 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 20:34:27,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:34:27,578 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 20:34:27,614 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-24 20:34:27,614 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 20:34:27,644 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-24 20:34:27,646 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 3 imperfect interpolant sequences. [2018-01-24 20:34:27,646 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [7, 7, 7] total 22 [2018-01-24 20:34:27,646 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:34:27,647 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 20:34:27,647 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 20:34:27,647 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2018-01-24 20:34:27,647 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 5 states. [2018-01-24 20:34:27,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:34:27,717 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2018-01-24 20:34:27,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 20:34:27,717 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-01-24 20:34:27,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:34:27,718 INFO L225 Difference]: With dead ends: 72 [2018-01-24 20:34:27,718 INFO L226 Difference]: Without dead ends: 70 [2018-01-24 20:34:27,719 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 147 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2018-01-24 20:34:27,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-24 20:34:27,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 56. [2018-01-24 20:34:27,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-24 20:34:27,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-01-24 20:34:27,727 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 41 [2018-01-24 20:34:27,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:34:27,727 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-01-24 20:34:27,727 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 20:34:27,728 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-01-24 20:34:27,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-24 20:34:27,729 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:34:27,729 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 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] [2018-01-24 20:34:27,729 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 20:34:27,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1072164206, now seen corresponding path program 1 times [2018-01-24 20:34:27,730 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:34:27,731 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:34:27,731 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:34:27,731 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:34:27,731 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:34:27,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:34:27,745 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:34:27,961 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:34:27,961 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 20:34:27,999 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 20:34:27,999 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 50 with the following transitions: [2018-01-24 20:34:28,000 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [13], [14], [17], [19], [23], [24], [28], [29], [30], [34], [37], [39], [41], [43], [45], [49], [53], [58], [60], [63], [65], [66], [67], [78], [79], [80], [81], [83], [84] [2018-01-24 20:34:28,001 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 20:34:28,001 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 20:34:29,281 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 20:34:29,282 INFO L268 AbstractInterpreter]: Visited 35 different actions 123 times. Merged at 25 different actions 62 times. Never widened. Found 7 fixpoints after 3 different actions. Largest state had 21 variables. [2018-01-24 20:34:29,283 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 20:34:29,283 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 20:34:29,283 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 20:34:29,291 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:34:29,292 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 20:34:29,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:34:29,312 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 20:34:29,381 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:34:29,382 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 20:34:29,468 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:34:29,488 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 20:34:29,488 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 20:34:29,491 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:34:29,491 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 20:34:29,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:34:29,521 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 20:34:29,573 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-24 20:34:29,574 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 20:34:29,601 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-24 20:34:29,602 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 20:34:29,603 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 4, 4] total 21 [2018-01-24 20:34:29,603 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 20:34:29,603 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 20:34:29,603 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 20:34:29,604 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2018-01-24 20:34:29,604 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 12 states. [2018-01-24 20:34:29,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:34:29,746 INFO L93 Difference]: Finished difference Result 115 states and 122 transitions. [2018-01-24 20:34:29,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 20:34:29,746 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 49 [2018-01-24 20:34:29,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:34:29,747 INFO L225 Difference]: With dead ends: 115 [2018-01-24 20:34:29,747 INFO L226 Difference]: Without dead ends: 66 [2018-01-24 20:34:29,748 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=158, Invalid=492, Unknown=0, NotChecked=0, Total=650 [2018-01-24 20:34:29,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-24 20:34:29,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2018-01-24 20:34:29,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-24 20:34:29,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2018-01-24 20:34:29,755 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 49 [2018-01-24 20:34:29,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:34:29,756 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2018-01-24 20:34:29,756 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 20:34:29,756 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2018-01-24 20:34:29,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-24 20:34:29,758 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:34:29,758 INFO L322 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 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] [2018-01-24 20:34:29,758 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 20:34:29,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1829333686, now seen corresponding path program 2 times [2018-01-24 20:34:29,758 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:34:29,759 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:34:29,759 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:34:29,759 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:34:29,759 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:34:29,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:34:29,773 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:34:29,972 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 2 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:34:29,973 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 20:34:29,973 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 20:34:29,973 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 20:34:29,973 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 20:34:29,973 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 20:34:29,973 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 20:34:29,981 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 20:34:29,981 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 20:34:29,990 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 20:34:29,991 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 20:34:29,994 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 20:34:30,016 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 20:34:30,017 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-24 20:34:30,017 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 20:34:30,019 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-24 20:34:30,019 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-24 20:34:30,085 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|main_~#mask~3.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |main_~#mask~3.base| 0)) (= 0 (select |c_old(#valid)| |main_~#mask~3.base|)))) is different from true [2018-01-24 20:34:30,093 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-01-24 20:34:30,093 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 20:34:30,176 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_~#mask~3.base_17| Int)) (or (= (store |c_#valid| |v_main_~#mask~3.base_17| 0) |c_old(#valid)|) (not (= (select |c_#valid| |v_main_~#mask~3.base_17|) 0)))) is different from false [2018-01-24 20:34:30,182 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-01-24 20:34:30,205 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 20:34:30,205 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [8] total 14 [2018-01-24 20:34:30,205 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:34:30,205 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 20:34:30,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 20:34:30,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=101, Unknown=2, NotChecked=42, Total=182 [2018-01-24 20:34:30,206 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand 6 states. [2018-01-24 20:34:30,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:34:30,284 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2018-01-24 20:34:30,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 20:34:30,285 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2018-01-24 20:34:30,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:34:30,286 INFO L225 Difference]: With dead ends: 63 [2018-01-24 20:34:30,286 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 20:34:30,286 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=144, Unknown=2, NotChecked=50, Total=240 [2018-01-24 20:34:30,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 20:34:30,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 20:34:30,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 20:34:30,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 20:34:30,287 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2018-01-24 20:34:30,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:34:30,287 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 20:34:30,287 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 20:34:30,288 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 20:34:30,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 20:34:30,292 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 20:34:30,612 WARN L146 SmtUtils]: Spent 157ms on a formula simplification. DAG size of input: 50 DAG size of output 34 [2018-01-24 20:34:30,652 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 35) no Hoare annotation was computed. [2018-01-24 20:34:30,653 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 35) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 20:34:30,653 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 35) no Hoare annotation was computed. [2018-01-24 20:34:30,653 INFO L401 ceAbstractionStarter]: For program point fooFINAL(lines 12 19) no Hoare annotation was computed. [2018-01-24 20:34:30,653 INFO L401 ceAbstractionStarter]: For program point L15''''(lines 15 17) no Hoare annotation was computed. [2018-01-24 20:34:30,653 INFO L401 ceAbstractionStarter]: For program point fooEXIT(lines 12 19) no Hoare annotation was computed. [2018-01-24 20:34:30,653 INFO L404 ceAbstractionStarter]: At program point fooENTRY(lines 12 19) the Hoare annotation is: true [2018-01-24 20:34:30,653 INFO L401 ceAbstractionStarter]: For program point fooErr2RequiresViolation(lines 1 35) no Hoare annotation was computed. [2018-01-24 20:34:30,653 INFO L397 ceAbstractionStarter]: At program point L15'''(lines 15 17) the Hoare annotation is: (let ((.cse2 (= 1 (select |#valid| foo_~b.base))) (.cse1 (select |#length| foo_~b.base)) (.cse0 (= foo_~size 32)) (.cse3 (= foo_~b.offset 0))) (or (and .cse0 (= 32 .cse1) .cse2 .cse3 (= foo_~i~1 0)) (not (= 0 |foo_#in~b.offset|)) (not (= (select |#valid| |foo_#in~b.base|) 1)) (and .cse2 (= .cse1 32) .cse0 .cse3 (<= 1 foo_~i~1)) (not (= 32 |foo_#in~size|)) (not (= 32 (select |#length| |foo_#in~b.base|))))) [2018-01-24 20:34:30,653 INFO L401 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2018-01-24 20:34:30,653 INFO L401 ceAbstractionStarter]: For program point L15(lines 15 17) no Hoare annotation was computed. [2018-01-24 20:34:30,654 INFO L401 ceAbstractionStarter]: For program point fooErr1RequiresViolation(lines 1 35) no Hoare annotation was computed. [2018-01-24 20:34:30,654 INFO L401 ceAbstractionStarter]: For program point L16'(line 16) no Hoare annotation was computed. [2018-01-24 20:34:30,654 INFO L401 ceAbstractionStarter]: For program point L15''(lines 15 17) no Hoare annotation was computed. [2018-01-24 20:34:30,654 INFO L401 ceAbstractionStarter]: For program point L16''(line 16) no Hoare annotation was computed. [2018-01-24 20:34:30,654 INFO L401 ceAbstractionStarter]: For program point fooErr0AssertViolation(line 16) no Hoare annotation was computed. [2018-01-24 20:34:30,654 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 35) the Hoare annotation is: true [2018-01-24 20:34:30,654 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 35) no Hoare annotation was computed. [2018-01-24 20:34:30,654 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 35) the Hoare annotation is: true [2018-01-24 20:34:30,654 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 35) no Hoare annotation was computed. [2018-01-24 20:34:30,654 INFO L401 ceAbstractionStarter]: For program point mainErr0AssertViolation(line 27) no Hoare annotation was computed. [2018-01-24 20:34:30,654 INFO L401 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 21 35) no Hoare annotation was computed. [2018-01-24 20:34:30,654 INFO L401 ceAbstractionStarter]: For program point mainErr1AssertViolation(line 30) no Hoare annotation was computed. [2018-01-24 20:34:30,654 INFO L401 ceAbstractionStarter]: For program point L25(lines 25 28) no Hoare annotation was computed. [2018-01-24 20:34:30,654 INFO L401 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-01-24 20:34:30,654 INFO L401 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-01-24 20:34:30,655 INFO L397 ceAbstractionStarter]: At program point L25'''(lines 25 28) the Hoare annotation is: (let ((.cse0 (= 32 (select |#length| |main_~#mask~3.base|))) (.cse1 (= (store |old(#valid)| |main_~#mask~3.base| 1) |#valid|)) (.cse2 (= 0 (select |old(#valid)| |main_~#mask~3.base|))) (.cse3 (= 0 |main_~#mask~3.offset|))) (or (and (<= 1 main_~i~3) (= 1 (select |#valid| main_~c~3.base)) .cse0 .cse1 (= 32 (select |#length| main_~c~3.base)) .cse2 .cse3 (= 0 main_~c~3.offset)) (and .cse0 .cse1 (= main_~i~3 0) .cse2 .cse3))) [2018-01-24 20:34:30,655 INFO L401 ceAbstractionStarter]: For program point L29(lines 29 33) no Hoare annotation was computed. [2018-01-24 20:34:30,655 INFO L401 ceAbstractionStarter]: For program point L24''''(line 24) no Hoare annotation was computed. [2018-01-24 20:34:30,655 INFO L397 ceAbstractionStarter]: At program point L27'(line 27) the Hoare annotation is: (and (= 1 (select |#valid| main_~c~3.base)) (= 32 (select |#length| |main_~#mask~3.base|)) (= (store |old(#valid)| |main_~#mask~3.base| 1) |#valid|) (<= 0 main_~i~3) (= 32 (select |#length| main_~c~3.base)) (= 0 (select |old(#valid)| |main_~#mask~3.base|)) (= 0 |main_~#mask~3.offset|) (= 0 main_~c~3.offset)) [2018-01-24 20:34:30,655 INFO L401 ceAbstractionStarter]: For program point L24'''''(line 24) no Hoare annotation was computed. [2018-01-24 20:34:30,655 INFO L397 ceAbstractionStarter]: At program point L29'''(lines 29 33) the Hoare annotation is: (let ((.cse0 (= 1 (select |#valid| main_~c~3.base))) (.cse1 (= 32 (select |#length| |main_~#mask~3.base|))) (.cse2 (= (store |old(#valid)| |main_~#mask~3.base| 1) |#valid|)) (.cse3 (= 32 (select |#length| main_~c~3.base))) (.cse4 (= 0 (select |old(#valid)| |main_~#mask~3.base|))) (.cse5 (= 0 |main_~#mask~3.offset|)) (.cse6 (= 0 main_~c~3.offset))) (or (and .cse0 .cse1 .cse2 .cse3 (= main_~i~3 0) .cse4 .cse5 .cse6) (and (<= 1 main_~i~3) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2018-01-24 20:34:30,655 INFO L401 ceAbstractionStarter]: For program point L25''''(lines 25 28) no Hoare annotation was computed. [2018-01-24 20:34:30,655 INFO L401 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2018-01-24 20:34:30,655 INFO L401 ceAbstractionStarter]: For program point L24''(line 24) no Hoare annotation was computed. [2018-01-24 20:34:30,655 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 21 35) no Hoare annotation was computed. [2018-01-24 20:34:30,655 INFO L401 ceAbstractionStarter]: For program point L25''(lines 25 28) no Hoare annotation was computed. [2018-01-24 20:34:30,656 INFO L401 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-01-24 20:34:30,656 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 21 35) no Hoare annotation was computed. [2018-01-24 20:34:30,656 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 21 35) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 20:34:30,656 INFO L401 ceAbstractionStarter]: For program point L24'''(line 24) no Hoare annotation was computed. [2018-01-24 20:34:30,656 INFO L401 ceAbstractionStarter]: For program point L29''''(lines 29 33) no Hoare annotation was computed. [2018-01-24 20:34:30,656 INFO L401 ceAbstractionStarter]: For program point L29''(lines 29 33) no Hoare annotation was computed. [2018-01-24 20:34:30,656 INFO L401 ceAbstractionStarter]: For program point L27''(line 27) no Hoare annotation was computed. [2018-01-24 20:34:30,656 INFO L401 ceAbstractionStarter]: For program point L24'(line 24) no Hoare annotation was computed. [2018-01-24 20:34:30,656 INFO L401 ceAbstractionStarter]: For program point L30'(lines 30 32) no Hoare annotation was computed. [2018-01-24 20:34:30,660 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 20:34:30,661 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 20:34:30,661 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 20:34:30,661 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 20:34:30,664 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 20:34:30,665 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 20:34:30,665 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 20:34:30,665 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 20:34:30,668 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 20:34:30,668 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 20:34:30,668 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 20:34:30,670 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 20:34:30,670 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 20:34:30,670 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 20:34:30,672 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 20:34:30,672 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 20:34:30,673 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 20:34:30,674 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 20:34:30,674 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 20:34:30,675 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 20:34:30,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 08:34:30 BoogieIcfgContainer [2018-01-24 20:34:30,676 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 20:34:30,677 INFO L168 Benchmark]: Toolchain (without parser) took 10678.17 ms. Allocated memory was 298.8 MB in the beginning and 748.7 MB in the end (delta: 449.8 MB). Free memory was 257.8 MB in the beginning and 622.6 MB in the end (delta: -364.8 MB). Peak memory consumption was 85.0 MB. Max. memory is 5.3 GB. [2018-01-24 20:34:30,678 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 298.8 MB. Free memory is still 262.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 20:34:30,679 INFO L168 Benchmark]: CACSL2BoogieTranslator took 161.61 ms. Allocated memory is still 298.8 MB. Free memory was 256.8 MB in the beginning and 248.7 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. [2018-01-24 20:34:30,679 INFO L168 Benchmark]: Boogie Preprocessor took 39.79 ms. Allocated memory is still 298.8 MB. Free memory was 248.7 MB in the beginning and 246.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 20:34:30,679 INFO L168 Benchmark]: RCFGBuilder took 257.29 ms. Allocated memory is still 298.8 MB. Free memory was 246.7 MB in the beginning and 230.8 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 5.3 GB. [2018-01-24 20:34:30,679 INFO L168 Benchmark]: TraceAbstraction took 10212.91 ms. Allocated memory was 298.8 MB in the beginning and 748.7 MB in the end (delta: 449.8 MB). Free memory was 230.8 MB in the beginning and 622.6 MB in the end (delta: -391.8 MB). Peak memory consumption was 58.0 MB. Max. memory is 5.3 GB. [2018-01-24 20:34:30,681 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.19 ms. Allocated memory is still 298.8 MB. Free memory is still 262.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 161.61 ms. Allocated memory is still 298.8 MB. Free memory was 256.8 MB in the beginning and 248.7 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.79 ms. Allocated memory is still 298.8 MB. Free memory was 248.7 MB in the beginning and 246.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 257.29 ms. Allocated memory is still 298.8 MB. Free memory was 246.7 MB in the beginning and 230.8 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 10212.91 ms. Allocated memory was 298.8 MB in the beginning and 748.7 MB in the end (delta: 449.8 MB). Free memory was 230.8 MB in the beginning and 622.6 MB in the end (delta: -391.8 MB). Peak memory consumption was 58.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 19 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 151 LocStat_NO_SUPPORTING_DISEQUALITIES : 36 LocStat_NO_DISJUNCTIONS : -38 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 26 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 33 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 27 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.940793 RENAME_VARIABLES(MILLISECONDS) : 0.260424 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.883686 PROJECTAWAY(MILLISECONDS) : 0.215210 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.099663 DISJOIN(MILLISECONDS) : 1.620469 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.311857 ADD_EQUALITY(MILLISECONDS) : 0.077071 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.041612 #CONJOIN_DISJUNCTIVE : 37 #RENAME_VARIABLES : 65 #UNFREEZE : 0 #CONJOIN : 61 #PROJECTAWAY : 60 #ADD_WEAK_EQUALITY : 4 #DISJOIN : 1 #RENAME_VARIABLES_DISJUNCTIVE : 63 #ADD_EQUALITY : 33 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 1 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 19 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 151 LocStat_NO_SUPPORTING_DISEQUALITIES : 36 LocStat_NO_DISJUNCTIONS : -38 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 26 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 33 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 27 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.657828 RENAME_VARIABLES(MILLISECONDS) : 0.172004 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.625067 PROJECTAWAY(MILLISECONDS) : 0.217492 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.065289 DISJOIN(MILLISECONDS) : 0.270168 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.192644 ADD_EQUALITY(MILLISECONDS) : 0.026034 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.013006 #CONJOIN_DISJUNCTIVE : 37 #RENAME_VARIABLES : 65 #UNFREEZE : 0 #CONJOIN : 61 #PROJECTAWAY : 60 #ADD_WEAK_EQUALITY : 4 #DISJOIN : 1 #RENAME_VARIABLES_DISJUNCTIVE : 63 #ADD_EQUALITY : 33 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 1 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 24 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 189 LocStat_NO_SUPPORTING_DISEQUALITIES : 38 LocStat_NO_DISJUNCTIONS : -48 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 32 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 38 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 33 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.538775 RENAME_VARIABLES(MILLISECONDS) : 0.158236 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.508898 PROJECTAWAY(MILLISECONDS) : 0.131842 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.103256 DISJOIN(MILLISECONDS) : 0.198354 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.176207 ADD_EQUALITY(MILLISECONDS) : 0.030096 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.012426 #CONJOIN_DISJUNCTIVE : 130 #RENAME_VARIABLES : 298 #UNFREEZE : 0 #CONJOIN : 214 #PROJECTAWAY : 205 #ADD_WEAK_EQUALITY : 5 #DISJOIN : 31 #RENAME_VARIABLES_DISJUNCTIVE : 293 #ADD_EQUALITY : 38 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 1 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 33 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 260 LocStat_NO_SUPPORTING_DISEQUALITIES : 60 LocStat_NO_DISJUNCTIONS : -66 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 41 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 40 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 41 TransStat_MAX_NO_DISJUNCTIONS : 1 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.670110 RENAME_VARIABLES(MILLISECONDS) : 0.212859 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.630096 PROJECTAWAY(MILLISECONDS) : 0.168092 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.081087 DISJOIN(MILLISECONDS) : 0.262459 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.236621 ADD_EQUALITY(MILLISECONDS) : 0.019851 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.007650 #CONJOIN_DISJUNCTIVE : 167 #RENAME_VARIABLES : 351 #UNFREEZE : 0 #CONJOIN : 228 #PROJECTAWAY : 234 #ADD_WEAK_EQUALITY : 6 #DISJOIN : 35 #RENAME_VARIABLES_DISJUNCTIVE : 351 #ADD_EQUALITY : 40 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 * 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 - 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: 16]: 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: 27]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 21]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 30]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 29]: Loop Invariant [2018-01-24 20:34:30,691 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 20:34:30,691 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 20:34:30,691 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 20:34:30,692 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 20:34:30,693 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 20:34:30,693 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 20:34:30,693 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 20:34:30,694 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((1 == \valid[c] && 32 == unknown-#length-unknown[mask]) && \old(\valid)[mask := 1] == \valid) && 32 == unknown-#length-unknown[c]) && i == 0) && 0 == \old(\valid)[mask]) && 0 == mask) && 0 == c) || (((((((1 <= i && 1 == \valid[c]) && 32 == unknown-#length-unknown[mask]) && \old(\valid)[mask := 1] == \valid) && 32 == unknown-#length-unknown[c]) && 0 == \old(\valid)[mask]) && 0 == mask) && 0 == c) - InvariantResult [Line: 15]: Loop Invariant [2018-01-24 20:34:30,695 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 20:34:30,695 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 20:34:30,695 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 20:34:30,697 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 20:34:30,697 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 20:34:30,697 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((size == 32 && 32 == unknown-#length-unknown[b]) && 1 == \valid[b]) && b == 0) && i == 0) || !(0 == b)) || !(\valid[b] == 1)) || ((((1 == \valid[b] && unknown-#length-unknown[b] == 32) && size == 32) && b == 0) && 1 <= i)) || !(32 == \old(size))) || !(32 == unknown-#length-unknown[b]) - InvariantResult [Line: 25]: Loop Invariant [2018-01-24 20:34:30,698 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 20:34:30,698 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 20:34:30,698 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 20:34:30,699 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 20:34:30,699 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 20:34:30,699 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((1 <= i && 1 == \valid[c]) && 32 == unknown-#length-unknown[mask]) && \old(\valid)[mask := 1] == \valid) && 32 == unknown-#length-unknown[c]) && 0 == \old(\valid)[mask]) && 0 == mask) && 0 == c) || ((((32 == unknown-#length-unknown[mask] && \old(\valid)[mask := 1] == \valid) && i == 0) && 0 == \old(\valid)[mask]) && 0 == mask) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 46 locations, 6 error locations. SAFE Result, 10.1s OverallTime, 9 OverallIterations, 5 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 340 SDtfs, 477 SDslu, 1046 SDs, 0 SdLazy, 464 SolverSat, 58 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 719 GetRequests, 601 SyntacticMatches, 7 SemanticMatches, 111 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 4.4s AbstIntTime, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 37 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 17 PreInvPairs, 26 NumberOfFragments, 240 HoareAnnotationTreeSize, 17 FomulaSimplifications, 143 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 242 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 576 NumberOfCodeBlocks, 540 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 874 ConstructedInterpolants, 34 QuantifiedInterpolants, 160100 SizeOfPredicates, 16 NumberOfNonLiveVariables, 806 ConjunctsInSsa, 77 ConjunctsInUnsatCore, 27 InterpolantComputations, 8 PerfectInterpolantSequences, 213/438 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/ArraysOfVariableLength6_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_20-34-30-704.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength6_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_20-34-30-704.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength6_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_20-34-30-704.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength6_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_20-34-30-704.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength6_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_20-34-30-704.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength6_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-24_20-34-30-704.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength6_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-24_20-34-30-704.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength6_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-24_20-34-30-704.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength6_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-24_20-34-30-704.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength6_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_20-34-30-704.csv Received shutdown request...