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_NoArray.epf -i ../../../trunk/examples/svcomp/array-memsafety/insertionsort-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 17:25:26,984 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 17:25:26,985 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 17:25:26,997 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 17:25:26,998 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 17:25:26,998 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 17:25:26,999 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 17:25:27,000 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 17:25:27,002 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 17:25:27,003 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 17:25:27,003 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 17:25:27,004 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 17:25:27,004 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 17:25:27,005 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 17:25:27,006 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 17:25:27,008 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 17:25:27,009 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 17:25:27,011 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 17:25:27,012 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 17:25:27,012 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 17:25:27,014 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 17:25:27,014 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 17:25:27,014 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 17:25:27,015 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 17:25:27,016 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 17:25:27,017 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 17:25:27,017 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 17:25:27,017 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 17:25:27,017 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 17:25:27,018 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 17:25:27,018 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 17:25:27,018 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_NoArray.epf [2018-02-04 17:25:27,027 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 17:25:27,027 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 17:25:27,027 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 17:25:27,027 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 17:25:27,028 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 17:25:27,028 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 17:25:27,028 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 17:25:27,028 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 17:25:27,028 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 17:25:27,028 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 17:25:27,028 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 17:25:27,028 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 17:25:27,028 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 17:25:27,029 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 17:25:27,029 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 17:25:27,029 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 17:25:27,029 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 17:25:27,029 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 17:25:27,029 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 17:25:27,029 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 17:25:27,029 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 17:25:27,029 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 17:25:27,030 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 17:25:27,030 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 17:25:27,055 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 17:25:27,063 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 17:25:27,065 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 17:25:27,066 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 17:25:27,066 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 17:25:27,067 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/insertionsort-alloca_true-valid-memsafety_true-termination.i [2018-02-04 17:25:27,205 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 17:25:27,206 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 17:25:27,207 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 17:25:27,207 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 17:25:27,213 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 17:25:27,214 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:25:27" (1/1) ... [2018-02-04 17:25:27,217 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 05:25:27, skipping insertion in model container [2018-02-04 17:25:27,217 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:25:27" (1/1) ... [2018-02-04 17:25:27,232 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:25:27,261 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:25:27,346 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:25:27,362 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:25:27,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:25:27 WrapperNode [2018-02-04 17:25:27,368 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 17:25:27,368 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 17:25:27,369 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 17:25:27,369 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 17:25:27,377 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:25:27" (1/1) ... [2018-02-04 17:25:27,378 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:25:27" (1/1) ... [2018-02-04 17:25:27,383 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:25:27" (1/1) ... [2018-02-04 17:25:27,383 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:25:27" (1/1) ... [2018-02-04 17:25:27,386 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:25:27" (1/1) ... [2018-02-04 17:25:27,388 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:25:27" (1/1) ... [2018-02-04 17:25:27,389 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:25:27" (1/1) ... [2018-02-04 17:25:27,390 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 17:25:27,390 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 17:25:27,390 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 17:25:27,390 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 17:25:27,391 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:25:27" (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 17:25:27,427 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 17:25:27,427 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 17:25:27,427 INFO L136 BoogieDeclarations]: Found implementation of procedure insertionSort [2018-02-04 17:25:27,427 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 17:25:27,427 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 17:25:27,427 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 17:25:27,428 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 17:25:27,428 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 17:25:27,428 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 17:25:27,428 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 17:25:27,428 INFO L128 BoogieDeclarations]: Found specification of procedure insertionSort [2018-02-04 17:25:27,428 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 17:25:27,428 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 17:25:27,428 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 17:25:27,591 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 17:25:27,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:25:27 BoogieIcfgContainer [2018-02-04 17:25:27,591 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 17:25:27,592 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 17:25:27,592 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 17:25:27,594 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 17:25:27,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 05:25:27" (1/3) ... [2018-02-04 17:25:27,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17617ee1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:25:27, skipping insertion in model container [2018-02-04 17:25:27,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:25:27" (2/3) ... [2018-02-04 17:25:27,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17617ee1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:25:27, skipping insertion in model container [2018-02-04 17:25:27,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:25:27" (3/3) ... [2018-02-04 17:25:27,596 INFO L107 eAbstractionObserver]: Analyzing ICFG insertionsort-alloca_true-valid-memsafety_true-termination.i [2018-02-04 17:25:27,602 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 17:25:27,607 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-02-04 17:25:27,630 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 17:25:27,631 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 17:25:27,631 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 17:25:27,631 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 17:25:27,631 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 17:25:27,631 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 17:25:27,631 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 17:25:27,632 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 17:25:27,632 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 17:25:27,643 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-02-04 17:25:27,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 17:25:27,652 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:25:27,653 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:25:27,653 INFO L371 AbstractCegarLoop]: === Iteration 1 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:25:27,656 INFO L82 PathProgramCache]: Analyzing trace with hash 243546787, now seen corresponding path program 1 times [2018-02-04 17:25:27,657 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:25:27,658 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:25:27,688 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:27,688 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:27,688 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:27,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:27,732 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:25:27,799 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 17:25:27,801 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:25:27,801 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 17:25:27,802 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 17:25:27,810 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 17:25:27,810 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 17:25:27,812 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 6 states. [2018-02-04 17:25:27,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:25:27,920 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-02-04 17:25:27,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:25:27,921 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-02-04 17:25:27,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:25:27,928 INFO L225 Difference]: With dead ends: 41 [2018-02-04 17:25:27,928 INFO L226 Difference]: Without dead ends: 38 [2018-02-04 17:25:27,929 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 17:25:27,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-02-04 17:25:27,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-02-04 17:25:27,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-04 17:25:27,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-02-04 17:25:27,993 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 14 [2018-02-04 17:25:27,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:25:27,993 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-02-04 17:25:27,993 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 17:25:27,993 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-02-04 17:25:27,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 17:25:27,993 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:25:27,994 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:25:27,994 INFO L371 AbstractCegarLoop]: === Iteration 2 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:25:27,994 INFO L82 PathProgramCache]: Analyzing trace with hash 243546788, now seen corresponding path program 1 times [2018-02-04 17:25:27,994 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:25:27,994 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:25:27,995 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:27,995 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:27,995 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:28,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:28,010 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:25:28,103 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 17:25:28,103 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:25:28,103 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 17:25:28,105 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 17:25:28,105 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 17:25:28,105 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 17:25:28,106 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 7 states. [2018-02-04 17:25:28,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:25:28,255 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2018-02-04 17:25:28,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 17:25:28,256 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-02-04 17:25:28,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:25:28,259 INFO L225 Difference]: With dead ends: 59 [2018-02-04 17:25:28,259 INFO L226 Difference]: Without dead ends: 59 [2018-02-04 17:25:28,260 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-02-04 17:25:28,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-04 17:25:28,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 41. [2018-02-04 17:25:28,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-04 17:25:28,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-02-04 17:25:28,264 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 14 [2018-02-04 17:25:28,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:25:28,265 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-02-04 17:25:28,265 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 17:25:28,265 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-02-04 17:25:28,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 17:25:28,265 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:25:28,265 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:25:28,266 INFO L371 AbstractCegarLoop]: === Iteration 3 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:25:28,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1724462409, now seen corresponding path program 1 times [2018-02-04 17:25:28,266 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:25:28,266 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:25:28,267 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:28,267 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:28,267 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:28,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:28,281 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:25:28,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 17:25:28,352 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:25:28,353 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 17:25:28,353 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 17:25:28,353 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 17:25:28,353 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-04 17:25:28,353 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 8 states. [2018-02-04 17:25:28,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:25:28,481 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2018-02-04 17:25:28,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 17:25:28,482 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-02-04 17:25:28,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:25:28,485 INFO L225 Difference]: With dead ends: 79 [2018-02-04 17:25:28,485 INFO L226 Difference]: Without dead ends: 79 [2018-02-04 17:25:28,485 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-02-04 17:25:28,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-02-04 17:25:28,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 48. [2018-02-04 17:25:28,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 17:25:28,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-02-04 17:25:28,488 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 18 [2018-02-04 17:25:28,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:25:28,489 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-02-04 17:25:28,489 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 17:25:28,489 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-02-04 17:25:28,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 17:25:28,489 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:25:28,489 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 17:25:28,489 INFO L371 AbstractCegarLoop]: === Iteration 4 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:25:28,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1435415779, now seen corresponding path program 1 times [2018-02-04 17:25:28,489 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:25:28,490 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:25:28,490 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:28,490 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:28,490 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:28,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:28,502 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:25:28,507 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:25:28,507 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:25:28,508 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:25:28,508 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:28,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:28,535 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:25:28,568 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:25:28,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-02-04 17:25:28,573 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:25:28,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:25:28,575 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-04 17:25:28,589 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc9.base| Int)) (and (= (store |c_old(#valid)| |main_#t~malloc9.base| 0) |c_#valid|) (= 0 (select |c_old(#valid)| |main_#t~malloc9.base|)))) is different from true [2018-02-04 17:25:28,592 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 17:25:28,592 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:25:28,593 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 17:25:28,593 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 17:25:28,593 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 17:25:28,593 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2018-02-04 17:25:28,593 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 6 states. [2018-02-04 17:25:28,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:25:28,657 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2018-02-04 17:25:28,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:25:28,658 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 17:25:28,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:25:28,658 INFO L225 Difference]: With dead ends: 47 [2018-02-04 17:25:28,659 INFO L226 Difference]: Without dead ends: 41 [2018-02-04 17:25:28,659 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=28, Unknown=1, NotChecked=10, Total=56 [2018-02-04 17:25:28,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-02-04 17:25:28,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-02-04 17:25:28,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-04 17:25:28,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-02-04 17:25:28,663 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 19 [2018-02-04 17:25:28,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:25:28,664 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-02-04 17:25:28,664 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 17:25:28,664 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-02-04 17:25:28,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 17:25:28,664 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:25:28,664 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 17:25:28,665 INFO L371 AbstractCegarLoop]: === Iteration 5 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:25:28,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1918733159, now seen corresponding path program 1 times [2018-02-04 17:25:28,665 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:25:28,665 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:25:28,666 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:28,666 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:28,666 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:28,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:28,674 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:25:28,705 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 17:25:28,705 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:25:28,705 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 17:25:28,706 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:25:28,706 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:25:28,706 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:25:28,706 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 5 states. [2018-02-04 17:25:28,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:25:28,775 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2018-02-04 17:25:28,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 17:25:28,776 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-02-04 17:25:28,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:25:28,776 INFO L225 Difference]: With dead ends: 68 [2018-02-04 17:25:28,776 INFO L226 Difference]: Without dead ends: 68 [2018-02-04 17:25:28,776 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-04 17:25:28,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-04 17:25:28,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 41. [2018-02-04 17:25:28,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-04 17:25:28,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-02-04 17:25:28,778 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 19 [2018-02-04 17:25:28,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:25:28,779 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-02-04 17:25:28,779 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:25:28,779 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-02-04 17:25:28,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 17:25:28,779 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:25:28,779 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:25:28,779 INFO L371 AbstractCegarLoop]: === Iteration 6 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:25:28,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1355765508, now seen corresponding path program 1 times [2018-02-04 17:25:28,779 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:25:28,779 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:25:28,780 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:28,780 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:28,780 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:28,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:28,787 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:25:28,851 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 17:25:28,851 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:25:28,851 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 17:25:28,851 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 17:25:28,852 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 17:25:28,852 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-04 17:25:28,852 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 8 states. [2018-02-04 17:25:28,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:25:28,948 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2018-02-04 17:25:28,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 17:25:28,949 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-02-04 17:25:28,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:25:28,949 INFO L225 Difference]: With dead ends: 66 [2018-02-04 17:25:28,949 INFO L226 Difference]: Without dead ends: 66 [2018-02-04 17:25:28,949 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-02-04 17:25:28,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-04 17:25:28,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 43. [2018-02-04 17:25:28,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-04 17:25:28,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-02-04 17:25:28,952 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 21 [2018-02-04 17:25:28,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:25:28,952 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-02-04 17:25:28,953 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 17:25:28,953 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-02-04 17:25:28,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 17:25:28,953 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:25:28,953 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, 1, 1, 1] [2018-02-04 17:25:28,953 INFO L371 AbstractCegarLoop]: === Iteration 7 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:25:28,954 INFO L82 PathProgramCache]: Analyzing trace with hash 461327576, now seen corresponding path program 1 times [2018-02-04 17:25:28,954 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:25:28,954 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:25:28,954 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:28,955 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:28,955 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:28,965 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:25:29,040 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:25:29,040 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:25:29,040 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:25:29,041 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:29,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:29,058 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:25:29,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 17:25:29,060 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:25:29,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:25:29,063 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-02-04 17:25:29,217 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:25:29,217 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:25:29,217 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-02-04 17:25:29,218 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 17:25:29,218 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 17:25:29,218 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-02-04 17:25:29,218 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 16 states. [2018-02-04 17:25:29,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:25:29,388 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-02-04 17:25:29,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 17:25:29,389 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2018-02-04 17:25:29,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:25:29,389 INFO L225 Difference]: With dead ends: 42 [2018-02-04 17:25:29,389 INFO L226 Difference]: Without dead ends: 42 [2018-02-04 17:25:29,389 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2018-02-04 17:25:29,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-02-04 17:25:29,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-02-04 17:25:29,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-04 17:25:29,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-02-04 17:25:29,392 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 25 [2018-02-04 17:25:29,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:25:29,392 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-02-04 17:25:29,392 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 17:25:29,392 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-02-04 17:25:29,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 17:25:29,392 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:25:29,392 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, 1, 1, 1, 1, 1] [2018-02-04 17:25:29,392 INFO L371 AbstractCegarLoop]: === Iteration 8 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:25:29,393 INFO L82 PathProgramCache]: Analyzing trace with hash 2040783234, now seen corresponding path program 1 times [2018-02-04 17:25:29,393 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:25:29,393 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:25:29,393 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:29,393 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:29,393 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:29,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:29,401 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:25:29,443 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:25:29,443 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:25:29,443 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:25:29,444 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:29,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:29,457 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:25:29,471 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:25:29,471 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:25:29,472 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-02-04 17:25:29,472 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 17:25:29,472 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 17:25:29,472 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-04 17:25:29,472 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 8 states. [2018-02-04 17:25:29,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:25:29,543 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-02-04 17:25:29,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 17:25:29,544 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-02-04 17:25:29,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:25:29,545 INFO L225 Difference]: With dead ends: 60 [2018-02-04 17:25:29,545 INFO L226 Difference]: Without dead ends: 60 [2018-02-04 17:25:29,546 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-02-04 17:25:29,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-04 17:25:29,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 47. [2018-02-04 17:25:29,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-04 17:25:29,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-02-04 17:25:29,550 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 27 [2018-02-04 17:25:29,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:25:29,550 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-02-04 17:25:29,550 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 17:25:29,550 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-02-04 17:25:29,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 17:25:29,551 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:25:29,551 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:25:29,551 INFO L371 AbstractCegarLoop]: === Iteration 9 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:25:29,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1160223154, now seen corresponding path program 1 times [2018-02-04 17:25:29,551 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:25:29,551 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:25:29,552 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:29,552 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:29,552 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:29,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:29,559 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:25:29,652 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:25:29,652 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:25:29,653 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:25:29,653 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:29,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:29,664 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:25:29,838 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:25:29,838 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:25:29,838 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 16 [2018-02-04 17:25:29,839 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 17:25:29,839 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 17:25:29,839 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2018-02-04 17:25:29,840 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 17 states. [2018-02-04 17:25:30,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:25:30,382 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2018-02-04 17:25:30,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 17:25:30,382 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2018-02-04 17:25:30,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:25:30,383 INFO L225 Difference]: With dead ends: 69 [2018-02-04 17:25:30,383 INFO L226 Difference]: Without dead ends: 69 [2018-02-04 17:25:30,383 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=242, Invalid=814, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 17:25:30,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-04 17:25:30,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 54. [2018-02-04 17:25:30,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 17:25:30,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-02-04 17:25:30,386 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 28 [2018-02-04 17:25:30,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:25:30,386 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-02-04 17:25:30,386 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 17:25:30,386 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-02-04 17:25:30,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 17:25:30,386 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:25:30,386 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:25:30,387 INFO L371 AbstractCegarLoop]: === Iteration 10 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:25:30,387 INFO L82 PathProgramCache]: Analyzing trace with hash 2127039869, now seen corresponding path program 1 times [2018-02-04 17:25:30,387 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:25:30,387 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:25:30,388 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:30,388 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:30,388 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:30,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:30,395 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:25:30,525 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:25:30,525 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:25:30,525 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:25:30,526 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:30,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:30,538 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:25:30,660 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:25:30,661 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:25:30,661 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2018-02-04 17:25:30,661 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 17:25:30,662 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 17:25:30,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2018-02-04 17:25:30,663 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 18 states. [2018-02-04 17:25:31,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:25:31,324 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2018-02-04 17:25:31,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 17:25:31,324 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 29 [2018-02-04 17:25:31,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:25:31,324 INFO L225 Difference]: With dead ends: 65 [2018-02-04 17:25:31,324 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 17:25:31,325 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=310, Invalid=880, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 17:25:31,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 17:25:31,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 17:25:31,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 17:25:31,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 17:25:31,325 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2018-02-04 17:25:31,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:25:31,325 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 17:25:31,325 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 17:25:31,325 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 17:25:31,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 17:25:31,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 05:25:31 BoogieIcfgContainer [2018-02-04 17:25:31,328 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 17:25:31,329 INFO L168 Benchmark]: Toolchain (without parser) took 4123.54 ms. Allocated memory was 408.4 MB in the beginning and 694.2 MB in the end (delta: 285.7 MB). Free memory was 366.6 MB in the beginning and 546.2 MB in the end (delta: -179.6 MB). Peak memory consumption was 106.1 MB. Max. memory is 5.3 GB. [2018-02-04 17:25:31,330 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 408.4 MB. Free memory is still 371.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 17:25:31,330 INFO L168 Benchmark]: CACSL2BoogieTranslator took 161.26 ms. Allocated memory is still 408.4 MB. Free memory was 365.3 MB in the beginning and 356.0 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 5.3 GB. [2018-02-04 17:25:31,330 INFO L168 Benchmark]: Boogie Preprocessor took 21.18 ms. Allocated memory is still 408.4 MB. Free memory was 356.0 MB in the beginning and 353.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 17:25:31,330 INFO L168 Benchmark]: RCFGBuilder took 201.41 ms. Allocated memory is still 408.4 MB. Free memory was 353.4 MB in the beginning and 335.4 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB. [2018-02-04 17:25:31,330 INFO L168 Benchmark]: TraceAbstraction took 3736.81 ms. Allocated memory was 408.4 MB in the beginning and 694.2 MB in the end (delta: 285.7 MB). Free memory was 335.4 MB in the beginning and 546.2 MB in the end (delta: -210.9 MB). Peak memory consumption was 74.9 MB. Max. memory is 5.3 GB. [2018-02-04 17:25:31,331 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.10 ms. Allocated memory is still 408.4 MB. Free memory is still 371.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 161.26 ms. Allocated memory is still 408.4 MB. Free memory was 365.3 MB in the beginning and 356.0 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 21.18 ms. Allocated memory is still 408.4 MB. Free memory was 356.0 MB in the beginning and 353.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 201.41 ms. Allocated memory is still 408.4 MB. Free memory was 353.4 MB in the beginning and 335.4 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 3736.81 ms. Allocated memory was 408.4 MB in the beginning and 694.2 MB in the end (delta: 285.7 MB). Free memory was 335.4 MB in the beginning and 546.2 MB in the end (delta: -210.9 MB). Peak memory consumption was 74.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 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: 551]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 11 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 46 locations, 11 error locations. SAFE Result, 3.7s OverallTime, 10 OverallIterations, 2 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 235 SDtfs, 1258 SDslu, 856 SDs, 0 SdLazy, 971 SolverSat, 206 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 247 GetRequests, 106 SyntacticMatches, 2 SemanticMatches, 139 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=9, 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, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 127 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 342 NumberOfCodeBlocks, 342 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 309 ConstructedInterpolants, 47 QuantifiedInterpolants, 58125 SizeOfPredicates, 15 NumberOfNonLiveVariables, 464 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 14 InterpolantComputations, 6 PerfectInterpolantSequences, 12/32 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/insertionsort-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_17-25-31-337.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/insertionsort-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_17-25-31-337.csv Received shutdown request...