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/selectionsort-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 17:37:53,021 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 17:37:53,022 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 17:37:53,032 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 17:37:53,032 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 17:37:53,033 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 17:37:53,034 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 17:37:53,035 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 17:37:53,036 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 17:37:53,037 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 17:37:53,037 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 17:37:53,037 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 17:37:53,038 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 17:37:53,039 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 17:37:53,040 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 17:37:53,042 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 17:37:53,043 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 17:37:53,045 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 17:37:53,046 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 17:37:53,047 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 17:37:53,049 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 17:37:53,049 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 17:37:53,049 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 17:37:53,050 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 17:37:53,051 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 17:37:53,052 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 17:37:53,052 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 17:37:53,053 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 17:37:53,053 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 17:37:53,053 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 17:37:53,054 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 17:37:53,054 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:37:53,064 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 17:37:53,064 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 17:37:53,065 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 17:37:53,066 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 17:37:53,066 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 17:37:53,066 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 17:37:53,066 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 17:37:53,066 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 17:37:53,067 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 17:37:53,067 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 17:37:53,067 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 17:37:53,067 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 17:37:53,067 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 17:37:53,067 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 17:37:53,067 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 17:37:53,068 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 17:37:53,068 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 17:37:53,068 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 17:37:53,068 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 17:37:53,068 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 17:37:53,068 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 17:37:53,069 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 17:37:53,069 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 17:37:53,069 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 17:37:53,096 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 17:37:53,106 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 17:37:53,109 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 17:37:53,110 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 17:37:53,110 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 17:37:53,111 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/selectionsort-alloca_true-valid-memsafety_true-termination.i [2018-02-04 17:37:53,248 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 17:37:53,249 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 17:37:53,250 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 17:37:53,250 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 17:37:53,254 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 17:37:53,255 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:37:53" (1/1) ... [2018-02-04 17:37:53,257 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43f9b4aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:37:53, skipping insertion in model container [2018-02-04 17:37:53,257 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:37:53" (1/1) ... [2018-02-04 17:37:53,267 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:37:53,294 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:37:53,385 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:37:53,398 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:37:53,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:37:53 WrapperNode [2018-02-04 17:37:53,403 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 17:37:53,403 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 17:37:53,404 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 17:37:53,404 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 17:37:53,411 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:37:53" (1/1) ... [2018-02-04 17:37:53,412 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:37:53" (1/1) ... [2018-02-04 17:37:53,418 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:37:53" (1/1) ... [2018-02-04 17:37:53,418 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:37:53" (1/1) ... [2018-02-04 17:37:53,421 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:37:53" (1/1) ... [2018-02-04 17:37:53,423 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:37:53" (1/1) ... [2018-02-04 17:37:53,424 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:37:53" (1/1) ... [2018-02-04 17:37:53,426 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 17:37:53,426 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 17:37:53,426 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 17:37:53,426 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 17:37:53,427 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:37:53" (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:37:53,460 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 17:37:53,461 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 17:37:53,461 INFO L136 BoogieDeclarations]: Found implementation of procedure SelectionSort [2018-02-04 17:37:53,461 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 17:37:53,461 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 17:37:53,461 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 17:37:53,461 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 17:37:53,461 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 17:37:53,461 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 17:37:53,462 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 17:37:53,462 INFO L128 BoogieDeclarations]: Found specification of procedure SelectionSort [2018-02-04 17:37:53,462 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 17:37:53,462 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 17:37:53,462 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 17:37:53,603 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 17:37:53,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:37:53 BoogieIcfgContainer [2018-02-04 17:37:53,603 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 17:37:53,604 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 17:37:53,604 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 17:37:53,606 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 17:37:53,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 05:37:53" (1/3) ... [2018-02-04 17:37:53,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f997ca1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:37:53, skipping insertion in model container [2018-02-04 17:37:53,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:37:53" (2/3) ... [2018-02-04 17:37:53,607 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f997ca1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:37:53, skipping insertion in model container [2018-02-04 17:37:53,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:37:53" (3/3) ... [2018-02-04 17:37:53,608 INFO L107 eAbstractionObserver]: Analyzing ICFG selectionsort-alloca_true-valid-memsafety_true-termination.i [2018-02-04 17:37:53,613 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 17:37:53,617 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-02-04 17:37:53,645 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 17:37:53,646 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 17:37:53,646 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 17:37:53,646 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 17:37:53,646 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 17:37:53,646 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 17:37:53,646 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 17:37:53,646 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 17:37:53,647 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 17:37:53,656 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2018-02-04 17:37:53,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 17:37:53,665 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:53,666 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:37:53,666 INFO L371 AbstractCegarLoop]: === Iteration 1 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:37:53,670 INFO L82 PathProgramCache]: Analyzing trace with hash -545325107, now seen corresponding path program 1 times [2018-02-04 17:37:53,672 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:53,672 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:53,717 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:53,717 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:53,717 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:53,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:53,758 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:37:53,785 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:37:53,786 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:37:53,787 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 17:37:53,788 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-04 17:37:53,795 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-04 17:37:53,796 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-04 17:37:53,797 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 2 states. [2018-02-04 17:37:53,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:37:53,809 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2018-02-04 17:37:53,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-04 17:37:53,810 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-02-04 17:37:53,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:37:53,815 INFO L225 Difference]: With dead ends: 48 [2018-02-04 17:37:53,816 INFO L226 Difference]: Without dead ends: 45 [2018-02-04 17:37:53,817 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-04 17:37:53,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-04 17:37:53,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-02-04 17:37:53,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-04 17:37:53,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-02-04 17:37:53,892 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 15 [2018-02-04 17:37:53,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:37:53,893 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-02-04 17:37:53,893 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-04 17:37:53,893 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-02-04 17:37:53,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 17:37:53,893 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:53,893 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:37:53,894 INFO L371 AbstractCegarLoop]: === Iteration 2 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:37:53,894 INFO L82 PathProgramCache]: Analyzing trace with hash 274771065, now seen corresponding path program 1 times [2018-02-04 17:37:53,894 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:53,894 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:53,895 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:53,895 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:53,896 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:53,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:53,910 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:37:53,971 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:37:53,972 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:37:53,972 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 17:37:53,973 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 17:37:53,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 17:37:53,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 17:37:53,973 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 6 states. [2018-02-04 17:37:54,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:37:54,086 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-02-04 17:37:54,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:37:54,086 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-02-04 17:37:54,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:37:54,087 INFO L225 Difference]: With dead ends: 39 [2018-02-04 17:37:54,087 INFO L226 Difference]: Without dead ends: 39 [2018-02-04 17:37:54,088 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:37:54,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-02-04 17:37:54,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-02-04 17:37:54,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-02-04 17:37:54,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-02-04 17:37:54,092 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 16 [2018-02-04 17:37:54,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:37:54,092 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-02-04 17:37:54,092 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 17:37:54,092 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-02-04 17:37:54,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 17:37:54,093 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:54,093 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:37:54,093 INFO L371 AbstractCegarLoop]: === Iteration 3 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:37:54,093 INFO L82 PathProgramCache]: Analyzing trace with hash 274771066, now seen corresponding path program 1 times [2018-02-04 17:37:54,094 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:54,094 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:54,095 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:54,095 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:54,095 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:54,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:54,109 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:37:54,130 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:37:54,130 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:37:54,131 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 17:37:54,131 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 17:37:54,131 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 17:37:54,132 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 17:37:54,132 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 3 states. [2018-02-04 17:37:54,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:37:54,150 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-02-04 17:37:54,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 17:37:54,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-02-04 17:37:54,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:37:54,151 INFO L225 Difference]: With dead ends: 41 [2018-02-04 17:37:54,151 INFO L226 Difference]: Without dead ends: 41 [2018-02-04 17:37:54,151 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 17:37:54,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-02-04 17:37:54,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-02-04 17:37:54,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-04 17:37:54,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-02-04 17:37:54,154 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 16 [2018-02-04 17:37:54,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:37:54,154 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-02-04 17:37:54,154 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 17:37:54,154 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-02-04 17:37:54,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 17:37:54,155 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:54,155 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:37:54,155 INFO L371 AbstractCegarLoop]: === Iteration 4 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:37:54,155 INFO L82 PathProgramCache]: Analyzing trace with hash 274771112, now seen corresponding path program 1 times [2018-02-04 17:37:54,155 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:54,155 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:54,156 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:54,156 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:54,156 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:54,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:54,165 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:37:54,274 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:37:54,275 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:37:54,275 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 17:37:54,275 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 17:37:54,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 17:37:54,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 17:37:54,276 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 8 states. [2018-02-04 17:37:54,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:37:54,458 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2018-02-04 17:37:54,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 17:37:54,459 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-02-04 17:37:54,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:37:54,461 INFO L225 Difference]: With dead ends: 69 [2018-02-04 17:37:54,461 INFO L226 Difference]: Without dead ends: 69 [2018-02-04 17:37:54,462 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-02-04 17:37:54,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-04 17:37:54,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 51. [2018-02-04 17:37:54,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 17:37:54,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2018-02-04 17:37:54,465 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 16 [2018-02-04 17:37:54,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:37:54,465 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2018-02-04 17:37:54,465 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 17:37:54,466 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-02-04 17:37:54,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 17:37:54,466 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:54,466 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 17:37:54,466 INFO L371 AbstractCegarLoop]: === Iteration 5 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:37:54,466 INFO L82 PathProgramCache]: Analyzing trace with hash -72030156, now seen corresponding path program 1 times [2018-02-04 17:37:54,467 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:54,467 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:54,467 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:54,467 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:54,468 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:54,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:54,478 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:37:54,532 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:37:54,532 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:37:54,532 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 17:37:54,532 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 17:37:54,533 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 17:37:54,533 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-04 17:37:54,533 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 8 states. [2018-02-04 17:37:54,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:37:54,690 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2018-02-04 17:37:54,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 17:37:54,691 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-02-04 17:37:54,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:37:54,691 INFO L225 Difference]: With dead ends: 83 [2018-02-04 17:37:54,691 INFO L226 Difference]: Without dead ends: 83 [2018-02-04 17:37:54,692 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-02-04 17:37:54,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-04 17:37:54,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 63. [2018-02-04 17:37:54,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-04 17:37:54,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2018-02-04 17:37:54,695 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 17 [2018-02-04 17:37:54,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:37:54,695 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2018-02-04 17:37:54,695 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 17:37:54,695 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2018-02-04 17:37:54,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 17:37:54,695 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:54,696 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:37:54,696 INFO L371 AbstractCegarLoop]: === Iteration 6 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:37:54,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1045798781, now seen corresponding path program 1 times [2018-02-04 17:37:54,696 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:54,696 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:54,697 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:54,697 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:54,697 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:54,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:54,706 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:37:54,710 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:37:54,710 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:37:54,710 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:37:54,711 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:54,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:54,734 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:37:54,773 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:37:54,779 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:37:54,779 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:54,783 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:37:54,783 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-04 17:37:54,815 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:37:54,818 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:37:54,819 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:37:54,819 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 17:37:54,819 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 17:37:54,820 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 17:37:54,820 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2018-02-04 17:37:54,820 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand 6 states. [2018-02-04 17:37:54,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:37:54,901 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2018-02-04 17:37:54,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:37:54,901 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 17:37:54,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:37:54,902 INFO L225 Difference]: With dead ends: 62 [2018-02-04 17:37:54,902 INFO L226 Difference]: Without dead ends: 56 [2018-02-04 17:37:54,903 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:37:54,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-02-04 17:37:54,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-02-04 17:37:54,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-04 17:37:54,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2018-02-04 17:37:54,906 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 19 [2018-02-04 17:37:54,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:37:54,907 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2018-02-04 17:37:54,907 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 17:37:54,907 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2018-02-04 17:37:54,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 17:37:54,908 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:54,908 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] [2018-02-04 17:37:54,908 INFO L371 AbstractCegarLoop]: === Iteration 7 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:37:54,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1880509326, now seen corresponding path program 1 times [2018-02-04 17:37:54,908 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:54,908 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:54,909 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:54,909 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:54,909 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:54,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:54,920 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:37:54,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:37:54,977 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:37:54,977 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:37:54,977 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:54,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:54,996 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:37:55,072 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:37:55,072 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:37:55,072 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 10 [2018-02-04 17:37:55,072 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 17:37:55,072 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 17:37:55,073 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-04 17:37:55,073 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand 11 states. [2018-02-04 17:37:55,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:37:55,357 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2018-02-04 17:37:55,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 17:37:55,360 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-02-04 17:37:55,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:37:55,362 INFO L225 Difference]: With dead ends: 87 [2018-02-04 17:37:55,362 INFO L226 Difference]: Without dead ends: 87 [2018-02-04 17:37:55,362 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2018-02-04 17:37:55,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-02-04 17:37:55,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 54. [2018-02-04 17:37:55,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 17:37:55,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2018-02-04 17:37:55,368 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 22 [2018-02-04 17:37:55,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:37:55,368 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2018-02-04 17:37:55,368 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 17:37:55,368 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2018-02-04 17:37:55,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 17:37:55,369 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:55,369 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:37:55,369 INFO L371 AbstractCegarLoop]: === Iteration 8 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:37:55,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1833751648, now seen corresponding path program 1 times [2018-02-04 17:37:55,369 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:55,369 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:55,370 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:55,370 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:55,370 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:55,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:55,380 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:37:55,455 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:37:55,455 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:37:55,455 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:37:55,456 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:55,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:55,470 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:37:55,510 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:37:55,511 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:37:55,511 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-02-04 17:37:55,511 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 17:37:55,511 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 17:37:55,511 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-02-04 17:37:55,511 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand 10 states. [2018-02-04 17:37:55,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:37:55,677 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2018-02-04 17:37:55,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 17:37:55,677 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-02-04 17:37:55,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:37:55,678 INFO L225 Difference]: With dead ends: 91 [2018-02-04 17:37:55,678 INFO L226 Difference]: Without dead ends: 91 [2018-02-04 17:37:55,679 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2018-02-04 17:37:55,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-04 17:37:55,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 42. [2018-02-04 17:37:55,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-04 17:37:55,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2018-02-04 17:37:55,682 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 23 [2018-02-04 17:37:55,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:37:55,683 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-02-04 17:37:55,683 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 17:37:55,683 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-02-04 17:37:55,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 17:37:55,683 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:55,683 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 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, 1] [2018-02-04 17:37:55,684 INFO L371 AbstractCegarLoop]: === Iteration 9 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:37:55,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1016956569, now seen corresponding path program 1 times [2018-02-04 17:37:55,684 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:55,684 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:55,685 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:55,685 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:55,685 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:55,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:55,693 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:37:55,734 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:37:55,735 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:37:55,735 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:37:55,735 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:55,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:55,746 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:37:55,751 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:37:55,751 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:37:55,751 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-02-04 17:37:55,751 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 17:37:55,751 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 17:37:55,751 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 17:37:55,752 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 6 states. [2018-02-04 17:37:55,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:37:55,780 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2018-02-04 17:37:55,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:37:55,780 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-02-04 17:37:55,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:37:55,781 INFO L225 Difference]: With dead ends: 71 [2018-02-04 17:37:55,781 INFO L226 Difference]: Without dead ends: 62 [2018-02-04 17:37:55,781 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 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:37:55,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-02-04 17:37:55,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 52. [2018-02-04 17:37:55,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 17:37:55,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2018-02-04 17:37:55,784 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 33 [2018-02-04 17:37:55,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:37:55,784 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2018-02-04 17:37:55,784 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 17:37:55,784 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2018-02-04 17:37:55,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 17:37:55,785 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:55,785 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:37:55,785 INFO L371 AbstractCegarLoop]: === Iteration 10 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:37:55,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1805684219, now seen corresponding path program 2 times [2018-02-04 17:37:55,785 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:55,785 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:55,785 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:55,785 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:55,785 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:55,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:55,794 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:37:55,866 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:37:55,867 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:37:55,867 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:37:55,868 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:37:55,889 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:37:55,889 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:37:55,893 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:37:55,896 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:37:55,897 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:55,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:55,901 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-02-04 17:37:56,106 WARN L143 SmtUtils]: Spent 178ms on a formula simplification that was a NOOP. DAG size: 15 [2018-02-04 17:37:56,304 WARN L143 SmtUtils]: Spent 189ms on a formula simplification that was a NOOP. DAG size: 17 [2018-02-04 17:37:56,376 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 17:37:56,376 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:37:56,376 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-02-04 17:37:56,376 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 17:37:56,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 17:37:56,377 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-02-04 17:37:56,377 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand 14 states. [2018-02-04 17:37:56,723 WARN L146 SmtUtils]: Spent 190ms on a formula simplification. DAG size of input: 36 DAG size of output 35 [2018-02-04 17:37:56,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:37:56,924 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2018-02-04 17:37:56,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 17:37:56,924 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 39 [2018-02-04 17:37:56,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:37:56,925 INFO L225 Difference]: With dead ends: 58 [2018-02-04 17:37:56,925 INFO L226 Difference]: Without dead ends: 58 [2018-02-04 17:37:56,925 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2018-02-04 17:37:56,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-04 17:37:56,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 41. [2018-02-04 17:37:56,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-04 17:37:56,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-02-04 17:37:56,928 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 39 [2018-02-04 17:37:56,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:37:56,928 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-02-04 17:37:56,928 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 17:37:56,928 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-02-04 17:37:56,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 17:37:56,929 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:56,929 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:37:56,929 INFO L371 AbstractCegarLoop]: === Iteration 11 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:37:56,929 INFO L82 PathProgramCache]: Analyzing trace with hash -141635977, now seen corresponding path program 1 times [2018-02-04 17:37:56,929 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:56,931 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:56,931 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:56,931 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:37:56,931 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:56,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:56,937 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:37:57,004 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:37:57,004 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:37:57,005 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:37:57,005 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:57,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:57,019 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:37:57,158 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 17:37:57,158 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:37:57,158 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2018-02-04 17:37:57,159 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 17:37:57,159 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 17:37:57,159 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-02-04 17:37:57,160 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 13 states. [2018-02-04 17:37:57,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:37:57,565 INFO L93 Difference]: Finished difference Result 97 states and 108 transitions. [2018-02-04 17:37:57,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 17:37:57,565 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-02-04 17:37:57,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:37:57,566 INFO L225 Difference]: With dead ends: 97 [2018-02-04 17:37:57,566 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 17:37:57,566 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=192, Invalid=510, Unknown=0, NotChecked=0, Total=702 [2018-02-04 17:37:57,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 17:37:57,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 17:37:57,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 17:37:57,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 17:37:57,567 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2018-02-04 17:37:57,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:37:57,567 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 17:37:57,567 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 17:37:57,567 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 17:37:57,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 17:37:57,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 05:37:57 BoogieIcfgContainer [2018-02-04 17:37:57,570 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 17:37:57,571 INFO L168 Benchmark]: Toolchain (without parser) took 4321.85 ms. Allocated memory was 386.4 MB in the beginning and 659.0 MB in the end (delta: 272.6 MB). Free memory was 342.9 MB in the beginning and 415.9 MB in the end (delta: -73.1 MB). Peak memory consumption was 199.6 MB. Max. memory is 5.3 GB. [2018-02-04 17:37:57,571 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 386.4 MB. Free memory is still 348.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 17:37:57,571 INFO L168 Benchmark]: CACSL2BoogieTranslator took 153.32 ms. Allocated memory is still 386.4 MB. Free memory was 342.9 MB in the beginning and 332.3 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 17:37:57,572 INFO L168 Benchmark]: Boogie Preprocessor took 22.25 ms. Allocated memory is still 386.4 MB. Free memory was 332.3 MB in the beginning and 329.7 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:37:57,572 INFO L168 Benchmark]: RCFGBuilder took 177.60 ms. Allocated memory is still 386.4 MB. Free memory was 329.7 MB in the beginning and 312.4 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 5.3 GB. [2018-02-04 17:37:57,572 INFO L168 Benchmark]: TraceAbstraction took 3966.19 ms. Allocated memory was 386.4 MB in the beginning and 659.0 MB in the end (delta: 272.6 MB). Free memory was 309.8 MB in the beginning and 415.9 MB in the end (delta: -106.1 MB). Peak memory consumption was 166.5 MB. Max. memory is 5.3 GB. [2018-02-04 17:37:57,573 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 386.4 MB. Free memory is still 348.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 153.32 ms. Allocated memory is still 386.4 MB. Free memory was 342.9 MB in the beginning and 332.3 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 22.25 ms. Allocated memory is still 386.4 MB. Free memory was 332.3 MB in the beginning and 329.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 177.60 ms. Allocated memory is still 386.4 MB. Free memory was 329.7 MB in the beginning and 312.4 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 3966.19 ms. Allocated memory was 386.4 MB in the beginning and 659.0 MB in the end (delta: 272.6 MB). Free memory was 309.8 MB in the beginning and 415.9 MB in the end (delta: -106.1 MB). Peak memory consumption was 166.5 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: 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: 557]: all allocated memory was freed For all program executions holds that all allocated memory was freed 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, 3.9s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 344 SDtfs, 786 SDslu, 972 SDs, 0 SdLazy, 1392 SolverSat, 100 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 291 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 122 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=5, 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, 11 MinimizatonAttempts, 147 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 432 NumberOfCodeBlocks, 432 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 397 ConstructedInterpolants, 72 QuantifiedInterpolants, 103119 SizeOfPredicates, 19 NumberOfNonLiveVariables, 664 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 16 InterpolantComputations, 6 PerfectInterpolantSequences, 45/114 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/selectionsort-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_17-37-57-577.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/selectionsort-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_17-37-57-577.csv Received shutdown request...