/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-zilu/benchmark26_linear.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 07:10:42,629 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 07:10:42,631 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 07:10:42,667 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 07:10:42,667 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 07:10:42,668 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 07:10:42,669 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 07:10:42,670 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 07:10:42,683 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 07:10:42,684 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 07:10:42,685 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 07:10:42,685 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 07:10:42,685 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 07:10:42,686 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 07:10:42,687 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 07:10:42,687 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 07:10:42,688 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 07:10:42,688 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 07:10:42,689 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 07:10:42,690 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 07:10:42,691 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 07:10:42,692 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 07:10:42,693 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 07:10:42,694 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 07:10:42,694 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 07:10:42,696 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 07:10:42,697 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 07:10:42,697 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 07:10:42,698 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 07:10:42,698 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 07:10:42,699 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 07:10:42,699 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 07:10:42,700 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 07:10:42,700 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 07:10:42,701 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 07:10:42,701 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 07:10:42,701 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 07:10:42,702 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 07:10:42,702 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 07:10:42,702 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 07:10:42,703 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 07:10:42,703 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 07:10:42,704 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 07:10:42,714 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 07:10:42,715 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 07:10:42,716 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 07:10:42,716 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 07:10:42,716 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 07:10:42,716 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 07:10:42,716 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 07:10:42,716 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 07:10:42,716 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 07:10:42,717 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 07:10:42,717 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 07:10:42,717 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 07:10:42,717 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 07:10:42,717 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 07:10:42,717 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 07:10:42,717 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 07:10:42,718 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 07:10:42,718 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 07:10:42,718 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 07:10:42,718 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 07:10:42,718 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 07:10:42,718 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 07:10:42,718 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 07:10:42,718 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 07:10:42,718 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 07:10:42,718 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 07:10:42,919 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 07:10:42,932 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 07:10:42,934 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 07:10:42,934 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 07:10:42,935 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 07:10:42,935 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-zilu/benchmark26_linear.i [2022-04-15 07:10:42,978 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74cd15b52/2b9287392e7c4cd1a22f6175e6b4a3ec/FLAGc8d9f1999 [2022-04-15 07:10:43,283 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 07:10:43,283 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark26_linear.i [2022-04-15 07:10:43,288 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74cd15b52/2b9287392e7c4cd1a22f6175e6b4a3ec/FLAGc8d9f1999 [2022-04-15 07:10:43,733 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74cd15b52/2b9287392e7c4cd1a22f6175e6b4a3ec [2022-04-15 07:10:43,735 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 07:10:43,736 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 07:10:43,737 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 07:10:43,737 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 07:10:43,748 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 07:10:43,749 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 07:10:43" (1/1) ... [2022-04-15 07:10:43,750 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@513944cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:10:43, skipping insertion in model container [2022-04-15 07:10:43,750 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 07:10:43" (1/1) ... [2022-04-15 07:10:43,755 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 07:10:43,765 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 07:10:43,893 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark26_linear.i[868,881] [2022-04-15 07:10:43,920 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 07:10:43,933 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 07:10:43,942 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark26_linear.i[868,881] [2022-04-15 07:10:43,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 07:10:43,955 INFO L208 MainTranslator]: Completed translation [2022-04-15 07:10:43,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:10:43 WrapperNode [2022-04-15 07:10:43,955 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 07:10:43,956 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 07:10:43,956 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 07:10:43,956 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 07:10:43,962 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:10:43" (1/1) ... [2022-04-15 07:10:43,962 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:10:43" (1/1) ... [2022-04-15 07:10:43,966 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:10:43" (1/1) ... [2022-04-15 07:10:43,966 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:10:43" (1/1) ... [2022-04-15 07:10:43,974 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:10:43" (1/1) ... [2022-04-15 07:10:43,978 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:10:43" (1/1) ... [2022-04-15 07:10:43,982 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:10:43" (1/1) ... [2022-04-15 07:10:43,984 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 07:10:43,985 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 07:10:43,985 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 07:10:43,985 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 07:10:43,986 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:10:43" (1/1) ... [2022-04-15 07:10:43,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 07:10:43,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:10:44,009 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 07:10:44,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 07:10:44,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 07:10:44,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 07:10:44,044 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 07:10:44,044 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 07:10:44,044 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 07:10:44,044 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 07:10:44,044 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 07:10:44,045 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 07:10:44,045 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 07:10:44,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 07:10:44,045 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 07:10:44,046 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-04-15 07:10:44,046 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 07:10:44,046 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 07:10:44,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 07:10:44,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 07:10:44,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 07:10:44,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 07:10:44,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 07:10:44,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 07:10:44,095 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 07:10:44,096 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 07:10:44,235 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 07:10:44,240 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 07:10:44,240 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 07:10:44,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 07:10:44 BoogieIcfgContainer [2022-04-15 07:10:44,241 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 07:10:44,243 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 07:10:44,243 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 07:10:44,261 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 07:10:44,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 07:10:43" (1/3) ... [2022-04-15 07:10:44,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b4d8343 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 07:10:44, skipping insertion in model container [2022-04-15 07:10:44,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:10:43" (2/3) ... [2022-04-15 07:10:44,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b4d8343 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 07:10:44, skipping insertion in model container [2022-04-15 07:10:44,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 07:10:44" (3/3) ... [2022-04-15 07:10:44,264 INFO L111 eAbstractionObserver]: Analyzing ICFG benchmark26_linear.i [2022-04-15 07:10:44,267 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 07:10:44,267 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 07:10:44,317 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 07:10:44,321 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 07:10:44,322 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 07:10:44,332 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:10:44,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 07:10:44,337 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:10:44,337 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:10:44,337 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:10:44,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:10:44,340 INFO L85 PathProgramCache]: Analyzing trace with hash -304977768, now seen corresponding path program 1 times [2022-04-15 07:10:44,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:10:44,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [162940010] [2022-04-15 07:10:44,364 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:10:44,364 INFO L85 PathProgramCache]: Analyzing trace with hash -304977768, now seen corresponding path program 2 times [2022-04-15 07:10:44,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:10:44,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532619380] [2022-04-15 07:10:44,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:10:44,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:10:44,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:10:44,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:10:44,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:10:44,569 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {23#true} is VALID [2022-04-15 07:10:44,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-15 07:10:44,569 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #45#return; {23#true} is VALID [2022-04-15 07:10:44,570 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:10:44,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {23#true} is VALID [2022-04-15 07:10:44,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-15 07:10:44,571 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #45#return; {23#true} is VALID [2022-04-15 07:10:44,571 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret3 := main(); {23#true} is VALID [2022-04-15 07:10:44,571 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~x~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~y~0 := #t~nondet2;havoc #t~nondet2; {23#true} is VALID [2022-04-15 07:10:44,573 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} assume !!(~x~0 < ~y~0); {28#(<= (+ main_~x~0 1) main_~y~0)} is VALID [2022-04-15 07:10:44,574 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#(<= (+ main_~x~0 1) main_~y~0)} assume !(~x~0 < ~y~0); {24#false} is VALID [2022-04-15 07:10:44,574 INFO L272 TraceCheckUtils]: 8: Hoare triple {24#false} call __VERIFIER_assert((if ~x~0 == ~y~0 then 1 else 0)); {24#false} is VALID [2022-04-15 07:10:44,574 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2022-04-15 07:10:44,574 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2022-04-15 07:10:44,574 INFO L290 TraceCheckUtils]: 11: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-15 07:10:44,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 07:10:44,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:10:44,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532619380] [2022-04-15 07:10:44,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532619380] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:10:44,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:10:44,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:10:44,578 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:10:44,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [162940010] [2022-04-15 07:10:44,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [162940010] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:10:44,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:10:44,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:10:44,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593558177] [2022-04-15 07:10:44,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:10:44,582 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 07:10:44,583 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:10:44,585 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:10:44,604 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:10:44,605 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 07:10:44,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:10:44,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 07:10:44,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 07:10:44,626 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:10:44,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:44,747 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-15 07:10:44,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 07:10:44,747 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 07:10:44,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:10:44,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:10:44,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-04-15 07:10:44,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:10:44,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-04-15 07:10:44,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 39 transitions. [2022-04-15 07:10:44,797 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:10:44,802 INFO L225 Difference]: With dead ends: 33 [2022-04-15 07:10:44,802 INFO L226 Difference]: Without dead ends: 14 [2022-04-15 07:10:44,804 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 07:10:44,808 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 12 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:10:44,809 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 28 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 07:10:44,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-15 07:10:44,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-15 07:10:44,830 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:10:44,831 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:10:44,831 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:10:44,832 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:10:44,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:44,833 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-15 07:10:44,833 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 07:10:44,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:10:44,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:10:44,834 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-15 07:10:44,834 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-15 07:10:44,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:44,836 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-15 07:10:44,836 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 07:10:44,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:10:44,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:10:44,836 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:10:44,836 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:10:44,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:10:44,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-15 07:10:44,838 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-15 07:10:44,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:10:44,839 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-15 07:10:44,839 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:10:44,839 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 14 transitions. [2022-04-15 07:10:44,850 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:10:44,850 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 07:10:44,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 07:10:44,851 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:10:44,851 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:10:44,851 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 07:10:44,851 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:10:44,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:10:44,852 INFO L85 PathProgramCache]: Analyzing trace with hash -828987386, now seen corresponding path program 1 times [2022-04-15 07:10:44,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:10:44,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [361059799] [2022-04-15 07:10:48,975 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:10:49,086 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:49,096 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:10:49,099 INFO L85 PathProgramCache]: Analyzing trace with hash 28963623, now seen corresponding path program 1 times [2022-04-15 07:10:49,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:10:49,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272495068] [2022-04-15 07:10:49,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:10:49,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:10:49,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:10:49,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:10:49,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:10:49,246 INFO L290 TraceCheckUtils]: 0: Hoare triple {166#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {156#true} is VALID [2022-04-15 07:10:49,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {156#true} assume true; {156#true} is VALID [2022-04-15 07:10:49,246 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {156#true} {156#true} #45#return; {156#true} is VALID [2022-04-15 07:10:49,247 INFO L272 TraceCheckUtils]: 0: Hoare triple {156#true} call ULTIMATE.init(); {166#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:10:49,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {166#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {156#true} is VALID [2022-04-15 07:10:49,247 INFO L290 TraceCheckUtils]: 2: Hoare triple {156#true} assume true; {156#true} is VALID [2022-04-15 07:10:49,247 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {156#true} {156#true} #45#return; {156#true} is VALID [2022-04-15 07:10:49,247 INFO L272 TraceCheckUtils]: 4: Hoare triple {156#true} call #t~ret3 := main(); {156#true} is VALID [2022-04-15 07:10:49,248 INFO L290 TraceCheckUtils]: 5: Hoare triple {156#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~x~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~y~0 := #t~nondet2;havoc #t~nondet2; {156#true} is VALID [2022-04-15 07:10:49,248 INFO L290 TraceCheckUtils]: 6: Hoare triple {156#true} assume !!(~x~0 < ~y~0); {161#(<= (+ main_~x~0 1) main_~y~0)} is VALID [2022-04-15 07:10:49,249 INFO L290 TraceCheckUtils]: 7: Hoare triple {161#(<= (+ main_~x~0 1) main_~y~0)} [49] L23-2-->L23-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_10 v_main_~x~0_9))) (or (and (< v_main_~x~0_9 (+ v_main_~y~0_8 1)) (< v_main_~x~0_10 v_main_~x~0_9)) (and (= v_main_~y~0_8 v_main_~y~0_8) .cse0) (and (not (< v_main_~x~0_10 v_main_~y~0_8)) .cse0))) InVars {main_~x~0=v_main_~x~0_10, main_~y~0=v_main_~y~0_8} OutVars{main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_8} AuxVars[] AssignedVars[main_~x~0] {162#(< main_~x~0 (+ main_~y~0 1))} is VALID [2022-04-15 07:10:49,249 INFO L290 TraceCheckUtils]: 8: Hoare triple {162#(< main_~x~0 (+ main_~y~0 1))} [48] L23-3_primed-->L23-3: Formula: (not (< v_main_~x~0_1 v_main_~y~0_1)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {163#(= (+ main_~y~0 (* (- 1) main_~x~0)) 0)} is VALID [2022-04-15 07:10:49,250 INFO L272 TraceCheckUtils]: 9: Hoare triple {163#(= (+ main_~y~0 (* (- 1) main_~x~0)) 0)} call __VERIFIER_assert((if ~x~0 == ~y~0 then 1 else 0)); {164#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:10:49,251 INFO L290 TraceCheckUtils]: 10: Hoare triple {164#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {165#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:10:49,251 INFO L290 TraceCheckUtils]: 11: Hoare triple {165#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {157#false} is VALID [2022-04-15 07:10:49,251 INFO L290 TraceCheckUtils]: 12: Hoare triple {157#false} assume !false; {157#false} is VALID [2022-04-15 07:10:49,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 07:10:49,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:10:49,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272495068] [2022-04-15 07:10:49,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272495068] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:10:49,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:10:49,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 07:10:49,328 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:10:49,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [361059799] [2022-04-15 07:10:49,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [361059799] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:10:49,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:10:49,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 07:10:49,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879695974] [2022-04-15 07:10:49,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:10:49,329 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 07:10:49,330 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:10:49,330 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:10:49,341 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:10:49,341 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 07:10:49,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:10:49,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 07:10:49,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-04-15 07:10:49,342 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:10:49,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:49,436 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-15 07:10:49,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 07:10:49,436 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 07:10:49,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:10:49,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:10:49,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 13 transitions. [2022-04-15 07:10:49,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:10:49,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 13 transitions. [2022-04-15 07:10:49,438 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 13 transitions. [2022-04-15 07:10:49,450 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:10:49,450 INFO L225 Difference]: With dead ends: 14 [2022-04-15 07:10:49,451 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 07:10:49,451 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-04-15 07:10:49,452 INFO L913 BasicCegarLoop]: 8 mSDtfsCounter, 6 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:10:49,452 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 25 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 07:10:49,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 07:10:49,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 07:10:49,453 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:10:49,453 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 07:10:49,454 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 07:10:49,454 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 07:10:49,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:49,454 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 07:10:49,454 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 07:10:49,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:10:49,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:10:49,454 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 07:10:49,454 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 07:10:49,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:49,454 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 07:10:49,454 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 07:10:49,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:10:49,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:10:49,455 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:10:49,455 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:10:49,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 07:10:49,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 07:10:49,455 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2022-04-15 07:10:49,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:10:49,455 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 07:10:49,455 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:10:49,456 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 07:10:49,456 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:10:49,456 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 07:10:49,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:10:49,458 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 07:10:49,458 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 07:10:49,459 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 07:10:49,503 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 11) no Hoare annotation was computed. [2022-04-15 07:10:49,503 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 11) no Hoare annotation was computed. [2022-04-15 07:10:49,503 INFO L882 garLoopResultBuilder]: For program point L11-1(line 11) no Hoare annotation was computed. [2022-04-15 07:10:49,503 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 19 28) the Hoare annotation is: true [2022-04-15 07:10:49,503 INFO L885 garLoopResultBuilder]: At program point L26(line 26) the Hoare annotation is: true [2022-04-15 07:10:49,504 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 19 28) the Hoare annotation is: true [2022-04-15 07:10:49,504 INFO L885 garLoopResultBuilder]: At program point L22(line 22) the Hoare annotation is: true [2022-04-15 07:10:49,504 INFO L878 garLoopResultBuilder]: At program point L23-2(lines 23 25) the Hoare annotation is: (< main_~x~0 (+ main_~y~0 1)) [2022-04-15 07:10:49,504 INFO L878 garLoopResultBuilder]: At program point L23-3(lines 23 25) the Hoare annotation is: (= (+ main_~y~0 (* (- 1) main_~x~0)) 0) [2022-04-15 07:10:49,504 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 19 28) the Hoare annotation is: true [2022-04-15 07:10:49,504 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-15 07:10:49,504 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 07:10:49,504 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-15 07:10:49,504 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 07:10:49,504 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 07:10:49,504 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 07:10:49,505 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 07:10:49,505 INFO L878 garLoopResultBuilder]: At program point L16(line 16) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-15 07:10:49,505 INFO L878 garLoopResultBuilder]: At program point L15(lines 15 17) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-15 07:10:49,505 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 18) the Hoare annotation is: true [2022-04-15 07:10:49,505 INFO L885 garLoopResultBuilder]: At program point L15-2(lines 14 18) the Hoare annotation is: true [2022-04-15 07:10:49,505 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 14 18) the Hoare annotation is: true [2022-04-15 07:10:49,505 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-15 07:10:49,508 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2022-04-15 07:10:49,509 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 07:10:49,511 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 07:10:49,511 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 07:10:49,512 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2022-04-15 07:10:49,515 INFO L163 areAnnotationChecker]: CFG has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 07:10:49,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 07:10:49 BoogieIcfgContainer [2022-04-15 07:10:49,522 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 07:10:49,523 INFO L158 Benchmark]: Toolchain (without parser) took 5786.30ms. Allocated memory was 228.6MB in the beginning and 330.3MB in the end (delta: 101.7MB). Free memory was 172.3MB in the beginning and 278.9MB in the end (delta: -106.6MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 07:10:49,523 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 228.6MB. Free memory is still 188.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 07:10:49,523 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.16ms. Allocated memory was 228.6MB in the beginning and 330.3MB in the end (delta: 101.7MB). Free memory was 172.1MB in the beginning and 301.9MB in the end (delta: -129.8MB). Peak memory consumption was 6.9MB. Max. memory is 8.0GB. [2022-04-15 07:10:49,523 INFO L158 Benchmark]: Boogie Preprocessor took 28.30ms. Allocated memory is still 330.3MB. Free memory was 301.9MB in the beginning and 300.6MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 07:10:49,524 INFO L158 Benchmark]: RCFGBuilder took 256.56ms. Allocated memory is still 330.3MB. Free memory was 300.5MB in the beginning and 290.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-15 07:10:49,524 INFO L158 Benchmark]: TraceAbstraction took 5279.11ms. Allocated memory is still 330.3MB. Free memory was 289.6MB in the beginning and 278.9MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-15 07:10:49,525 INFO L339 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.08ms. Allocated memory is still 228.6MB. Free memory is still 188.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 218.16ms. Allocated memory was 228.6MB in the beginning and 330.3MB in the end (delta: 101.7MB). Free memory was 172.1MB in the beginning and 301.9MB in the end (delta: -129.8MB). Peak memory consumption was 6.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.30ms. Allocated memory is still 330.3MB. Free memory was 301.9MB in the beginning and 300.6MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 256.56ms. Allocated memory is still 330.3MB. Free memory was 300.5MB in the beginning and 290.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 5279.11ms. Allocated memory is still 330.3MB. Free memory was 289.6MB in the beginning and 278.9MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 16]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.2s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18 mSDsluCounter, 53 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36 IncrementalHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 27 mSDtfsCounter, 36 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 26 PreInvPairs, 35 NumberOfFragments, 47 HoareAnnotationTreeSize, 26 FomulaSimplifications, 5 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 20 FomulaSimplificationsInter, 11 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: x < y + 1 - ProcedureContractResult [Line: 19]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-15 07:10:49,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...