java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/loop-invgen/heapsort_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-3142e50-m [2018-09-10 10:14:00,894 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-10 10:14:00,896 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-10 10:14:00,910 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-10 10:14:00,910 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-10 10:14:00,912 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-10 10:14:00,913 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-10 10:14:00,915 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-10 10:14:00,917 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-10 10:14:00,918 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-10 10:14:00,919 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-10 10:14:00,919 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-10 10:14:00,920 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-10 10:14:00,921 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-10 10:14:00,923 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-10 10:14:00,924 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-10 10:14:00,924 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-10 10:14:00,927 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-10 10:14:00,931 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-10 10:14:00,933 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-10 10:14:00,938 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-10 10:14:00,940 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-10 10:14:00,945 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-10 10:14:00,946 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-10 10:14:00,946 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-10 10:14:00,949 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-10 10:14:00,952 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-10 10:14:00,953 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-10 10:14:00,954 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-10 10:14:00,957 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-10 10:14:00,957 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-10 10:14:00,958 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-10 10:14:00,958 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-10 10:14:00,959 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-10 10:14:00,961 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-10 10:14:00,962 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-10 10:14:00,963 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf [2018-09-10 10:14:00,992 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-10 10:14:00,992 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-10 10:14:00,995 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-10 10:14:00,996 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-10 10:14:00,996 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-10 10:14:00,996 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-10 10:14:00,996 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-10 10:14:00,997 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-10 10:14:00,997 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-10 10:14:00,997 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-10 10:14:00,998 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-10 10:14:00,999 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-10 10:14:00,999 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-10 10:14:00,999 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-10 10:14:00,999 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-10 10:14:01,000 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-10 10:14:01,000 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-10 10:14:01,001 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-10 10:14:01,001 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-10 10:14:01,001 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-10 10:14:01,001 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-10 10:14:01,003 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-10 10:14:01,003 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-10 10:14:01,003 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-10 10:14:01,003 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-10 10:14:01,003 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-10 10:14:01,004 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-10 10:14:01,004 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-10 10:14:01,004 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-10 10:14:01,004 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-10 10:14:01,004 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-10 10:14:01,005 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-10 10:14:01,005 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-10 10:14:01,072 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-10 10:14:01,089 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-10 10:14:01,095 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-10 10:14:01,097 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-10 10:14:01,098 INFO L276 PluginConnector]: CDTParser initialized [2018-09-10 10:14:01,098 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/heapsort_true-unreach-call_true-termination.i [2018-09-10 10:14:01,467 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/102c7ccf2/5640694653094c3f8f09b90932e1d190/FLAG6855ad167 [2018-09-10 10:14:01,635 INFO L276 CDTParser]: Found 1 translation units. [2018-09-10 10:14:01,635 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/heapsort_true-unreach-call_true-termination.i [2018-09-10 10:14:01,643 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/102c7ccf2/5640694653094c3f8f09b90932e1d190/FLAG6855ad167 [2018-09-10 10:14:01,662 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/102c7ccf2/5640694653094c3f8f09b90932e1d190 [2018-09-10 10:14:01,674 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-10 10:14:01,678 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-10 10:14:01,679 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-10 10:14:01,679 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-10 10:14:01,686 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-10 10:14:01,687 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 10:14:01" (1/1) ... [2018-09-10 10:14:01,692 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56525e8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:14:01, skipping insertion in model container [2018-09-10 10:14:01,692 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 10:14:01" (1/1) ... [2018-09-10 10:14:01,860 INFO L180 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-09-10 10:14:01,909 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 10:14:01,927 INFO L431 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-10 10:14:01,939 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 10:14:01,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:14:01 WrapperNode [2018-09-10 10:14:01,953 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-10 10:14:01,954 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-10 10:14:01,954 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-10 10:14:01,955 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-10 10:14:01,962 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:14:01" (1/1) ... [2018-09-10 10:14:01,971 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:14:01" (1/1) ... [2018-09-10 10:14:01,977 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-10 10:14:01,978 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-10 10:14:01,978 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-10 10:14:01,978 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-10 10:14:01,988 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:14:01" (1/1) ... [2018-09-10 10:14:01,988 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:14:01" (1/1) ... [2018-09-10 10:14:01,990 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:14:01" (1/1) ... [2018-09-10 10:14:01,990 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:14:01" (1/1) ... [2018-09-10 10:14:01,993 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:14:01" (1/1) ... [2018-09-10 10:14:01,999 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:14:01" (1/1) ... [2018-09-10 10:14:02,002 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:14:01" (1/1) ... [2018-09-10 10:14:02,005 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-10 10:14:02,006 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-10 10:14:02,006 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-10 10:14:02,006 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-10 10:14:02,007 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:14:01" (1/1) ... No working directory specified, using /storage/repos/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-09-10 10:14:02,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-10 10:14:02,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-10 10:14:02,070 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_invgen_heapsort_true_unreach_call_true_termination_i____VERIFIER_assert [2018-09-10 10:14:02,070 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_invgen_heapsort_true_unreach_call_true_termination_i____VERIFIER_assert [2018-09-10 10:14:02,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-10 10:14:02,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-10 10:14:02,071 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-10 10:14:02,071 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-10 10:14:02,614 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-10 10:14:02,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 10:14:02 BoogieIcfgContainer [2018-09-10 10:14:02,615 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-10 10:14:02,616 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-10 10:14:02,616 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-10 10:14:02,620 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-10 10:14:02,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 10:14:01" (1/3) ... [2018-09-10 10:14:02,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e581f28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 10:14:02, skipping insertion in model container [2018-09-10 10:14:02,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:14:01" (2/3) ... [2018-09-10 10:14:02,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e581f28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 10:14:02, skipping insertion in model container [2018-09-10 10:14:02,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 10:14:02" (3/3) ... [2018-09-10 10:14:02,624 INFO L112 eAbstractionObserver]: Analyzing ICFG heapsort_true-unreach-call_true-termination.i [2018-09-10 10:14:02,634 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-10 10:14:02,643 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-10 10:14:02,691 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-10 10:14:02,692 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-10 10:14:02,692 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-10 10:14:02,692 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-10 10:14:02,692 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-10 10:14:02,693 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-10 10:14:02,693 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-10 10:14:02,693 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-10 10:14:02,693 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-10 10:14:02,712 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-09-10 10:14:02,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-10 10:14:02,719 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:14:02,720 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:14:02,721 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_invgen_heapsort_true_unreach_call_true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:14:02,727 INFO L82 PathProgramCache]: Analyzing trace with hash 397302021, now seen corresponding path program 1 times [2018-09-10 10:14:02,730 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:14:02,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:14:02,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:14:02,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:14:02,783 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:14:02,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:14:02,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:14:02,869 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:14:02,869 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-10 10:14:02,870 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:14:02,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-10 10:14:02,892 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-10 10:14:02,893 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-10 10:14:02,895 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2018-09-10 10:14:02,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:14:02,930 INFO L93 Difference]: Finished difference Result 83 states and 141 transitions. [2018-09-10 10:14:02,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-10 10:14:02,932 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-09-10 10:14:02,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:14:02,948 INFO L225 Difference]: With dead ends: 83 [2018-09-10 10:14:02,948 INFO L226 Difference]: Without dead ends: 40 [2018-09-10 10:14:02,954 INFO L604 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-09-10 10:14:02,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-09-10 10:14:03,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-09-10 10:14:03,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-09-10 10:14:03,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2018-09-10 10:14:03,011 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 59 transitions. Word has length 15 [2018-09-10 10:14:03,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:14:03,012 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 59 transitions. [2018-09-10 10:14:03,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-10 10:14:03,012 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions. [2018-09-10 10:14:03,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-10 10:14:03,013 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:14:03,014 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:14:03,014 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_invgen_heapsort_true_unreach_call_true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:14:03,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1054353405, now seen corresponding path program 1 times [2018-09-10 10:14:03,015 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:14:03,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:14:03,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:14:03,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:14:03,017 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:14:03,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:14:03,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:14:03,329 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:14:03,329 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-10 10:14:03,330 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:14:03,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 10:14:03,332 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 10:14:03,332 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-10 10:14:03,332 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. Second operand 5 states. [2018-09-10 10:14:03,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:14:03,575 INFO L93 Difference]: Finished difference Result 46 states and 64 transitions. [2018-09-10 10:14:03,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-10 10:14:03,576 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-09-10 10:14:03,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:14:03,577 INFO L225 Difference]: With dead ends: 46 [2018-09-10 10:14:03,577 INFO L226 Difference]: Without dead ends: 44 [2018-09-10 10:14:03,578 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-09-10 10:14:03,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-09-10 10:14:03,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-09-10 10:14:03,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-09-10 10:14:03,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 62 transitions. [2018-09-10 10:14:03,593 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 62 transitions. Word has length 16 [2018-09-10 10:14:03,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:14:03,593 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 62 transitions. [2018-09-10 10:14:03,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 10:14:03,593 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 62 transitions. [2018-09-10 10:14:03,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-10 10:14:03,594 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:14:03,594 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:14:03,595 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_invgen_heapsort_true_unreach_call_true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:14:03,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1049616636, now seen corresponding path program 1 times [2018-09-10 10:14:03,595 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:14:03,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:14:03,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:14:03,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:14:03,597 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:14:03,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:14:03,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:14:03,811 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:14:03,811 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-10 10:14:03,812 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:14:03,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 10:14:03,812 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 10:14:03,813 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-10 10:14:03,813 INFO L87 Difference]: Start difference. First operand 44 states and 62 transitions. Second operand 5 states. [2018-09-10 10:14:04,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:14:04,032 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2018-09-10 10:14:04,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-10 10:14:04,032 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-09-10 10:14:04,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:14:04,034 INFO L225 Difference]: With dead ends: 52 [2018-09-10 10:14:04,035 INFO L226 Difference]: Without dead ends: 50 [2018-09-10 10:14:04,035 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-09-10 10:14:04,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-09-10 10:14:04,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2018-09-10 10:14:04,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-09-10 10:14:04,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2018-09-10 10:14:04,046 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 65 transitions. Word has length 16 [2018-09-10 10:14:04,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:14:04,046 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 65 transitions. [2018-09-10 10:14:04,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 10:14:04,046 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2018-09-10 10:14:04,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-10 10:14:04,047 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:14:04,048 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:14:04,048 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_invgen_heapsort_true_unreach_call_true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:14:04,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1015923015, now seen corresponding path program 1 times [2018-09-10 10:14:04,048 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:14:04,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:14:04,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:14:04,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:14:04,050 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:14:04,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:14:04,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:14:04,163 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:14:04,163 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 10:14:04,164 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:14:04,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 10:14:04,164 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 10:14:04,164 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-10 10:14:04,165 INFO L87 Difference]: Start difference. First operand 48 states and 65 transitions. Second operand 6 states. [2018-09-10 10:14:04,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:14:04,561 INFO L93 Difference]: Finished difference Result 85 states and 120 transitions. [2018-09-10 10:14:04,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 10:14:04,562 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-09-10 10:14:04,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:14:04,563 INFO L225 Difference]: With dead ends: 85 [2018-09-10 10:14:04,563 INFO L226 Difference]: Without dead ends: 83 [2018-09-10 10:14:04,564 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-09-10 10:14:04,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-09-10 10:14:04,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 70. [2018-09-10 10:14:04,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-09-10 10:14:04,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 100 transitions. [2018-09-10 10:14:04,583 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 100 transitions. Word has length 16 [2018-09-10 10:14:04,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:14:04,583 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 100 transitions. [2018-09-10 10:14:04,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 10:14:04,584 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 100 transitions. [2018-09-10 10:14:04,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-10 10:14:04,585 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:14:04,585 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:14:04,585 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_invgen_heapsort_true_unreach_call_true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:14:04,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1028167116, now seen corresponding path program 1 times [2018-09-10 10:14:04,585 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:14:04,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:14:04,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:14:04,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:14:04,587 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:14:04,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:14:04,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:14:04,897 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:14:04,897 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 10:14:04,897 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:14:04,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 10:14:04,898 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 10:14:04,898 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-10 10:14:04,898 INFO L87 Difference]: Start difference. First operand 70 states and 100 transitions. Second operand 6 states. [2018-09-10 10:14:05,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:14:05,349 INFO L93 Difference]: Finished difference Result 129 states and 190 transitions. [2018-09-10 10:14:05,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 10:14:05,360 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-09-10 10:14:05,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:14:05,362 INFO L225 Difference]: With dead ends: 129 [2018-09-10 10:14:05,362 INFO L226 Difference]: Without dead ends: 127 [2018-09-10 10:14:05,363 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-09-10 10:14:05,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-09-10 10:14:05,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 98. [2018-09-10 10:14:05,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-09-10 10:14:05,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 144 transitions. [2018-09-10 10:14:05,405 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 144 transitions. Word has length 16 [2018-09-10 10:14:05,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:14:05,406 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 144 transitions. [2018-09-10 10:14:05,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 10:14:05,406 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 144 transitions. [2018-09-10 10:14:05,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-10 10:14:05,411 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:14:05,411 INFO L376 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:14:05,412 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_invgen_heapsort_true_unreach_call_true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:14:05,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1829298465, now seen corresponding path program 1 times [2018-09-10 10:14:05,413 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:14:05,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:14:05,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:14:05,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:14:05,415 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:14:05,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:14:05,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:14:05,585 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:14:05,586 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/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-09-10 10:14:05,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:14:05,601 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:14:05,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:14:05,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:14:05,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-10 10:14:05,952 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:14:06,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:14:06,132 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-10 10:14:06,132 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [9] total 15 [2018-09-10 10:14:06,132 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:14:06,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 10:14:06,133 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 10:14:06,133 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-09-10 10:14:06,134 INFO L87 Difference]: Start difference. First operand 98 states and 144 transitions. Second operand 5 states. [2018-09-10 10:14:06,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:14:06,962 INFO L93 Difference]: Finished difference Result 304 states and 478 transitions. [2018-09-10 10:14:06,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-10 10:14:06,965 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-09-10 10:14:06,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:14:06,972 INFO L225 Difference]: With dead ends: 304 [2018-09-10 10:14:06,973 INFO L226 Difference]: Without dead ends: 213 [2018-09-10 10:14:06,975 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2018-09-10 10:14:06,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-09-10 10:14:07,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 165. [2018-09-10 10:14:07,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-09-10 10:14:07,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 257 transitions. [2018-09-10 10:14:07,051 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 257 transitions. Word has length 21 [2018-09-10 10:14:07,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:14:07,051 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 257 transitions. [2018-09-10 10:14:07,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 10:14:07,052 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 257 transitions. [2018-09-10 10:14:07,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-10 10:14:07,053 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:14:07,053 INFO L376 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:14:07,053 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_invgen_heapsort_true_unreach_call_true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:14:07,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1289753751, now seen corresponding path program 1 times [2018-09-10 10:14:07,054 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:14:07,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:14:07,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:14:07,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:14:07,056 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:14:07,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:14:07,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:14:07,152 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:14:07,152 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/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-09-10 10:14:07,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:14:07,172 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:14:07,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:14:07,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:14:07,410 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:14:07,411 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:14:07,539 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:14:07,560 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:14:07,560 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:14:07,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:14:07,578 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:14:07,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:14:07,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:14:07,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:14:07,737 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:14:07,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:14:07,775 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 3 imperfect interpolant sequences. [2018-09-10 10:14:07,775 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [7, 9, 9] total 20 [2018-09-10 10:14:07,776 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:14:07,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-10 10:14:07,776 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-10 10:14:07,777 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2018-09-10 10:14:07,777 INFO L87 Difference]: Start difference. First operand 165 states and 257 transitions. Second operand 7 states. [2018-09-10 10:14:08,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:14:08,548 INFO L93 Difference]: Finished difference Result 252 states and 398 transitions. [2018-09-10 10:14:08,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-10 10:14:08,550 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-09-10 10:14:08,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:14:08,553 INFO L225 Difference]: With dead ends: 252 [2018-09-10 10:14:08,553 INFO L226 Difference]: Without dead ends: 250 [2018-09-10 10:14:08,558 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 69 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2018-09-10 10:14:08,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-09-10 10:14:08,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 197. [2018-09-10 10:14:08,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-09-10 10:14:08,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 313 transitions. [2018-09-10 10:14:08,625 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 313 transitions. Word has length 21 [2018-09-10 10:14:08,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:14:08,626 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 313 transitions. [2018-09-10 10:14:08,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-10 10:14:08,626 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 313 transitions. [2018-09-10 10:14:08,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-10 10:14:08,630 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:14:08,630 INFO L376 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:14:08,630 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_invgen_heapsort_true_unreach_call_true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:14:08,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1185805153, now seen corresponding path program 1 times [2018-09-10 10:14:08,632 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:14:08,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:14:08,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:14:08,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:14:08,634 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:14:08,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:14:08,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:14:08,687 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:14:08,687 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 10:14:08,687 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:14:08,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:14:08,688 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:14:08,689 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:14:08,689 INFO L87 Difference]: Start difference. First operand 197 states and 313 transitions. Second operand 3 states. [2018-09-10 10:14:08,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:14:08,769 INFO L93 Difference]: Finished difference Result 257 states and 400 transitions. [2018-09-10 10:14:08,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:14:08,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-09-10 10:14:08,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:14:08,777 INFO L225 Difference]: With dead ends: 257 [2018-09-10 10:14:08,777 INFO L226 Difference]: Without dead ends: 194 [2018-09-10 10:14:08,779 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:14:08,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-09-10 10:14:08,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2018-09-10 10:14:08,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-09-10 10:14:08,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 306 transitions. [2018-09-10 10:14:08,829 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 306 transitions. Word has length 21 [2018-09-10 10:14:08,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:14:08,830 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 306 transitions. [2018-09-10 10:14:08,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:14:08,830 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 306 transitions. [2018-09-10 10:14:08,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-10 10:14:08,831 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:14:08,831 INFO L376 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:14:08,833 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_invgen_heapsort_true_unreach_call_true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:14:08,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1567167616, now seen corresponding path program 1 times [2018-09-10 10:14:08,834 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:14:08,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:14:08,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:14:08,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:14:08,835 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:14:08,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:14:08,940 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:14:08,941 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:14:08,941 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-10 10:14:08,941 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:14:08,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-10 10:14:08,942 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-10 10:14:08,942 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-10 10:14:08,942 INFO L87 Difference]: Start difference. First operand 194 states and 306 transitions. Second operand 4 states. [2018-09-10 10:14:09,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:14:09,385 INFO L93 Difference]: Finished difference Result 331 states and 520 transitions. [2018-09-10 10:14:09,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-10 10:14:09,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-09-10 10:14:09,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:14:09,391 INFO L225 Difference]: With dead ends: 331 [2018-09-10 10:14:09,391 INFO L226 Difference]: Without dead ends: 247 [2018-09-10 10:14:09,392 INFO L604 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-09-10 10:14:09,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-09-10 10:14:09,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 198. [2018-09-10 10:14:09,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-09-10 10:14:09,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 310 transitions. [2018-09-10 10:14:09,444 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 310 transitions. Word has length 21 [2018-09-10 10:14:09,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:14:09,445 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 310 transitions. [2018-09-10 10:14:09,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-10 10:14:09,446 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 310 transitions. [2018-09-10 10:14:09,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-10 10:14:09,446 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:14:09,447 INFO L376 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:14:09,447 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_invgen_heapsort_true_unreach_call_true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:14:09,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1725349867, now seen corresponding path program 1 times [2018-09-10 10:14:09,451 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:14:09,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:14:09,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:14:09,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:14:09,454 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:14:09,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:14:09,598 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:14:09,598 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:14:09,599 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/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-09-10 10:14:09,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:14:09,610 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:14:09,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:14:09,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:14:09,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:14:09,717 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:14:09,795 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:14:09,815 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-10 10:14:09,816 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [8] total 12 [2018-09-10 10:14:09,816 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:14:09,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-10 10:14:09,816 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-10 10:14:09,817 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-09-10 10:14:09,817 INFO L87 Difference]: Start difference. First operand 198 states and 310 transitions. Second operand 7 states. [2018-09-10 10:14:10,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:14:10,831 INFO L93 Difference]: Finished difference Result 281 states and 438 transitions. [2018-09-10 10:14:10,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-10 10:14:10,836 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-09-10 10:14:10,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:14:10,839 INFO L225 Difference]: With dead ends: 281 [2018-09-10 10:14:10,839 INFO L226 Difference]: Without dead ends: 279 [2018-09-10 10:14:10,840 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-09-10 10:14:10,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-09-10 10:14:10,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 246. [2018-09-10 10:14:10,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-09-10 10:14:10,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 391 transitions. [2018-09-10 10:14:10,886 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 391 transitions. Word has length 21 [2018-09-10 10:14:10,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:14:10,887 INFO L480 AbstractCegarLoop]: Abstraction has 246 states and 391 transitions. [2018-09-10 10:14:10,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-10 10:14:10,887 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 391 transitions. [2018-09-10 10:14:10,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-10 10:14:10,888 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:14:10,888 INFO L376 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:14:10,889 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_invgen_heapsort_true_unreach_call_true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:14:10,889 INFO L82 PathProgramCache]: Analyzing trace with hash -999582530, now seen corresponding path program 1 times [2018-09-10 10:14:10,889 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:14:10,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:14:10,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:14:10,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:14:10,891 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:14:10,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:14:10,983 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-10 10:14:10,984 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:14:10,984 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/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-09-10 10:14:10,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:14:10,993 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:14:11,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:14:11,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:14:11,045 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-09-10 10:14:11,045 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:14:11,167 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-09-10 10:14:11,187 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-10 10:14:11,187 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [7] total 9 [2018-09-10 10:14:11,188 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:14:11,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 10:14:11,188 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 10:14:11,188 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-09-10 10:14:11,189 INFO L87 Difference]: Start difference. First operand 246 states and 391 transitions. Second operand 6 states. [2018-09-10 10:14:11,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:14:11,574 INFO L93 Difference]: Finished difference Result 322 states and 520 transitions. [2018-09-10 10:14:11,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 10:14:11,576 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-09-10 10:14:11,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:14:11,579 INFO L225 Difference]: With dead ends: 322 [2018-09-10 10:14:11,579 INFO L226 Difference]: Without dead ends: 320 [2018-09-10 10:14:11,580 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-09-10 10:14:11,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-09-10 10:14:11,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 289. [2018-09-10 10:14:11,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-09-10 10:14:11,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 465 transitions. [2018-09-10 10:14:11,639 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 465 transitions. Word has length 28 [2018-09-10 10:14:11,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:14:11,640 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 465 transitions. [2018-09-10 10:14:11,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 10:14:11,641 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 465 transitions. [2018-09-10 10:14:11,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-09-10 10:14:11,643 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:14:11,643 INFO L376 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:14:11,645 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_invgen_heapsort_true_unreach_call_true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:14:11,646 INFO L82 PathProgramCache]: Analyzing trace with hash 793690116, now seen corresponding path program 1 times [2018-09-10 10:14:11,646 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:14:11,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:14:11,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:14:11,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:14:11,647 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:14:11,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:14:12,113 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-09-10 10:14:12,113 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:14:12,113 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:14:12,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:14:12,124 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:14:12,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:14:12,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:14:12,503 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-09-10 10:14:12,504 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:14:12,676 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-09-10 10:14:12,696 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:14:12,696 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:14:12,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:14:12,714 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:14:12,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:14:12,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:14:12,874 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-09-10 10:14:12,874 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:14:13,023 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-09-10 10:14:13,025 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 3 imperfect interpolant sequences. [2018-09-10 10:14:13,025 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [8, 10, 9] total 21 [2018-09-10 10:14:13,025 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:14:13,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-10 10:14:13,026 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-10 10:14:13,026 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2018-09-10 10:14:13,026 INFO L87 Difference]: Start difference. First operand 289 states and 465 transitions. Second operand 7 states. [2018-09-10 10:14:13,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:14:13,962 INFO L93 Difference]: Finished difference Result 460 states and 751 transitions. [2018-09-10 10:14:13,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 10:14:13,963 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-09-10 10:14:13,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:14:13,967 INFO L225 Difference]: With dead ends: 460 [2018-09-10 10:14:13,967 INFO L226 Difference]: Without dead ends: 458 [2018-09-10 10:14:13,968 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 118 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2018-09-10 10:14:13,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-09-10 10:14:14,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 407. [2018-09-10 10:14:14,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2018-09-10 10:14:14,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 664 transitions. [2018-09-10 10:14:14,040 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 664 transitions. Word has length 33 [2018-09-10 10:14:14,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:14:14,040 INFO L480 AbstractCegarLoop]: Abstraction has 407 states and 664 transitions. [2018-09-10 10:14:14,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-10 10:14:14,040 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 664 transitions. [2018-09-10 10:14:14,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-09-10 10:14:14,041 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:14:14,041 INFO L376 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:14:14,042 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_invgen_heapsort_true_unreach_call_true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:14:14,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1578049146, now seen corresponding path program 1 times [2018-09-10 10:14:14,042 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:14:14,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:14:14,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:14:14,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:14:14,044 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:14:14,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:14:14,234 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-09-10 10:14:14,234 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:14:14,234 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:14:14,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:14:14,242 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:14:14,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:14:14,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:14:14,416 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-09-10 10:14:14,416 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:14:14,552 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-09-10 10:14:14,572 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-10 10:14:14,572 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [8] total 17 [2018-09-10 10:14:14,573 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:14:14,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-10 10:14:14,573 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-10 10:14:14,574 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-09-10 10:14:14,574 INFO L87 Difference]: Start difference. First operand 407 states and 664 transitions. Second operand 8 states. [2018-09-10 10:14:15,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:14:15,218 INFO L93 Difference]: Finished difference Result 441 states and 701 transitions. [2018-09-10 10:14:15,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-10 10:14:15,223 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-09-10 10:14:15,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:14:15,227 INFO L225 Difference]: With dead ends: 441 [2018-09-10 10:14:15,227 INFO L226 Difference]: Without dead ends: 439 [2018-09-10 10:14:15,228 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2018-09-10 10:14:15,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2018-09-10 10:14:15,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 419. [2018-09-10 10:14:15,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-09-10 10:14:15,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 673 transitions. [2018-09-10 10:14:15,302 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 673 transitions. Word has length 33 [2018-09-10 10:14:15,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:14:15,303 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 673 transitions. [2018-09-10 10:14:15,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-10 10:14:15,303 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 673 transitions. [2018-09-10 10:14:15,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-09-10 10:14:15,304 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:14:15,305 INFO L376 BasicCegarLoop]: trace histogram [6, 5, 5, 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-09-10 10:14:15,305 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_invgen_heapsort_true_unreach_call_true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:14:15,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1056264363, now seen corresponding path program 1 times [2018-09-10 10:14:15,305 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:14:15,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:14:15,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:14:15,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:14:15,306 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:14:15,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:14:15,396 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-09-10 10:14:15,396 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:14:15,397 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:14:15,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:14:15,405 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:14:15,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:14:15,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:14:15,452 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-09-10 10:14:15,452 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:14:15,520 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-09-10 10:14:15,541 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-10 10:14:15,541 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [8] total 10 [2018-09-10 10:14:15,541 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:14:15,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-10 10:14:15,542 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-10 10:14:15,542 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-09-10 10:14:15,542 INFO L87 Difference]: Start difference. First operand 419 states and 673 transitions. Second operand 7 states. [2018-09-10 10:14:16,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:14:16,782 INFO L93 Difference]: Finished difference Result 525 states and 836 transitions. [2018-09-10 10:14:16,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 10:14:16,785 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2018-09-10 10:14:16,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:14:16,789 INFO L225 Difference]: With dead ends: 525 [2018-09-10 10:14:16,790 INFO L226 Difference]: Without dead ends: 523 [2018-09-10 10:14:16,790 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-09-10 10:14:16,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2018-09-10 10:14:16,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 423. [2018-09-10 10:14:16,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-09-10 10:14:16,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 676 transitions. [2018-09-10 10:14:16,864 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 676 transitions. Word has length 43 [2018-09-10 10:14:16,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:14:16,864 INFO L480 AbstractCegarLoop]: Abstraction has 423 states and 676 transitions. [2018-09-10 10:14:16,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-10 10:14:16,864 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 676 transitions. [2018-09-10 10:14:16,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-09-10 10:14:16,865 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:14:16,866 INFO L376 BasicCegarLoop]: trace histogram [5, 4, 4, 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] [2018-09-10 10:14:16,866 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_invgen_heapsort_true_unreach_call_true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:14:16,866 INFO L82 PathProgramCache]: Analyzing trace with hash 694556156, now seen corresponding path program 1 times [2018-09-10 10:14:16,866 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:14:16,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:14:16,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:14:16,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:14:16,867 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:14:16,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:14:16,983 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-09-10 10:14:16,983 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:14:16,983 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:14:16,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:14:16,992 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:14:17,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:14:17,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:14:17,062 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-09-10 10:14:17,063 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:14:17,123 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-09-10 10:14:17,147 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-10 10:14:17,147 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [8] total 11 [2018-09-10 10:14:17,147 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:14:17,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-10 10:14:17,148 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-10 10:14:17,148 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-09-10 10:14:17,148 INFO L87 Difference]: Start difference. First operand 423 states and 676 transitions. Second operand 7 states. [2018-09-10 10:14:17,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:14:17,493 INFO L93 Difference]: Finished difference Result 431 states and 683 transitions. [2018-09-10 10:14:17,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 10:14:17,494 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2018-09-10 10:14:17,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:14:17,497 INFO L225 Difference]: With dead ends: 431 [2018-09-10 10:14:17,497 INFO L226 Difference]: Without dead ends: 429 [2018-09-10 10:14:17,498 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 86 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-09-10 10:14:17,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2018-09-10 10:14:17,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 427. [2018-09-10 10:14:17,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-09-10 10:14:17,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 679 transitions. [2018-09-10 10:14:17,585 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 679 transitions. Word has length 45 [2018-09-10 10:14:17,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:14:17,586 INFO L480 AbstractCegarLoop]: Abstraction has 427 states and 679 transitions. [2018-09-10 10:14:17,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-10 10:14:17,586 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 679 transitions. [2018-09-10 10:14:17,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-09-10 10:14:17,588 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:14:17,588 INFO L376 BasicCegarLoop]: trace histogram [7, 6, 6, 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] [2018-09-10 10:14:17,588 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_invgen_heapsort_true_unreach_call_true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:14:17,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1909380230, now seen corresponding path program 1 times [2018-09-10 10:14:17,588 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:14:17,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:14:17,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:14:17,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:14:17,590 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:14:17,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:14:17,994 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 20 proven. 16 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-09-10 10:14:17,995 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:14:17,995 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:14:18,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:14:18,004 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:14:18,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:14:18,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:14:18,302 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 46 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-09-10 10:14:18,302 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:14:18,511 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-09-10 10:14:18,532 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:14:18,532 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:14:18,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:14:18,549 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:14:18,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:14:18,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:14:18,797 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 46 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-09-10 10:14:18,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:14:18,949 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-09-10 10:14:18,951 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:14:18,951 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6, 6, 6] total 21 [2018-09-10 10:14:18,951 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:14:18,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-10 10:14:18,953 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-10 10:14:18,953 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2018-09-10 10:14:18,954 INFO L87 Difference]: Start difference. First operand 427 states and 679 transitions. Second operand 12 states. [2018-09-10 10:14:21,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:14:21,390 INFO L93 Difference]: Finished difference Result 686 states and 1068 transitions. [2018-09-10 10:14:21,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-10 10:14:21,390 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2018-09-10 10:14:21,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:14:21,392 INFO L225 Difference]: With dead ends: 686 [2018-09-10 10:14:21,392 INFO L226 Difference]: Without dead ends: 217 [2018-09-10 10:14:21,395 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 220 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2018-09-10 10:14:21,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-09-10 10:14:21,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 205. [2018-09-10 10:14:21,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-09-10 10:14:21,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 309 transitions. [2018-09-10 10:14:21,450 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 309 transitions. Word has length 57 [2018-09-10 10:14:21,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:14:21,451 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 309 transitions. [2018-09-10 10:14:21,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-10 10:14:21,451 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 309 transitions. [2018-09-10 10:14:21,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-09-10 10:14:21,453 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:14:21,454 INFO L376 BasicCegarLoop]: trace histogram [10, 9, 9, 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] [2018-09-10 10:14:21,454 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_invgen_heapsort_true_unreach_call_true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:14:21,454 INFO L82 PathProgramCache]: Analyzing trace with hash 763076711, now seen corresponding path program 1 times [2018-09-10 10:14:21,454 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:14:21,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:14:21,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:14:21,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:14:21,455 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:14:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:14:21,731 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-09-10 10:14:21,731 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:14:21,732 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:14:21,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:14:21,740 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:14:21,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:14:21,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:14:21,856 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-09-10 10:14:21,856 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:14:21,915 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-09-10 10:14:21,936 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-10 10:14:21,936 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 6] total 12 [2018-09-10 10:14:21,936 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:14:21,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 10:14:21,937 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 10:14:21,937 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-09-10 10:14:21,937 INFO L87 Difference]: Start difference. First operand 205 states and 309 transitions. Second operand 6 states. [2018-09-10 10:14:22,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:14:22,200 INFO L93 Difference]: Finished difference Result 391 states and 586 transitions. [2018-09-10 10:14:22,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-10 10:14:22,203 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-09-10 10:14:22,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:14:22,205 INFO L225 Difference]: With dead ends: 391 [2018-09-10 10:14:22,205 INFO L226 Difference]: Without dead ends: 226 [2018-09-10 10:14:22,206 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2018-09-10 10:14:22,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-09-10 10:14:22,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 208. [2018-09-10 10:14:22,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-09-10 10:14:22,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 312 transitions. [2018-09-10 10:14:22,250 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 312 transitions. Word has length 69 [2018-09-10 10:14:22,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:14:22,251 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 312 transitions. [2018-09-10 10:14:22,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 10:14:22,251 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 312 transitions. [2018-09-10 10:14:22,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-09-10 10:14:22,252 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:14:22,252 INFO L376 BasicCegarLoop]: trace histogram [14, 13, 13, 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-09-10 10:14:22,253 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_invgen_heapsort_true_unreach_call_true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:14:22,253 INFO L82 PathProgramCache]: Analyzing trace with hash 109885865, now seen corresponding path program 1 times [2018-09-10 10:14:22,253 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:14:22,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:14:22,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:14:22,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:14:22,254 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:14:22,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:14:22,758 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 25 proven. 46 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-09-10 10:14:22,759 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:14:22,759 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:14:22,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:14:22,768 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:14:22,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:14:22,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:14:22,993 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 28 proven. 7 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-09-10 10:14:22,993 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:14:23,170 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-09-10 10:14:23,191 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:14:23,192 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:14:23,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:14:23,207 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:14:23,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:14:23,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:14:31,676 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2018-09-10 10:14:31,677 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:14:31,844 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 33 proven. 2 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-09-10 10:14:31,846 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 4 imperfect interpolant sequences. [2018-09-10 10:14:31,846 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 10, 10, 7] total 31 [2018-09-10 10:14:31,846 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:14:31,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-10 10:14:31,847 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-10 10:14:31,847 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=810, Unknown=3, NotChecked=0, Total=930 [2018-09-10 10:14:31,847 INFO L87 Difference]: Start difference. First operand 208 states and 312 transitions. Second operand 7 states. [2018-09-10 10:14:46,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:14:46,280 INFO L93 Difference]: Finished difference Result 384 states and 566 transitions. [2018-09-10 10:14:46,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 10:14:46,280 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-09-10 10:14:46,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:14:46,282 INFO L225 Difference]: With dead ends: 384 [2018-09-10 10:14:46,282 INFO L226 Difference]: Without dead ends: 216 [2018-09-10 10:14:46,284 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 343 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=117, Invalid=810, Unknown=3, NotChecked=0, Total=930 [2018-09-10 10:14:46,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-09-10 10:14:46,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 190. [2018-09-10 10:14:46,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-09-10 10:14:46,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 278 transitions. [2018-09-10 10:14:46,322 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 278 transitions. Word has length 91 [2018-09-10 10:14:46,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:14:46,323 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 278 transitions. [2018-09-10 10:14:46,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-10 10:14:46,323 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 278 transitions. [2018-09-10 10:14:46,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-09-10 10:14:46,324 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:14:46,324 INFO L376 BasicCegarLoop]: trace histogram [14, 13, 13, 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-09-10 10:14:46,328 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_invgen_heapsort_true_unreach_call_true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:14:46,328 INFO L82 PathProgramCache]: Analyzing trace with hash 543614951, now seen corresponding path program 1 times [2018-09-10 10:14:46,328 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:14:46,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:14:46,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:14:46,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:14:46,330 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:14:46,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:14:46,616 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 25 proven. 46 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-09-10 10:14:46,616 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:14:46,616 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:14:46,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:14:46,628 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:14:46,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:14:46,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:14:46,798 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 28 proven. 7 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-09-10 10:14:46,798 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:14:46,965 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-09-10 10:14:46,989 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:14:46,989 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:14:47,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:14:47,005 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:14:47,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:14:47,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:14:49,076 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2018-09-10 10:14:49,076 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:14:49,195 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 33 proven. 2 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-09-10 10:14:49,197 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 4 imperfect interpolant sequences. [2018-09-10 10:14:49,197 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 9, 9, 6] total 27 [2018-09-10 10:14:49,197 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:14:49,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 10:14:49,198 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 10:14:49,198 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=612, Unknown=2, NotChecked=0, Total=702 [2018-09-10 10:14:49,198 INFO L87 Difference]: Start difference. First operand 190 states and 278 transitions. Second operand 6 states. [2018-09-10 10:15:00,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:15:00,965 INFO L93 Difference]: Finished difference Result 338 states and 488 transitions. [2018-09-10 10:15:00,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-10 10:15:00,966 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-09-10 10:15:00,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:15:00,967 INFO L225 Difference]: With dead ends: 338 [2018-09-10 10:15:00,968 INFO L226 Difference]: Without dead ends: 195 [2018-09-10 10:15:00,969 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 346 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=108, Invalid=702, Unknown=2, NotChecked=0, Total=812 [2018-09-10 10:15:00,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-09-10 10:15:01,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 180. [2018-09-10 10:15:01,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-09-10 10:15:01,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 262 transitions. [2018-09-10 10:15:01,009 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 262 transitions. Word has length 91 [2018-09-10 10:15:01,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:15:01,009 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 262 transitions. [2018-09-10 10:15:01,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 10:15:01,010 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 262 transitions. [2018-09-10 10:15:01,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-09-10 10:15:01,011 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:15:01,011 INFO L376 BasicCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 3, 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] [2018-09-10 10:15:01,012 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_invgen_heapsort_true_unreach_call_true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:15:01,012 INFO L82 PathProgramCache]: Analyzing trace with hash -729243423, now seen corresponding path program 1 times [2018-09-10 10:15:01,012 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:15:01,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:15:01,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:15:01,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:15:01,013 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:15:01,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:15:01,443 INFO L134 CoverageAnalysis]: Checked inductivity of 603 backedges. 48 proven. 11 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-09-10 10:15:01,443 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:15:01,443 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:15:01,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:15:01,451 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:15:01,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:15:01,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:15:01,962 INFO L134 CoverageAnalysis]: Checked inductivity of 603 backedges. 212 proven. 9 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2018-09-10 10:15:01,962 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:15:04,120 INFO L134 CoverageAnalysis]: Checked inductivity of 603 backedges. 48 proven. 11 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-09-10 10:15:04,141 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:15:04,142 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:15:04,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:15:04,158 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:15:04,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:15:04,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:15:11,720 INFO L134 CoverageAnalysis]: Checked inductivity of 603 backedges. 210 proven. 11 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2018-09-10 10:15:11,721 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:15:12,553 INFO L134 CoverageAnalysis]: Checked inductivity of 603 backedges. 46 proven. 13 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-09-10 10:15:12,555 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:15:12,558 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 9] total 29 [2018-09-10 10:15:12,558 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:15:12,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-10 10:15:12,559 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-10 10:15:12,560 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=670, Unknown=6, NotChecked=0, Total=812 [2018-09-10 10:15:12,560 INFO L87 Difference]: Start difference. First operand 180 states and 262 transitions. Second operand 14 states. [2018-09-10 10:15:12,977 WARN L175 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2018-09-10 10:15:19,038 WARN L175 SmtUtils]: Spent 393.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-09-10 10:15:19,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:15:19,335 INFO L93 Difference]: Finished difference Result 428 states and 633 transitions. [2018-09-10 10:15:19,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-10 10:15:19,335 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 120 [2018-09-10 10:15:19,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:15:19,337 INFO L225 Difference]: With dead ends: 428 [2018-09-10 10:15:19,338 INFO L226 Difference]: Without dead ends: 301 [2018-09-10 10:15:19,339 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 463 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=372, Invalid=1513, Unknown=7, NotChecked=0, Total=1892 [2018-09-10 10:15:19,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-09-10 10:15:19,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 244. [2018-09-10 10:15:19,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-09-10 10:15:19,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 371 transitions. [2018-09-10 10:15:19,395 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 371 transitions. Word has length 120 [2018-09-10 10:15:19,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:15:19,396 INFO L480 AbstractCegarLoop]: Abstraction has 244 states and 371 transitions. [2018-09-10 10:15:19,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-10 10:15:19,396 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 371 transitions. [2018-09-10 10:15:19,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-09-10 10:15:19,397 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:15:19,397 INFO L376 BasicCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 3, 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] [2018-09-10 10:15:19,398 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_invgen_heapsort_true_unreach_call_true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:15:19,398 INFO L82 PathProgramCache]: Analyzing trace with hash -295514337, now seen corresponding path program 1 times [2018-09-10 10:15:19,398 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:15:19,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:15:19,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:15:19,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:15:19,399 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:15:19,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:15:20,499 INFO L134 CoverageAnalysis]: Checked inductivity of 603 backedges. 33 proven. 74 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-09-10 10:15:20,499 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:15:20,499 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:15:20,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:15:20,514 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:15:20,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:15:20,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:15:20,951 INFO L134 CoverageAnalysis]: Checked inductivity of 603 backedges. 34 proven. 25 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-09-10 10:15:20,952 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:15:21,151 INFO L134 CoverageAnalysis]: Checked inductivity of 603 backedges. 34 proven. 25 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-09-10 10:15:21,171 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:15:21,172 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:15:21,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:15:21,187 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:15:21,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:15:21,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:15:21,464 INFO L134 CoverageAnalysis]: Checked inductivity of 603 backedges. 36 proven. 23 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-09-10 10:15:21,464 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:15:21,603 INFO L134 CoverageAnalysis]: Checked inductivity of 603 backedges. 36 proven. 23 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-09-10 10:15:21,604 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:15:21,605 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10, 9, 9] total 27 [2018-09-10 10:15:21,605 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:15:21,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-10 10:15:21,605 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-10 10:15:21,606 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2018-09-10 10:15:21,606 INFO L87 Difference]: Start difference. First operand 244 states and 371 transitions. Second operand 16 states. [2018-09-10 10:15:23,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:15:23,428 INFO L93 Difference]: Finished difference Result 359 states and 534 transitions. [2018-09-10 10:15:23,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-10 10:15:23,428 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 120 [2018-09-10 10:15:23,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:15:23,431 INFO L225 Difference]: With dead ends: 359 [2018-09-10 10:15:23,431 INFO L226 Difference]: Without dead ends: 357 [2018-09-10 10:15:23,432 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 460 SyntacticMatches, 6 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=257, Invalid=1225, Unknown=0, NotChecked=0, Total=1482 [2018-09-10 10:15:23,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-09-10 10:15:23,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 290. [2018-09-10 10:15:23,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-09-10 10:15:23,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 437 transitions. [2018-09-10 10:15:23,512 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 437 transitions. Word has length 120 [2018-09-10 10:15:23,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:15:23,512 INFO L480 AbstractCegarLoop]: Abstraction has 290 states and 437 transitions. [2018-09-10 10:15:23,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-10 10:15:23,512 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 437 transitions. [2018-09-10 10:15:23,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-09-10 10:15:23,514 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:15:23,515 INFO L376 BasicCegarLoop]: trace histogram [22, 21, 21, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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] [2018-09-10 10:15:23,515 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_invgen_heapsort_true_unreach_call_true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:15:23,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1799179169, now seen corresponding path program 2 times [2018-09-10 10:15:23,515 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:15:23,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:15:23,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:15:23,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:15:23,517 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:15:23,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:15:23,683 INFO L134 CoverageAnalysis]: Checked inductivity of 913 backedges. 41 proven. 92 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2018-09-10 10:15:23,683 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:15:23,683 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:15:23,692 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-10 10:15:23,692 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-10 10:15:23,733 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-10 10:15:23,733 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 10:15:23,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:15:24,154 INFO L134 CoverageAnalysis]: Checked inductivity of 913 backedges. 61 proven. 12 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2018-09-10 10:15:24,154 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:15:24,840 INFO L134 CoverageAnalysis]: Checked inductivity of 913 backedges. 42 proven. 31 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2018-09-10 10:15:24,860 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:15:24,860 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 24 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:15:24,876 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-10 10:15:24,876 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-10 10:15:24,965 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-10 10:15:24,965 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 10:15:24,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:15:27,459 INFO L134 CoverageAnalysis]: Checked inductivity of 913 backedges. 266 proven. 17 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2018-09-10 10:15:27,459 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:15:32,483 WARN L1010 $PredicateComparison]: unable to prove that (forall ((v_main_~r~0_BEFORE_CALL_233 Int) (v_main_~l~0_BEFORE_CALL_69 Int)) (or (exists ((v_main_~j~0_94 Int) (v_main_~l~0_80 Int)) (and (<= (* 2 v_main_~j~0_94) v_main_~r~0_BEFORE_CALL_233) (<= v_main_~l~0_BEFORE_CALL_69 (+ v_main_~l~0_80 1)) (<= (+ (* 2 v_main_~l~0_80) 1) v_main_~j~0_94))) (forall ((v_prenex_16 Int) (v_prenex_15 Int)) (or (< v_prenex_15 (+ (* 2 v_prenex_16) 1)) (< (+ v_prenex_16 1) v_main_~l~0_BEFORE_CALL_69) (< v_main_~r~0_BEFORE_CALL_233 (* 2 v_prenex_15)))) (<= v_main_~l~0_BEFORE_CALL_69 1))) is different from false [2018-09-10 10:15:32,809 INFO L134 CoverageAnalysis]: Checked inductivity of 913 backedges. 58 proven. 163 refuted. 0 times theorem prover too weak. 692 trivial. 0 not checked. [2018-09-10 10:15:32,811 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:15:32,811 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11, 9, 9] total 41 [2018-09-10 10:15:32,811 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:15:32,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-10 10:15:32,812 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-10 10:15:32,813 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1475, Unknown=3, NotChecked=0, Total=1640 [2018-09-10 10:15:32,813 INFO L87 Difference]: Start difference. First operand 290 states and 437 transitions. Second operand 20 states. [2018-09-10 10:15:37,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:15:37,809 INFO L93 Difference]: Finished difference Result 473 states and 696 transitions. [2018-09-10 10:15:37,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-10 10:15:37,811 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 142 [2018-09-10 10:15:37,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:15:37,815 INFO L225 Difference]: With dead ends: 473 [2018-09-10 10:15:37,815 INFO L226 Difference]: Without dead ends: 471 [2018-09-10 10:15:37,818 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 627 GetRequests, 546 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1557 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=1062, Invalid=5415, Unknown=3, NotChecked=0, Total=6480 [2018-09-10 10:15:37,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2018-09-10 10:15:37,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 389. [2018-09-10 10:15:37,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-09-10 10:15:37,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 574 transitions. [2018-09-10 10:15:37,918 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 574 transitions. Word has length 142 [2018-09-10 10:15:37,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:15:37,918 INFO L480 AbstractCegarLoop]: Abstraction has 389 states and 574 transitions. [2018-09-10 10:15:37,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-10 10:15:37,919 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 574 transitions. [2018-09-10 10:15:37,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-09-10 10:15:37,922 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:15:37,922 INFO L376 BasicCegarLoop]: trace histogram [28, 27, 27, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2018-09-10 10:15:37,922 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_invgen_heapsort_true_unreach_call_true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:15:37,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1490146688, now seen corresponding path program 1 times [2018-09-10 10:15:37,923 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:15:37,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:15:37,924 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-10 10:15:37,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:15:37,924 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:15:37,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:15:38,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1517 backedges. 53 proven. 119 refuted. 0 times theorem prover too weak. 1345 trivial. 0 not checked. [2018-09-10 10:15:38,416 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:15:38,416 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:15:38,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:15:38,427 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:15:38,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:15:38,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:15:38,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1517 backedges. 357 proven. 38 refuted. 0 times theorem prover too weak. 1122 trivial. 0 not checked. [2018-09-10 10:15:38,798 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:15:39,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1517 backedges. 75 proven. 38 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2018-09-10 10:15:39,129 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:15:39,129 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 26 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:15:39,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:15:39,147 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:15:39,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:15:39,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:15:39,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1517 backedges. 357 proven. 38 refuted. 0 times theorem prover too weak. 1122 trivial. 0 not checked. [2018-09-10 10:15:39,496 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:15:39,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1517 backedges. 75 proven. 38 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2018-09-10 10:15:39,835 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:15:39,835 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 10, 9, 10] total 28 [2018-09-10 10:15:39,835 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:15:39,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-10 10:15:39,837 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-10 10:15:39,838 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=652, Unknown=0, NotChecked=0, Total=756 [2018-09-10 10:15:39,838 INFO L87 Difference]: Start difference. First operand 389 states and 574 transitions. Second operand 15 states. [2018-09-10 10:15:41,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:15:41,914 INFO L93 Difference]: Finished difference Result 684 states and 1007 transitions. [2018-09-10 10:15:41,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-10 10:15:41,915 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 178 [2018-09-10 10:15:41,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:15:41,916 INFO L225 Difference]: With dead ends: 684 [2018-09-10 10:15:41,916 INFO L226 Difference]: Without dead ends: 0 [2018-09-10 10:15:41,919 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 746 GetRequests, 695 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=480, Invalid=1776, Unknown=0, NotChecked=0, Total=2256 [2018-09-10 10:15:41,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-10 10:15:41,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-10 10:15:41,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-10 10:15:41,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-10 10:15:41,920 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 178 [2018-09-10 10:15:41,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:15:41,920 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-10 10:15:41,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-10 10:15:41,920 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-10 10:15:41,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-10 10:15:41,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-10 10:15:41,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:41,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:41,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:41,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:41,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:41,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:41,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:42,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:42,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:42,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:42,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:42,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:42,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:42,028 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:42,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:42,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:42,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:42,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:42,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:42,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:42,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:42,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:42,106 WARN L175 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 174 [2018-09-10 10:15:42,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:42,535 WARN L175 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 225 DAG size of output: 210 [2018-09-10 10:15:42,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:42,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:42,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:42,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:42,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:42,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:42,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:42,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:42,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:42,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:42,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:42,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:42,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:42,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:42,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:42,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:42,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:42,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:42,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:42,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:42,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:42,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:42,723 WARN L175 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 221 DAG size of output: 179 [2018-09-10 10:15:42,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:43,278 WARN L175 SmtUtils]: Spent 553.00 ms on a formula simplification. DAG size of input: 263 DAG size of output: 248 [2018-09-10 10:15:43,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:43,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:43,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:43,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:43,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:43,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:43,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:43,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:43,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:43,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:43,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:43,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:43,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:43,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:43,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:43,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:43,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:43,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:43,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:43,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:43,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:43,482 WARN L175 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 181 [2018-09-10 10:15:43,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:43,737 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:43,737 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:43,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:43,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:43,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:43,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:43,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:43,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:43,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:43,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:43,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:43,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:43,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:43,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:43,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:43,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:43,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:43,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:43,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:43,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:43,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:43,830 WARN L175 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 174 [2018-09-10 10:15:43,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:43,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:43,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:43,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:43,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:43,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:44,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:44,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:44,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:44,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:44,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:44,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:44,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:44,145 WARN L175 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 271 DAG size of output: 236 [2018-09-10 10:15:44,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:44,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:44,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:44,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:44,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:44,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:44,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:44,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:44,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:44,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:44,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:44,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:44,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:44,499 WARN L175 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 289 DAG size of output: 251 [2018-09-10 10:15:44,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:15:47,417 WARN L175 SmtUtils]: Spent 2.84 s on a formula simplification. DAG size of input: 166 DAG size of output: 71 [2018-09-10 10:15:49,822 WARN L175 SmtUtils]: Spent 2.40 s on a formula simplification. DAG size of input: 208 DAG size of output: 33 [2018-09-10 10:15:50,949 WARN L175 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 171 DAG size of output: 69 [2018-09-10 10:15:52,922 WARN L175 SmtUtils]: Spent 1.97 s on a formula simplification. DAG size of input: 246 DAG size of output: 33 [2018-09-10 10:15:53,433 WARN L175 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 57 [2018-09-10 10:15:54,060 WARN L175 SmtUtils]: Spent 624.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 57 [2018-09-10 10:15:55,499 WARN L175 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 172 DAG size of output: 71 [2018-09-10 10:15:56,067 WARN L175 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 57 [2018-09-10 10:15:57,461 WARN L175 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 166 DAG size of output: 69 [2018-09-10 10:15:58,148 WARN L175 SmtUtils]: Spent 686.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 58 [2018-09-10 10:15:58,730 WARN L175 SmtUtils]: Spent 579.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 50 [2018-09-10 10:16:01,109 WARN L175 SmtUtils]: Spent 2.38 s on a formula simplification. DAG size of input: 226 DAG size of output: 101 [2018-09-10 10:16:01,837 WARN L175 SmtUtils]: Spent 726.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 58 [2018-09-10 10:16:04,348 WARN L175 SmtUtils]: Spent 2.51 s on a formula simplification. DAG size of input: 241 DAG size of output: 99 [2018-09-10 10:16:15,407 WARN L175 SmtUtils]: Spent 11.06 s on a formula simplification. DAG size of input: 195 DAG size of output: 92 [2018-09-10 10:16:15,411 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-09-10 10:16:15,411 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-10 10:16:15,411 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_invgen_heapsort_true_unreach_call_true_termination_i____VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-09-10 10:16:15,411 INFO L429 ceAbstractionStarter]: At program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_invgen_heapsort_true_unreach_call_true_termination_i____VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-09-10 10:16:15,412 INFO L426 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-09-10 10:16:15,412 INFO L426 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-09-10 10:16:15,412 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_invgen_heapsort_true_unreach_call_true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-09-10 10:16:15,412 INFO L426 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-09-10 10:16:15,412 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-10 10:16:15,412 INFO L429 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-09-10 10:16:15,412 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-10 10:16:15,412 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-10 10:16:15,413 INFO L422 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (let ((.cse5 (<= 1 main_~l~0)) (.cse3 (<= 1 main_~i~0))) (let ((.cse1 (= main_~n~0 main_~r~0)) (.cse6 (<= (+ main_~j~0 1) main_~n~0)) (.cse2 (exists ((v_main_~l~0_58 Int) (main_~l~0 Int)) (and (<= main_~r~0 (* 2 v_main_~l~0_58)) (< 1 v_main_~l~0_58) (<= (* 2 main_~l~0) main_~j~0) (<= v_main_~l~0_58 (+ main_~l~0 1))))) (.cse4 (* 2 main_~l~0)) (.cse0 (and .cse5 (<= main_~l~0 1) (<= main_~j~0 main_~r~0) (<= (+ main_~r~0 1) main_~n~0) .cse3 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (* 2 main_~l~0) main_~j~0)))))) (or .cse0 (and .cse1 .cse2 .cse3 (<= main_~i~0 (div main_~n~0 2)) (<= main_~j~0 .cse4) (<= (+ .cse4 1) main_~n~0)) .cse0 (and .cse5 (<= main_~i~0 main_~n~0) .cse1 .cse6 (<= (+ .cse4 3) main_~n~0) (exists ((main_~l~0 Int) (main_~n~0 Int)) (and (<= 0 main_~n~0) (<= 1 main_~n~0) (<= main_~n~0 main_~r~0) (<= main_~j~0 (* 2 main_~l~0)) (<= main_~l~0 (div main_~n~0 2)))) (<= .cse4 main_~j~0) .cse3) (and .cse1 .cse6 (exists ((main_~l~0 Int)) (let ((.cse7 (* 2 main_~l~0))) (and (<= main_~i~0 .cse7) (<= (+ .cse7 2) main_~n~0)))) .cse2 .cse3 (exists ((v_main_~l~0_58 Int)) (and (<= main_~r~0 (* 2 v_main_~l~0_58)) (< 1 v_main_~l~0_58) (<= v_main_~l~0_58 (+ main_~l~0 1)))) (<= (+ .cse4 2) main_~n~0)) .cse0))) [2018-09-10 10:16:15,413 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 10 56) no Hoare annotation was computed. [2018-09-10 10:16:15,414 INFO L422 ceAbstractionStarter]: At program point L40(line 40) the Hoare annotation is: (let ((.cse6 (* 2 main_~l~0))) (let ((.cse8 (<= 1 main_~l~0)) (.cse3 (<= 1 main_~i~0)) (.cse19 (exists ((v_main_~l~0_37 Int)) (and (<= (+ main_~l~0 1) v_main_~l~0_37) (<= (* 2 v_main_~l~0_37) main_~r~0)))) (.cse10 (<= (+ main_~j~0 1) main_~n~0)) (.cse20 (<= .cse6 main_~j~0)) (.cse2 (= main_~n~0 main_~r~0))) (let ((.cse1 (and .cse8 .cse3 .cse19 .cse10 .cse20 .cse2)) (.cse14 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0)))) (.cse13 (<= 2 main_~r~0)) (.cse9 (<= main_~l~0 1)) (.cse16 (< 1 main_~r~0)) (.cse12 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (* 2 main_~l~0) main_~j~0)))) (.cse11 (<= (+ main_~r~0 1) main_~n~0)) (.cse5 (exists ((v_main_~l~0_58 Int)) (and (<= main_~r~0 (* 2 v_main_~l~0_58)) (< 1 v_main_~l~0_58) (<= v_main_~l~0_58 (+ main_~l~0 1))))) (.cse0 (<= main_~i~0 main_~n~0)) (.cse4 (<= main_~j~0 main_~n~0))) (or (and .cse0 (and (<= (+ main_~r~0 2) (* 2 main_~j~0)) .cse1)) (and .cse0 (and (and .cse2 .cse3 .cse4 .cse5 (exists ((v_main_~l~0_58 Int) (main_~l~0 Int)) (and (<= main_~r~0 (* 2 v_main_~l~0_58)) (< 1 v_main_~l~0_58) (<= (+ (* 2 main_~l~0) 1) main_~j~0) (<= v_main_~l~0_58 (+ main_~l~0 1))))) (<= (+ .cse6 1) main_~n~0))) (and (exists ((main_~l~0 Int)) (let ((.cse7 (* 2 main_~l~0))) (and (<= main_~i~0 .cse7) (<= (+ .cse7 2) main_~n~0)))) .cse1) (and .cse3 (or (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse8 .cse9 .cse10 .cse12 .cse13 .cse11))) (and .cse8 .cse9 .cse14 .cse4 .cse11 .cse3 .cse12 .cse13) (and .cse3 (let ((.cse15 (and (and .cse8 .cse9 .cse10 .cse11) .cse16 .cse12))) (or .cse15 .cse15))) (and .cse8 .cse3 (let ((.cse17 (and (and (<= 2 main_~j~0) .cse9 .cse10) .cse16 .cse12 .cse11))) (or .cse17 .cse17))) (and .cse8 .cse3 .cse14 .cse4 .cse12 (and .cse9 .cse13) .cse11) (and .cse8 .cse3 (and .cse9 .cse10) .cse16 .cse12 .cse11) (and .cse0 (and .cse3 .cse2) (exists ((v_prenex_7 Int) (main_~l~0 Int)) (let ((.cse18 (div v_prenex_7 2))) (and (<= 0 v_prenex_7) (<= 1 v_prenex_7) (<= main_~r~0 v_prenex_7) (<= .cse18 main_~l~0) (<= (* 2 main_~l~0) main_~j~0) (< 0 .cse18)))) .cse5 (<= .cse6 main_~n~0) (<= main_~j~0 .cse6)) (and .cse0 (and .cse8 (<= (+ .cse6 3) main_~n~0) (and .cse3 .cse2 .cse19 .cse4 .cse20))))))) [2018-09-10 10:16:15,414 INFO L422 ceAbstractionStarter]: At program point L28(line 28) the Hoare annotation is: (let ((.cse5 (<= 1 main_~l~0)) (.cse3 (<= 1 main_~i~0))) (let ((.cse1 (= main_~n~0 main_~r~0)) (.cse6 (<= (+ main_~j~0 1) main_~n~0)) (.cse2 (exists ((v_main_~l~0_58 Int) (main_~l~0 Int)) (and (<= main_~r~0 (* 2 v_main_~l~0_58)) (< 1 v_main_~l~0_58) (<= (* 2 main_~l~0) main_~j~0) (<= v_main_~l~0_58 (+ main_~l~0 1))))) (.cse4 (* 2 main_~l~0)) (.cse0 (and .cse5 (<= main_~l~0 1) (<= main_~j~0 main_~r~0) (<= (+ main_~r~0 1) main_~n~0) .cse3 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (* 2 main_~l~0) main_~j~0)))))) (or .cse0 (and .cse1 .cse2 .cse3 (<= main_~i~0 (div main_~n~0 2)) (<= main_~j~0 .cse4) (<= (+ .cse4 1) main_~n~0)) .cse0 (and .cse5 (<= main_~i~0 main_~n~0) .cse1 .cse6 (<= (+ .cse4 3) main_~n~0) (<= .cse4 main_~j~0) .cse3) (and .cse1 .cse6 (exists ((main_~l~0 Int)) (let ((.cse7 (* 2 main_~l~0))) (and (<= main_~i~0 .cse7) (<= (+ .cse7 2) main_~n~0)))) .cse2 .cse3 (exists ((v_main_~l~0_58 Int)) (and (<= main_~r~0 (* 2 v_main_~l~0_58)) (< 1 v_main_~l~0_58) (<= v_main_~l~0_58 (+ main_~l~0 1)))) (<= (+ .cse4 2) main_~n~0)) .cse0))) [2018-09-10 10:16:15,414 INFO L426 ceAbstractionStarter]: For program point L24-1(lines 24 44) no Hoare annotation was computed. [2018-09-10 10:16:15,414 INFO L422 ceAbstractionStarter]: At program point L24-3(lines 24 44) the Hoare annotation is: (let ((.cse1 (<= 1 main_~l~0)) (.cse2 (<= main_~l~0 1)) (.cse3 (<= (+ main_~r~0 1) main_~n~0)) (.cse4 (<= 1 main_~i~0)) (.cse5 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))) (let ((.cse7 (exists ((v_main_~l~0_58 Int) (main_~l~0 Int)) (and (<= main_~r~0 (* 2 v_main_~l~0_58)) (< 1 v_main_~l~0_58) (<= (* 2 main_~l~0) main_~j~0) (<= v_main_~l~0_58 (+ main_~l~0 1))))) (.cse9 (* 2 main_~l~0)) (.cse6 (= main_~n~0 main_~r~0)) (.cse10 (exists ((main_~n~0 Int)) (and (<= 0 main_~n~0) (<= 1 main_~n~0) (<= main_~n~0 main_~r~0) (<= main_~l~0 (div main_~n~0 2))))) (.cse13 (<= main_~i~0 main_~n~0)) (.cse12 (exists ((v_main_~l~0_58 Int)) (and (<= main_~r~0 (* 2 v_main_~l~0_58)) (< 1 v_main_~l~0_58) (<= v_main_~l~0_58 (+ main_~l~0 1))))) (.cse0 (and .cse1 .cse2 (<= main_~j~0 main_~r~0) .cse3 .cse4 .cse5))) (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 main_~r~0)) (and .cse6 .cse7 .cse4 (<= main_~i~0 (div main_~n~0 2)) (exists ((v_prenex_7 Int) (main_~l~0 Int)) (let ((.cse8 (div v_prenex_7 2))) (and (<= 0 v_prenex_7) (<= 1 v_prenex_7) (<= main_~r~0 v_prenex_7) (<= .cse8 main_~l~0) (<= (* 2 main_~l~0) main_~j~0) (< 0 .cse8)))) (<= main_~j~0 .cse9) .cse10) (and .cse6 (exists ((main_~l~0 Int) (v_main_~j~0_98 Int) (v_main_~l~0_83 Int)) (and (<= main_~j~0 (* 2 v_main_~j~0_98)) (<= (* 2 v_main_~l~0_83) main_~r~0) (<= (+ main_~l~0 1) v_main_~l~0_83) (<= v_main_~j~0_98 (* 2 main_~l~0)))) (exists ((main_~l~0 Int)) (let ((.cse11 (* 2 main_~l~0))) (and (<= main_~i~0 .cse11) (<= (+ .cse11 2) main_~n~0)))) .cse7 .cse4 .cse12 (<= (+ .cse9 2) main_~n~0)) (and .cse1 .cse13 .cse6 (<= (+ .cse9 3) main_~n~0) (<= .cse9 main_~j~0) .cse4) (and .cse13 (and (exists ((v_main_~l~0_37 Int)) (and (<= (+ main_~l~0 1) v_main_~l~0_37) (<= (* 2 v_main_~l~0_37) main_~r~0))) .cse6 .cse4 .cse12 (<= (+ main_~r~0 2) main_~j~0))) (and (and (exists ((v_prenex_7 Int) (v_main_~j~0_61 Int) (main_~l~0 Int)) (let ((.cse14 (div v_prenex_7 2))) (and (<= 0 v_prenex_7) (<= (* 2 main_~l~0) v_main_~j~0_61) (<= 1 v_prenex_7) (<= (* 2 v_main_~j~0_61) main_~j~0) (<= main_~r~0 v_prenex_7) (<= .cse14 main_~l~0) (< 0 .cse14)))) .cse6 .cse4 .cse10) .cse13 .cse12) .cse0))) [2018-09-10 10:16:15,415 INFO L426 ceAbstractionStarter]: For program point L24-4(lines 21 54) no Hoare annotation was computed. [2018-09-10 10:16:15,415 INFO L426 ceAbstractionStarter]: For program point L16(lines 16 20) no Hoare annotation was computed. [2018-09-10 10:16:15,415 INFO L426 ceAbstractionStarter]: For program point L45-1(lines 10 56) no Hoare annotation was computed. [2018-09-10 10:16:15,415 INFO L426 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2018-09-10 10:16:15,415 INFO L422 ceAbstractionStarter]: At program point L33(line 33) the Hoare annotation is: (let ((.cse10 (div main_~n~0 2)) (.cse4 (<= main_~j~0 main_~n~0)) (.cse2 (<= 1 main_~l~0)) (.cse11 (<= main_~l~0 1)) (.cse12 (<= (+ main_~j~0 1) main_~n~0)) (.cse16 (<= (+ main_~r~0 1) main_~n~0)) (.cse6 (<= 1 main_~i~0)) (.cse13 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (* 2 main_~l~0) main_~j~0)))) (.cse14 (<= 2 main_~r~0))) (let ((.cse1 (and .cse2 .cse11 .cse12 .cse16 .cse6 .cse13 .cse14)) (.cse0 (and .cse2 .cse11 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0))) .cse4 .cse16 .cse6 .cse13 .cse14)) (.cse7 (<= main_~i~0 .cse10)) (.cse3 (= main_~n~0 main_~r~0)) (.cse9 (exists ((v_main_~l~0_58 Int)) (and (<= main_~r~0 (* 2 v_main_~l~0_58)) (< 1 v_main_~l~0_58) (<= v_main_~l~0_58 (+ main_~l~0 1))))) (.cse5 (* 2 main_~l~0))) (or .cse0 .cse1 .cse1 (and .cse2 (<= main_~i~0 main_~n~0) .cse3 .cse4 (<= (+ .cse5 3) main_~n~0) (<= .cse5 main_~j~0) .cse6) (and .cse6 .cse7 .cse3 (exists ((v_prenex_7 Int) (main_~l~0 Int)) (let ((.cse8 (div v_prenex_7 2))) (and (<= 0 v_prenex_7) (<= 1 v_prenex_7) (<= main_~r~0 v_prenex_7) (<= .cse8 main_~l~0) (<= (* 2 main_~l~0) main_~j~0) (< 0 .cse8)))) .cse9 (<= main_~j~0 .cse5) (<= main_~l~0 .cse10)) (and .cse2 .cse11 .cse12 .cse6 (<= main_~r~0 main_~n~0) .cse13 .cse14) .cse0 .cse0 (and .cse3 .cse4 .cse6 .cse7 .cse9 (exists ((v_main_~l~0_58 Int) (main_~l~0 Int)) (and (<= main_~r~0 (* 2 v_main_~l~0_58)) (< 1 v_main_~l~0_58) (<= (+ (* 2 main_~l~0) 1) main_~j~0) (<= v_main_~l~0_58 (+ main_~l~0 1)))) (<= (+ .cse5 1) main_~n~0)) (and .cse3 .cse4 (exists ((main_~l~0 Int)) (let ((.cse15 (* 2 main_~l~0))) (and (<= main_~i~0 .cse15) (<= (+ .cse15 2) main_~n~0)))) (exists ((v_main_~l~0_58 Int) (main_~l~0 Int)) (and (<= main_~r~0 (* 2 v_main_~l~0_58)) (< 1 v_main_~l~0_58) (<= (* 2 main_~l~0) main_~j~0) (<= v_main_~l~0_58 (+ main_~l~0 1)))) .cse6 .cse9 (<= (+ .cse5 2) main_~n~0))))) [2018-09-10 10:16:15,415 INFO L426 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2018-09-10 10:16:15,416 INFO L426 ceAbstractionStarter]: For program point L25(lines 25 32) no Hoare annotation was computed. [2018-09-10 10:16:15,416 INFO L422 ceAbstractionStarter]: At program point L25-1(lines 25 32) the Hoare annotation is: (let ((.cse7 (div main_~n~0 2)) (.cse10 (<= main_~j~0 main_~n~0)) (.cse9 (<= 1 main_~l~0)) (.cse13 (<= main_~l~0 1)) (.cse14 (<= (+ main_~r~0 1) main_~n~0)) (.cse2 (<= 1 main_~i~0)) (.cse15 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (* 2 main_~l~0) main_~j~0)))) (.cse16 (<= 2 main_~r~0))) (let ((.cse8 (and .cse9 .cse13 (<= (+ main_~j~0 1) main_~n~0) .cse14 .cse2 .cse15 .cse16)) (.cse0 (and .cse9 .cse13 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0))) .cse10 .cse14 .cse2 .cse15 .cse16)) (.cse3 (<= main_~i~0 .cse7)) (.cse4 (= main_~n~0 main_~r~0)) (.cse1 (exists ((v_main_~l~0_58 Int) (main_~l~0 Int)) (and (<= main_~r~0 (* 2 v_main_~l~0_58)) (< 1 v_main_~l~0_58) (<= (* 2 main_~l~0) main_~j~0) (<= v_main_~l~0_58 (+ main_~l~0 1))))) (.cse11 (exists ((v_main_~l~0_58 Int)) (and (<= main_~r~0 (* 2 v_main_~l~0_58)) (< 1 v_main_~l~0_58) (<= v_main_~l~0_58 (+ main_~l~0 1))))) (.cse6 (* 2 main_~l~0))) (or .cse0 (and .cse1 .cse2 .cse3 .cse4 (exists ((v_prenex_7 Int) (main_~l~0 Int)) (let ((.cse5 (div v_prenex_7 2))) (and (<= 0 v_prenex_7) (<= 1 v_prenex_7) (<= main_~r~0 v_prenex_7) (<= .cse5 main_~l~0) (<= (* 2 main_~l~0) main_~j~0) (< 0 .cse5)))) (<= main_~j~0 .cse6) (<= main_~l~0 .cse7)) .cse8 .cse8 (and .cse9 (<= main_~i~0 main_~n~0) .cse4 .cse10 (<= (+ .cse6 3) main_~n~0) (<= .cse6 main_~j~0) .cse2) .cse8 .cse0 .cse0 (and .cse4 .cse10 .cse2 .cse3 .cse11 (exists ((v_main_~l~0_58 Int) (main_~l~0 Int)) (and (<= main_~r~0 (* 2 v_main_~l~0_58)) (< 1 v_main_~l~0_58) (<= (+ (* 2 main_~l~0) 1) main_~j~0) (<= v_main_~l~0_58 (+ main_~l~0 1)))) (<= (+ .cse6 1) main_~n~0)) (and .cse4 .cse10 (exists ((main_~l~0 Int)) (let ((.cse12 (* 2 main_~l~0))) (and (<= main_~i~0 .cse12) (<= (+ .cse12 2) main_~n~0)))) .cse1 .cse2 .cse11 (<= (+ .cse6 2) main_~n~0))))) [2018-09-10 10:16:15,416 INFO L426 ceAbstractionStarter]: For program point L21(lines 21 54) no Hoare annotation was computed. [2018-09-10 10:16:15,416 INFO L426 ceAbstractionStarter]: For program point L21-2(lines 21 54) no Hoare annotation was computed. [2018-09-10 10:16:15,416 INFO L422 ceAbstractionStarter]: At program point L50(line 50) the Hoare annotation is: (let ((.cse2 (<= 1 main_~l~0)) (.cse1 (<= main_~l~0 1)) (.cse11 (<= (+ main_~r~0 1) main_~n~0))) (let ((.cse0 (<= 1 main_~i~0)) (.cse5 (<= main_~j~0 main_~n~0)) (.cse4 (<= (+ main_~j~0 1) main_~n~0)) (.cse6 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0)))) (.cse8 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (* 2 main_~l~0) main_~j~0)))) (.cse7 (and (and (<= 2 main_~j~0) .cse2 .cse1 (<= 2 main_~r~0)) .cse11))) (or (and .cse0 (and (and .cse1 (and .cse2 (= main_~n~0 main_~r~0))) (<= main_~l~0 (div main_~n~0 2))) (<= (* 2 main_~l~0) main_~j~0)) (and .cse0 (let ((.cse3 (or (and .cse6 .cse7 .cse8) (and .cse7 .cse8)))) (or (and .cse3 .cse4) .cse3 (and .cse3 .cse5)))) (and .cse2 .cse0 (let ((.cse9 (let ((.cse10 (< 1 main_~r~0))) (or (and .cse1 .cse10 .cse8 .cse11) (and .cse1 .cse6 .cse10 .cse8 .cse11))))) (or (and .cse4 .cse9) .cse9 (and .cse5 .cse9)))) (and .cse0 (let ((.cse12 (or (and .cse8 .cse7) (and .cse6 .cse8 .cse7)))) (or .cse12 (and .cse12 .cse5) (and .cse12 .cse4))))))) [2018-09-10 10:16:15,417 INFO L422 ceAbstractionStarter]: At program point L50-1(line 50) the Hoare annotation is: (let ((.cse2 (<= 1 main_~l~0)) (.cse1 (<= main_~l~0 1)) (.cse11 (<= (+ main_~r~0 1) main_~n~0))) (let ((.cse0 (<= 1 main_~i~0)) (.cse5 (<= main_~j~0 main_~n~0)) (.cse4 (<= (+ main_~j~0 1) main_~n~0)) (.cse6 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0)))) (.cse8 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (* 2 main_~l~0) main_~j~0)))) (.cse7 (and (and (<= 2 main_~j~0) .cse2 .cse1 (<= 2 main_~r~0)) .cse11))) (or (and .cse0 (and (and .cse1 (and .cse2 (= main_~n~0 main_~r~0))) (<= main_~l~0 (div main_~n~0 2))) (<= (* 2 main_~l~0) main_~j~0)) (and .cse0 (let ((.cse3 (or (and .cse6 .cse7 .cse8) (and .cse7 .cse8)))) (or (and .cse3 .cse4) .cse3 (and .cse3 .cse5)))) (and .cse2 .cse0 (let ((.cse9 (let ((.cse10 (< 1 main_~r~0))) (or (and .cse1 .cse10 .cse8 .cse11) (and .cse1 .cse6 .cse10 .cse8 .cse11))))) (or (and .cse4 .cse9) .cse9 (and .cse5 .cse9)))) (and .cse0 (let ((.cse12 (or (and .cse8 .cse7) (and .cse6 .cse8 .cse7)))) (or .cse12 (and .cse12 .cse5) (and .cse12 .cse4))))))) [2018-09-10 10:16:15,417 INFO L422 ceAbstractionStarter]: At program point L46(line 46) the Hoare annotation is: (let ((.cse6 (* 2 main_~l~0))) (let ((.cse5 (and (and (= main_~n~0 main_~r~0) (<= main_~l~0 (div main_~n~0 2))) (<= 1 main_~i~0) (<= 2 main_~l~0) (<= .cse6 main_~j~0)))) (let ((.cse1 (<= main_~i~0 main_~n~0)) (.cse2 (and .cse5 (<= (+ .cse6 1) main_~n~0))) (.cse0 (let ((.cse4 (<= main_~r~0 .cse6))) (or (and .cse4 .cse5 (<= (+ main_~r~0 2) main_~j~0)) (and .cse4 .cse5 (<= main_~j~0 .cse6))))) (.cse3 (<= main_~j~0 main_~n~0))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and .cse2 .cse3) (and .cse0 .cse3))))) [2018-09-10 10:16:15,417 INFO L426 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2018-09-10 10:16:15,417 INFO L422 ceAbstractionStarter]: At program point L46-1(line 46) the Hoare annotation is: (let ((.cse6 (* 2 main_~l~0))) (let ((.cse5 (and (and (= main_~n~0 main_~r~0) (<= main_~l~0 (div main_~n~0 2))) (<= 1 main_~i~0) (<= 2 main_~l~0) (<= .cse6 main_~j~0)))) (let ((.cse3 (<= main_~i~0 main_~n~0)) (.cse1 (and .cse5 (<= (+ .cse6 1) main_~n~0))) (.cse2 (let ((.cse4 (<= main_~r~0 .cse6))) (or (and .cse4 .cse5 (<= (+ main_~r~0 2) main_~j~0)) (and .cse4 .cse5 (<= main_~j~0 .cse6))))) (.cse0 (<= main_~j~0 main_~n~0))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse3 .cse1) (and .cse2 .cse0))))) [2018-09-10 10:16:15,417 INFO L426 ceAbstractionStarter]: For program point mainFINAL(lines 10 56) no Hoare annotation was computed. [2018-09-10 10:16:15,418 INFO L422 ceAbstractionStarter]: At program point L38(line 38) the Hoare annotation is: (let ((.cse10 (div main_~n~0 2)) (.cse4 (<= main_~j~0 main_~n~0)) (.cse2 (<= 1 main_~l~0)) (.cse12 (<= main_~l~0 1)) (.cse13 (<= (+ main_~r~0 1) main_~n~0)) (.cse6 (<= 1 main_~i~0)) (.cse14 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (* 2 main_~l~0) main_~j~0)))) (.cse15 (<= 2 main_~r~0))) (let ((.cse1 (and .cse2 .cse12 (<= (+ main_~j~0 1) main_~n~0) .cse13 .cse6 .cse14 .cse15)) (.cse0 (and .cse2 .cse12 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0))) .cse4 .cse13 .cse6 .cse14 .cse15)) (.cse7 (<= main_~i~0 .cse10)) (.cse3 (= main_~n~0 main_~r~0)) (.cse9 (exists ((v_main_~l~0_58 Int)) (and (<= main_~r~0 (* 2 v_main_~l~0_58)) (< 1 v_main_~l~0_58) (<= v_main_~l~0_58 (+ main_~l~0 1))))) (.cse5 (* 2 main_~l~0))) (or .cse0 .cse1 .cse1 (and .cse2 (<= main_~i~0 main_~n~0) .cse3 .cse4 (<= (+ .cse5 3) main_~n~0) (<= .cse5 main_~j~0) .cse6) (and .cse6 .cse7 .cse3 (exists ((v_prenex_7 Int) (main_~l~0 Int)) (let ((.cse8 (div v_prenex_7 2))) (and (<= 0 v_prenex_7) (<= 1 v_prenex_7) (<= main_~r~0 v_prenex_7) (<= .cse8 main_~l~0) (<= (* 2 main_~l~0) main_~j~0) (< 0 .cse8)))) .cse9 (<= main_~j~0 .cse5) (<= main_~l~0 .cse10)) .cse1 .cse0 .cse0 (and .cse3 .cse4 .cse6 .cse7 .cse9 (exists ((v_main_~l~0_58 Int) (main_~l~0 Int)) (and (<= main_~r~0 (* 2 v_main_~l~0_58)) (< 1 v_main_~l~0_58) (<= (+ (* 2 main_~l~0) 1) main_~j~0) (<= v_main_~l~0_58 (+ main_~l~0 1)))) (<= (+ .cse5 1) main_~n~0)) (and .cse3 .cse4 (exists ((main_~l~0 Int)) (let ((.cse11 (* 2 main_~l~0))) (and (<= main_~i~0 .cse11) (<= (+ .cse11 2) main_~n~0)))) (exists ((v_main_~l~0_58 Int) (main_~l~0 Int)) (and (<= main_~r~0 (* 2 v_main_~l~0_58)) (< 1 v_main_~l~0_58) (<= (* 2 main_~l~0) main_~j~0) (<= v_main_~l~0_58 (+ main_~l~0 1)))) .cse6 .cse9 (<= (+ .cse5 2) main_~n~0))))) [2018-09-10 10:16:15,418 INFO L422 ceAbstractionStarter]: At program point L38-1(line 38) the Hoare annotation is: (let ((.cse5 (<= main_~j~0 main_~n~0)) (.cse1 (<= 1 main_~i~0)) (.cse10 (div main_~n~0 2)) (.cse9 (<= 1 main_~l~0)) (.cse12 (<= main_~l~0 1)) (.cse13 (<= (+ main_~j~0 1) main_~n~0)) (.cse14 (<= (+ main_~r~0 1) main_~n~0)) (.cse15 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (* 2 main_~l~0) main_~j~0)))) (.cse17 (<= 2 main_~r~0))) (let ((.cse3 (and .cse9 .cse12 .cse13 .cse14 .cse15 .cse17)) (.cse2 (and .cse9 .cse12 .cse13 .cse15 .cse17 .cse14)) (.cse6 (<= main_~i~0 .cse10)) (.cse0 (and .cse9 .cse12 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0))) .cse5 .cse14 .cse1 .cse15 .cse17)) (.cse4 (= main_~n~0 main_~r~0)) (.cse7 (exists ((v_main_~l~0_58 Int)) (and (<= main_~r~0 (* 2 v_main_~l~0_58)) (< 1 v_main_~l~0_58) (<= v_main_~l~0_58 (+ main_~l~0 1))))) (.cse8 (* 2 main_~l~0))) (or .cse0 (and .cse1 (or .cse2 .cse3)) (and .cse4 .cse5 .cse1 .cse6 .cse7 (exists ((v_main_~l~0_58 Int) (main_~l~0 Int)) (and (<= main_~r~0 (* 2 v_main_~l~0_58)) (< 1 v_main_~l~0_58) (<= (+ (* 2 main_~l~0) 1) main_~j~0) (<= v_main_~l~0_58 (+ main_~l~0 1)))) (<= (+ .cse8 1) main_~n~0)) (and .cse1 (or .cse3 .cse2)) (and .cse9 (<= main_~i~0 main_~n~0) .cse4 .cse5 (<= (+ .cse8 3) main_~n~0) (<= .cse8 main_~j~0) .cse1) .cse0 (and .cse1 (<= main_~j~0 .cse8) (<= main_~l~0 .cse10) .cse4 .cse6 (<= (+ .cse8 main_~r~0) (+ main_~j~0 main_~n~0)) .cse7) (and (let ((.cse11 (and .cse9 .cse12 .cse13 .cse14 .cse15))) (or .cse11 .cse11)) (<= .cse8 main_~r~0) .cse1) .cse0 (and .cse4 .cse5 (exists ((main_~l~0 Int)) (let ((.cse16 (* 2 main_~l~0))) (and (<= main_~i~0 .cse16) (<= (+ .cse16 2) main_~n~0)))) (exists ((v_main_~l~0_58 Int) (main_~l~0 Int)) (and (<= main_~r~0 (* 2 v_main_~l~0_58)) (< 1 v_main_~l~0_58) (<= (* 2 main_~l~0) main_~j~0) (<= v_main_~l~0_58 (+ main_~l~0 1)))) .cse1 .cse7 (<= (+ .cse8 2) main_~n~0))))) [2018-09-10 10:16:15,418 INFO L426 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-09-10 10:16:15,418 INFO L426 ceAbstractionStarter]: For program point L30(lines 30 31) no Hoare annotation was computed. [2018-09-10 10:16:15,419 INFO L429 ceAbstractionStarter]: At program point mainENTRY(lines 10 56) the Hoare annotation is: true [2018-09-10 10:16:15,419 INFO L422 ceAbstractionStarter]: At program point L26(line 26) the Hoare annotation is: (let ((.cse1 (<= 1 main_~l~0)) (.cse5 (<= 1 main_~i~0))) (let ((.cse2 (= main_~n~0 main_~r~0)) (.cse3 (<= (+ main_~j~0 1) main_~n~0)) (.cse6 (exists ((v_main_~l~0_58 Int) (main_~l~0 Int)) (and (<= main_~r~0 (* 2 v_main_~l~0_58)) (< 1 v_main_~l~0_58) (<= (* 2 main_~l~0) main_~j~0) (<= v_main_~l~0_58 (+ main_~l~0 1))))) (.cse4 (* 2 main_~l~0)) (.cse0 (and .cse1 (<= main_~l~0 1) (<= main_~j~0 main_~r~0) (<= (+ main_~r~0 1) main_~n~0) .cse5 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (* 2 main_~l~0) main_~j~0)))))) (or .cse0 (and .cse1 (<= main_~i~0 main_~n~0) .cse2 .cse3 (<= (+ .cse4 3) main_~n~0) (exists ((main_~l~0 Int) (main_~n~0 Int)) (and (<= 0 main_~n~0) (<= 1 main_~n~0) (<= main_~n~0 main_~r~0) (<= main_~j~0 (* 2 main_~l~0)) (<= main_~l~0 (div main_~n~0 2)))) (<= .cse4 main_~j~0) .cse5) .cse0 (and .cse2 .cse6 .cse5 (<= main_~i~0 (div main_~n~0 2)) (<= main_~j~0 .cse4) (<= (+ .cse4 1) main_~n~0)) (and .cse2 .cse3 (exists ((main_~l~0 Int)) (let ((.cse7 (* 2 main_~l~0))) (and (<= main_~i~0 .cse7) (<= (+ .cse7 2) main_~n~0)))) .cse6 .cse5 (exists ((v_main_~l~0_58 Int)) (and (<= main_~r~0 (* 2 v_main_~l~0_58)) (< 1 v_main_~l~0_58) (<= v_main_~l~0_58 (+ main_~l~0 1)))) (<= (+ .cse4 2) main_~n~0)) .cse0))) [2018-09-10 10:16:15,419 INFO L422 ceAbstractionStarter]: At program point L26-1(line 26) the Hoare annotation is: (let ((.cse1 (<= 1 main_~l~0)) (.cse5 (<= 1 main_~i~0))) (let ((.cse2 (= main_~n~0 main_~r~0)) (.cse3 (<= (+ main_~j~0 1) main_~n~0)) (.cse6 (exists ((v_main_~l~0_58 Int) (main_~l~0 Int)) (and (<= main_~r~0 (* 2 v_main_~l~0_58)) (< 1 v_main_~l~0_58) (<= (* 2 main_~l~0) main_~j~0) (<= v_main_~l~0_58 (+ main_~l~0 1))))) (.cse4 (* 2 main_~l~0)) (.cse0 (and .cse1 (<= main_~l~0 1) (<= main_~j~0 main_~r~0) (<= (+ main_~r~0 1) main_~n~0) .cse5 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (* 2 main_~l~0) main_~j~0)))))) (or .cse0 (and .cse1 (<= main_~i~0 main_~n~0) .cse2 .cse3 (<= (+ .cse4 3) main_~n~0) (exists ((main_~l~0 Int) (main_~n~0 Int)) (and (<= 0 main_~n~0) (<= 1 main_~n~0) (<= main_~n~0 main_~r~0) (<= main_~j~0 (* 2 main_~l~0)) (<= main_~l~0 (div main_~n~0 2)))) (<= .cse4 main_~j~0) .cse5) .cse0 (and .cse2 .cse6 .cse5 (<= main_~i~0 (div main_~n~0 2)) (<= main_~j~0 .cse4) (<= (+ .cse4 1) main_~n~0)) (and .cse2 .cse3 (exists ((main_~l~0 Int)) (let ((.cse7 (* 2 main_~l~0))) (and (<= main_~i~0 .cse7) (<= (+ .cse7 2) main_~n~0)))) .cse6 .cse5 (exists ((v_main_~l~0_58 Int)) (and (<= main_~r~0 (* 2 v_main_~l~0_58)) (< 1 v_main_~l~0_58) (<= v_main_~l~0_58 (+ main_~l~0 1)))) (<= (+ .cse4 2) main_~n~0)) .cse0))) [2018-09-10 10:16:15,419 INFO L426 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2018-09-10 10:16:15,419 INFO L426 ceAbstractionStarter]: For program point L47(line 47) no Hoare annotation was computed. [2018-09-10 10:16:15,420 INFO L422 ceAbstractionStarter]: At program point L39(line 39) the Hoare annotation is: (let ((.cse6 (* 2 main_~l~0))) (let ((.cse16 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0)))) (.cse15 (<= 2 main_~r~0)) (.cse11 (<= main_~l~0 1)) (.cse12 (<= (+ main_~j~0 1) main_~n~0)) (.cse18 (< 1 main_~r~0)) (.cse14 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (* 2 main_~l~0) main_~j~0)))) (.cse13 (<= (+ main_~r~0 1) main_~n~0)) (.cse5 (exists ((v_main_~l~0_58 Int)) (and (<= main_~r~0 (* 2 v_main_~l~0_58)) (< 1 v_main_~l~0_58) (<= v_main_~l~0_58 (+ main_~l~0 1))))) (.cse0 (<= main_~i~0 main_~n~0)) (.cse8 (<= 1 main_~l~0)) (.cse3 (<= 1 main_~i~0)) (.cse2 (= main_~n~0 main_~r~0)) (.cse9 (exists ((v_main_~l~0_37 Int)) (and (<= (+ main_~l~0 1) v_main_~l~0_37) (<= (* 2 v_main_~l~0_37) main_~r~0)))) (.cse1 (<= main_~j~0 main_~n~0)) (.cse10 (<= .cse6 main_~j~0))) (or (and .cse0 .cse1 .cse2 .cse3 (exists ((v_prenex_5 Int) (main_~l~0 Int)) (let ((.cse4 (div v_prenex_5 2))) (and (<= .cse4 main_~l~0) (<= 0 v_prenex_5) (<= 1 v_prenex_5) (<= main_~r~0 v_prenex_5) (<= (+ (* 2 main_~l~0) 1) main_~j~0) (< 0 .cse4)))) .cse5 (<= (+ .cse6 1) main_~n~0)) (and (exists ((main_~l~0 Int)) (let ((.cse7 (* 2 main_~l~0))) (and (<= main_~i~0 .cse7) (<= (+ .cse7 2) main_~n~0)))) (and .cse8 .cse3 .cse9 .cse10 (and .cse2 (<= main_~j~0 main_~r~0)))) (and .cse3 (or (and .cse8 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse11 .cse12 .cse14 .cse15 .cse13))) (and .cse8 .cse11 .cse16 .cse1 .cse13 .cse3 .cse14 .cse15) (and .cse3 (let ((.cse17 (and (and .cse8 .cse11 .cse12 .cse13) .cse18 .cse14))) (or .cse17 .cse17))) (and .cse8 .cse3 (let ((.cse19 (and (and (<= 2 main_~j~0) .cse11 .cse12) .cse18 .cse14 .cse13))) (or .cse19 .cse19))) (and .cse8 .cse3 .cse16 .cse1 .cse14 (and .cse11 .cse15) .cse13) (and .cse8 .cse3 (and .cse11 .cse12) .cse18 .cse14 .cse13) (and .cse0 (and .cse3 .cse2) (exists ((v_prenex_7 Int) (main_~l~0 Int)) (let ((.cse20 (div v_prenex_7 2))) (and (<= 0 v_prenex_7) (<= 1 v_prenex_7) (<= main_~r~0 v_prenex_7) (<= .cse20 main_~l~0) (<= (* 2 main_~l~0) main_~j~0) (< 0 .cse20)))) .cse5 (<= .cse6 main_~n~0) (<= main_~j~0 .cse6)) (and .cse0 (and .cse8 (<= (+ .cse6 3) main_~n~0) (and .cse3 .cse2 .cse9 .cse1 .cse10)))))) [2018-09-10 10:16:15,420 INFO L426 ceAbstractionStarter]: For program point L35(lines 35 37) no Hoare annotation was computed. [2018-09-10 10:16:15,430 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,431 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,432 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,432 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,432 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] [2018-09-10 10:16:15,432 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] [2018-09-10 10:16:15,433 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,433 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] [2018-09-10 10:16:15,433 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,434 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-09-10 10:16:15,434 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-09-10 10:16:15,434 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-09-10 10:16:15,434 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-09-10 10:16:15,434 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,435 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,435 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-09-10 10:16:15,435 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-10 10:16:15,435 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-10 10:16:15,436 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-10 10:16:15,436 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-10 10:16:15,436 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_98,QUANTIFIED] [2018-09-10 10:16:15,436 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_83,QUANTIFIED] [2018-09-10 10:16:15,436 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,437 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_83,QUANTIFIED] [2018-09-10 10:16:15,437 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_98,QUANTIFIED] [2018-09-10 10:16:15,437 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,437 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,438 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,438 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] [2018-09-10 10:16:15,438 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] [2018-09-10 10:16:15,438 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,438 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] [2018-09-10 10:16:15,439 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,439 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] [2018-09-10 10:16:15,439 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] [2018-09-10 10:16:15,439 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] [2018-09-10 10:16:15,440 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_37,QUANTIFIED] [2018-09-10 10:16:15,440 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_37,QUANTIFIED] [2018-09-10 10:16:15,440 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] [2018-09-10 10:16:15,440 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] [2018-09-10 10:16:15,440 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] [2018-09-10 10:16:15,441 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-09-10 10:16:15,441 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,441 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_61,QUANTIFIED] [2018-09-10 10:16:15,441 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-09-10 10:16:15,442 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_61,QUANTIFIED] [2018-09-10 10:16:15,442 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-09-10 10:16:15,442 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-09-10 10:16:15,442 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,442 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-09-10 10:16:15,443 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-10 10:16:15,443 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-10 10:16:15,443 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-10 10:16:15,443 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-10 10:16:15,443 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] [2018-09-10 10:16:15,444 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] [2018-09-10 10:16:15,444 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] [2018-09-10 10:16:15,444 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,444 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,464 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,464 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,466 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,467 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,467 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] [2018-09-10 10:16:15,467 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] [2018-09-10 10:16:15,467 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,468 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] [2018-09-10 10:16:15,468 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,468 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-09-10 10:16:15,468 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-09-10 10:16:15,469 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-09-10 10:16:15,469 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-09-10 10:16:15,469 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,469 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,475 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-09-10 10:16:15,476 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-10 10:16:15,476 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-10 10:16:15,476 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-10 10:16:15,476 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-10 10:16:15,477 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_98,QUANTIFIED] [2018-09-10 10:16:15,477 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_83,QUANTIFIED] [2018-09-10 10:16:15,477 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,477 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_83,QUANTIFIED] [2018-09-10 10:16:15,477 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_98,QUANTIFIED] [2018-09-10 10:16:15,478 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,478 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,478 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,478 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] [2018-09-10 10:16:15,479 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] [2018-09-10 10:16:15,479 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,479 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] [2018-09-10 10:16:15,479 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,479 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] [2018-09-10 10:16:15,480 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] [2018-09-10 10:16:15,480 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] [2018-09-10 10:16:15,480 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_37,QUANTIFIED] [2018-09-10 10:16:15,480 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_37,QUANTIFIED] [2018-09-10 10:16:15,482 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] [2018-09-10 10:16:15,482 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] [2018-09-10 10:16:15,483 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] [2018-09-10 10:16:15,483 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-09-10 10:16:15,483 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,483 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_61,QUANTIFIED] [2018-09-10 10:16:15,483 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-09-10 10:16:15,484 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_61,QUANTIFIED] [2018-09-10 10:16:15,484 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-09-10 10:16:15,484 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-09-10 10:16:15,484 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,484 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-09-10 10:16:15,485 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-10 10:16:15,485 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-10 10:16:15,485 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-10 10:16:15,485 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-10 10:16:15,487 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] [2018-09-10 10:16:15,487 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] [2018-09-10 10:16:15,487 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] [2018-09-10 10:16:15,488 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,488 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 10:16:15 BoogieIcfgContainer [2018-09-10 10:16:15,494 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-10 10:16:15,495 INFO L168 Benchmark]: Toolchain (without parser) took 133819.55 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 1.0 GB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -221.0 MB). Peak memory consumption was 982.1 MB. Max. memory is 7.1 GB. [2018-09-10 10:16:15,496 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-10 10:16:15,496 INFO L168 Benchmark]: CACSL2BoogieTranslator took 274.64 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-10 10:16:15,497 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.12 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-10 10:16:15,497 INFO L168 Benchmark]: Boogie Preprocessor took 27.49 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-10 10:16:15,498 INFO L168 Benchmark]: RCFGBuilder took 609.58 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 712.5 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -763.0 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. [2018-09-10 10:16:15,499 INFO L168 Benchmark]: TraceAbstraction took 132877.84 ms. Allocated memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: 327.2 MB). Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 531.4 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2018-09-10 10:16:15,508 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 274.64 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 23.12 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.49 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 609.58 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 712.5 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -763.0 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 132877.84 ms. Allocated memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: 327.2 MB). Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 531.4 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_98,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_98,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_61,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_61,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_98,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_98,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_61,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_61,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant [2018-09-10 10:16:15,529 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,529 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,529 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,530 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,530 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] [2018-09-10 10:16:15,530 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] [2018-09-10 10:16:15,530 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,530 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] [2018-09-10 10:16:15,531 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,531 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-09-10 10:16:15,531 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-09-10 10:16:15,531 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-09-10 10:16:15,531 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-09-10 10:16:15,531 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,532 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,532 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-09-10 10:16:15,532 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-10 10:16:15,532 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-10 10:16:15,532 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-10 10:16:15,533 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-10 10:16:15,533 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_98,QUANTIFIED] [2018-09-10 10:16:15,533 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_83,QUANTIFIED] [2018-09-10 10:16:15,533 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,533 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_83,QUANTIFIED] [2018-09-10 10:16:15,534 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_98,QUANTIFIED] [2018-09-10 10:16:15,534 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,534 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,534 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,534 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] [2018-09-10 10:16:15,535 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] [2018-09-10 10:16:15,535 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,535 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] [2018-09-10 10:16:15,535 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,535 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] [2018-09-10 10:16:15,535 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] [2018-09-10 10:16:15,536 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] [2018-09-10 10:16:15,536 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_37,QUANTIFIED] [2018-09-10 10:16:15,536 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_37,QUANTIFIED] [2018-09-10 10:16:15,536 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] [2018-09-10 10:16:15,536 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] [2018-09-10 10:16:15,537 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] [2018-09-10 10:16:15,537 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-09-10 10:16:15,537 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,537 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_61,QUANTIFIED] [2018-09-10 10:16:15,537 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-09-10 10:16:15,538 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_61,QUANTIFIED] [2018-09-10 10:16:15,538 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-09-10 10:16:15,538 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-09-10 10:16:15,538 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,538 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-09-10 10:16:15,538 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-10 10:16:15,539 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-10 10:16:15,539 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-10 10:16:15,539 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-10 10:16:15,539 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] [2018-09-10 10:16:15,539 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] [2018-09-10 10:16:15,539 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] [2018-09-10 10:16:15,540 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,540 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,543 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,543 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,543 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,544 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,544 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] [2018-09-10 10:16:15,544 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] [2018-09-10 10:16:15,544 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,544 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] [2018-09-10 10:16:15,545 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,545 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-09-10 10:16:15,545 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-09-10 10:16:15,545 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-09-10 10:16:15,545 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-09-10 10:16:15,545 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,546 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,546 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-09-10 10:16:15,546 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-10 10:16:15,546 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-10 10:16:15,546 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-10 10:16:15,547 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-10 10:16:15,547 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_98,QUANTIFIED] [2018-09-10 10:16:15,547 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_83,QUANTIFIED] [2018-09-10 10:16:15,547 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,547 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_83,QUANTIFIED] [2018-09-10 10:16:15,547 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_98,QUANTIFIED] [2018-09-10 10:16:15,548 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,548 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,548 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,548 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] [2018-09-10 10:16:15,548 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] [2018-09-10 10:16:15,549 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,549 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] [2018-09-10 10:16:15,549 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,549 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] [2018-09-10 10:16:15,549 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] [2018-09-10 10:16:15,550 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] [2018-09-10 10:16:15,550 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_37,QUANTIFIED] [2018-09-10 10:16:15,550 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_37,QUANTIFIED] [2018-09-10 10:16:15,550 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] [2018-09-10 10:16:15,550 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] [2018-09-10 10:16:15,550 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] [2018-09-10 10:16:15,551 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-09-10 10:16:15,551 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,551 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_61,QUANTIFIED] [2018-09-10 10:16:15,551 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-09-10 10:16:15,551 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_61,QUANTIFIED] [2018-09-10 10:16:15,552 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-09-10 10:16:15,552 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-09-10 10:16:15,552 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,552 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-09-10 10:16:15,552 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-10 10:16:15,552 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-10 10:16:15,553 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-10 10:16:15,553 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-09-10 10:16:15,553 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] [2018-09-10 10:16:15,553 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] [2018-09-10 10:16:15,553 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_58,QUANTIFIED] [2018-09-10 10:16:15,553 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-09-10 10:16:15,554 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] Derived loop invariant: (((((((((((1 <= l && l <= 1) && j <= r) && r + 1 <= n) && 1 <= i) && (\exists main_~l~0 : int :: i <= main_~l~0 && 2 * main_~l~0 <= j)) || (((((1 <= l && l <= 1) && r + 1 <= n) && 1 <= i) && (\exists main_~l~0 : int :: i <= main_~l~0 && 2 * main_~l~0 <= j)) && 2 <= r)) || ((((((n == r && (\exists v_main_~l~0_58 : int, main_~l~0 : int :: ((r <= 2 * v_main_~l~0_58 && 1 < v_main_~l~0_58) && 2 * main_~l~0 <= j) && v_main_~l~0_58 <= main_~l~0 + 1)) && 1 <= i) && i <= n / 2) && (\exists v_prenex_7 : int, main_~l~0 : int :: ((((0 <= v_prenex_7 && 1 <= v_prenex_7) && r <= v_prenex_7) && v_prenex_7 / 2 <= main_~l~0) && 2 * main_~l~0 <= j) && 0 < v_prenex_7 / 2)) && j <= 2 * l) && (\exists main_~n~0 : int :: ((0 <= main_~n~0 && 1 <= main_~n~0) && main_~n~0 <= r) && l <= main_~n~0 / 2))) || ((((((n == r && (\exists main_~l~0 : int, v_main_~j~0_98 : int, v_main_~l~0_83 : int :: ((j <= 2 * v_main_~j~0_98 && 2 * v_main_~l~0_83 <= r) && main_~l~0 + 1 <= v_main_~l~0_83) && v_main_~j~0_98 <= 2 * main_~l~0)) && (\exists main_~l~0 : int :: i <= 2 * main_~l~0 && 2 * main_~l~0 + 2 <= n)) && (\exists v_main_~l~0_58 : int, main_~l~0 : int :: ((r <= 2 * v_main_~l~0_58 && 1 < v_main_~l~0_58) && 2 * main_~l~0 <= j) && v_main_~l~0_58 <= main_~l~0 + 1)) && 1 <= i) && (\exists v_main_~l~0_58 : int :: (r <= 2 * v_main_~l~0_58 && 1 < v_main_~l~0_58) && v_main_~l~0_58 <= l + 1)) && 2 * l + 2 <= n)) || (((((1 <= l && i <= n) && n == r) && 2 * l + 3 <= n) && 2 * l <= j) && 1 <= i)) || (i <= n && ((((\exists v_main_~l~0_37 : int :: l + 1 <= v_main_~l~0_37 && 2 * v_main_~l~0_37 <= r) && n == r) && 1 <= i) && (\exists v_main_~l~0_58 : int :: (r <= 2 * v_main_~l~0_58 && 1 < v_main_~l~0_58) && v_main_~l~0_58 <= l + 1)) && r + 2 <= j)) || ((((((\exists v_prenex_7 : int, v_main_~j~0_61 : int, main_~l~0 : int :: (((((0 <= v_prenex_7 && 2 * main_~l~0 <= v_main_~j~0_61) && 1 <= v_prenex_7) && 2 * v_main_~j~0_61 <= j) && r <= v_prenex_7) && v_prenex_7 / 2 <= main_~l~0) && 0 < v_prenex_7 / 2) && n == r) && 1 <= i) && (\exists main_~n~0 : int :: ((0 <= main_~n~0 && 1 <= main_~n~0) && main_~n~0 <= r) && l <= main_~n~0 / 2)) && i <= n) && (\exists v_main_~l~0_58 : int :: (r <= 2 * v_main_~l~0_58 && 1 < v_main_~l~0_58) && v_main_~l~0_58 <= l + 1))) || (((((1 <= l && l <= 1) && j <= r) && r + 1 <= n) && 1 <= i) && (\exists main_~l~0 : int :: i <= main_~l~0 && 2 * main_~l~0 <= j)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 45 locations, 1 error locations. SAFE Result, 132.7s OverallTime, 23 OverallIterations, 28 TraceHistogramMax, 52.7s AutomataDifference, 0.0s DeadEndRemovalTime, 33.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 1739 SDtfs, 1303 SDslu, 5901 SDs, 0 SdLazy, 6131 SolverSat, 2110 SolverUnsat, 29 SolverUnknown, 0 SolverNotchecked, 40.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4249 GetRequests, 3768 SyntacticMatches, 39 SemanticMatches, 442 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3754 ImplicationChecksByTransitivity, 47.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=427occurred in iteration=15, 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: 1.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 708 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 894 PreInvPairs, 1179 NumberOfFragments, 6120 HoareAnnotationTreeSize, 894 FomulaSimplifications, 20533697959 FormulaSimplificationTreeSizeReduction, 2.6s HoareSimplificationTime, 20 FomulaSimplificationsInter, 3211639802 FormulaSimplificationTreeSizeReductionInter, 30.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 42.9s InterpolantComputationTime, 3200 NumberOfCodeBlocks, 3200 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 5093 ConstructedInterpolants, 680 QuantifiedInterpolants, 2375684 SizeOfPredicates, 136 NumberOfNonLiveVariables, 4134 ConjunctsInSsa, 262 ConjunctsInUnsatCore, 73 InterpolantComputations, 26 PerfectInterpolantSequences, 21992/23023 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/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/heapsort_true-unreach-call_true-termination.i_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-10_10-16-15-560.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/heapsort_true-unreach-call_true-termination.i_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-10_10-16-15-560.csv Received shutdown request...