/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-new/half.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:52:07,810 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:52:07,814 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:52:07,830 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:52:07,830 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:52:07,832 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:52:07,833 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:52:07,836 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:52:07,838 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:52:07,839 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:52:07,840 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:52:07,841 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:52:07,842 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:52:07,843 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:52:07,844 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:52:07,846 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:52:07,846 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:52:07,848 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:52:07,851 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:52:07,854 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:52:07,856 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:52:07,858 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:52:07,859 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:52:07,860 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:52:07,863 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:52:07,863 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:52:07,864 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:52:07,865 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:52:07,865 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:52:07,867 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:52:07,867 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:52:07,868 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:52:07,868 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:52:07,869 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:52:07,871 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:52:07,871 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:52:07,872 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:52:07,872 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:52:07,872 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:52:07,873 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:52:07,874 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:52:07,875 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-17 22:52:07,893 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:52:07,894 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:52:07,895 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:52:07,896 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:52:07,896 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:52:07,896 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:52:07,896 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:52:07,897 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:52:07,897 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:52:07,897 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:52:07,897 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:52:07,897 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:52:07,898 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:52:07,898 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:52:07,898 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:52:07,898 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:52:07,898 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:52:07,899 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:52:07,899 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:52:07,899 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:52:07,899 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:52:07,900 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:52:07,900 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:52:07,900 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:52:07,900 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:52:07,900 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:52:07,901 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:52:07,901 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:52:07,901 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:52:07,901 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:52:08,231 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:52:08,244 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:52:08,248 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:52:08,249 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:52:08,250 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:52:08,250 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/half.i [2020-07-17 22:52:08,359 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3a59ff0a/d6ef075d659d4e6190a96366a0df1505/FLAGb927f0e35 [2020-07-17 22:52:08,968 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:52:08,970 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/half.i [2020-07-17 22:52:08,978 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3a59ff0a/d6ef075d659d4e6190a96366a0df1505/FLAGb927f0e35 [2020-07-17 22:52:09,325 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3a59ff0a/d6ef075d659d4e6190a96366a0df1505 [2020-07-17 22:52:09,344 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:52:09,349 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:52:09,354 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:52:09,355 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:52:09,360 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:52:09,362 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:52:09" (1/1) ... [2020-07-17 22:52:09,366 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d1f65e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:09, skipping insertion in model container [2020-07-17 22:52:09,367 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:52:09" (1/1) ... [2020-07-17 22:52:09,378 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:52:09,407 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:52:09,664 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:52:09,671 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:52:09,694 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:52:09,712 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:52:09,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:09 WrapperNode [2020-07-17 22:52:09,713 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:52:09,713 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:52:09,714 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:52:09,714 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:52:09,726 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:09" (1/1) ... [2020-07-17 22:52:09,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:09" (1/1) ... [2020-07-17 22:52:09,733 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:09" (1/1) ... [2020-07-17 22:52:09,734 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:09" (1/1) ... [2020-07-17 22:52:09,845 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:09" (1/1) ... [2020-07-17 22:52:09,852 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:09" (1/1) ... [2020-07-17 22:52:09,854 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:09" (1/1) ... [2020-07-17 22:52:09,859 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:52:09,861 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:52:09,861 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:52:09,861 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:52:09,863 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:09" (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 [2020-07-17 22:52:09,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:52:09,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:52:09,942 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-17 22:52:09,942 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-17 22:52:09,942 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:52:09,942 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:52:09,943 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-17 22:52:09,943 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-17 22:52:09,943 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-17 22:52:09,943 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:52:09,943 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:52:09,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:52:09,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:52:10,272 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:52:10,273 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-17 22:52:10,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:52:10 BoogieIcfgContainer [2020-07-17 22:52:10,290 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:52:10,294 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:52:10,295 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:52:10,307 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:52:10,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:52:09" (1/3) ... [2020-07-17 22:52:10,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d5c2b4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:52:10, skipping insertion in model container [2020-07-17 22:52:10,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:09" (2/3) ... [2020-07-17 22:52:10,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d5c2b4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:52:10, skipping insertion in model container [2020-07-17 22:52:10,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:52:10" (3/3) ... [2020-07-17 22:52:10,323 INFO L109 eAbstractionObserver]: Analyzing ICFG half.i [2020-07-17 22:52:10,353 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:52:10,367 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:52:10,401 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:52:10,433 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:52:10,433 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:52:10,433 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:52:10,434 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:52:10,434 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:52:10,434 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:52:10,434 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:52:10,434 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:52:10,454 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2020-07-17 22:52:10,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-17 22:52:10,460 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:52:10,461 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:52:10,462 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:52:10,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:52:10,467 INFO L82 PathProgramCache]: Analyzing trace with hash -961315073, now seen corresponding path program 1 times [2020-07-17 22:52:10,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:52:10,477 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548600686] [2020-07-17 22:52:10,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:52:10,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:10,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:10,615 INFO L280 TraceCheckUtils]: 0: Hoare triple {24#true} assume true; {24#true} is VALID [2020-07-17 22:52:10,616 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {24#true} {24#true} #50#return; {24#true} is VALID [2020-07-17 22:52:10,618 INFO L263 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2020-07-17 22:52:10,618 INFO L280 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2020-07-17 22:52:10,618 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #50#return; {24#true} is VALID [2020-07-17 22:52:10,619 INFO L263 TraceCheckUtils]: 3: Hoare triple {24#true} call #t~ret3 := main(); {24#true} is VALID [2020-07-17 22:52:10,619 INFO L280 TraceCheckUtils]: 4: Hoare triple {24#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0; {24#true} is VALID [2020-07-17 22:52:10,620 INFO L280 TraceCheckUtils]: 5: Hoare triple {24#true} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {24#true} is VALID [2020-07-17 22:52:10,622 INFO L280 TraceCheckUtils]: 6: Hoare triple {24#true} assume !true; {25#false} is VALID [2020-07-17 22:52:10,623 INFO L263 TraceCheckUtils]: 7: Hoare triple {25#false} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {25#false} is VALID [2020-07-17 22:52:10,623 INFO L280 TraceCheckUtils]: 8: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2020-07-17 22:52:10,624 INFO L280 TraceCheckUtils]: 9: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2020-07-17 22:52:10,624 INFO L280 TraceCheckUtils]: 10: Hoare triple {25#false} assume !false; {25#false} is VALID [2020-07-17 22:52:10,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:52:10,626 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548600686] [2020-07-17 22:52:10,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:52:10,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-17 22:52:10,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431100833] [2020-07-17 22:52:10,638 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-07-17 22:52:10,642 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:52:10,647 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-17 22:52:10,694 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:52:10,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-17 22:52:10,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:52:10,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-17 22:52:10,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-17 22:52:10,707 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2020-07-17 22:52:10,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:10,804 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2020-07-17 22:52:10,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-17 22:52:10,805 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-07-17 22:52:10,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:52:10,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-17 22:52:10,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 38 transitions. [2020-07-17 22:52:10,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-17 22:52:10,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 38 transitions. [2020-07-17 22:52:10,823 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 38 transitions. [2020-07-17 22:52:10,932 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:52:10,947 INFO L225 Difference]: With dead ends: 33 [2020-07-17 22:52:10,947 INFO L226 Difference]: Without dead ends: 14 [2020-07-17 22:52:10,953 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-17 22:52:10,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-07-17 22:52:11,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-07-17 22:52:11,017 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:52:11,019 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2020-07-17 22:52:11,020 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-17 22:52:11,021 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-17 22:52:11,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:11,032 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2020-07-17 22:52:11,033 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2020-07-17 22:52:11,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:11,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:11,035 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-17 22:52:11,035 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-17 22:52:11,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:11,044 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2020-07-17 22:52:11,044 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2020-07-17 22:52:11,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:11,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:11,046 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:52:11,046 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:52:11,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-17 22:52:11,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2020-07-17 22:52:11,058 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2020-07-17 22:52:11,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:52:11,060 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2020-07-17 22:52:11,060 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-17 22:52:11,060 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2020-07-17 22:52:11,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-17 22:52:11,064 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:52:11,065 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:52:11,066 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:52:11,068 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:52:11,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:52:11,070 INFO L82 PathProgramCache]: Analyzing trace with hash -971473804, now seen corresponding path program 1 times [2020-07-17 22:52:11,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:52:11,071 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126041157] [2020-07-17 22:52:11,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:52:11,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:11,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:11,377 INFO L280 TraceCheckUtils]: 0: Hoare triple {121#true} assume true; {121#true} is VALID [2020-07-17 22:52:11,378 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {121#true} {121#true} #50#return; {121#true} is VALID [2020-07-17 22:52:11,379 INFO L263 TraceCheckUtils]: 0: Hoare triple {121#true} call ULTIMATE.init(); {121#true} is VALID [2020-07-17 22:52:11,379 INFO L280 TraceCheckUtils]: 1: Hoare triple {121#true} assume true; {121#true} is VALID [2020-07-17 22:52:11,380 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {121#true} {121#true} #50#return; {121#true} is VALID [2020-07-17 22:52:11,380 INFO L263 TraceCheckUtils]: 3: Hoare triple {121#true} call #t~ret3 := main(); {121#true} is VALID [2020-07-17 22:52:11,382 INFO L280 TraceCheckUtils]: 4: Hoare triple {121#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0; {125#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-17 22:52:11,384 INFO L280 TraceCheckUtils]: 5: Hoare triple {125#(and (<= 0 main_~n~0) (<= main_~n~0 0))} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {126#(and (<= main_~n~0 0) (<= main_~i~0 (* 2 main_~n~0)))} is VALID [2020-07-17 22:52:11,385 INFO L280 TraceCheckUtils]: 6: Hoare triple {126#(and (<= main_~n~0 0) (<= main_~i~0 (* 2 main_~n~0)))} assume !(~i~0 < 2 * ~k~0); {127#(and (<= main_~k~0 main_~n~0) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} is VALID [2020-07-17 22:52:11,389 INFO L263 TraceCheckUtils]: 7: Hoare triple {127#(and (<= main_~k~0 main_~n~0) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {128#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:52:11,390 INFO L280 TraceCheckUtils]: 8: Hoare triple {128#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {129#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-17 22:52:11,394 INFO L280 TraceCheckUtils]: 9: Hoare triple {129#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {122#false} is VALID [2020-07-17 22:52:11,394 INFO L280 TraceCheckUtils]: 10: Hoare triple {122#false} assume !false; {122#false} is VALID [2020-07-17 22:52:11,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:52:11,397 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126041157] [2020-07-17 22:52:11,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:52:11,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-17 22:52:11,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042489670] [2020-07-17 22:52:11,400 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2020-07-17 22:52:11,400 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:52:11,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-17 22:52:11,424 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:52:11,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 22:52:11,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:52:11,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 22:52:11,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:52:11,425 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 7 states. [2020-07-17 22:52:11,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:11,807 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2020-07-17 22:52:11,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 22:52:11,807 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2020-07-17 22:52:11,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:52:11,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:52:11,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2020-07-17 22:52:11,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:52:11,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2020-07-17 22:52:11,814 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 30 transitions. [2020-07-17 22:52:11,862 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:52:11,864 INFO L225 Difference]: With dead ends: 26 [2020-07-17 22:52:11,865 INFO L226 Difference]: Without dead ends: 21 [2020-07-17 22:52:11,866 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-07-17 22:52:11,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-17 22:52:11,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 15. [2020-07-17 22:52:11,880 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:52:11,880 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 15 states. [2020-07-17 22:52:11,880 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 15 states. [2020-07-17 22:52:11,881 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 15 states. [2020-07-17 22:52:11,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:11,884 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2020-07-17 22:52:11,884 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-17 22:52:11,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:11,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:11,885 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 21 states. [2020-07-17 22:52:11,886 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 21 states. [2020-07-17 22:52:11,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:11,888 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2020-07-17 22:52:11,889 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-17 22:52:11,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:11,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:11,890 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:52:11,890 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:52:11,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-17 22:52:11,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2020-07-17 22:52:11,893 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2020-07-17 22:52:11,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:52:11,893 INFO L479 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2020-07-17 22:52:11,893 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 22:52:11,894 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2020-07-17 22:52:11,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-17 22:52:11,894 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:52:11,894 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:52:11,895 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:52:11,895 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:52:11,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:52:11,896 INFO L82 PathProgramCache]: Analyzing trace with hash -18708286, now seen corresponding path program 1 times [2020-07-17 22:52:11,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:52:11,896 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397545859] [2020-07-17 22:52:11,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:52:11,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:12,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:12,046 INFO L280 TraceCheckUtils]: 0: Hoare triple {241#true} assume true; {241#true} is VALID [2020-07-17 22:52:12,046 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {241#true} {241#true} #50#return; {241#true} is VALID [2020-07-17 22:52:12,047 INFO L263 TraceCheckUtils]: 0: Hoare triple {241#true} call ULTIMATE.init(); {241#true} is VALID [2020-07-17 22:52:12,047 INFO L280 TraceCheckUtils]: 1: Hoare triple {241#true} assume true; {241#true} is VALID [2020-07-17 22:52:12,048 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {241#true} {241#true} #50#return; {241#true} is VALID [2020-07-17 22:52:12,048 INFO L263 TraceCheckUtils]: 3: Hoare triple {241#true} call #t~ret3 := main(); {241#true} is VALID [2020-07-17 22:52:12,049 INFO L280 TraceCheckUtils]: 4: Hoare triple {241#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0; {245#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-17 22:52:12,051 INFO L280 TraceCheckUtils]: 5: Hoare triple {245#(and (<= 0 main_~n~0) (<= main_~n~0 0))} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {246#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} is VALID [2020-07-17 22:52:12,052 INFO L280 TraceCheckUtils]: 6: Hoare triple {246#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} assume !!(~i~0 < 2 * ~k~0); {247#(and (<= (+ main_~n~0 1) main_~k~0) (<= main_~i~0 (* 2 main_~n~0)))} is VALID [2020-07-17 22:52:12,054 INFO L280 TraceCheckUtils]: 7: Hoare triple {247#(and (<= (+ main_~n~0 1) main_~k~0) (<= main_~i~0 (* 2 main_~n~0)))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post2 := ~n~0;~n~0 := 1 + #t~post2;havoc #t~post2; {248#(<= (+ main_~i~0 2) (* 2 main_~k~0))} is VALID [2020-07-17 22:52:12,056 INFO L280 TraceCheckUtils]: 8: Hoare triple {248#(<= (+ main_~i~0 2) (* 2 main_~k~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {249#(<= (+ main_~i~0 1) (* 2 main_~k~0))} is VALID [2020-07-17 22:52:12,058 INFO L280 TraceCheckUtils]: 9: Hoare triple {249#(<= (+ main_~i~0 1) (* 2 main_~k~0))} assume !(~i~0 < 2 * ~k~0); {242#false} is VALID [2020-07-17 22:52:12,058 INFO L263 TraceCheckUtils]: 10: Hoare triple {242#false} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {242#false} is VALID [2020-07-17 22:52:12,059 INFO L280 TraceCheckUtils]: 11: Hoare triple {242#false} ~cond := #in~cond; {242#false} is VALID [2020-07-17 22:52:12,059 INFO L280 TraceCheckUtils]: 12: Hoare triple {242#false} assume 0 == ~cond; {242#false} is VALID [2020-07-17 22:52:12,060 INFO L280 TraceCheckUtils]: 13: Hoare triple {242#false} assume !false; {242#false} is VALID [2020-07-17 22:52:12,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:52:12,062 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397545859] [2020-07-17 22:52:12,062 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084583833] [2020-07-17 22:52:12,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:52:12,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:12,104 INFO L264 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-17 22:52:12,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:12,120 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:52:12,341 INFO L263 TraceCheckUtils]: 0: Hoare triple {241#true} call ULTIMATE.init(); {241#true} is VALID [2020-07-17 22:52:12,341 INFO L280 TraceCheckUtils]: 1: Hoare triple {241#true} assume true; {241#true} is VALID [2020-07-17 22:52:12,342 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {241#true} {241#true} #50#return; {241#true} is VALID [2020-07-17 22:52:12,342 INFO L263 TraceCheckUtils]: 3: Hoare triple {241#true} call #t~ret3 := main(); {241#true} is VALID [2020-07-17 22:52:12,343 INFO L280 TraceCheckUtils]: 4: Hoare triple {241#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0; {245#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-17 22:52:12,345 INFO L280 TraceCheckUtils]: 5: Hoare triple {245#(and (<= 0 main_~n~0) (<= main_~n~0 0))} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {268#(and (<= 0 main_~n~0) (<= main_~n~0 0) (= 0 main_~i~0))} is VALID [2020-07-17 22:52:12,347 INFO L280 TraceCheckUtils]: 6: Hoare triple {268#(and (<= 0 main_~n~0) (<= main_~n~0 0) (= 0 main_~i~0))} assume !!(~i~0 < 2 * ~k~0); {272#(and (<= 0 main_~n~0) (<= main_~n~0 0) (= 0 main_~i~0) (< main_~i~0 (* 2 main_~k~0)))} is VALID [2020-07-17 22:52:12,348 INFO L280 TraceCheckUtils]: 7: Hoare triple {272#(and (<= 0 main_~n~0) (<= main_~n~0 0) (= 0 main_~i~0) (< main_~i~0 (* 2 main_~k~0)))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post2 := ~n~0;~n~0 := 1 + #t~post2;havoc #t~post2; {276#(and (= 0 main_~i~0) (< main_~i~0 (* 2 main_~k~0)))} is VALID [2020-07-17 22:52:12,349 INFO L280 TraceCheckUtils]: 8: Hoare triple {276#(and (= 0 main_~i~0) (< main_~i~0 (* 2 main_~k~0)))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {280#(and (<= main_~i~0 1) (< 0 (* 2 main_~k~0)))} is VALID [2020-07-17 22:52:12,351 INFO L280 TraceCheckUtils]: 9: Hoare triple {280#(and (<= main_~i~0 1) (< 0 (* 2 main_~k~0)))} assume !(~i~0 < 2 * ~k~0); {242#false} is VALID [2020-07-17 22:52:12,352 INFO L263 TraceCheckUtils]: 10: Hoare triple {242#false} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {242#false} is VALID [2020-07-17 22:52:12,352 INFO L280 TraceCheckUtils]: 11: Hoare triple {242#false} ~cond := #in~cond; {242#false} is VALID [2020-07-17 22:52:12,352 INFO L280 TraceCheckUtils]: 12: Hoare triple {242#false} assume 0 == ~cond; {242#false} is VALID [2020-07-17 22:52:12,353 INFO L280 TraceCheckUtils]: 13: Hoare triple {242#false} assume !false; {242#false} is VALID [2020-07-17 22:52:12,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:52:12,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:52:12,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2020-07-17 22:52:12,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340728767] [2020-07-17 22:52:12,356 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2020-07-17 22:52:12,356 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:52:12,357 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-17 22:52:12,387 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:52:12,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-17 22:52:12,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:52:12,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-17 22:52:12,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-07-17 22:52:12,389 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 11 states. [2020-07-17 22:52:12,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:12,725 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2020-07-17 22:52:12,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-17 22:52:12,726 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2020-07-17 22:52:12,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:52:12,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-17 22:52:12,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 37 transitions. [2020-07-17 22:52:12,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-17 22:52:12,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 37 transitions. [2020-07-17 22:52:12,739 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 37 transitions. [2020-07-17 22:52:12,804 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:52:12,808 INFO L225 Difference]: With dead ends: 31 [2020-07-17 22:52:12,808 INFO L226 Difference]: Without dead ends: 23 [2020-07-17 22:52:12,813 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2020-07-17 22:52:12,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-17 22:52:12,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2020-07-17 22:52:12,839 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:52:12,839 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 18 states. [2020-07-17 22:52:12,839 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 18 states. [2020-07-17 22:52:12,840 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 18 states. [2020-07-17 22:52:12,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:12,844 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2020-07-17 22:52:12,845 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2020-07-17 22:52:12,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:12,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:12,846 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 23 states. [2020-07-17 22:52:12,846 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 23 states. [2020-07-17 22:52:12,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:12,857 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2020-07-17 22:52:12,857 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2020-07-17 22:52:12,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:12,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:12,862 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:52:12,863 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:52:12,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-17 22:52:12,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2020-07-17 22:52:12,864 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 14 [2020-07-17 22:52:12,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:52:12,865 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2020-07-17 22:52:12,865 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-17 22:52:12,865 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-07-17 22:52:12,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-17 22:52:12,867 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:52:12,867 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:52:13,083 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-17 22:52:13,084 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:52:13,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:52:13,085 INFO L82 PathProgramCache]: Analyzing trace with hash 154986550, now seen corresponding path program 1 times [2020-07-17 22:52:13,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:52:13,086 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69229073] [2020-07-17 22:52:13,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:52:13,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:13,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:13,501 INFO L280 TraceCheckUtils]: 0: Hoare triple {414#true} assume true; {414#true} is VALID [2020-07-17 22:52:13,502 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {414#true} {414#true} #50#return; {414#true} is VALID [2020-07-17 22:52:13,502 INFO L263 TraceCheckUtils]: 0: Hoare triple {414#true} call ULTIMATE.init(); {414#true} is VALID [2020-07-17 22:52:13,503 INFO L280 TraceCheckUtils]: 1: Hoare triple {414#true} assume true; {414#true} is VALID [2020-07-17 22:52:13,503 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {414#true} {414#true} #50#return; {414#true} is VALID [2020-07-17 22:52:13,504 INFO L263 TraceCheckUtils]: 3: Hoare triple {414#true} call #t~ret3 := main(); {414#true} is VALID [2020-07-17 22:52:13,508 INFO L280 TraceCheckUtils]: 4: Hoare triple {414#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0; {418#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-17 22:52:13,510 INFO L280 TraceCheckUtils]: 5: Hoare triple {418#(and (<= 0 main_~n~0) (<= main_~n~0 0))} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {419#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} is VALID [2020-07-17 22:52:13,512 INFO L280 TraceCheckUtils]: 6: Hoare triple {419#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} assume !!(~i~0 < 2 * ~k~0); {419#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} is VALID [2020-07-17 22:52:13,514 INFO L280 TraceCheckUtils]: 7: Hoare triple {419#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post2 := ~n~0;~n~0 := 1 + #t~post2;havoc #t~post2; {420#(and (<= (* 2 main_~n~0) (+ main_~i~0 2)) (<= (+ main_~i~0 2) (* 2 main_~n~0)))} is VALID [2020-07-17 22:52:13,516 INFO L280 TraceCheckUtils]: 8: Hoare triple {420#(and (<= (* 2 main_~n~0) (+ main_~i~0 2)) (<= (+ main_~i~0 2) (* 2 main_~n~0)))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {421#(and (<= (* 2 main_~n~0) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* 2 main_~n~0)))} is VALID [2020-07-17 22:52:13,519 INFO L280 TraceCheckUtils]: 9: Hoare triple {421#(and (<= (* 2 main_~n~0) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* 2 main_~n~0)))} assume !!(~i~0 < 2 * ~k~0); {422#(and (or (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} is VALID [2020-07-17 22:52:13,520 INFO L280 TraceCheckUtils]: 10: Hoare triple {422#(and (or (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {422#(and (or (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} is VALID [2020-07-17 22:52:13,523 INFO L280 TraceCheckUtils]: 11: Hoare triple {422#(and (or (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {423#(and (or (<= main_~i~0 (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} is VALID [2020-07-17 22:52:13,525 INFO L280 TraceCheckUtils]: 12: Hoare triple {423#(and (or (<= main_~i~0 (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} assume !(~i~0 < 2 * ~k~0); {424#(and (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0))} is VALID [2020-07-17 22:52:13,527 INFO L263 TraceCheckUtils]: 13: Hoare triple {424#(and (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0))} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {425#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:52:13,528 INFO L280 TraceCheckUtils]: 14: Hoare triple {425#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {426#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-17 22:52:13,528 INFO L280 TraceCheckUtils]: 15: Hoare triple {426#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {415#false} is VALID [2020-07-17 22:52:13,529 INFO L280 TraceCheckUtils]: 16: Hoare triple {415#false} assume !false; {415#false} is VALID [2020-07-17 22:52:13,530 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:52:13,532 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69229073] [2020-07-17 22:52:13,533 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895712653] [2020-07-17 22:52:13,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:52:13,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:13,568 INFO L264 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-17 22:52:13,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:13,577 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:52:13,889 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-17 22:52:13,912 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-17 22:52:13,939 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-17 22:52:13,967 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-17 22:52:14,057 INFO L263 TraceCheckUtils]: 0: Hoare triple {414#true} call ULTIMATE.init(); {414#true} is VALID [2020-07-17 22:52:14,058 INFO L280 TraceCheckUtils]: 1: Hoare triple {414#true} assume true; {414#true} is VALID [2020-07-17 22:52:14,059 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {414#true} {414#true} #50#return; {414#true} is VALID [2020-07-17 22:52:14,059 INFO L263 TraceCheckUtils]: 3: Hoare triple {414#true} call #t~ret3 := main(); {414#true} is VALID [2020-07-17 22:52:14,061 INFO L280 TraceCheckUtils]: 4: Hoare triple {414#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0; {418#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-17 22:52:14,062 INFO L280 TraceCheckUtils]: 5: Hoare triple {418#(and (<= 0 main_~n~0) (<= main_~n~0 0))} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {445#(and (<= 0 main_~n~0) (<= main_~n~0 0) (= 0 main_~i~0))} is VALID [2020-07-17 22:52:14,064 INFO L280 TraceCheckUtils]: 6: Hoare triple {445#(and (<= 0 main_~n~0) (<= main_~n~0 0) (= 0 main_~i~0))} assume !!(~i~0 < 2 * ~k~0); {445#(and (<= 0 main_~n~0) (<= main_~n~0 0) (= 0 main_~i~0))} is VALID [2020-07-17 22:52:14,067 INFO L280 TraceCheckUtils]: 7: Hoare triple {445#(and (<= 0 main_~n~0) (<= main_~n~0 0) (= 0 main_~i~0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post2 := ~n~0;~n~0 := 1 + #t~post2;havoc #t~post2; {452#(and (= 0 main_~i~0) (<= 1 main_~n~0) (<= main_~n~0 1))} is VALID [2020-07-17 22:52:14,068 INFO L280 TraceCheckUtils]: 8: Hoare triple {452#(and (= 0 main_~i~0) (<= 1 main_~n~0) (<= main_~n~0 1))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {456#(and (= 1 main_~i~0) (<= 1 main_~n~0) (<= main_~n~0 1))} is VALID [2020-07-17 22:52:14,069 INFO L280 TraceCheckUtils]: 9: Hoare triple {456#(and (= 1 main_~i~0) (<= 1 main_~n~0) (<= main_~n~0 1))} assume !!(~i~0 < 2 * ~k~0); {460#(and (= 1 main_~i~0) (<= 1 main_~n~0) (< main_~i~0 (* 2 main_~k~0)) (<= main_~n~0 1))} is VALID [2020-07-17 22:52:14,071 INFO L280 TraceCheckUtils]: 10: Hoare triple {460#(and (= 1 main_~i~0) (<= 1 main_~n~0) (< main_~i~0 (* 2 main_~k~0)) (<= main_~n~0 1))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {460#(and (= 1 main_~i~0) (<= 1 main_~n~0) (< main_~i~0 (* 2 main_~k~0)) (<= main_~n~0 1))} is VALID [2020-07-17 22:52:14,072 INFO L280 TraceCheckUtils]: 11: Hoare triple {460#(and (= 1 main_~i~0) (<= 1 main_~n~0) (< main_~i~0 (* 2 main_~k~0)) (<= main_~n~0 1))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {467#(and (<= main_~i~0 2) (< 1 (* 2 main_~k~0)) (<= 1 main_~n~0) (<= main_~n~0 1))} is VALID [2020-07-17 22:52:14,075 INFO L280 TraceCheckUtils]: 12: Hoare triple {467#(and (<= main_~i~0 2) (< 1 (* 2 main_~k~0)) (<= 1 main_~n~0) (<= main_~n~0 1))} assume !(~i~0 < 2 * ~k~0); {471#(and (< 1 (* 2 main_~k~0)) (<= 1 main_~n~0) (<= (* 2 main_~k~0) 2) (<= main_~n~0 1))} is VALID [2020-07-17 22:52:14,077 INFO L263 TraceCheckUtils]: 13: Hoare triple {471#(and (< 1 (* 2 main_~k~0)) (<= 1 main_~n~0) (<= (* 2 main_~k~0) 2) (<= main_~n~0 1))} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {475#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-17 22:52:14,078 INFO L280 TraceCheckUtils]: 14: Hoare triple {475#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {479#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:52:14,079 INFO L280 TraceCheckUtils]: 15: Hoare triple {479#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {415#false} is VALID [2020-07-17 22:52:14,079 INFO L280 TraceCheckUtils]: 16: Hoare triple {415#false} assume !false; {415#false} is VALID [2020-07-17 22:52:14,081 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:52:14,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:52:14,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2020-07-17 22:52:14,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146077395] [2020-07-17 22:52:14,082 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 17 [2020-07-17 22:52:14,082 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:52:14,083 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2020-07-17 22:52:14,151 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:52:14,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-17 22:52:14,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:52:14,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-17 22:52:14,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2020-07-17 22:52:14,153 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 19 states. [2020-07-17 22:52:14,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:14,849 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2020-07-17 22:52:14,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-17 22:52:14,850 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 17 [2020-07-17 22:52:14,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:52:14,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-17 22:52:14,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 39 transitions. [2020-07-17 22:52:14,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-17 22:52:14,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 39 transitions. [2020-07-17 22:52:14,856 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 39 transitions. [2020-07-17 22:52:14,922 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:52:14,923 INFO L225 Difference]: With dead ends: 34 [2020-07-17 22:52:14,923 INFO L226 Difference]: Without dead ends: 0 [2020-07-17 22:52:14,925 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2020-07-17 22:52:14,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-17 22:52:14,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-17 22:52:14,926 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:52:14,926 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-17 22:52:14,926 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:52:14,926 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:52:14,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:14,927 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:52:14,927 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:52:14,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:14,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:14,927 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:52:14,927 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:52:14,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:14,928 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:52:14,928 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:52:14,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:14,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:14,928 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:52:14,928 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:52:14,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-17 22:52:14,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-17 22:52:14,929 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2020-07-17 22:52:14,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:52:14,929 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-17 22:52:14,930 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-17 22:52:14,930 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:52:14,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:15,140 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:52:15,145 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-17 22:52:15,331 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-17 22:52:15,332 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:52:15,332 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:52:15,332 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-17 22:52:15,332 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-17 22:52:15,332 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-17 22:52:15,332 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-17 22:52:15,333 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-17 22:52:15,333 INFO L268 CegarLoopResult]: For program point L4-2(lines 3 5) no Hoare annotation was computed. [2020-07-17 22:52:15,333 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-17 22:52:15,333 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 25) the Hoare annotation is: true [2020-07-17 22:52:15,333 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 13 25) no Hoare annotation was computed. [2020-07-17 22:52:15,333 INFO L268 CegarLoopResult]: For program point L23(line 23) no Hoare annotation was computed. [2020-07-17 22:52:15,333 INFO L268 CegarLoopResult]: For program point L19(lines 19 21) no Hoare annotation was computed. [2020-07-17 22:52:15,334 INFO L268 CegarLoopResult]: For program point L17(line 17) no Hoare annotation was computed. [2020-07-17 22:52:15,334 INFO L268 CegarLoopResult]: For program point L18-2(lines 18 22) no Hoare annotation was computed. [2020-07-17 22:52:15,334 INFO L264 CegarLoopResult]: At program point L18-3(lines 18 22) the Hoare annotation is: (let ((.cse1 (* 2 main_~n~0))) (let ((.cse0 (<= main_~i~0 .cse1))) (or (and (<= main_~n~0 0) .cse0 (= 0 main_~i~0)) (and .cse0 (<= .cse1 main_~i~0) (<= main_~n~0 main_~k~0)) (let ((.cse2 (+ main_~i~0 1))) (and (<= .cse1 .cse2) (<= .cse2 (* 2 main_~k~0)) (<= .cse2 .cse1)))))) [2020-07-17 22:52:15,334 INFO L264 CegarLoopResult]: At program point L18-4(lines 18 22) the Hoare annotation is: (let ((.cse2 (* 2 main_~n~0))) (let ((.cse0 (<= main_~i~0 .cse2)) (.cse1 (<= main_~k~0 main_~n~0))) (or (and (<= 0 main_~n~0) (<= main_~n~0 0) .cse0 .cse1) (and .cse0 .cse1 (<= .cse2 main_~i~0) (<= main_~n~0 main_~k~0))))) [2020-07-17 22:52:15,334 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 13 25) no Hoare annotation was computed. [2020-07-17 22:52:15,335 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-17 22:52:15,335 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 6 11) no Hoare annotation was computed. [2020-07-17 22:52:15,335 INFO L268 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed. [2020-07-17 22:52:15,335 INFO L268 CegarLoopResult]: For program point L7(lines 7 9) no Hoare annotation was computed. [2020-07-17 22:52:15,335 INFO L268 CegarLoopResult]: For program point L7-2(lines 6 11) no Hoare annotation was computed. [2020-07-17 22:52:15,335 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-17 22:52:15,341 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:52:15,341 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-17 22:52:15,341 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-17 22:52:15,342 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-17 22:52:15,342 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:52:15,342 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:52:15,342 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-17 22:52:15,342 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-17 22:52:15,342 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-17 22:52:15,342 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-17 22:52:15,342 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-17 22:52:15,343 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-17 22:52:15,343 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:52:15,343 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-17 22:52:15,343 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:52:15,346 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-17 22:52:15,346 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-17 22:52:15,346 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-17 22:52:15,346 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2020-07-17 22:52:15,346 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:52:15,346 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-17 22:52:15,347 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-17 22:52:15,347 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-17 22:52:15,347 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:52:15,347 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-17 22:52:15,347 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2020-07-17 22:52:15,347 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-17 22:52:15,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:52:15 BoogieIcfgContainer [2020-07-17 22:52:15,361 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:52:15,364 INFO L168 Benchmark]: Toolchain (without parser) took 6017.89 ms. Allocated memory was 137.9 MB in the beginning and 250.1 MB in the end (delta: 112.2 MB). Free memory was 100.5 MB in the beginning and 127.7 MB in the end (delta: -27.2 MB). Peak memory consumption was 85.0 MB. Max. memory is 7.1 GB. [2020-07-17 22:52:15,365 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 137.9 MB. Free memory was 118.8 MB in the beginning and 118.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-17 22:52:15,366 INFO L168 Benchmark]: CACSL2BoogieTranslator took 358.86 ms. Allocated memory is still 137.9 MB. Free memory was 100.1 MB in the beginning and 90.4 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-07-17 22:52:15,367 INFO L168 Benchmark]: Boogie Preprocessor took 146.10 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 90.4 MB in the beginning and 180.6 MB in the end (delta: -90.2 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2020-07-17 22:52:15,368 INFO L168 Benchmark]: RCFGBuilder took 429.39 ms. Allocated memory is still 201.3 MB. Free memory was 180.6 MB in the beginning and 162.4 MB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 7.1 GB. [2020-07-17 22:52:15,369 INFO L168 Benchmark]: TraceAbstraction took 5066.75 ms. Allocated memory was 201.3 MB in the beginning and 250.1 MB in the end (delta: 48.8 MB). Free memory was 162.4 MB in the beginning and 127.7 MB in the end (delta: 34.7 MB). Peak memory consumption was 83.4 MB. Max. memory is 7.1 GB. [2020-07-17 22:52:15,373 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 137.9 MB. Free memory was 118.8 MB in the beginning and 118.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 358.86 ms. Allocated memory is still 137.9 MB. Free memory was 100.1 MB in the beginning and 90.4 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 146.10 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 90.4 MB in the beginning and 180.6 MB in the end (delta: -90.2 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 429.39 ms. Allocated memory is still 201.3 MB. Free memory was 180.6 MB in the beginning and 162.4 MB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5066.75 ms. Allocated memory was 201.3 MB in the beginning and 250.1 MB in the end (delta: 48.8 MB). Free memory was 162.4 MB in the beginning and 127.7 MB in the end (delta: 34.7 MB). Peak memory consumption was 83.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: 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: 18]: Loop Invariant Derived loop invariant: (((n <= 0 && i <= 2 * n) && 0 == i) || ((i <= 2 * n && 2 * n <= i) && n <= k)) || ((2 * n <= i + 1 && i + 1 <= 2 * k) && i + 1 <= 2 * n) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4.7s, OverallIterations: 4, TraceHistogramMax: 2, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 51 SDtfs, 40 SDslu, 152 SDs, 0 SdLazy, 184 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 11 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 12 PreInvPairs, 20 NumberOfFragments, 87 HoareAnnotationTreeSize, 12 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 89 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 84 NumberOfCodeBlocks, 84 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 78 ConstructedInterpolants, 0 QuantifiedInterpolants, 5789 SizeOfPredicates, 6 NumberOfNonLiveVariables, 82 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 0/12 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...