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_RubberTaipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/array-memsafety/java_BubbleSort-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 12:49:55,405 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 12:49:55,407 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 12:49:55,422 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 12:49:55,422 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 12:49:55,423 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 12:49:55,424 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 12:49:55,426 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 12:49:55,428 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 12:49:55,428 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 12:49:55,429 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 12:49:55,430 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 12:49:55,430 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 12:49:55,432 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 12:49:55,433 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 12:49:55,435 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 12:49:55,437 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 12:49:55,439 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 12:49:55,441 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 12:49:55,442 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 12:49:55,444 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 12:49:55,445 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 12:49:55,445 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 12:49:55,446 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 12:49:55,447 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 12:49:55,448 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 12:49:55,449 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 12:49:55,449 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 12:49:55,449 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 12:49:55,450 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 12:49:55,450 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 12:49:55,451 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf [2018-01-24 12:49:55,460 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 12:49:55,460 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 12:49:55,461 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 12:49:55,461 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 12:49:55,461 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 12:49:55,462 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 12:49:55,462 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 12:49:55,462 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 12:49:55,463 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 12:49:55,463 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 12:49:55,463 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 12:49:55,463 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 12:49:55,463 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 12:49:55,464 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 12:49:55,464 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 12:49:55,464 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 12:49:55,464 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 12:49:55,464 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 12:49:55,465 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 12:49:55,465 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 12:49:55,465 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 12:49:55,465 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 12:49:55,465 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 12:49:55,466 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:49:55,466 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 12:49:55,466 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 12:49:55,466 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 12:49:55,467 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 12:49:55,467 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-01-24 12:49:55,467 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 12:49:55,467 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 12:49:55,467 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 12:49:55,468 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 12:49:55,468 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 12:49:55,504 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 12:49:55,517 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 12:49:55,522 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 12:49:55,523 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 12:49:55,524 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 12:49:55,525 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/java_BubbleSort-alloca_true-valid-memsafety_true-termination.i [2018-01-24 12:49:55,688 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 12:49:55,694 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 12:49:55,694 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 12:49:55,694 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 12:49:55,699 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 12:49:55,700 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:49:55" (1/1) ... [2018-01-24 12:49:55,702 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@386958ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:49:55, skipping insertion in model container [2018-01-24 12:49:55,702 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:49:55" (1/1) ... [2018-01-24 12:49:55,719 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:49:55,760 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:49:55,873 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:49:55,889 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:49:55,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:49:55 WrapperNode [2018-01-24 12:49:55,895 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 12:49:55,895 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 12:49:55,895 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 12:49:55,895 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 12:49:55,914 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:49:55" (1/1) ... [2018-01-24 12:49:55,914 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:49:55" (1/1) ... [2018-01-24 12:49:55,926 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:49:55" (1/1) ... [2018-01-24 12:49:55,926 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:49:55" (1/1) ... [2018-01-24 12:49:55,930 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:49:55" (1/1) ... [2018-01-24 12:49:55,934 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:49:55" (1/1) ... [2018-01-24 12:49:55,936 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:49:55" (1/1) ... [2018-01-24 12:49:55,938 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 12:49:55,939 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 12:49:55,939 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 12:49:55,939 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 12:49:55,940 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:49:55" (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 12:49:56,005 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 12:49:56,006 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 12:49:56,006 INFO L136 BoogieDeclarations]: Found implementation of procedure sort [2018-01-24 12:49:56,006 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 12:49:56,006 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 12:49:56,006 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 12:49:56,006 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 12:49:56,007 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 12:49:56,007 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 12:49:56,007 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 12:49:56,007 INFO L128 BoogieDeclarations]: Found specification of procedure sort [2018-01-24 12:49:56,007 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 12:49:56,007 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 12:49:56,007 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 12:49:56,280 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 12:49:56,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:49:56 BoogieIcfgContainer [2018-01-24 12:49:56,281 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 12:49:56,282 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 12:49:56,282 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 12:49:56,285 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 12:49:56,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 12:49:55" (1/3) ... [2018-01-24 12:49:56,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6035b0fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:49:56, skipping insertion in model container [2018-01-24 12:49:56,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:49:55" (2/3) ... [2018-01-24 12:49:56,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6035b0fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:49:56, skipping insertion in model container [2018-01-24 12:49:56,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:49:56" (3/3) ... [2018-01-24 12:49:56,289 INFO L105 eAbstractionObserver]: Analyzing ICFG java_BubbleSort-alloca_true-valid-memsafety_true-termination.i [2018-01-24 12:49:56,299 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 12:49:56,306 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-01-24 12:49:56,343 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 12:49:56,343 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 12:49:56,343 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 12:49:56,343 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 12:49:56,343 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 12:49:56,343 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 12:49:56,343 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 12:49:56,343 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 12:49:56,344 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 12:49:56,360 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2018-01-24 12:49:56,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 12:49:56,366 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:49:56,367 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:49:56,367 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, sortErr7RequiresViolation, sortErr11RequiresViolation, sortErr0RequiresViolation, sortErr3RequiresViolation, sortErr9RequiresViolation, sortErr1RequiresViolation, sortErr2RequiresViolation, sortErr8RequiresViolation, sortErr10RequiresViolation, sortErr6RequiresViolation, sortErr4RequiresViolation, sortErr5RequiresViolation]=== [2018-01-24 12:49:56,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1780471319, now seen corresponding path program 1 times [2018-01-24 12:49:56,373 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:49:56,412 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:49:56,413 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:49:56,413 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:49:56,413 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:49:56,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:49:56,467 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:49:56,599 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 12:49:56,601 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:49:56,601 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:49:56,602 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:49:56,604 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:49:56,614 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:49:56,614 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:49:56,616 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 6 states. [2018-01-24 12:49:56,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:49:56,865 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2018-01-24 12:49:56,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:49:56,867 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-01-24 12:49:56,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:49:56,876 INFO L225 Difference]: With dead ends: 79 [2018-01-24 12:49:56,877 INFO L226 Difference]: Without dead ends: 39 [2018-01-24 12:49:56,879 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 12:49:56,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-01-24 12:49:56,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-01-24 12:49:56,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-01-24 12:49:56,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-01-24 12:49:56,909 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 16 [2018-01-24 12:49:56,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:49:56,910 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-01-24 12:49:56,910 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:49:56,910 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-01-24 12:49:56,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 12:49:56,910 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:49:56,911 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:49:56,911 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, sortErr7RequiresViolation, sortErr11RequiresViolation, sortErr0RequiresViolation, sortErr3RequiresViolation, sortErr9RequiresViolation, sortErr1RequiresViolation, sortErr2RequiresViolation, sortErr8RequiresViolation, sortErr10RequiresViolation, sortErr6RequiresViolation, sortErr4RequiresViolation, sortErr5RequiresViolation]=== [2018-01-24 12:49:56,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1780471318, now seen corresponding path program 1 times [2018-01-24 12:49:56,911 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:49:56,912 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:49:56,912 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:49:56,912 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:49:56,912 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:49:56,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:49:56,933 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:49:57,036 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 12:49:57,036 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:49:57,036 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 12:49:57,037 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:49:57,038 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:49:57,039 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:49:57,039 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:49:57,039 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 6 states. [2018-01-24 12:49:57,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:49:57,118 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2018-01-24 12:49:57,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:49:57,119 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-01-24 12:49:57,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:49:57,120 INFO L225 Difference]: With dead ends: 80 [2018-01-24 12:49:57,120 INFO L226 Difference]: Without dead ends: 52 [2018-01-24 12:49:57,121 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:49:57,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-24 12:49:57,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2018-01-24 12:49:57,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-24 12:49:57,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2018-01-24 12:49:57,130 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 16 [2018-01-24 12:49:57,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:49:57,130 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2018-01-24 12:49:57,130 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:49:57,130 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2018-01-24 12:49:57,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 12:49:57,131 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:49:57,131 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:49:57,131 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, sortErr7RequiresViolation, sortErr11RequiresViolation, sortErr0RequiresViolation, sortErr3RequiresViolation, sortErr9RequiresViolation, sortErr1RequiresViolation, sortErr2RequiresViolation, sortErr8RequiresViolation, sortErr10RequiresViolation, sortErr6RequiresViolation, sortErr4RequiresViolation, sortErr5RequiresViolation]=== [2018-01-24 12:49:57,131 INFO L82 PathProgramCache]: Analyzing trace with hash 2121468968, now seen corresponding path program 1 times [2018-01-24 12:49:57,131 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:49:57,133 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:49:57,133 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:49:57,133 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:49:57,133 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:49:57,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:49:57,148 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:49:57,359 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 12:49:57,360 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:49:57,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:49:57,360 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:49:57,360 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:49:57,360 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:49:57,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:49:57,361 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 8 states. [2018-01-24 12:49:57,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:49:57,510 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2018-01-24 12:49:57,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:49:57,511 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-01-24 12:49:57,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:49:57,515 INFO L225 Difference]: With dead ends: 70 [2018-01-24 12:49:57,515 INFO L226 Difference]: Without dead ends: 67 [2018-01-24 12:49:57,516 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-01-24 12:49:57,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-24 12:49:57,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 56. [2018-01-24 12:49:57,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-24 12:49:57,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2018-01-24 12:49:57,526 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 16 [2018-01-24 12:49:57,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:49:57,526 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2018-01-24 12:49:57,527 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:49:57,527 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2018-01-24 12:49:57,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 12:49:57,527 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:49:57,528 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 12:49:57,528 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, sortErr7RequiresViolation, sortErr11RequiresViolation, sortErr0RequiresViolation, sortErr3RequiresViolation, sortErr9RequiresViolation, sortErr1RequiresViolation, sortErr2RequiresViolation, sortErr8RequiresViolation, sortErr10RequiresViolation, sortErr6RequiresViolation, sortErr4RequiresViolation, sortErr5RequiresViolation]=== [2018-01-24 12:49:57,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1341028550, now seen corresponding path program 1 times [2018-01-24 12:49:57,528 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:49:57,529 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:49:57,529 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:49:57,530 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:49:57,530 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:49:57,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:49:57,544 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:49:57,670 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 12:49:57,670 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:49:57,670 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:49:57,670 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:49:57,671 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:49:57,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:49:57,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:49:57,671 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand 8 states. [2018-01-24 12:49:57,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:49:57,917 INFO L93 Difference]: Finished difference Result 106 states and 126 transitions. [2018-01-24 12:49:57,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:49:57,917 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-01-24 12:49:57,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:49:57,919 INFO L225 Difference]: With dead ends: 106 [2018-01-24 12:49:57,919 INFO L226 Difference]: Without dead ends: 101 [2018-01-24 12:49:57,920 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:49:57,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-01-24 12:49:57,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 87. [2018-01-24 12:49:57,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-24 12:49:57,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 102 transitions. [2018-01-24 12:49:57,933 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 102 transitions. Word has length 17 [2018-01-24 12:49:57,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:49:57,933 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 102 transitions. [2018-01-24 12:49:57,933 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:49:57,933 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 102 transitions. [2018-01-24 12:49:57,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 12:49:57,934 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:49:57,934 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:49:57,934 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, sortErr7RequiresViolation, sortErr11RequiresViolation, sortErr0RequiresViolation, sortErr3RequiresViolation, sortErr9RequiresViolation, sortErr1RequiresViolation, sortErr2RequiresViolation, sortErr8RequiresViolation, sortErr10RequiresViolation, sortErr6RequiresViolation, sortErr4RequiresViolation, sortErr5RequiresViolation]=== [2018-01-24 12:49:57,934 INFO L82 PathProgramCache]: Analyzing trace with hash 232335457, now seen corresponding path program 1 times [2018-01-24 12:49:57,934 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:49:57,935 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:49:57,935 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:49:57,935 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:49:57,935 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:49:57,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:49:57,949 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:49:57,990 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 12:49:57,991 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:49:57,991 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:49:57,991 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:49:57,992 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:49:57,992 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:49:57,992 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:49:57,993 INFO L87 Difference]: Start difference. First operand 87 states and 102 transitions. Second operand 4 states. [2018-01-24 12:49:58,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:49:58,076 INFO L93 Difference]: Finished difference Result 87 states and 102 transitions. [2018-01-24 12:49:58,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:49:58,077 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-01-24 12:49:58,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:49:58,079 INFO L225 Difference]: With dead ends: 87 [2018-01-24 12:49:58,079 INFO L226 Difference]: Without dead ends: 72 [2018-01-24 12:49:58,080 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:49:58,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-01-24 12:49:58,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-01-24 12:49:58,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-24 12:49:58,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2018-01-24 12:49:58,093 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 19 [2018-01-24 12:49:58,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:49:58,094 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2018-01-24 12:49:58,094 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:49:58,094 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2018-01-24 12:49:58,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 12:49:58,095 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:49:58,095 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 12:49:58,096 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, sortErr7RequiresViolation, sortErr11RequiresViolation, sortErr0RequiresViolation, sortErr3RequiresViolation, sortErr9RequiresViolation, sortErr1RequiresViolation, sortErr2RequiresViolation, sortErr8RequiresViolation, sortErr10RequiresViolation, sortErr6RequiresViolation, sortErr4RequiresViolation, sortErr5RequiresViolation]=== [2018-01-24 12:49:58,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1939327170, now seen corresponding path program 1 times [2018-01-24 12:49:58,096 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:49:58,097 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:49:58,097 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:49:58,097 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:49:58,098 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:49:58,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:49:58,111 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:49:58,152 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:49:58,152 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:49:58,152 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:49:58,152 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:49:58,153 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:49:58,153 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:49:58,153 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:49:58,153 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand 5 states. [2018-01-24 12:49:58,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:49:58,269 INFO L93 Difference]: Finished difference Result 88 states and 101 transitions. [2018-01-24 12:49:58,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:49:58,270 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-01-24 12:49:58,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:49:58,271 INFO L225 Difference]: With dead ends: 88 [2018-01-24 12:49:58,271 INFO L226 Difference]: Without dead ends: 83 [2018-01-24 12:49:58,271 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:49:58,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-24 12:49:58,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 50. [2018-01-24 12:49:58,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 12:49:58,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-01-24 12:49:58,280 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 22 [2018-01-24 12:49:58,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:49:58,280 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-01-24 12:49:58,281 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:49:58,281 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-01-24 12:49:58,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 12:49:58,282 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:49:58,282 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:49:58,282 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, sortErr7RequiresViolation, sortErr11RequiresViolation, sortErr0RequiresViolation, sortErr3RequiresViolation, sortErr9RequiresViolation, sortErr1RequiresViolation, sortErr2RequiresViolation, sortErr8RequiresViolation, sortErr10RequiresViolation, sortErr6RequiresViolation, sortErr4RequiresViolation, sortErr5RequiresViolation]=== [2018-01-24 12:49:58,282 INFO L82 PathProgramCache]: Analyzing trace with hash 733703231, now seen corresponding path program 1 times [2018-01-24 12:49:58,282 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:49:58,283 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:49:58,284 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:49:58,284 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:49:58,284 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:49:58,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:49:58,299 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:49:58,325 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 12:49:58,325 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:49:58,347 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:49:58,347 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:49:58,347 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 12:49:58,347 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 12:49:58,347 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:49:58,348 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 3 states. [2018-01-24 12:49:58,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:49:58,374 INFO L93 Difference]: Finished difference Result 89 states and 100 transitions. [2018-01-24 12:49:58,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 12:49:58,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-01-24 12:49:58,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:49:58,375 INFO L225 Difference]: With dead ends: 89 [2018-01-24 12:49:58,376 INFO L226 Difference]: Without dead ends: 66 [2018-01-24 12:49:58,376 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:49:58,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-24 12:49:58,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 45. [2018-01-24 12:49:58,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-24 12:49:58,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-01-24 12:49:58,385 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 28 [2018-01-24 12:49:58,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:49:58,386 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-01-24 12:49:58,386 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 12:49:58,386 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-01-24 12:49:58,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 12:49:58,387 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:49:58,387 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:49:58,387 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, sortErr7RequiresViolation, sortErr11RequiresViolation, sortErr0RequiresViolation, sortErr3RequiresViolation, sortErr9RequiresViolation, sortErr1RequiresViolation, sortErr2RequiresViolation, sortErr8RequiresViolation, sortErr10RequiresViolation, sortErr6RequiresViolation, sortErr4RequiresViolation, sortErr5RequiresViolation]=== [2018-01-24 12:49:58,387 INFO L82 PathProgramCache]: Analyzing trace with hash 149814891, now seen corresponding path program 2 times [2018-01-24 12:49:58,387 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:49:58,388 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:49:58,388 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:49:58,389 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:49:58,389 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:49:58,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:49:58,402 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:49:58,565 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:49:58,566 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:49:58,566 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 12:49:58,587 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:49:58,587 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 12:49:58,608 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:49:58,621 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:49:58,625 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:49:58,631 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:49:58,751 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:49:58,751 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:49:58,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-24 12:49:58,868 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:49:58,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:49:58,873 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:13 [2018-01-24 12:49:58,918 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:49:58,950 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:49:58,950 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 12:49:58,955 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:49:58,955 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 12:49:58,973 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:49:58,986 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:49:58,999 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:49:59,004 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:49:59,038 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:49:59,038 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:49:59,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-24 12:49:59,086 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:49:59,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:49:59,096 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:13 [2018-01-24 12:49:59,134 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:49:59,136 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 12:49:59,136 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5, 5, 5] total 14 [2018-01-24 12:49:59,136 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 12:49:59,136 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 12:49:59,137 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 12:49:59,137 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-01-24 12:49:59,137 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 12 states. [2018-01-24 12:49:59,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:49:59,525 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2018-01-24 12:49:59,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 12:49:59,525 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-01-24 12:49:59,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:49:59,526 INFO L225 Difference]: With dead ends: 60 [2018-01-24 12:49:59,526 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 12:49:59,527 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 105 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2018-01-24 12:49:59,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 12:49:59,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 12:49:59,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 12:49:59,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 12:49:59,527 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2018-01-24 12:49:59,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:49:59,527 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 12:49:59,527 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 12:49:59,527 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 12:49:59,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 12:49:59,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 12:49:59,565 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-24 12:49:59,784 WARN L146 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 57 DAG size of output 54 [2018-01-24 12:50:00,031 WARN L146 SmtUtils]: Spent 220ms on a formula simplification. DAG size of input: 71 DAG size of output 55 [2018-01-24 12:50:00,035 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 557) no Hoare annotation was computed. [2018-01-24 12:50:00,035 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 557) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 12:50:00,036 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 557) no Hoare annotation was computed. [2018-01-24 12:50:00,036 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 557) the Hoare annotation is: true [2018-01-24 12:50:00,036 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 557) no Hoare annotation was computed. [2018-01-24 12:50:00,036 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 557) the Hoare annotation is: true [2018-01-24 12:50:00,036 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 557) no Hoare annotation was computed. [2018-01-24 12:50:00,036 INFO L401 ceAbstractionStarter]: For program point L551(lines 551 553) no Hoare annotation was computed. [2018-01-24 12:50:00,036 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 549 557) no Hoare annotation was computed. [2018-01-24 12:50:00,036 INFO L397 ceAbstractionStarter]: At program point L555(line 555) the Hoare annotation is: (let ((.cse0 (* 4 main_~array_size~6))) (and (= .cse0 (select |#length| |main_#t~malloc9.base|)) (= 0 |main_#t~malloc9.offset|) (= 0 main_~numbers~6.offset) (<= 1 main_~array_size~6) (= 1 (select |#valid| |main_#t~malloc9.base|)) (= 1 (select |#valid| main_~numbers~6.base)) (= (store |#valid| |main_#t~malloc9.base| 0) |old(#valid)|) (= .cse0 (select |#length| main_~numbers~6.base)))) [2018-01-24 12:50:00,037 INFO L401 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-01-24 12:50:00,037 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 549 557) no Hoare annotation was computed. [2018-01-24 12:50:00,037 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 549 557) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 12:50:00,037 INFO L401 ceAbstractionStarter]: For program point L551''(lines 551 553) no Hoare annotation was computed. [2018-01-24 12:50:00,037 INFO L401 ceAbstractionStarter]: For program point L554'(line 554) no Hoare annotation was computed. [2018-01-24 12:50:00,037 INFO L401 ceAbstractionStarter]: For program point L555'(line 555) no Hoare annotation was computed. [2018-01-24 12:50:00,037 INFO L401 ceAbstractionStarter]: For program point L554''(line 554) no Hoare annotation was computed. [2018-01-24 12:50:00,037 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 549 557) no Hoare annotation was computed. [2018-01-24 12:50:00,038 INFO L401 ceAbstractionStarter]: For program point sortErr8RequiresViolation(lines 1 557) no Hoare annotation was computed. [2018-01-24 12:50:00,038 INFO L401 ceAbstractionStarter]: For program point L546(line 546) no Hoare annotation was computed. [2018-01-24 12:50:00,038 INFO L401 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-01-24 12:50:00,038 INFO L401 ceAbstractionStarter]: For program point L544(lines 544 547) no Hoare annotation was computed. [2018-01-24 12:50:00,038 INFO L401 ceAbstractionStarter]: For program point L543(lines 543 547) no Hoare annotation was computed. [2018-01-24 12:50:00,038 INFO L401 ceAbstractionStarter]: For program point L546'''''(line 546) no Hoare annotation was computed. [2018-01-24 12:50:00,038 INFO L401 ceAbstractionStarter]: For program point sortErr7RequiresViolation(lines 1 557) no Hoare annotation was computed. [2018-01-24 12:50:00,038 INFO L401 ceAbstractionStarter]: For program point L546'(line 546) no Hoare annotation was computed. [2018-01-24 12:50:00,038 INFO L401 ceAbstractionStarter]: For program point L546''''(line 546) no Hoare annotation was computed. [2018-01-24 12:50:00,039 INFO L397 ceAbstractionStarter]: At program point L543'''(lines 543 547) the Hoare annotation is: (let ((.cse4 (select |#length| |sort_#in~x.base|))) (let ((.cse0 (< .cse4 4)) (.cse2 (not (= (select |#valid| |sort_#in~x.base|) 1))) (.cse1 (= sort_~pass~2 1)) (.cse3 (not (= 0 |sort_#in~x.offset|)))) (and (or .cse0 (< 1 |sort_#in~n|) (and .cse1 (<= sort_~n 1)) .cse2 .cse3) (let ((.cse6 (= sort_~x.offset 0)) (.cse8 (= 1 (select |#valid| sort_~x.base))) (.cse7 (* 4 sort_~n)) (.cse5 (select |#length| sort_~x.base))) (or .cse0 (< .cse4 (* 4 |sort_#in~n|)) (and (<= (+ (* 4 sort_~i~2) sort_~x.offset 4) .cse5) (exists ((sort_~i~2 Int)) (and (<= (+ (* 4 sort_~i~2) sort_~x.offset 8) (select |#length| sort_~x.base)) (<= 0 sort_~i~2))) .cse6 (<= (+ sort_~x.offset .cse7 8) (+ (* 4 sort_~pass~2) .cse5)) .cse8 (<= 0 sort_~i~2)) .cse2 (and .cse6 .cse1 .cse8 (<= .cse7 .cse5) (<= 4 .cse5)) .cse3))))) [2018-01-24 12:50:00,039 INFO L401 ceAbstractionStarter]: For program point sortErr0RequiresViolation(lines 1 557) no Hoare annotation was computed. [2018-01-24 12:50:00,039 INFO L401 ceAbstractionStarter]: For program point L545''(line 545) no Hoare annotation was computed. [2018-01-24 12:50:00,039 INFO L401 ceAbstractionStarter]: For program point sortErr5RequiresViolation(lines 1 557) no Hoare annotation was computed. [2018-01-24 12:50:00,039 INFO L401 ceAbstractionStarter]: For program point sortEXIT(lines 540 548) no Hoare annotation was computed. [2018-01-24 12:50:00,039 INFO L401 ceAbstractionStarter]: For program point L543''(lines 543 547) no Hoare annotation was computed. [2018-01-24 12:50:00,040 INFO L404 ceAbstractionStarter]: At program point sortENTRY(lines 540 548) the Hoare annotation is: true [2018-01-24 12:50:00,040 INFO L401 ceAbstractionStarter]: For program point sortErr10RequiresViolation(lines 1 557) no Hoare annotation was computed. [2018-01-24 12:50:00,040 INFO L397 ceAbstractionStarter]: At program point L544'''(lines 544 547) the Hoare annotation is: (let ((.cse3 (select |#length| |sort_#in~x.base|))) (let ((.cse0 (< .cse3 4)) (.cse1 (not (= (select |#valid| |sort_#in~x.base|) 1))) (.cse2 (not (= 0 |sort_#in~x.offset|)))) (and (or .cse0 (< 1 |sort_#in~n|) .cse1 .cse2) (let ((.cse11 (* 4 sort_~n)) (.cse8 (select |#length| sort_~x.base))) (let ((.cse4 (= sort_~pass~2 1)) (.cse5 (<= .cse11 .cse8)) (.cse7 (* 4 sort_~i~2)) (.cse6 (= sort_~x.offset 0)) (.cse9 (= 1 (select |#valid| sort_~x.base))) (.cse10 (<= 0 sort_~i~2))) (or .cse0 (< .cse3 (* 4 |sort_#in~n|)) .cse1 (and .cse4 .cse5 .cse6 (<= (+ .cse7 8) .cse8) .cse9 .cse10) .cse2 (and .cse4 .cse5 (<= (+ .cse7 sort_~x.offset 4) .cse8) .cse6 (<= 4 (+ .cse7 sort_~x.offset)) .cse9) (and (<= (+ sort_~x.offset .cse11 8) (+ (* 4 sort_~pass~2) .cse8)) (<= (+ .cse7 sort_~x.offset 8) .cse8) (and .cse6 .cse9) .cse10))))))) [2018-01-24 12:50:00,040 INFO L401 ceAbstractionStarter]: For program point sortErr3RequiresViolation(lines 1 557) no Hoare annotation was computed. [2018-01-24 12:50:00,040 INFO L401 ceAbstractionStarter]: For program point L543''''(lines 543 547) no Hoare annotation was computed. [2018-01-24 12:50:00,040 INFO L401 ceAbstractionStarter]: For program point sortErr11RequiresViolation(lines 1 557) no Hoare annotation was computed. [2018-01-24 12:50:00,041 INFO L401 ceAbstractionStarter]: For program point sortErr2RequiresViolation(lines 1 557) no Hoare annotation was computed. [2018-01-24 12:50:00,041 INFO L401 ceAbstractionStarter]: For program point sortErr1RequiresViolation(lines 1 557) no Hoare annotation was computed. [2018-01-24 12:50:00,041 INFO L401 ceAbstractionStarter]: For program point sortErr6RequiresViolation(lines 1 557) no Hoare annotation was computed. [2018-01-24 12:50:00,041 INFO L401 ceAbstractionStarter]: For program point sortErr4RequiresViolation(lines 1 557) no Hoare annotation was computed. [2018-01-24 12:50:00,041 INFO L401 ceAbstractionStarter]: For program point L546''(line 546) no Hoare annotation was computed. [2018-01-24 12:50:00,041 INFO L401 ceAbstractionStarter]: For program point L545'(line 545) no Hoare annotation was computed. [2018-01-24 12:50:00,041 INFO L401 ceAbstractionStarter]: For program point L544''(lines 544 547) no Hoare annotation was computed. [2018-01-24 12:50:00,041 INFO L401 ceAbstractionStarter]: For program point L546'''(line 546) no Hoare annotation was computed. [2018-01-24 12:50:00,042 INFO L401 ceAbstractionStarter]: For program point sortErr9RequiresViolation(lines 1 557) no Hoare annotation was computed. [2018-01-24 12:50:00,049 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sort_~i~2,QUANTIFIED] [2018-01-24 12:50:00,050 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sort_~i~2,QUANTIFIED] [2018-01-24 12:50:00,053 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,053 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,054 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,054 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,054 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,054 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,055 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,055 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,060 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sort_~i~2,QUANTIFIED] [2018-01-24 12:50:00,060 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sort_~i~2,QUANTIFIED] [2018-01-24 12:50:00,061 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,061 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,061 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,061 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,062 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,062 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,062 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,062 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,066 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,066 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,067 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,067 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,067 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,067 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,068 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,068 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,068 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,071 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,071 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,072 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,072 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,072 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,072 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,073 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,073 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,073 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 12:50:00 BoogieIcfgContainer [2018-01-24 12:50:00,075 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 12:50:00,076 INFO L168 Benchmark]: Toolchain (without parser) took 4387.83 ms. Allocated memory was 302.5 MB in the beginning and 504.4 MB in the end (delta: 201.9 MB). Free memory was 262.6 MB in the beginning and 379.6 MB in the end (delta: -117.0 MB). Peak memory consumption was 84.8 MB. Max. memory is 5.3 GB. [2018-01-24 12:50:00,078 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 302.5 MB. Free memory is still 268.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:50:00,078 INFO L168 Benchmark]: CACSL2BoogieTranslator took 200.80 ms. Allocated memory is still 302.5 MB. Free memory was 261.6 MB in the beginning and 251.5 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-24 12:50:00,079 INFO L168 Benchmark]: Boogie Preprocessor took 42.93 ms. Allocated memory is still 302.5 MB. Free memory was 251.5 MB in the beginning and 249.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:50:00,079 INFO L168 Benchmark]: RCFGBuilder took 342.77 ms. Allocated memory is still 302.5 MB. Free memory was 249.5 MB in the beginning and 233.0 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 5.3 GB. [2018-01-24 12:50:00,080 INFO L168 Benchmark]: TraceAbstraction took 3793.09 ms. Allocated memory was 302.5 MB in the beginning and 504.4 MB in the end (delta: 201.9 MB). Free memory was 232.0 MB in the beginning and 379.6 MB in the end (delta: -147.6 MB). Peak memory consumption was 54.2 MB. Max. memory is 5.3 GB. [2018-01-24 12:50:00,082 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.26 ms. Allocated memory is still 302.5 MB. Free memory is still 268.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 200.80 ms. Allocated memory is still 302.5 MB. Free memory was 261.6 MB in the beginning and 251.5 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 42.93 ms. Allocated memory is still 302.5 MB. Free memory was 251.5 MB in the beginning and 249.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 342.77 ms. Allocated memory is still 302.5 MB. Free memory was 249.5 MB in the beginning and 233.0 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 3793.09 ms. Allocated memory was 302.5 MB in the beginning and 504.4 MB in the end (delta: 201.9 MB). Free memory was 232.0 MB in the beginning and 379.6 MB in the end (delta: -147.6 MB). Peak memory consumption was 54.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sort_~i~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sort_~i~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sort_~i~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sort_~i~2,QUANTIFIED] * 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 - 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: 549]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 13 specifications checked. All of them hold - InvariantResult [Line: 543]: Loop Invariant [2018-01-24 12:50:00,089 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sort_~i~2,QUANTIFIED] [2018-01-24 12:50:00,090 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sort_~i~2,QUANTIFIED] [2018-01-24 12:50:00,090 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,091 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,091 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,091 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,091 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,091 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,092 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,092 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,094 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sort_~i~2,QUANTIFIED] [2018-01-24 12:50:00,094 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sort_~i~2,QUANTIFIED] [2018-01-24 12:50:00,095 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,095 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,095 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,095 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,095 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,096 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,096 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,096 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((unknown-#length-unknown[x] < 4 || 1 < \old(n)) || (pass == 1 && n <= 1)) || !(\valid[x] == 1)) || !(0 == x)) && (((((unknown-#length-unknown[x] < 4 || unknown-#length-unknown[x] < 4 * \old(n)) || (((((4 * i + x + 4 <= unknown-#length-unknown[x] && (\exists sort_~i~2 : int :: 4 * sort_~i~2 + x + 8 <= unknown-#length-unknown[x] && 0 <= sort_~i~2)) && x == 0) && x + 4 * n + 8 <= 4 * pass + unknown-#length-unknown[x]) && 1 == \valid[x]) && 0 <= i)) || !(\valid[x] == 1)) || ((((x == 0 && pass == 1) && 1 == \valid[x]) && 4 * n <= unknown-#length-unknown[x]) && 4 <= unknown-#length-unknown[x])) || !(0 == x)) - InvariantResult [Line: 544]: Loop Invariant [2018-01-24 12:50:00,098 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,099 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,099 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,099 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,099 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,099 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,100 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,100 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,100 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,102 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,102 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,102 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,103 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,103 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,103 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,103 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,103 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:50:00,104 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((unknown-#length-unknown[x] < 4 || 1 < \old(n)) || !(\valid[x] == 1)) || !(0 == x)) && ((((((unknown-#length-unknown[x] < 4 || unknown-#length-unknown[x] < 4 * \old(n)) || !(\valid[x] == 1)) || (((((pass == 1 && 4 * n <= unknown-#length-unknown[x]) && x == 0) && 4 * i + 8 <= unknown-#length-unknown[x]) && 1 == \valid[x]) && 0 <= i)) || !(0 == x)) || (((((pass == 1 && 4 * n <= unknown-#length-unknown[x]) && 4 * i + x + 4 <= unknown-#length-unknown[x]) && x == 0) && 4 <= 4 * i + x) && 1 == \valid[x])) || (((x + 4 * n + 8 <= 4 * pass + unknown-#length-unknown[x] && 4 * i + x + 8 <= unknown-#length-unknown[x]) && x == 0 && 1 == \valid[x]) && 0 <= i)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 48 locations, 13 error locations. SAFE Result, 3.7s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 1.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 224 SDtfs, 511 SDslu, 465 SDs, 0 SdLazy, 525 SolverSat, 62 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 181 GetRequests, 114 SyntacticMatches, 5 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 84 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 11 PreInvPairs, 20 NumberOfFragments, 329 HoareAnnotationTreeSize, 11 FomulaSimplifications, 329 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 591 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 218 NumberOfCodeBlocks, 218 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 262 ConstructedInterpolants, 36 QuantifiedInterpolants, 38601 SizeOfPredicates, 8 NumberOfNonLiveVariables, 196 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 12 InterpolantComputations, 7 PerfectInterpolantSequences, 33/63 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/java_BubbleSort-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_12-50-00-109.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/java_BubbleSort-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_12-50-00-109.csv Received shutdown request...