java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-memsafety/selectionsort-alloca_true-valid-memsafety_true-termination.i
--------------------------------------------------------------------------------
This is Ultimate 0.1.23-1cceb4a
[2018-01-29 22:51:22,452 INFO L170 SettingsManager]: Resetting all preferences to default values...
[2018-01-29 22:51:22,454 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values
[2018-01-29 22:51:22,468 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-01-29 22:51:22,469 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-01-29 22:51:22,470 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-01-29 22:51:22,471 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-01-29 22:51:22,472 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values
[2018-01-29 22:51:22,474 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-01-29 22:51:22,474 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-01-29 22:51:22,475 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-01-29 22:51:22,475 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-01-29 22:51:22,476 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-01-29 22:51:22,477 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-01-29 22:51:22,477 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-01-29 22:51:22,480 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-01-29 22:51:22,482 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values
[2018-01-29 22:51:22,484 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-01-29 22:51:22,486 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-01-29 22:51:22,487 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-01-29 22:51:22,489 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-01-29 22:51:22,489 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-01-29 22:51:22,490 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-01-29 22:51:22,491 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-01-29 22:51:22,491 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values
[2018-01-29 22:51:22,493 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-01-29 22:51:22,493 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values
[2018-01-29 22:51:22,494 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring...
[2018-01-29 22:51:22,494 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-01-29 22:51:22,494 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values
[2018-01-29 22:51:22,495 INFO L181 SettingsManager]: Finished resetting all preferences to default values...
[2018-01-29 22:51:22,495 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf
[2018-01-29 22:51:22,505 INFO L110 SettingsManager]: Loading preferences was successful
[2018-01-29 22:51:22,506 INFO L112 SettingsManager]: Preferences different from defaults after loading the file:
[2018-01-29 22:51:22,506 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2018-01-29 22:51:22,507 INFO L133 SettingsManager]: * to procedures, called more than once=true
[2018-01-29 22:51:22,507 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults:
[2018-01-29 22:51:22,507 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain
[2018-01-29 22:51:22,507 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true
[2018-01-29 22:51:22,508 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-01-29 22:51:22,508 INFO L133 SettingsManager]: * sizeof long=4
[2018-01-29 22:51:22,508 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false
[2018-01-29 22:51:22,509 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true
[2018-01-29 22:51:22,509 INFO L133 SettingsManager]: * sizeof POINTER=4
[2018-01-29 22:51:22,509 INFO L133 SettingsManager]: * Check division by zero=IGNORE
[2018-01-29 22:51:22,509 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2018-01-29 22:51:22,509 INFO L133 SettingsManager]: * Bitprecise bitfields=true
[2018-01-29 22:51:22,510 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2018-01-29 22:51:22,510 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-01-29 22:51:22,510 INFO L133 SettingsManager]: * sizeof long double=12
[2018-01-29 22:51:22,510 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-01-29 22:51:22,510 INFO L133 SettingsManager]: * Size of a code block=SingleStatement
[2018-01-29 22:51:22,511 INFO L133 SettingsManager]: * To the following directory=./dump/
[2018-01-29 22:51:22,511 INFO L133 SettingsManager]: * Add additional assume for each assert=false
[2018-01-29 22:51:22,511 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode
[2018-01-29 22:51:22,511 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-01-29 22:51:22,511 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-01-29 22:51:22,512 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK
[2018-01-29 22:51:22,512 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2018-01-29 22:51:22,512 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2018-01-29 22:51:22,512 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL
[2018-01-29 22:51:22,513 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2018-01-29 22:51:22,513 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-01-29 22:51:22,513 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2018-01-29 22:51:22,514 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2018-01-29 22:51:22,514 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR
[2018-01-29 22:51:22,549 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2018-01-29 22:51:22,561 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized
[2018-01-29 22:51:22,564 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected.
[2018-01-29 22:51:22,565 INFO L271 PluginConnector]: Initializing CDTParser...
[2018-01-29 22:51:22,565 INFO L276 PluginConnector]: CDTParser initialized
[2018-01-29 22:51:22,566 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/selectionsort-alloca_true-valid-memsafety_true-termination.i
[2018-01-29 22:51:22,702 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-01-29 22:51:22,708 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2018-01-29 22:51:22,708 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-01-29 22:51:22,709 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-01-29 22:51:22,713 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized
[2018-01-29 22:51:22,714 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:51:22" (1/1) ...
[2018-01-29 22:51:22,717 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b862e21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:51:22, skipping insertion in model container
[2018-01-29 22:51:22,717 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:51:22" (1/1) ...
[2018-01-29 22:51:22,730 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-01-29 22:51:22,771 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-01-29 22:51:22,887 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-01-29 22:51:22,905 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-01-29 22:51:22,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:51:22 WrapperNode
[2018-01-29 22:51:22,912 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-01-29 22:51:22,913 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-01-29 22:51:22,913 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2018-01-29 22:51:22,913 INFO L276 PluginConnector]: Boogie Preprocessor initialized
[2018-01-29 22:51:22,924 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:51:22" (1/1) ...
[2018-01-29 22:51:22,924 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:51:22" (1/1) ...
[2018-01-29 22:51:22,933 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:51:22" (1/1) ...
[2018-01-29 22:51:22,933 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:51:22" (1/1) ...
[2018-01-29 22:51:22,937 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:51:22" (1/1) ...
[2018-01-29 22:51:22,940 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:51:22" (1/1) ...
[2018-01-29 22:51:22,942 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:51:22" (1/1) ...
[2018-01-29 22:51:22,944 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-01-29 22:51:22,944 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-01-29 22:51:22,944 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2018-01-29 22:51:22,944 INFO L276 PluginConnector]: RCFGBuilder initialized
[2018-01-29 22:51:22,946 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:51:22" (1/1) ...
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-01-29 22:51:23,003 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2018-01-29 22:51:23,003 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-01-29 22:51:23,004 INFO L136 BoogieDeclarations]: Found implementation of procedure SelectionSort
[2018-01-29 22:51:23,004 INFO L136 BoogieDeclarations]: Found implementation of procedure main
[2018-01-29 22:51:23,004 INFO L128 BoogieDeclarations]: Found specification of procedure write~int
[2018-01-29 22:51:23,004 INFO L128 BoogieDeclarations]: Found specification of procedure read~int
[2018-01-29 22:51:23,004 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free
[2018-01-29 22:51:23,004 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2018-01-29 22:51:23,004 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc
[2018-01-29 22:51:23,005 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2018-01-29 22:51:23,005 INFO L128 BoogieDeclarations]: Found specification of procedure SelectionSort
[2018-01-29 22:51:23,005 INFO L128 BoogieDeclarations]: Found specification of procedure main
[2018-01-29 22:51:23,005 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2018-01-29 22:51:23,005 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-01-29 22:51:23,265 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-01-29 22:51:23,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:51:23 BoogieIcfgContainer
[2018-01-29 22:51:23,265 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-01-29 22:51:23,266 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-01-29 22:51:23,266 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2018-01-29 22:51:23,269 INFO L276 PluginConnector]: TraceAbstraction initialized
[2018-01-29 22:51:23,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 10:51:22" (1/3) ...
[2018-01-29 22:51:23,270 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37bf2aa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:51:23, skipping insertion in model container
[2018-01-29 22:51:23,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:51:22" (2/3) ...
[2018-01-29 22:51:23,270 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37bf2aa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:51:23, skipping insertion in model container
[2018-01-29 22:51:23,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:51:23" (3/3) ...
[2018-01-29 22:51:23,272 INFO L107 eAbstractionObserver]: Analyzing ICFG selectionsort-alloca_true-valid-memsafety_true-termination.i
[2018-01-29 22:51:23,278 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2018-01-29 22:51:23,284 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations.
[2018-01-29 22:51:23,329 INFO L322 AbstractCegarLoop]: Interprodecural is true
[2018-01-29 22:51:23,329 INFO L323 AbstractCegarLoop]: Hoare is true
[2018-01-29 22:51:23,329 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP
[2018-01-29 22:51:23,329 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK
[2018-01-29 22:51:23,329 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-01-29 22:51:23,330 INFO L327 AbstractCegarLoop]: Difference is false
[2018-01-29 22:51:23,330 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-01-29 22:51:23,330 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-01-29 22:51:23,331 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure
[2018-01-29 22:51:23,350 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states.
[2018-01-29 22:51:23,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2018-01-29 22:51:23,357 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 22:51:23,359 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 22:51:23,359 INFO L371 AbstractCegarLoop]: === Iteration 1 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]===
[2018-01-29 22:51:23,364 INFO L82 PathProgramCache]: Analyzing trace with hash -2058939318, now seen corresponding path program 1 times
[2018-01-29 22:51:23,366 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 22:51:23,367 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 22:51:23,413 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:51:23,413 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 22:51:23,413 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:51:23,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 22:51:23,470 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 22:51:23,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 22:51:23,512 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 22:51:23,512 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2018-01-29 22:51:23,514 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states
[2018-01-29 22:51:23,525 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2018-01-29 22:51:23,525 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2018-01-29 22:51:23,527 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 2 states.
[2018-01-29 22:51:23,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 22:51:23,550 INFO L93 Difference]: Finished difference Result 122 states and 131 transitions.
[2018-01-29 22:51:23,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2018-01-29 22:51:23,551 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24
[2018-01-29 22:51:23,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 22:51:23,561 INFO L225 Difference]: With dead ends: 122
[2018-01-29 22:51:23,561 INFO L226 Difference]: Without dead ends: 67
[2018-01-29 22:51:23,566 INFO L553 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-01-29 22:51:23,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states.
[2018-01-29 22:51:23,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67.
[2018-01-29 22:51:23,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states.
[2018-01-29 22:51:23,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions.
[2018-01-29 22:51:23,687 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 24
[2018-01-29 22:51:23,688 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 22:51:23,688 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions.
[2018-01-29 22:51:23,688 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states.
[2018-01-29 22:51:23,688 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions.
[2018-01-29 22:51:23,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2018-01-29 22:51:23,689 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 22:51:23,689 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 22:51:23,689 INFO L371 AbstractCegarLoop]: === Iteration 2 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]===
[2018-01-29 22:51:23,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1779914082, now seen corresponding path program 1 times
[2018-01-29 22:51:23,690 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 22:51:23,690 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 22:51:23,691 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:51:23,691 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 22:51:23,691 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:51:23,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 22:51:23,715 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 22:51:23,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 22:51:23,826 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 22:51:23,827 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-01-29 22:51:23,828 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-01-29 22:51:23,829 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-01-29 22:51:23,829 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-01-29 22:51:23,829 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand 4 states.
[2018-01-29 22:51:24,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 22:51:24,030 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions.
[2018-01-29 22:51:24,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-01-29 22:51:24,031 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25
[2018-01-29 22:51:24,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 22:51:24,032 INFO L225 Difference]: With dead ends: 67
[2018-01-29 22:51:24,032 INFO L226 Difference]: Without dead ends: 60
[2018-01-29 22:51:24,034 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-01-29 22:51:24,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states.
[2018-01-29 22:51:24,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60.
[2018-01-29 22:51:24,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states.
[2018-01-29 22:51:24,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions.
[2018-01-29 22:51:24,042 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 25
[2018-01-29 22:51:24,042 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 22:51:24,042 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions.
[2018-01-29 22:51:24,043 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-01-29 22:51:24,043 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions.
[2018-01-29 22:51:24,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2018-01-29 22:51:24,044 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 22:51:24,044 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 22:51:24,044 INFO L371 AbstractCegarLoop]: === Iteration 3 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]===
[2018-01-29 22:51:24,044 INFO L82 PathProgramCache]: Analyzing trace with hash -484557405, now seen corresponding path program 1 times
[2018-01-29 22:51:24,044 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 22:51:24,045 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 22:51:24,046 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:51:24,046 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 22:51:24,046 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:51:24,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 22:51:24,062 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 22:51:24,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 22:51:24,134 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 22:51:24,134 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-01-29 22:51:24,135 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-01-29 22:51:24,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-01-29 22:51:24,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2018-01-29 22:51:24,135 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 6 states.
[2018-01-29 22:51:24,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 22:51:24,256 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions.
[2018-01-29 22:51:24,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-01-29 22:51:24,256 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27
[2018-01-29 22:51:24,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 22:51:24,258 INFO L225 Difference]: With dead ends: 60
[2018-01-29 22:51:24,258 INFO L226 Difference]: Without dead ends: 54
[2018-01-29 22:51:24,258 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2018-01-29 22:51:24,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states.
[2018-01-29 22:51:24,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54.
[2018-01-29 22:51:24,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states.
[2018-01-29 22:51:24,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions.
[2018-01-29 22:51:24,265 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 27
[2018-01-29 22:51:24,266 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 22:51:24,266 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions.
[2018-01-29 22:51:24,266 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-01-29 22:51:24,266 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions.
[2018-01-29 22:51:24,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2018-01-29 22:51:24,267 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 22:51:24,267 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 22:51:24,268 INFO L371 AbstractCegarLoop]: === Iteration 4 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]===
[2018-01-29 22:51:24,268 INFO L82 PathProgramCache]: Analyzing trace with hash -484557404, now seen corresponding path program 1 times
[2018-01-29 22:51:24,268 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 22:51:24,268 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 22:51:24,269 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:51:24,269 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 22:51:24,269 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:51:24,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 22:51:24,285 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 22:51:24,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 22:51:24,328 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 22:51:24,329 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-01-29 22:51:24,329 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-01-29 22:51:24,329 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-01-29 22:51:24,329 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-01-29 22:51:24,330 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 4 states.
[2018-01-29 22:51:24,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 22:51:24,401 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions.
[2018-01-29 22:51:24,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-01-29 22:51:24,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27
[2018-01-29 22:51:24,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 22:51:24,403 INFO L225 Difference]: With dead ends: 92
[2018-01-29 22:51:24,403 INFO L226 Difference]: Without dead ends: 56
[2018-01-29 22:51:24,403 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-01-29 22:51:24,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states.
[2018-01-29 22:51:24,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56.
[2018-01-29 22:51:24,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states.
[2018-01-29 22:51:24,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions.
[2018-01-29 22:51:24,410 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 27
[2018-01-29 22:51:24,410 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 22:51:24,410 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions.
[2018-01-29 22:51:24,410 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-01-29 22:51:24,410 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions.
[2018-01-29 22:51:24,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2018-01-29 22:51:24,411 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 22:51:24,411 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 22:51:24,411 INFO L371 AbstractCegarLoop]: === Iteration 5 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]===
[2018-01-29 22:51:24,411 INFO L82 PathProgramCache]: Analyzing trace with hash -484557365, now seen corresponding path program 1 times
[2018-01-29 22:51:24,411 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 22:51:24,411 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 22:51:24,412 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:51:24,412 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 22:51:24,412 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:51:24,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 22:51:24,425 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 22:51:24,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 22:51:24,589 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 22:51:24,589 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2018-01-29 22:51:24,590 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states
[2018-01-29 22:51:24,590 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2018-01-29 22:51:24,590 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90
[2018-01-29 22:51:24,591 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 10 states.
[2018-01-29 22:51:24,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 22:51:24,904 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions.
[2018-01-29 22:51:24,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2018-01-29 22:51:24,904 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27
[2018-01-29 22:51:24,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 22:51:24,906 INFO L225 Difference]: With dead ends: 105
[2018-01-29 22:51:24,906 INFO L226 Difference]: Without dead ends: 102
[2018-01-29 22:51:24,907 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240
[2018-01-29 22:51:24,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states.
[2018-01-29 22:51:24,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 84.
[2018-01-29 22:51:24,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states.
[2018-01-29 22:51:24,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions.
[2018-01-29 22:51:24,917 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 27
[2018-01-29 22:51:24,917 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 22:51:24,918 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions.
[2018-01-29 22:51:24,918 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states.
[2018-01-29 22:51:24,918 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions.
[2018-01-29 22:51:24,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2018-01-29 22:51:24,919 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 22:51:24,919 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 22:51:24,919 INFO L371 AbstractCegarLoop]: === Iteration 6 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]===
[2018-01-29 22:51:24,919 INFO L82 PathProgramCache]: Analyzing trace with hash -2136376454, now seen corresponding path program 1 times
[2018-01-29 22:51:24,919 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 22:51:24,920 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 22:51:24,920 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:51:24,921 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 22:51:24,921 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:51:24,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 22:51:24,933 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 22:51:25,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 22:51:25,006 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 22:51:25,006 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2018-01-29 22:51:25,006 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-01-29 22:51:25,007 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-01-29 22:51:25,007 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2018-01-29 22:51:25,007 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand 9 states.
[2018-01-29 22:51:25,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 22:51:25,190 INFO L93 Difference]: Finished difference Result 123 states and 130 transitions.
[2018-01-29 22:51:25,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2018-01-29 22:51:25,190 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28
[2018-01-29 22:51:25,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 22:51:25,192 INFO L225 Difference]: With dead ends: 123
[2018-01-29 22:51:25,192 INFO L226 Difference]: Without dead ends: 120
[2018-01-29 22:51:25,193 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210
[2018-01-29 22:51:25,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states.
[2018-01-29 22:51:25,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 101.
[2018-01-29 22:51:25,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states.
[2018-01-29 22:51:25,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 112 transitions.
[2018-01-29 22:51:25,204 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 112 transitions. Word has length 28
[2018-01-29 22:51:25,205 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 22:51:25,205 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 112 transitions.
[2018-01-29 22:51:25,205 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-01-29 22:51:25,205 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 112 transitions.
[2018-01-29 22:51:25,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38
[2018-01-29 22:51:25,207 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 22:51:25,207 INFO L350 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 22:51:25,207 INFO L371 AbstractCegarLoop]: === Iteration 7 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]===
[2018-01-29 22:51:25,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1524073151, now seen corresponding path program 1 times
[2018-01-29 22:51:25,208 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 22:51:25,208 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 22:51:25,209 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:51:25,209 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 22:51:25,209 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:51:25,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 22:51:25,223 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 22:51:25,397 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 22:51:25,398 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 22:51:25,398 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-29 22:51:25,404 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 22:51:25,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 22:51:25,429 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 22:51:25,468 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-01-29 22:51:25,470 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 22:51:25,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 22:51:25,474 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11
[2018-01-29 22:51:25,729 WARN L143 SmtUtils]: Spent 221ms on a formula simplification that was a NOOP. DAG size: 15
[2018-01-29 22:51:25,958 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 22:51:25,989 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-29 22:51:25,989 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16
[2018-01-29 22:51:25,989 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states
[2018-01-29 22:51:25,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2018-01-29 22:51:25,990 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272
[2018-01-29 22:51:25,990 INFO L87 Difference]: Start difference. First operand 101 states and 112 transitions. Second operand 17 states.
[2018-01-29 22:51:26,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 22:51:26,348 INFO L93 Difference]: Finished difference Result 123 states and 137 transitions.
[2018-01-29 22:51:26,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2018-01-29 22:51:26,349 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 37
[2018-01-29 22:51:26,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 22:51:26,350 INFO L225 Difference]: With dead ends: 123
[2018-01-29 22:51:26,350 INFO L226 Difference]: Without dead ends: 122
[2018-01-29 22:51:26,351 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=149, Invalid=451, Unknown=0, NotChecked=0, Total=600
[2018-01-29 22:51:26,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states.
[2018-01-29 22:51:26,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 99.
[2018-01-29 22:51:26,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states.
[2018-01-29 22:51:26,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions.
[2018-01-29 22:51:26,365 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 37
[2018-01-29 22:51:26,365 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 22:51:26,365 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions.
[2018-01-29 22:51:26,365 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states.
[2018-01-29 22:51:26,365 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions.
[2018-01-29 22:51:26,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40
[2018-01-29 22:51:26,367 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 22:51:26,367 INFO L350 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 22:51:26,367 INFO L371 AbstractCegarLoop]: === Iteration 8 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]===
[2018-01-29 22:51:26,367 INFO L82 PathProgramCache]: Analyzing trace with hash -884945472, now seen corresponding path program 1 times
[2018-01-29 22:51:26,367 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 22:51:26,368 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 22:51:26,368 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:51:26,369 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 22:51:26,369 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:51:26,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 22:51:26,383 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 22:51:26,534 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 22:51:26,534 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 22:51:26,535 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-29 22:51:26,548 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 22:51:26,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 22:51:26,565 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 22:51:26,651 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 22:51:26,671 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-29 22:51:26,672 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19
[2018-01-29 22:51:26,672 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states
[2018-01-29 22:51:26,672 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2018-01-29 22:51:26,673 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380
[2018-01-29 22:51:26,673 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand 20 states.
[2018-01-29 22:51:27,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 22:51:27,209 INFO L93 Difference]: Finished difference Result 180 states and 194 transitions.
[2018-01-29 22:51:27,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2018-01-29 22:51:27,209 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 39
[2018-01-29 22:51:27,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 22:51:27,210 INFO L225 Difference]: With dead ends: 180
[2018-01-29 22:51:27,210 INFO L226 Difference]: Without dead ends: 177
[2018-01-29 22:51:27,211 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=242, Invalid=814, Unknown=0, NotChecked=0, Total=1056
[2018-01-29 22:51:27,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states.
[2018-01-29 22:51:27,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 114.
[2018-01-29 22:51:27,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states.
[2018-01-29 22:51:27,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 126 transitions.
[2018-01-29 22:51:27,225 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 126 transitions. Word has length 39
[2018-01-29 22:51:27,225 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 22:51:27,225 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 126 transitions.
[2018-01-29 22:51:27,225 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states.
[2018-01-29 22:51:27,225 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 126 transitions.
[2018-01-29 22:51:27,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2018-01-29 22:51:27,226 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 22:51:27,226 INFO L350 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 22:51:27,227 INFO L371 AbstractCegarLoop]: === Iteration 9 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]===
[2018-01-29 22:51:27,227 INFO L82 PathProgramCache]: Analyzing trace with hash -30213825, now seen corresponding path program 1 times
[2018-01-29 22:51:27,227 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 22:51:27,227 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 22:51:27,228 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:51:27,228 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 22:51:27,228 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:51:27,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 22:51:27,240 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 22:51:27,303 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 22:51:27,303 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 22:51:27,303 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-29 22:51:27,308 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 22:51:27,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 22:51:27,328 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 22:51:27,395 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 22:51:27,415 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-29 22:51:27,415 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9] total 13
[2018-01-29 22:51:27,416 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states
[2018-01-29 22:51:27,416 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2018-01-29 22:51:27,416 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182
[2018-01-29 22:51:27,416 INFO L87 Difference]: Start difference. First operand 114 states and 126 transitions. Second operand 14 states.
[2018-01-29 22:51:27,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 22:51:27,680 INFO L93 Difference]: Finished difference Result 155 states and 169 transitions.
[2018-01-29 22:51:27,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2018-01-29 22:51:27,680 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 41
[2018-01-29 22:51:27,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 22:51:27,681 INFO L225 Difference]: With dead ends: 155
[2018-01-29 22:51:27,682 INFO L226 Difference]: Without dead ends: 151
[2018-01-29 22:51:27,682 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=418, Unknown=0, NotChecked=0, Total=552
[2018-01-29 22:51:27,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states.
[2018-01-29 22:51:27,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 81.
[2018-01-29 22:51:27,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states.
[2018-01-29 22:51:27,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions.
[2018-01-29 22:51:27,691 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 41
[2018-01-29 22:51:27,691 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 22:51:27,691 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions.
[2018-01-29 22:51:27,691 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states.
[2018-01-29 22:51:27,691 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions.
[2018-01-29 22:51:27,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58
[2018-01-29 22:51:27,692 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 22:51:27,692 INFO L350 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 22:51:27,692 INFO L371 AbstractCegarLoop]: === Iteration 10 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]===
[2018-01-29 22:51:27,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1690732940, now seen corresponding path program 1 times
[2018-01-29 22:51:27,692 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 22:51:27,692 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 22:51:27,693 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:51:27,693 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 22:51:27,693 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:51:27,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 22:51:27,706 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 22:51:27,776 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 22:51:27,776 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 22:51:27,776 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-29 22:51:27,788 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 22:51:27,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 22:51:27,814 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 22:51:27,823 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 22:51:27,857 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-29 22:51:27,857 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6
[2018-01-29 22:51:27,857 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-01-29 22:51:27,858 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-01-29 22:51:27,858 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2018-01-29 22:51:27,858 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand 6 states.
[2018-01-29 22:51:28,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 22:51:28,002 INFO L93 Difference]: Finished difference Result 200 states and 215 transitions.
[2018-01-29 22:51:28,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-01-29 22:51:28,039 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57
[2018-01-29 22:51:28,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 22:51:28,040 INFO L225 Difference]: With dead ends: 200
[2018-01-29 22:51:28,040 INFO L226 Difference]: Without dead ends: 134
[2018-01-29 22:51:28,041 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 59 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-01-29 22:51:28,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states.
[2018-01-29 22:51:28,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 111.
[2018-01-29 22:51:28,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states.
[2018-01-29 22:51:28,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 123 transitions.
[2018-01-29 22:51:28,053 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 123 transitions. Word has length 57
[2018-01-29 22:51:28,053 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 22:51:28,053 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 123 transitions.
[2018-01-29 22:51:28,053 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-01-29 22:51:28,053 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions.
[2018-01-29 22:51:28,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68
[2018-01-29 22:51:28,054 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 22:51:28,054 INFO L350 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 22:51:28,055 INFO L371 AbstractCegarLoop]: === Iteration 11 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]===
[2018-01-29 22:51:28,055 INFO L82 PathProgramCache]: Analyzing trace with hash 365931392, now seen corresponding path program 2 times
[2018-01-29 22:51:28,055 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 22:51:28,055 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 22:51:28,056 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:51:28,056 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 22:51:28,056 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:51:28,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 22:51:28,069 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 22:51:28,183 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 22:51:28,183 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 22:51:28,183 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-29 22:51:28,189 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-01-29 22:51:28,203 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command
[2018-01-29 22:51:28,213 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command
[2018-01-29 22:51:28,215 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-01-29 22:51:28,219 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 22:51:28,389 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked.
[2018-01-29 22:51:28,409 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-29 22:51:28,409 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 16
[2018-01-29 22:51:28,409 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states
[2018-01-29 22:51:28,409 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2018-01-29 22:51:28,409 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272
[2018-01-29 22:51:28,410 INFO L87 Difference]: Start difference. First operand 111 states and 123 transitions. Second operand 17 states.
[2018-01-29 22:51:28,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 22:51:28,999 INFO L93 Difference]: Finished difference Result 154 states and 168 transitions.
[2018-01-29 22:51:29,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states.
[2018-01-29 22:51:29,000 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67
[2018-01-29 22:51:29,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 22:51:29,000 INFO L225 Difference]: With dead ends: 154
[2018-01-29 22:51:29,000 INFO L226 Difference]: Without dead ends: 0
[2018-01-29 22:51:29,002 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=258, Invalid=798, Unknown=0, NotChecked=0, Total=1056
[2018-01-29 22:51:29,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2018-01-29 22:51:29,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2018-01-29 22:51:29,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states.
[2018-01-29 22:51:29,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2018-01-29 22:51:29,003 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67
[2018-01-29 22:51:29,003 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 22:51:29,003 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2018-01-29 22:51:29,003 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states.
[2018-01-29 22:51:29,003 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2018-01-29 22:51:29,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2018-01-29 22:51:29,007 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2018-01-29 22:51:29,159 WARN L146 SmtUtils]: Spent 150ms on a formula simplification. DAG size of input: 101 DAG size of output 99
[2018-01-29 22:51:29,172 WARN L137 erpolLogProxyWrapper]: Already inconsistent.
[2018-01-29 22:51:31,392 WARN L146 SmtUtils]: Spent 2171ms on a formula simplification. DAG size of input: 107 DAG size of output 70
[2018-01-29 22:51:31,876 WARN L146 SmtUtils]: Spent 463ms on a formula simplification. DAG size of input: 88 DAG size of output 52
[2018-01-29 22:51:31,882 INFO L399 ceAbstractionStarter]: For program point L1(lines 1 565) no Hoare annotation was computed.
[2018-01-29 22:51:31,882 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 565) no Hoare annotation was computed.
[2018-01-29 22:51:31,882 INFO L395 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 565) the Hoare annotation is: (= |#valid| |old(#valid)|)
[2018-01-29 22:51:31,882 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 565) no Hoare annotation was computed.
[2018-01-29 22:51:31,882 INFO L399 ceAbstractionStarter]: For program point SelectionSortEXIT(lines 540 556) no Hoare annotation was computed.
[2018-01-29 22:51:31,882 INFO L399 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed.
[2018-01-29 22:51:31,882 INFO L399 ceAbstractionStarter]: For program point L540(lines 540 556) no Hoare annotation was computed.
[2018-01-29 22:51:31,882 INFO L399 ceAbstractionStarter]: For program point L553'(line 553) no Hoare annotation was computed.
[2018-01-29 22:51:31,882 INFO L402 ceAbstractionStarter]: At program point SelectionSortENTRY(lines 540 556) the Hoare annotation is: true
[2018-01-29 22:51:31,882 INFO L399 ceAbstractionStarter]: For program point L546(line 546) no Hoare annotation was computed.
[2018-01-29 22:51:31,883 INFO L399 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed.
[2018-01-29 22:51:31,883 INFO L399 ceAbstractionStarter]: For program point L543(line 543) no Hoare annotation was computed.
[2018-01-29 22:51:31,883 INFO L399 ceAbstractionStarter]: For program point L549(line 549) no Hoare annotation was computed.
[2018-01-29 22:51:31,883 INFO L399 ceAbstractionStarter]: For program point SelectionSortErr6RequiresViolation(lines 1 565) no Hoare annotation was computed.
[2018-01-29 22:51:31,883 INFO L399 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed.
[2018-01-29 22:51:31,883 INFO L399 ceAbstractionStarter]: For program point L543''''''(lines 543 555) no Hoare annotation was computed.
[2018-01-29 22:51:31,883 INFO L399 ceAbstractionStarter]: For program point L549'''(line 549) no Hoare annotation was computed.
[2018-01-29 22:51:31,883 INFO L399 ceAbstractionStarter]: For program point L554'(line 554) no Hoare annotation was computed.
[2018-01-29 22:51:31,883 INFO L399 ceAbstractionStarter]: For program point L549''''(line 549) no Hoare annotation was computed.
[2018-01-29 22:51:31,883 INFO L399 ceAbstractionStarter]: For program point SelectionSortErr10RequiresViolation(lines 1 565) no Hoare annotation was computed.
[2018-01-29 22:51:31,883 INFO L399 ceAbstractionStarter]: For program point SelectionSortErr7RequiresViolation(lines 1 565) no Hoare annotation was computed.
[2018-01-29 22:51:31,883 INFO L399 ceAbstractionStarter]: For program point L543'''(line 543) no Hoare annotation was computed.
[2018-01-29 22:51:31,883 INFO L399 ceAbstractionStarter]: For program point SelectionSortErr4RequiresViolation(lines 1 565) no Hoare annotation was computed.
[2018-01-29 22:51:31,883 INFO L399 ceAbstractionStarter]: For program point SelectionSortErr9RequiresViolation(lines 1 565) no Hoare annotation was computed.
[2018-01-29 22:51:31,884 INFO L399 ceAbstractionStarter]: For program point L547''''(line 547) no Hoare annotation was computed.
[2018-01-29 22:51:31,884 INFO L399 ceAbstractionStarter]: For program point L543'(lines 543 555) no Hoare annotation was computed.
[2018-01-29 22:51:31,884 INFO L399 ceAbstractionStarter]: For program point SelectionSortErr1RequiresViolation(lines 1 565) no Hoare annotation was computed.
[2018-01-29 22:51:31,884 INFO L399 ceAbstractionStarter]: For program point L545''(line 545) no Hoare annotation was computed.
[2018-01-29 22:51:31,884 INFO L399 ceAbstractionStarter]: For program point L547'(lines 547 551) no Hoare annotation was computed.
[2018-01-29 22:51:31,884 INFO L399 ceAbstractionStarter]: For program point L549''(line 549) no Hoare annotation was computed.
[2018-01-29 22:51:31,884 INFO L395 ceAbstractionStarter]: At program point L547''''''(lines 547 551) the Hoare annotation is: (let ((.cse15 (select |#length| SelectionSort_~a.base)) (.cse14 (+ SelectionSort_~i~2 2))) (let ((.cse0 (= 1 (select |#valid| SelectionSort_~a.base))) (.cse1 (= SelectionSort_~a.offset 0)) (.cse2 (<= .cse14 SelectionSort_~array_size)) (.cse4 (exists ((v_main_~array_size~5_BEFORE_CALL_1 Int)) (and (<= |SelectionSort_#in~array_size| v_main_~array_size~5_BEFORE_CALL_1) (= (* 4 v_main_~array_size~5_BEFORE_CALL_1) (select |#length| SelectionSort_~a.base))))) (.cse12 (= 0 |SelectionSort_#in~a.offset|)) (.cse13 (+ SelectionSort_~i~2 1)) (.cse7 (<= (* 4 SelectionSort_~array_size) .cse15)) (.cse11 (select |#valid| |SelectionSort_#in~a.base|))) (let ((.cse9 (let ((.cse16 (= 1 .cse11))) (or (and .cse0 .cse1 .cse2 (= SelectionSort_~min~3 0) .cse4 .cse12 .cse16 (= SelectionSort_~i~2 0) .cse7) (and .cse0 .cse1 (<= 0 SelectionSort_~i~2) .cse2 (<= (+ SelectionSort_~min~3 1) SelectionSort_~j~3) (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~min~3) 4) .cse15) .cse4 .cse12 (<= .cse13 SelectionSort_~min~3) .cse16 .cse7)))) (.cse8 (<= SelectionSort_~j~3 .cse14)) (.cse3 (= SelectionSort_~i~2 SelectionSort_~min~3)) (.cse10 (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~2) 12) .cse15)) (.cse5 (<= 1 SelectionSort_~i~2)) (.cse6 (<= .cse14 SelectionSort_~j~3))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse10 .cse6) (not (= .cse11 1)) (not .cse12) (and .cse9 .cse6 .cse8) (not (exists ((v_main_~array_size~5_BEFORE_CALL_1 Int)) (and (<= |SelectionSort_#in~array_size| v_main_~array_size~5_BEFORE_CALL_1) (= (* 4 v_main_~array_size~5_BEFORE_CALL_1) (select |#length| |SelectionSort_#in~a.base|))))) (and .cse0 .cse1 .cse2 (<= SelectionSort_~j~3 .cse13) .cse3 .cse4 (<= .cse13 SelectionSort_~j~3) (<= 1 SelectionSort_~j~3) .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse10 .cse5 .cse6 .cse7)))))
[2018-01-29 22:51:31,884 INFO L399 ceAbstractionStarter]: For program point SelectionSortErr0RequiresViolation(lines 1 565) no Hoare annotation was computed.
[2018-01-29 22:51:31,884 INFO L399 ceAbstractionStarter]: For program point L543''''(line 543) no Hoare annotation was computed.
[2018-01-29 22:51:31,885 INFO L395 ceAbstractionStarter]: At program point L543'''''(lines 543 555) the Hoare annotation is: (let ((.cse2 (select |#length| SelectionSort_~a.base))) (let ((.cse3 (= 1 (select |#valid| SelectionSort_~a.base))) (.cse4 (= SelectionSort_~a.offset 0)) (.cse5 (exists ((v_main_~array_size~5_BEFORE_CALL_1 Int)) (and (<= |SelectionSort_#in~array_size| v_main_~array_size~5_BEFORE_CALL_1) (= (* 4 v_main_~array_size~5_BEFORE_CALL_1) (select |#length| SelectionSort_~a.base))))) (.cse6 (<= (* 4 SelectionSort_~array_size) .cse2))) (let ((.cse0 (+ SelectionSort_~i~2 1)) (.cse1 (and .cse3 .cse4 (<= 2 SelectionSort_~j~3) (<= 0 SelectionSort_~i~2) .cse5 .cse6))) (or (and (<= SelectionSort_~array_size .cse0) (<= SelectionSort_~j~3 .cse0) .cse1) (and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~2) 8) .cse2) (<= .cse0 SelectionSort_~j~3) .cse1) (not (exists ((v_main_~array_size~5_BEFORE_CALL_1 Int)) (and (<= |SelectionSort_#in~array_size| v_main_~array_size~5_BEFORE_CALL_1) (= (* 4 v_main_~array_size~5_BEFORE_CALL_1) (select |#length| |SelectionSort_#in~a.base|))))) (and .cse3 .cse4 .cse5 (= SelectionSort_~i~2 0) .cse6) (not (= (select |#valid| |SelectionSort_#in~a.base|) 1)) (not (= 0 |SelectionSort_#in~a.offset|))))))
[2018-01-29 22:51:31,885 INFO L399 ceAbstractionStarter]: For program point L553''(line 553) no Hoare annotation was computed.
[2018-01-29 22:51:31,885 INFO L399 ceAbstractionStarter]: For program point L547'''(lines 547 551) no Hoare annotation was computed.
[2018-01-29 22:51:31,885 INFO L399 ceAbstractionStarter]: For program point SelectionSortErr3RequiresViolation(lines 1 565) no Hoare annotation was computed.
[2018-01-29 22:51:31,885 INFO L399 ceAbstractionStarter]: For program point L549'''''''(line 549) no Hoare annotation was computed.
[2018-01-29 22:51:31,885 INFO L399 ceAbstractionStarter]: For program point L547'''''''(lines 547 551) no Hoare annotation was computed.
[2018-01-29 22:51:31,885 INFO L399 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed.
[2018-01-29 22:51:31,885 INFO L399 ceAbstractionStarter]: For program point L552(line 552) no Hoare annotation was computed.
[2018-01-29 22:51:31,885 INFO L399 ceAbstractionStarter]: For program point L552'(line 552) no Hoare annotation was computed.
[2018-01-29 22:51:31,885 INFO L399 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed.
[2018-01-29 22:51:31,885 INFO L399 ceAbstractionStarter]: For program point SelectionSortErr2RequiresViolation(lines 1 565) no Hoare annotation was computed.
[2018-01-29 22:51:31,885 INFO L399 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed.
[2018-01-29 22:51:31,885 INFO L399 ceAbstractionStarter]: For program point SelectionSortErr8RequiresViolation(lines 1 565) no Hoare annotation was computed.
[2018-01-29 22:51:31,885 INFO L399 ceAbstractionStarter]: For program point SelectionSortErr11RequiresViolation(lines 1 565) no Hoare annotation was computed.
[2018-01-29 22:51:31,886 INFO L399 ceAbstractionStarter]: For program point L549''''''(line 549) no Hoare annotation was computed.
[2018-01-29 22:51:31,886 INFO L399 ceAbstractionStarter]: For program point L545'(line 545) no Hoare annotation was computed.
[2018-01-29 22:51:31,886 INFO L399 ceAbstractionStarter]: For program point SelectionSortErr5RequiresViolation(lines 1 565) no Hoare annotation was computed.
[2018-01-29 22:51:31,886 INFO L399 ceAbstractionStarter]: For program point L549'(line 549) no Hoare annotation was computed.
[2018-01-29 22:51:31,886 INFO L399 ceAbstractionStarter]: For program point L547'''''(line 547) no Hoare annotation was computed.
[2018-01-29 22:51:31,886 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 565) the Hoare annotation is: true
[2018-01-29 22:51:31,886 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 565) no Hoare annotation was computed.
[2018-01-29 22:51:31,886 INFO L402 ceAbstractionStarter]: At program point L1(lines 1 565) the Hoare annotation is: true
[2018-01-29 22:51:31,886 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 565) no Hoare annotation was computed.
[2018-01-29 22:51:31,886 INFO L399 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed.
[2018-01-29 22:51:31,886 INFO L395 ceAbstractionStarter]: At program point L563(line 563) the Hoare annotation is: (let ((.cse0 (* 4 main_~array_size~5))) (and (= .cse0 (select |#length| main_~numbers~5.base)) (= 0 main_~numbers~5.offset) (= 0 |main_#t~malloc9.offset|) (= 1 (select |#valid| main_~numbers~5.base)) (= 1 (select |#valid| |main_#t~malloc9.base|)) (= .cse0 (select |#length| |main_#t~malloc9.base|)) (= |old(#valid)| (store |#valid| |main_#t~malloc9.base| (select (store |#valid| |main_#t~malloc9.base| 0) |main_#t~malloc9.base|)))))
[2018-01-29 22:51:31,886 INFO L399 ceAbstractionStarter]: For program point L562'(line 562) no Hoare annotation was computed.
[2018-01-29 22:51:31,886 INFO L399 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed.
[2018-01-29 22:51:31,886 INFO L399 ceAbstractionStarter]: For program point L563'(line 563) no Hoare annotation was computed.
[2018-01-29 22:51:31,887 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 557 565) no Hoare annotation was computed.
[2018-01-29 22:51:31,887 INFO L399 ceAbstractionStarter]: For program point L559(lines 559 561) no Hoare annotation was computed.
[2018-01-29 22:51:31,887 INFO L399 ceAbstractionStarter]: For program point L558(line 558) no Hoare annotation was computed.
[2018-01-29 22:51:31,887 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 557 565) no Hoare annotation was computed.
[2018-01-29 22:51:31,887 INFO L395 ceAbstractionStarter]: At program point mainENTRY(lines 557 565) the Hoare annotation is: (= |#valid| |old(#valid)|)
[2018-01-29 22:51:31,887 INFO L399 ceAbstractionStarter]: For program point L562''(line 562) no Hoare annotation was computed.
[2018-01-29 22:51:31,887 INFO L399 ceAbstractionStarter]: For program point L559''(lines 559 561) no Hoare annotation was computed.
[2018-01-29 22:51:31,887 INFO L399 ceAbstractionStarter]: For program point L558'(line 558) no Hoare annotation was computed.
[2018-01-29 22:51:31,887 INFO L399 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 557 565) no Hoare annotation was computed.
[2018-01-29 22:51:31,896 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,897 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,897 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,897 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,898 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,898 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,899 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,899 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,900 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,900 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,900 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,901 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,901 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,901 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,901 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,902 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,904 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,904 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,905 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,905 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,905 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,906 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,906 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,906 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,907 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,907 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,907 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,907 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,908 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,908 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,908 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,908 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,909 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,909 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,909 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,920 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,920 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,920 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,921 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,921 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,921 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,922 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,922 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,923 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,923 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,923 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,923 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,924 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,924 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,924 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,924 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,925 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,925 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,925 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,926 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,926 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,926 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,926 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,927 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,927 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,927 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,927 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,928 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,928 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,928 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,928 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,929 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,929 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,929 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,929 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,933 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,933 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,934 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,934 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,934 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,934 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,935 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,935 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,935 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,936 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,936 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,936 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,936 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,937 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,937 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,937 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,939 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,939 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,940 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,940 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,940 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,940 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,941 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,941 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,941 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,941 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,942 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,942 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,942 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,942 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,942 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,943 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 10:51:31 BoogieIcfgContainer
[2018-01-29 22:51:31,945 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2018-01-29 22:51:31,946 INFO L168 Benchmark]: Toolchain (without parser) took 9243.95 ms. Allocated memory was 303.0 MB in the beginning and 561.0 MB in the end (delta: 257.9 MB). Free memory was 262.9 MB in the beginning and 503.9 MB in the end (delta: -241.0 MB). Peak memory consumption was 185.3 MB. Max. memory is 5.3 GB.
[2018-01-29 22:51:31,948 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 303.0 MB. Free memory is still 268.9 MB. There was no memory consumed. Max. memory is 5.3 GB.
[2018-01-29 22:51:31,948 INFO L168 Benchmark]: CACSL2BoogieTranslator took 204.24 ms. Allocated memory is still 303.0 MB. Free memory was 261.9 MB in the beginning and 251.8 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB.
[2018-01-29 22:51:31,949 INFO L168 Benchmark]: Boogie Preprocessor took 30.89 ms. Allocated memory is still 303.0 MB. Free memory was 251.8 MB in the beginning and 249.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB.
[2018-01-29 22:51:31,949 INFO L168 Benchmark]: RCFGBuilder took 321.30 ms. Allocated memory is still 303.0 MB. Free memory was 249.8 MB in the beginning and 229.8 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 5.3 GB.
[2018-01-29 22:51:31,949 INFO L168 Benchmark]: TraceAbstraction took 8679.22 ms. Allocated memory was 303.0 MB in the beginning and 561.0 MB in the end (delta: 257.9 MB). Free memory was 229.8 MB in the beginning and 503.9 MB in the end (delta: -274.1 MB). Peak memory consumption was 152.2 MB. Max. memory is 5.3 GB.
[2018-01-29 22:51:31,951 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.11 ms. Allocated memory is still 303.0 MB. Free memory is still 268.9 MB. There was no memory consumed. Max. memory is 5.3 GB.
* CACSL2BoogieTranslator took 204.24 ms. Allocated memory is still 303.0 MB. Free memory was 261.9 MB in the beginning and 251.8 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB.
* Boogie Preprocessor took 30.89 ms. Allocated memory is still 303.0 MB. Free memory was 251.8 MB in the beginning and 249.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB.
* RCFGBuilder took 321.30 ms. Allocated memory is still 303.0 MB. Free memory was 249.8 MB in the beginning and 229.8 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 5.3 GB.
* TraceAbstraction took 8679.22 ms. Allocated memory was 303.0 MB in the beginning and 561.0 MB in the end (delta: 257.9 MB). Free memory was 229.8 MB in the beginning and 503.9 MB in the end (delta: -274.1 MB). Peak memory consumption was 152.2 MB. Max. memory is 5.3 GB.
* Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor:
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator:
- GenericResult: Unfinished Backtranslation
unknown boogie variable #length
- GenericResult: Unfinished Backtranslation
unknown boogie variable #length
- GenericResult: Unfinished Backtranslation
unknown boogie variable #length
- GenericResult: Unfinished Backtranslation
unknown boogie variable #length
- GenericResult: Unfinished Backtranslation
unknown boogie variable #length
- GenericResult: Unfinished Backtranslation
unknown boogie variable #length
- GenericResult: Unfinished Backtranslation
unknown boogie variable #length
- GenericResult: Unfinished Backtranslation
unknown boogie variable #length
- GenericResult: Unfinished Backtranslation
unknown boogie variable #length
- GenericResult: Unfinished Backtranslation
unknown boogie variable #length
- GenericResult: Unfinished Backtranslation
unknown boogie variable #length
- GenericResult: Unfinished Backtranslation
unknown boogie variable #length
- GenericResult: Unfinished Backtranslation
unknown boogie variable #length
- GenericResult: Unfinished Backtranslation
unknown boogie variable #length
- GenericResult: Unfinished Backtranslation
unknown boogie variable #length
- GenericResult: Unfinished Backtranslation
unknown boogie variable #length
- GenericResult: Unfinished Backtranslation
unknown boogie variable #length
- GenericResult: Unfinished Backtranslation
unknown boogie variable #length
- GenericResult: Unfinished Backtranslation
unknown boogie variable #length
- GenericResult: Unfinished Backtranslation
unknown boogie variable #length
- GenericResult: Unfinished Backtranslation
unknown boogie variable #length
- GenericResult: Unfinished Backtranslation
unknown boogie variable #length
- GenericResult: Unfinished Backtranslation
unknown boogie variable #length
- GenericResult: Unfinished Backtranslation
unknown boogie variable #length
- GenericResult: Unfinished Backtranslation
unknown boogie variable #length
- GenericResult: Unfinished Backtranslation
unknown boogie variable #length
- GenericResult: Unfinished Backtranslation
unknown boogie variable #length
- GenericResult: Unfinished Backtranslation
unknown boogie variable #length
- GenericResult: Unfinished Backtranslation
unknown boogie variable #length
- GenericResult: Unfinished Backtranslation
unknown boogie variable #length
- GenericResult: Unfinished Backtranslation
unknown boogie variable #length
- GenericResult: Unfinished Backtranslation
unknown boogie variable #length
- GenericResult: Unfinished Backtranslation
unknown boogie variable #length
- GenericResult: Unfinished Backtranslation
unknown boogie variable #length
- GenericResult: Unfinished Backtranslation
unknown boogie variable #length
- GenericResult: Unfinished Backtranslation
unknown boogie variable #length
- GenericResult: Unfinished Backtranslation
unknown boogie variable #length
- GenericResult: Unfinished Backtranslation
unknown boogie variable #length
- GenericResult: Unfinished Backtranslation
unknown boogie variable #length
- GenericResult: Unfinished Backtranslation
unknown boogie variable #length
- GenericResult: Unfinished Backtranslation
unknown boogie variable #length
- GenericResult: Unfinished Backtranslation
unknown boogie variable #length
- GenericResult: Unfinished Backtranslation
unknown boogie variable #length
- GenericResult: Unfinished Backtranslation
unknown boogie variable #length
- GenericResult: Unfinished Backtranslation
unknown boogie variable #length
- GenericResult: Unfinished Backtranslation
unknown boogie variable #length
- GenericResult: Unfinished Backtranslation
unknown boogie variable #length
- GenericResult: Unfinished Backtranslation
unknown boogie variable #length
- GenericResult: Unfinished Backtranslation
unknown boogie variable #length
- GenericResult: Unfinished Backtranslation
unknown boogie variable #length
- GenericResult: Unfinished Backtranslation
unknown boogie variable #length
- GenericResult: Unfinished Backtranslation
unknown boogie variable #length
- GenericResult: Unfinished Backtranslation
unknown boogie variable #length
- GenericResult: Unfinished Backtranslation
unknown boogie variable #length
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- PositiveResult [Line: 1]: pointer dereference always succeeds
For all program executions holds that pointer dereference always succeeds at this location
- PositiveResult [Line: 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
- InvariantResult [Line: 547]: Loop Invariant
[2018-01-29 22:51:31,960 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,960 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,960 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,961 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,961 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,961 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,962 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,962 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,962 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,963 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,963 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,963 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,963 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,963 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,964 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,964 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,964 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,964 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,965 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,965 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,965 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,965 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,965 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,966 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,966 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,966 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,966 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,967 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,967 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,967 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,967 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,967 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,967 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,968 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,968 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,971 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,971 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,971 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,972 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,972 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,972 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,973 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,973 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,973 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,973 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,974 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,974 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,974 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,974 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,975 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,975 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,975 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,975 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,976 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,976 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,976 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,976 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,976 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,977 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,977 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,977 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,977 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,977 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,978 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,978 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,978 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,978 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,978 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,979 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,979 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
Derived loop invariant: ((((((((((((((1 == \valid[a] && a == 0) && i + 2 <= array_size) && i == min) && (\exists v_main_~array_size~5_BEFORE_CALL_1 : int :: \old(array_size) <= v_main_~array_size~5_BEFORE_CALL_1 && 4 * v_main_~array_size~5_BEFORE_CALL_1 == unknown-#length-unknown[a])) && 1 <= i) && i + 2 <= j) && 4 * array_size <= unknown-#length-unknown[a]) && j <= i + 2) || (((((((((((1 == \valid[a] && a == 0) && i + 2 <= array_size) && min == 0) && (\exists v_main_~array_size~5_BEFORE_CALL_1 : int :: \old(array_size) <= v_main_~array_size~5_BEFORE_CALL_1 && 4 * v_main_~array_size~5_BEFORE_CALL_1 == unknown-#length-unknown[a])) && 0 == a) && 1 == \valid[a]) && i == 0) && 4 * array_size <= unknown-#length-unknown[a]) || ((((((((((1 == \valid[a] && a == 0) && 0 <= i) && i + 2 <= array_size) && min + 1 <= j) && a + 4 * min + 4 <= unknown-#length-unknown[a]) && (\exists v_main_~array_size~5_BEFORE_CALL_1 : int :: \old(array_size) <= v_main_~array_size~5_BEFORE_CALL_1 && 4 * v_main_~array_size~5_BEFORE_CALL_1 == unknown-#length-unknown[a])) && 0 == a) && i + 1 <= min) && 1 == \valid[a]) && 4 * array_size <= unknown-#length-unknown[a])) && a + 4 * i + 12 <= unknown-#length-unknown[a]) && i + 2 <= j)) || !(\valid[a] == 1)) || !(0 == a)) || (((((((((((1 == \valid[a] && a == 0) && i + 2 <= array_size) && min == 0) && (\exists v_main_~array_size~5_BEFORE_CALL_1 : int :: \old(array_size) <= v_main_~array_size~5_BEFORE_CALL_1 && 4 * v_main_~array_size~5_BEFORE_CALL_1 == unknown-#length-unknown[a])) && 0 == a) && 1 == \valid[a]) && i == 0) && 4 * array_size <= unknown-#length-unknown[a]) || ((((((((((1 == \valid[a] && a == 0) && 0 <= i) && i + 2 <= array_size) && min + 1 <= j) && a + 4 * min + 4 <= unknown-#length-unknown[a]) && (\exists v_main_~array_size~5_BEFORE_CALL_1 : int :: \old(array_size) <= v_main_~array_size~5_BEFORE_CALL_1 && 4 * v_main_~array_size~5_BEFORE_CALL_1 == unknown-#length-unknown[a])) && 0 == a) && i + 1 <= min) && 1 == \valid[a]) && 4 * array_size <= unknown-#length-unknown[a])) && i + 2 <= j) && j <= i + 2)) || !(\exists v_main_~array_size~5_BEFORE_CALL_1 : int :: \old(array_size) <= v_main_~array_size~5_BEFORE_CALL_1 && 4 * v_main_~array_size~5_BEFORE_CALL_1 == unknown-#length-unknown[a])) || ((((((((1 == \valid[a] && a == 0) && i + 2 <= array_size) && j <= i + 1) && i == min) && (\exists v_main_~array_size~5_BEFORE_CALL_1 : int :: \old(array_size) <= v_main_~array_size~5_BEFORE_CALL_1 && 4 * v_main_~array_size~5_BEFORE_CALL_1 == unknown-#length-unknown[a])) && i + 1 <= j) && 1 <= j) && 4 * array_size <= unknown-#length-unknown[a])) || ((((((((1 == \valid[a] && a == 0) && i + 2 <= array_size) && i == min) && (\exists v_main_~array_size~5_BEFORE_CALL_1 : int :: \old(array_size) <= v_main_~array_size~5_BEFORE_CALL_1 && 4 * v_main_~array_size~5_BEFORE_CALL_1 == unknown-#length-unknown[a])) && a + 4 * i + 12 <= unknown-#length-unknown[a]) && 1 <= i) && i + 2 <= j) && 4 * array_size <= unknown-#length-unknown[a])
- InvariantResult [Line: 543]: Loop Invariant
[2018-01-29 22:51:31,980 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,981 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,981 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,981 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,981 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,982 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,982 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,982 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,982 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,983 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,983 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,983 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,983 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,983 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,983 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,984 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,985 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,985 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,986 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,986 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,986 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,986 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,987 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,987 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED]
[2018-01-29 22:51:31,987 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,987 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,987 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,988 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,988 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,988 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,988 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:51:31,988 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
Derived loop invariant: ((((((array_size <= i + 1 && j <= i + 1) && ((((1 == \valid[a] && a == 0) && 2 <= j) && 0 <= i) && (\exists v_main_~array_size~5_BEFORE_CALL_1 : int :: \old(array_size) <= v_main_~array_size~5_BEFORE_CALL_1 && 4 * v_main_~array_size~5_BEFORE_CALL_1 == unknown-#length-unknown[a])) && 4 * array_size <= unknown-#length-unknown[a]) || ((a + 4 * i + 8 <= unknown-#length-unknown[a] && i + 1 <= j) && ((((1 == \valid[a] && a == 0) && 2 <= j) && 0 <= i) && (\exists v_main_~array_size~5_BEFORE_CALL_1 : int :: \old(array_size) <= v_main_~array_size~5_BEFORE_CALL_1 && 4 * v_main_~array_size~5_BEFORE_CALL_1 == unknown-#length-unknown[a])) && 4 * array_size <= unknown-#length-unknown[a])) || !(\exists v_main_~array_size~5_BEFORE_CALL_1 : int :: \old(array_size) <= v_main_~array_size~5_BEFORE_CALL_1 && 4 * v_main_~array_size~5_BEFORE_CALL_1 == unknown-#length-unknown[a])) || ((((1 == \valid[a] && a == 0) && (\exists v_main_~array_size~5_BEFORE_CALL_1 : int :: \old(array_size) <= v_main_~array_size~5_BEFORE_CALL_1 && 4 * v_main_~array_size~5_BEFORE_CALL_1 == unknown-#length-unknown[a])) && i == 0) && 4 * array_size <= unknown-#length-unknown[a])) || !(\valid[a] == 1)) || !(0 == a)
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 4 procedures, 70 locations, 13 error locations. SAFE Result, 8.5s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 2.8s AutomataDifference, 0.0s DeadEndRemovalTime, 2.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 553 SDtfs, 2283 SDslu, 1968 SDs, 0 SdLazy, 1812 SolverSat, 139 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 375 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114occurred in iteration=8, 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.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 216 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 20 NumberOfFragments, 628 HoareAnnotationTreeSize, 8 FomulaSimplifications, 2804 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 8 FomulaSimplificationsInter, 3996 FormulaSimplificationTreeSizeReductionInter, 2.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 640 NumberOfCodeBlocks, 640 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 624 ConstructedInterpolants, 26 QuantifiedInterpolants, 167047 SizeOfPredicates, 22 NumberOfNonLiveVariables, 617 ConjunctsInSsa, 59 ConjunctsInUnsatCore, 16 InterpolantComputations, 6 PerfectInterpolantSequences, 67/110 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be correct!
Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/selectionsort-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-29_22-51-31-994.csv
Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/selectionsort-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-29_22-51-31-994.csv
Received shutdown request...