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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/array-memsafety/java_BubbleSort-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 01:45:21,064 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 01:45:21,065 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 01:45:21,075 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 01:45:21,075 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 01:45:21,076 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 01:45:21,077 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 01:45:21,079 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 01:45:21,080 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 01:45:21,081 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 01:45:21,081 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 01:45:21,082 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 01:45:21,082 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 01:45:21,083 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 01:45:21,084 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 01:45:21,086 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 01:45:21,087 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 01:45:21,089 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 01:45:21,090 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 01:45:21,091 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 01:45:21,092 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 01:45:21,092 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 01:45:21,093 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 01:45:21,093 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 01:45:21,094 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 01:45:21,095 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 01:45:21,095 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 01:45:21,096 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 01:45:21,096 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 01:45:21,096 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 01:45:21,096 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 01:45:21,097 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-04 01:45:21,106 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 01:45:21,106 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 01:45:21,107 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 01:45:21,108 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 01:45:21,108 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 01:45:21,108 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 01:45:21,108 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 01:45:21,108 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 01:45:21,108 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 01:45:21,109 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 01:45:21,109 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 01:45:21,109 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 01:45:21,109 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 01:45:21,109 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 01:45:21,109 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 01:45:21,109 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 01:45:21,110 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 01:45:21,110 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 01:45:21,110 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 01:45:21,110 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 01:45:21,110 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 01:45:21,110 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 01:45:21,111 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 01:45:21,139 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 01:45:21,152 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 01:45:21,155 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 01:45:21,157 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 01:45:21,157 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 01:45:21,158 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/java_BubbleSort-alloca_true-valid-memsafety_true-termination.i [2018-02-04 01:45:21,294 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 01:45:21,295 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 01:45:21,295 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 01:45:21,295 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 01:45:21,301 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 01:45:21,301 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:45:21" (1/1) ... [2018-02-04 01:45:21,304 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3db90158 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:45:21, skipping insertion in model container [2018-02-04 01:45:21,304 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:45:21" (1/1) ... [2018-02-04 01:45:21,317 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 01:45:21,344 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 01:45:21,428 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 01:45:21,440 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 01:45:21,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:45:21 WrapperNode [2018-02-04 01:45:21,444 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 01:45:21,444 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 01:45:21,444 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 01:45:21,444 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 01:45:21,452 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:45:21" (1/1) ... [2018-02-04 01:45:21,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:45:21" (1/1) ... [2018-02-04 01:45:21,459 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:45:21" (1/1) ... [2018-02-04 01:45:21,459 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:45:21" (1/1) ... [2018-02-04 01:45:21,461 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:45:21" (1/1) ... [2018-02-04 01:45:21,464 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:45:21" (1/1) ... [2018-02-04 01:45:21,464 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:45:21" (1/1) ... [2018-02-04 01:45:21,465 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 01:45:21,466 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 01:45:21,466 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 01:45:21,466 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 01:45:21,466 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:45:21" (1/1) ... No working directory specified, using /home/ultimate/work/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-02-04 01:45:21,502 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 01:45:21,502 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 01:45:21,503 INFO L136 BoogieDeclarations]: Found implementation of procedure sort [2018-02-04 01:45:21,503 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 01:45:21,503 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 01:45:21,503 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 01:45:21,503 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 01:45:21,503 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 01:45:21,504 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 01:45:21,504 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 01:45:21,504 INFO L128 BoogieDeclarations]: Found specification of procedure sort [2018-02-04 01:45:21,504 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 01:45:21,504 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 01:45:21,504 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 01:45:21,648 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 01:45:21,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:45:21 BoogieIcfgContainer [2018-02-04 01:45:21,649 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 01:45:21,649 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 01:45:21,650 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 01:45:21,651 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 01:45:21,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 01:45:21" (1/3) ... [2018-02-04 01:45:21,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14ba63f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:45:21, skipping insertion in model container [2018-02-04 01:45:21,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:45:21" (2/3) ... [2018-02-04 01:45:21,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14ba63f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:45:21, skipping insertion in model container [2018-02-04 01:45:21,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:45:21" (3/3) ... [2018-02-04 01:45:21,654 INFO L107 eAbstractionObserver]: Analyzing ICFG java_BubbleSort-alloca_true-valid-memsafety_true-termination.i [2018-02-04 01:45:21,659 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 01:45:21,664 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-02-04 01:45:21,686 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 01:45:21,686 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 01:45:21,686 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 01:45:21,687 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 01:45:21,687 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 01:45:21,687 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 01:45:21,687 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 01:45:21,687 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 01:45:21,687 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 01:45:21,697 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2018-02-04 01:45:21,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 01:45:21,707 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:45:21,708 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:45:21,708 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, sortErr7RequiresViolation, sortErr11RequiresViolation, sortErr0RequiresViolation, sortErr3RequiresViolation, sortErr9RequiresViolation, sortErr1RequiresViolation, sortErr2RequiresViolation, sortErr8RequiresViolation, sortErr10RequiresViolation, sortErr6RequiresViolation, sortErr4RequiresViolation, sortErr5RequiresViolation]=== [2018-02-04 01:45:21,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1780471319, now seen corresponding path program 1 times [2018-02-04 01:45:21,762 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:45:21,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:45:21,810 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:45:21,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:21,901 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:45:21,902 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 01:45:21,903 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:45:21,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:21,903 INFO L182 omatonBuilderFactory]: Interpolants [51#true, 52#false, 53#(= 1 (select |#valid| |main_#t~malloc9.base|)), 54#(= 1 (select |#valid| main_~numbers~0.base)), 55#(= 1 (select |#valid| |sort_#in~x.base|)), 56#(= 1 (select |#valid| sort_~x.base))] [2018-02-04 01:45:21,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:21,905 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 01:45:21,916 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 01:45:21,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 01:45:21,919 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 6 states. [2018-02-04 01:45:22,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:45:22,047 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2018-02-04 01:45:22,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 01:45:22,049 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-02-04 01:45:22,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:45:22,056 INFO L225 Difference]: With dead ends: 42 [2018-02-04 01:45:22,056 INFO L226 Difference]: Without dead ends: 39 [2018-02-04 01:45:22,058 INFO L554 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-02-04 01:45:22,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-02-04 01:45:22,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-02-04 01:45:22,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-02-04 01:45:22,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-02-04 01:45:22,135 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 16 [2018-02-04 01:45:22,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:45:22,135 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-02-04 01:45:22,135 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 01:45:22,136 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-02-04 01:45:22,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 01:45:22,136 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:45:22,136 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:45:22,136 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, sortErr7RequiresViolation, sortErr11RequiresViolation, sortErr0RequiresViolation, sortErr3RequiresViolation, sortErr9RequiresViolation, sortErr1RequiresViolation, sortErr2RequiresViolation, sortErr8RequiresViolation, sortErr10RequiresViolation, sortErr6RequiresViolation, sortErr4RequiresViolation, sortErr5RequiresViolation]=== [2018-02-04 01:45:22,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1780471318, now seen corresponding path program 1 times [2018-02-04 01:45:22,137 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:45:22,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:45:22,151 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:45:22,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:22,211 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:45:22,211 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 01:45:22,212 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:45:22,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:22,212 INFO L182 omatonBuilderFactory]: Interpolants [144#(<= main_~array_size~0 1), 145#(<= |sort_#in~n| 1), 146#(and (= sort_~pass~0 1) (<= sort_~n 1)), 147#(and (= sort_~pass~0 1) (= sort_~i~0 0) (<= sort_~n 1)), 142#true, 143#false] [2018-02-04 01:45:22,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:22,213 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 01:45:22,214 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 01:45:22,214 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 01:45:22,214 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 6 states. [2018-02-04 01:45:22,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:45:22,251 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2018-02-04 01:45:22,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 01:45:22,252 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-02-04 01:45:22,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:45:22,253 INFO L225 Difference]: With dead ends: 52 [2018-02-04 01:45:22,253 INFO L226 Difference]: Without dead ends: 52 [2018-02-04 01:45:22,253 INFO L554 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-02-04 01:45:22,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-04 01:45:22,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2018-02-04 01:45:22,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-04 01:45:22,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2018-02-04 01:45:22,258 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 16 [2018-02-04 01:45:22,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:45:22,259 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2018-02-04 01:45:22,259 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 01:45:22,259 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2018-02-04 01:45:22,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 01:45:22,259 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:45:22,259 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:45:22,260 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, sortErr7RequiresViolation, sortErr11RequiresViolation, sortErr0RequiresViolation, sortErr3RequiresViolation, sortErr9RequiresViolation, sortErr1RequiresViolation, sortErr2RequiresViolation, sortErr8RequiresViolation, sortErr10RequiresViolation, sortErr6RequiresViolation, sortErr4RequiresViolation, sortErr5RequiresViolation]=== [2018-02-04 01:45:22,260 INFO L82 PathProgramCache]: Analyzing trace with hash 2121468968, now seen corresponding path program 1 times [2018-02-04 01:45:22,261 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:45:22,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:45:22,273 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:45:22,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:22,352 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:45:22,352 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 01:45:22,352 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:45:22,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:22,353 INFO L182 omatonBuilderFactory]: Interpolants [256#(and (= sort_~x.offset 0) (= sort_~i~0 0) (<= 4 (select |#length| sort_~x.base))), 249#true, 250#false, 251#(<= 1 main_~array_size~0), 252#(and (= (* 4 main_~array_size~0) (select |#length| |main_#t~malloc9.base|)) (= 0 |main_#t~malloc9.offset|) (<= 1 main_~array_size~0)), 253#(and (= 0 main_~numbers~0.offset) (= (* 4 main_~array_size~0) (select |#length| main_~numbers~0.base)) (<= 1 main_~array_size~0)), 254#(and (<= 4 (select |#length| |sort_#in~x.base|)) (= 0 |sort_#in~x.offset|)), 255#(and (= sort_~x.offset 0) (<= 4 (select |#length| sort_~x.base)))] [2018-02-04 01:45:22,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:22,353 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 01:45:22,353 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 01:45:22,354 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-04 01:45:22,354 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 8 states. [2018-02-04 01:45:22,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:45:22,467 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2018-02-04 01:45:22,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 01:45:22,467 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-02-04 01:45:22,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:45:22,469 INFO L225 Difference]: With dead ends: 67 [2018-02-04 01:45:22,470 INFO L226 Difference]: Without dead ends: 67 [2018-02-04 01:45:22,470 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-02-04 01:45:22,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-04 01:45:22,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 56. [2018-02-04 01:45:22,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-04 01:45:22,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2018-02-04 01:45:22,475 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 16 [2018-02-04 01:45:22,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:45:22,475 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2018-02-04 01:45:22,475 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 01:45:22,475 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2018-02-04 01:45:22,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 01:45:22,476 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:45:22,476 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:45:22,476 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, sortErr7RequiresViolation, sortErr11RequiresViolation, sortErr0RequiresViolation, sortErr3RequiresViolation, sortErr9RequiresViolation, sortErr1RequiresViolation, sortErr2RequiresViolation, sortErr8RequiresViolation, sortErr10RequiresViolation, sortErr6RequiresViolation, sortErr4RequiresViolation, sortErr5RequiresViolation]=== [2018-02-04 01:45:22,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1341028550, now seen corresponding path program 1 times [2018-02-04 01:45:22,477 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:45:22,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:45:22,488 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:45:22,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:22,581 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:45:22,581 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 01:45:22,582 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:45:22,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:22,582 INFO L182 omatonBuilderFactory]: Interpolants [386#true, 387#false, 388#(and (= (* 4 main_~array_size~0) (select |#length| |main_#t~malloc9.base|)) (= 0 |main_#t~malloc9.offset|)), 389#(and (= 0 main_~numbers~0.offset) (= (* 4 main_~array_size~0) (select |#length| main_~numbers~0.base))), 390#(and (= 0 |sort_#in~x.offset|) (<= (* 4 |sort_#in~n|) (select |#length| |sort_#in~x.base|))), 391#(and (= sort_~pass~0 1) (= sort_~x.offset 0) (<= (* 4 sort_~n) (select |#length| sort_~x.base))), 392#(and (= sort_~x.offset 0) (<= (+ (* 4 sort_~i~0) 8) (select |#length| sort_~x.base))), 393#(and (<= 0 (+ sort_~x.offset (* 4 sort_~i~0))) (= sort_~x.offset 0) (<= (+ (* 4 sort_~i~0) 8) (select |#length| sort_~x.base)))] [2018-02-04 01:45:22,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:22,582 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 01:45:22,583 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 01:45:22,583 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-04 01:45:22,583 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand 8 states. [2018-02-04 01:45:22,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:45:22,786 INFO L93 Difference]: Finished difference Result 101 states and 116 transitions. [2018-02-04 01:45:22,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 01:45:22,786 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-02-04 01:45:22,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:45:22,787 INFO L225 Difference]: With dead ends: 101 [2018-02-04 01:45:22,787 INFO L226 Difference]: Without dead ends: 101 [2018-02-04 01:45:22,788 INFO L554 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-02-04 01:45:22,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-02-04 01:45:22,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 87. [2018-02-04 01:45:22,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-04 01:45:22,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 102 transitions. [2018-02-04 01:45:22,793 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 102 transitions. Word has length 17 [2018-02-04 01:45:22,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:45:22,794 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 102 transitions. [2018-02-04 01:45:22,794 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 01:45:22,794 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 102 transitions. [2018-02-04 01:45:22,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 01:45:22,794 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:45:22,794 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:45:22,794 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, sortErr7RequiresViolation, sortErr11RequiresViolation, sortErr0RequiresViolation, sortErr3RequiresViolation, sortErr9RequiresViolation, sortErr1RequiresViolation, sortErr2RequiresViolation, sortErr8RequiresViolation, sortErr10RequiresViolation, sortErr6RequiresViolation, sortErr4RequiresViolation, sortErr5RequiresViolation]=== [2018-02-04 01:45:22,794 INFO L82 PathProgramCache]: Analyzing trace with hash 232335457, now seen corresponding path program 1 times [2018-02-04 01:45:22,795 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:45:22,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:45:22,805 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:45:22,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:22,835 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:45:22,835 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 01:45:22,835 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:45:22,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:22,836 INFO L182 omatonBuilderFactory]: Interpolants [592#true, 593#false, 594#(= |#valid| |old(#valid)|), 595#(= (store |#valid| |main_#t~malloc9.base| 0) |old(#valid)|)] [2018-02-04 01:45:22,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:22,836 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 01:45:22,836 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 01:45:22,836 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 01:45:22,836 INFO L87 Difference]: Start difference. First operand 87 states and 102 transitions. Second operand 4 states. [2018-02-04 01:45:22,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:45:22,882 INFO L93 Difference]: Finished difference Result 86 states and 101 transitions. [2018-02-04 01:45:22,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 01:45:22,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-02-04 01:45:22,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:45:22,883 INFO L225 Difference]: With dead ends: 86 [2018-02-04 01:45:22,883 INFO L226 Difference]: Without dead ends: 72 [2018-02-04 01:45:22,884 INFO L554 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-02-04 01:45:22,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-02-04 01:45:22,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-02-04 01:45:22,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-04 01:45:22,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2018-02-04 01:45:22,887 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 19 [2018-02-04 01:45:22,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:45:22,888 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2018-02-04 01:45:22,888 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 01:45:22,888 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2018-02-04 01:45:22,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 01:45:22,888 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:45:22,889 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:45:22,889 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, sortErr7RequiresViolation, sortErr11RequiresViolation, sortErr0RequiresViolation, sortErr3RequiresViolation, sortErr9RequiresViolation, sortErr1RequiresViolation, sortErr2RequiresViolation, sortErr8RequiresViolation, sortErr10RequiresViolation, sortErr6RequiresViolation, sortErr4RequiresViolation, sortErr5RequiresViolation]=== [2018-02-04 01:45:22,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1939327170, now seen corresponding path program 1 times [2018-02-04 01:45:22,890 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:45:22,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:45:22,900 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:45:22,933 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:22,933 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:45:22,933 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 01:45:22,933 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:45:22,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:22,933 INFO L182 omatonBuilderFactory]: Interpolants [756#true, 757#false, 758#(<= 0 (+ sort_~x.offset (* 4 sort_~i~0))), 759#(and (<= 0 (+ sort_~x.offset (* 4 sort_~i~0))) (<= (+ sort_~x.offset (* 4 sort_~i~0) 8) (select |#length| sort_~x.base))), 760#(and (<= (+ sort_~x.offset (* 4 sort_~i~0) 4) (select |#length| sort_~x.base)) (<= 4 (+ sort_~x.offset (* 4 sort_~i~0))))] [2018-02-04 01:45:22,933 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:22,933 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 01:45:22,934 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 01:45:22,934 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 01:45:22,934 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand 5 states. [2018-02-04 01:45:22,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:45:22,975 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2018-02-04 01:45:22,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 01:45:22,976 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-02-04 01:45:22,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:45:22,976 INFO L225 Difference]: With dead ends: 83 [2018-02-04 01:45:22,977 INFO L226 Difference]: Without dead ends: 83 [2018-02-04 01:45:22,977 INFO L554 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-02-04 01:45:22,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-04 01:45:22,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 50. [2018-02-04 01:45:22,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 01:45:22,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-02-04 01:45:22,981 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 22 [2018-02-04 01:45:22,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:45:22,981 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-02-04 01:45:22,981 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 01:45:22,981 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-02-04 01:45:22,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 01:45:22,982 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:45:22,982 INFO L351 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-02-04 01:45:22,982 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, sortErr7RequiresViolation, sortErr11RequiresViolation, sortErr0RequiresViolation, sortErr3RequiresViolation, sortErr9RequiresViolation, sortErr1RequiresViolation, sortErr2RequiresViolation, sortErr8RequiresViolation, sortErr10RequiresViolation, sortErr6RequiresViolation, sortErr4RequiresViolation, sortErr5RequiresViolation]=== [2018-02-04 01:45:22,982 INFO L82 PathProgramCache]: Analyzing trace with hash 733703231, now seen corresponding path program 1 times [2018-02-04 01:45:22,983 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:45:22,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:45:22,994 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:45:23,018 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 01:45:23,018 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:45:23,018 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 01:45:23,019 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:45:23,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:23,019 INFO L182 omatonBuilderFactory]: Interpolants [896#true, 897#false, 898#(and (= sort_~i~0 0) (<= (+ sort_~pass~0 1) sort_~n))] [2018-02-04 01:45:23,019 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 01:45:23,020 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 01:45:23,020 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 01:45:23,020 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 01:45:23,020 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 3 states. [2018-02-04 01:45:23,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:45:23,040 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2018-02-04 01:45:23,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 01:45:23,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-02-04 01:45:23,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:45:23,041 INFO L225 Difference]: With dead ends: 66 [2018-02-04 01:45:23,041 INFO L226 Difference]: Without dead ends: 66 [2018-02-04 01:45:23,042 INFO L554 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-02-04 01:45:23,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-04 01:45:23,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 45. [2018-02-04 01:45:23,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-04 01:45:23,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-02-04 01:45:23,045 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 28 [2018-02-04 01:45:23,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:45:23,045 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-02-04 01:45:23,045 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 01:45:23,045 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-02-04 01:45:23,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 01:45:23,046 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:45:23,046 INFO L351 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-02-04 01:45:23,046 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, sortErr7RequiresViolation, sortErr11RequiresViolation, sortErr0RequiresViolation, sortErr3RequiresViolation, sortErr9RequiresViolation, sortErr1RequiresViolation, sortErr2RequiresViolation, sortErr8RequiresViolation, sortErr10RequiresViolation, sortErr6RequiresViolation, sortErr4RequiresViolation, sortErr5RequiresViolation]=== [2018-02-04 01:45:23,046 INFO L82 PathProgramCache]: Analyzing trace with hash 149814891, now seen corresponding path program 2 times [2018-02-04 01:45:23,047 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:45:23,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:45:23,055 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:45:23,125 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:23,125 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:45:23,125 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 01:45:23,126 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:45:23,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:23,126 INFO L182 omatonBuilderFactory]: Interpolants [1010#true, 1011#false, 1012#(<= (+ sort_~x.offset (* 4 sort_~i~0) 8) (select |#length| sort_~x.base)), 1013#(<= (+ sort_~x.offset (* 4 sort_~i~0) 4) (select |#length| sort_~x.base)), 1014#(<= (+ sort_~x.offset (* 4 sort_~n) 4) (+ (* 4 sort_~pass~0) (select |#length| sort_~x.base))), 1015#(<= (+ sort_~x.offset (* 4 sort_~n) 8) (+ (* 4 sort_~pass~0) (select |#length| sort_~x.base))), 1016#(<= (+ sort_~x.offset (* 4 sort_~i~0) 12) (select |#length| sort_~x.base)), 1017#(and (<= 0 (+ sort_~x.offset (* 4 sort_~i~0))) (<= (+ sort_~x.offset (* 4 sort_~i~0) 12) (select |#length| sort_~x.base)))] [2018-02-04 01:45:23,126 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:23,126 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 01:45:23,126 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 01:45:23,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-02-04 01:45:23,127 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 8 states. [2018-02-04 01:45:23,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:45:23,217 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2018-02-04 01:45:23,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 01:45:23,218 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-02-04 01:45:23,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:45:23,218 INFO L225 Difference]: With dead ends: 48 [2018-02-04 01:45:23,218 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 01:45:23,219 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2018-02-04 01:45:23,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 01:45:23,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 01:45:23,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 01:45:23,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 01:45:23,219 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2018-02-04 01:45:23,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:45:23,219 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 01:45:23,220 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 01:45:23,220 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 01:45:23,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 01:45:23,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 01:45:23 BoogieIcfgContainer [2018-02-04 01:45:23,224 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 01:45:23,224 INFO L168 Benchmark]: Toolchain (without parser) took 1930.32 ms. Allocated memory was 399.0 MB in the beginning and 626.5 MB in the end (delta: 227.5 MB). Free memory was 357.2 MB in the beginning and 578.8 MB in the end (delta: -221.7 MB). Peak memory consumption was 5.9 MB. Max. memory is 5.3 GB. [2018-02-04 01:45:23,225 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 399.0 MB. Free memory is still 362.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 01:45:23,225 INFO L168 Benchmark]: CACSL2BoogieTranslator took 148.54 ms. Allocated memory is still 399.0 MB. Free memory was 355.9 MB in the beginning and 346.6 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 5.3 GB. [2018-02-04 01:45:23,225 INFO L168 Benchmark]: Boogie Preprocessor took 21.25 ms. Allocated memory is still 399.0 MB. Free memory was 345.3 MB in the beginning and 344.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 01:45:23,225 INFO L168 Benchmark]: RCFGBuilder took 183.52 ms. Allocated memory is still 399.0 MB. Free memory was 344.0 MB in the beginning and 325.9 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB. [2018-02-04 01:45:23,226 INFO L168 Benchmark]: TraceAbstraction took 1574.37 ms. Allocated memory was 399.0 MB in the beginning and 626.5 MB in the end (delta: 227.5 MB). Free memory was 325.9 MB in the beginning and 578.8 MB in the end (delta: -252.9 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 01:45:23,226 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.16 ms. Allocated memory is still 399.0 MB. Free memory is still 362.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 148.54 ms. Allocated memory is still 399.0 MB. Free memory was 355.9 MB in the beginning and 346.6 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 21.25 ms. Allocated memory is still 399.0 MB. Free memory was 345.3 MB in the beginning and 344.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 183.52 ms. Allocated memory is still 399.0 MB. Free memory was 344.0 MB in the beginning and 325.9 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1574.37 ms. Allocated memory was 399.0 MB in the beginning and 626.5 MB in the end (delta: 227.5 MB). Free memory was 325.9 MB in the beginning and 578.8 MB in the end (delta: -252.9 MB). There was no memory consumed. Max. memory is 5.3 GB. * 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 48 locations, 13 error locations. SAFE Result, 1.5s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 226 SDtfs, 453 SDslu, 413 SDs, 0 SdLazy, 459 SolverSat, 59 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 21/23 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 84 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 162 NumberOfCodeBlocks, 162 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 154 ConstructedInterpolants, 0 QuantifiedInterpolants, 13599 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 21/23 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/java_BubbleSort-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_01-45-23-234.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/java_BubbleSort-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_01-45-23-234.csv Received shutdown request...