/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-lit/hhk2008.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 03:13:41,845 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 03:13:41,847 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 03:13:41,893 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 03:13:41,894 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 03:13:41,895 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 03:13:41,897 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 03:13:41,898 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 03:13:41,900 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 03:13:41,903 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 03:13:41,904 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 03:13:41,905 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 03:13:41,905 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 03:13:41,906 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 03:13:41,907 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 03:13:41,909 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 03:13:41,909 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 03:13:41,910 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 03:13:41,912 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 03:13:41,916 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 03:13:41,917 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 03:13:41,918 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 03:13:41,919 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 03:13:41,919 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 03:13:41,920 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 03:13:41,925 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 03:13:41,925 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 03:13:41,925 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 03:13:41,926 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 03:13:41,926 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 03:13:41,927 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 03:13:41,927 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 03:13:41,928 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 03:13:41,929 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 03:13:41,929 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 03:13:41,930 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 03:13:41,930 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 03:13:41,930 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 03:13:41,930 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 03:13:41,931 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 03:13:41,931 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 03:13:41,932 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 03:13:41,933 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 03:13:41,944 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 03:13:41,944 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 03:13:41,945 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 03:13:41,945 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 03:13:41,945 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 03:13:41,945 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 03:13:41,945 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 03:13:41,945 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 03:13:41,945 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 03:13:41,946 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 03:13:41,946 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 03:13:41,946 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 03:13:41,946 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 03:13:41,946 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 03:13:41,947 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 03:13:41,947 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 03:13:41,947 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 03:13:41,947 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 03:13:41,947 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:13:41,947 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 03:13:41,947 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 03:13:41,947 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 03:13:41,948 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 03:13:41,948 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 03:13:41,948 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 03:13:41,948 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-28 03:13:42,140 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 03:13:42,160 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 03:13:42,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 03:13:42,163 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 03:13:42,163 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 03:13:42,164 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/hhk2008.i [2022-04-28 03:13:42,213 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7671c8ecc/c6db6b9eda89434590de723105cec935/FLAGc7b0dba41 [2022-04-28 03:13:42,546 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 03:13:42,546 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/hhk2008.i [2022-04-28 03:13:42,556 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7671c8ecc/c6db6b9eda89434590de723105cec935/FLAGc7b0dba41 [2022-04-28 03:13:42,955 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7671c8ecc/c6db6b9eda89434590de723105cec935 [2022-04-28 03:13:42,957 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 03:13:42,958 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 03:13:42,961 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 03:13:42,961 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 03:13:42,964 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 03:13:42,965 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:13:42" (1/1) ... [2022-04-28 03:13:42,966 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e3e36ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:13:42, skipping insertion in model container [2022-04-28 03:13:42,966 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:13:42" (1/1) ... [2022-04-28 03:13:42,970 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 03:13:42,981 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 03:13:43,102 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-lit/hhk2008.i[895,908] [2022-04-28 03:13:43,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:13:43,116 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 03:13:43,125 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-lit/hhk2008.i[895,908] [2022-04-28 03:13:43,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:13:43,136 INFO L208 MainTranslator]: Completed translation [2022-04-28 03:13:43,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:13:43 WrapperNode [2022-04-28 03:13:43,137 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 03:13:43,137 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 03:13:43,138 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 03:13:43,138 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 03:13:43,144 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:13:43" (1/1) ... [2022-04-28 03:13:43,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:13:43" (1/1) ... [2022-04-28 03:13:43,149 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:13:43" (1/1) ... [2022-04-28 03:13:43,150 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:13:43" (1/1) ... [2022-04-28 03:13:43,158 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:13:43" (1/1) ... [2022-04-28 03:13:43,160 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:13:43" (1/1) ... [2022-04-28 03:13:43,161 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:13:43" (1/1) ... [2022-04-28 03:13:43,163 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 03:13:43,163 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 03:13:43,163 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 03:13:43,163 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 03:13:43,167 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:13:43" (1/1) ... [2022-04-28 03:13:43,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:13:43,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:13:43,189 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-28 03:13:43,197 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-28 03:13:43,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 03:13:43,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 03:13:43,222 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 03:13:43,222 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 03:13:43,222 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 03:13:43,222 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 03:13:43,222 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 03:13:43,222 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 03:13:43,223 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 03:13:43,223 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 03:13:43,223 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 03:13:43,223 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 03:13:43,223 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 03:13:43,223 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 03:13:43,223 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 03:13:43,223 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 03:13:43,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 03:13:43,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 03:13:43,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 03:13:43,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 03:13:43,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 03:13:43,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 03:13:43,265 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 03:13:43,266 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 03:13:43,362 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 03:13:43,366 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 03:13:43,366 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 03:13:43,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:13:43 BoogieIcfgContainer [2022-04-28 03:13:43,368 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 03:13:43,369 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 03:13:43,369 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 03:13:43,387 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 03:13:43,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:13:42" (1/3) ... [2022-04-28 03:13:43,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@446ef0cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:13:43, skipping insertion in model container [2022-04-28 03:13:43,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:13:43" (2/3) ... [2022-04-28 03:13:43,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@446ef0cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:13:43, skipping insertion in model container [2022-04-28 03:13:43,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:13:43" (3/3) ... [2022-04-28 03:13:43,389 INFO L111 eAbstractionObserver]: Analyzing ICFG hhk2008.i [2022-04-28 03:13:43,398 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 03:13:43,398 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 03:13:43,427 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 03:13:43,432 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6995b9cf, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1abf4a62 [2022-04-28 03:13:43,432 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 03:13:43,437 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 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-28 03:13:43,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 03:13:43,442 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:13:43,442 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:13:43,443 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:13:43,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:13:43,446 INFO L85 PathProgramCache]: Analyzing trace with hash 499112448, now seen corresponding path program 1 times [2022-04-28 03:13:43,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:43,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1100500335] [2022-04-28 03:13:43,468 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:13:43,468 INFO L85 PathProgramCache]: Analyzing trace with hash 499112448, now seen corresponding path program 2 times [2022-04-28 03:13:43,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:13:43,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757713569] [2022-04-28 03:13:43,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:13:43,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:13:43,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:43,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:13:43,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:43,687 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(9, 2); {24#true} is VALID [2022-04-28 03:13:43,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-28 03:13:43,688 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #58#return; {24#true} is VALID [2022-04-28 03:13:43,690 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:13:43,690 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(9, 2); {24#true} is VALID [2022-04-28 03:13:43,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-28 03:13:43,690 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #58#return; {24#true} is VALID [2022-04-28 03:13:43,691 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret3 := main(); {24#true} is VALID [2022-04-28 03:13:43,691 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~a~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~b~0 := #t~nondet2;havoc #t~nondet2;havoc ~res~0;havoc ~cnt~0; {24#true} is VALID [2022-04-28 03:13:43,692 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} assume !!(~a~0 <= 1000000); {24#true} is VALID [2022-04-28 03:13:43,692 INFO L290 TraceCheckUtils]: 7: Hoare triple {24#true} assume !!(0 <= ~b~0 && ~b~0 <= 1000000);~res~0 := ~a~0;~cnt~0 := ~b~0; {24#true} is VALID [2022-04-28 03:13:43,692 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#true} assume !true; {25#false} is VALID [2022-04-28 03:13:43,693 INFO L272 TraceCheckUtils]: 9: Hoare triple {25#false} call __VERIFIER_assert((if ~res~0 == ~a~0 + ~b~0 then 1 else 0)); {25#false} is VALID [2022-04-28 03:13:43,693 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2022-04-28 03:13:43,693 INFO L290 TraceCheckUtils]: 11: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2022-04-28 03:13:43,694 INFO L290 TraceCheckUtils]: 12: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-28 03:13:43,694 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-28 03:13:43,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:13:43,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757713569] [2022-04-28 03:13:43,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757713569] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:13:43,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:13:43,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 03:13:43,699 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:13:43,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1100500335] [2022-04-28 03:13:43,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1100500335] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:13:43,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:13:43,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 03:13:43,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410664482] [2022-04-28 03:13:43,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:13:43,706 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 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-28 03:13:43,707 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:13:43,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 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-28 03:13:43,733 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-28 03:13:43,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 03:13:43,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:43,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 03:13:43,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 03:13:43,757 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 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 3 states, 3 states have (on average 3.0) internal successors, (9), 2 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-28 03:13:43,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:43,840 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-04-28 03:13:43,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 03:13:43,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 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-28 03:13:43,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:13:43,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 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-28 03:13:43,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-04-28 03:13:43,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 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-28 03:13:43,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-04-28 03:13:43,856 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 38 transitions. [2022-04-28 03:13:43,903 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:13:43,909 INFO L225 Difference]: With dead ends: 33 [2022-04-28 03:13:43,909 INFO L226 Difference]: Without dead ends: 14 [2022-04-28 03:13:43,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 03:13:43,914 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 14 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:13:43,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 25 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:13:43,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-28 03:13:43,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-28 03:13:43,942 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:13:43,942 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-28 03:13:43,943 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-28 03:13:43,943 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-28 03:13:43,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:43,948 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-28 03:13:43,949 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-28 03:13:43,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:43,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:43,949 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-28 03:13:43,949 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-28 03:13:43,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:43,952 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-28 03:13:43,952 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-28 03:13:43,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:43,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:43,953 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:13:43,953 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:13:43,953 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-28 03:13:43,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-28 03:13:43,956 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 13 [2022-04-28 03:13:43,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:13:43,957 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-28 03:13:43,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 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-28 03:13:43,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 14 transitions. [2022-04-28 03:13:43,974 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-28 03:13:43,975 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-28 03:13:43,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 03:13:43,976 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:13:43,976 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:13:43,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 03:13:43,976 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:13:43,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:13:43,979 INFO L85 PathProgramCache]: Analyzing trace with hash 495418364, now seen corresponding path program 1 times [2022-04-28 03:13:43,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:43,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [331869697] [2022-04-28 03:13:43,983 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:13:43,984 INFO L85 PathProgramCache]: Analyzing trace with hash 495418364, now seen corresponding path program 2 times [2022-04-28 03:13:43,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:13:43,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305747070] [2022-04-28 03:13:43,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:13:43,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:13:44,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:44,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:13:44,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:44,177 INFO L290 TraceCheckUtils]: 0: Hoare triple {163#(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(9, 2); {154#true} is VALID [2022-04-28 03:13:44,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {154#true} assume true; {154#true} is VALID [2022-04-28 03:13:44,178 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {154#true} {154#true} #58#return; {154#true} is VALID [2022-04-28 03:13:44,179 INFO L272 TraceCheckUtils]: 0: Hoare triple {154#true} call ULTIMATE.init(); {163#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:13:44,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {163#(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(9, 2); {154#true} is VALID [2022-04-28 03:13:44,180 INFO L290 TraceCheckUtils]: 2: Hoare triple {154#true} assume true; {154#true} is VALID [2022-04-28 03:13:44,181 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {154#true} {154#true} #58#return; {154#true} is VALID [2022-04-28 03:13:44,181 INFO L272 TraceCheckUtils]: 4: Hoare triple {154#true} call #t~ret3 := main(); {154#true} is VALID [2022-04-28 03:13:44,182 INFO L290 TraceCheckUtils]: 5: Hoare triple {154#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~a~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~b~0 := #t~nondet2;havoc #t~nondet2;havoc ~res~0;havoc ~cnt~0; {154#true} is VALID [2022-04-28 03:13:44,182 INFO L290 TraceCheckUtils]: 6: Hoare triple {154#true} assume !!(~a~0 <= 1000000); {154#true} is VALID [2022-04-28 03:13:44,183 INFO L290 TraceCheckUtils]: 7: Hoare triple {154#true} assume !!(0 <= ~b~0 && ~b~0 <= 1000000);~res~0 := ~a~0;~cnt~0 := ~b~0; {159#(and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (or (<= (+ main_~b~0 main_~a~0) main_~res~0) (<= (+ main_~b~0 main_~a~0) (+ main_~cnt~0 main_~res~0))))} is VALID [2022-04-28 03:13:44,185 INFO L290 TraceCheckUtils]: 8: Hoare triple {159#(and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (or (<= (+ main_~b~0 main_~a~0) main_~res~0) (<= (+ main_~b~0 main_~a~0) (+ main_~cnt~0 main_~res~0))))} assume !(~cnt~0 > 0); {160#(and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (<= (+ main_~b~0 main_~a~0) main_~res~0))} is VALID [2022-04-28 03:13:44,186 INFO L272 TraceCheckUtils]: 9: Hoare triple {160#(and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (<= (+ main_~b~0 main_~a~0) main_~res~0))} call __VERIFIER_assert((if ~res~0 == ~a~0 + ~b~0 then 1 else 0)); {161#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:13:44,187 INFO L290 TraceCheckUtils]: 10: Hoare triple {161#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {162#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:13:44,187 INFO L290 TraceCheckUtils]: 11: Hoare triple {162#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {155#false} is VALID [2022-04-28 03:13:44,188 INFO L290 TraceCheckUtils]: 12: Hoare triple {155#false} assume !false; {155#false} is VALID [2022-04-28 03:13:44,188 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-28 03:13:44,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:13:44,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305747070] [2022-04-28 03:13:44,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305747070] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:13:44,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:13:44,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:13:44,189 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:13:44,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [331869697] [2022-04-28 03:13:44,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [331869697] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:13:44,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:13:44,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:13:44,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663302594] [2022-04-28 03:13:44,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:13:44,191 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-28 03:13:44,191 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:13:44,192 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-28 03:13:44,207 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-28 03:13:44,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 03:13:44,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:44,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 03:13:44,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-28 03:13:44,208 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-28 03:13:44,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:44,376 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-28 03:13:44,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 03:13:44,376 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-28 03:13:44,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:13:44,377 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-28 03:13:44,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2022-04-28 03:13:44,378 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-28 03:13:44,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2022-04-28 03:13:44,379 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 20 transitions. [2022-04-28 03:13:44,396 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:13:44,397 INFO L225 Difference]: With dead ends: 20 [2022-04-28 03:13:44,397 INFO L226 Difference]: Without dead ends: 15 [2022-04-28 03:13:44,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-04-28 03:13:44,398 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 12 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:13:44,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 33 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:13:44,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-28 03:13:44,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-28 03:13:44,404 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:13:44,404 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-28 03:13:44,404 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-28 03:13:44,404 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-28 03:13:44,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:44,405 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-28 03:13:44,405 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 03:13:44,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:44,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:44,406 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 15 states. [2022-04-28 03:13:44,406 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 15 states. [2022-04-28 03:13:44,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:44,407 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-28 03:13:44,407 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 03:13:44,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:44,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:44,408 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:13:44,408 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:13:44,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-28 03:13:44,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-28 03:13:44,409 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2022-04-28 03:13:44,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:13:44,409 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-28 03:13:44,409 INFO L496 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-28 03:13:44,409 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-28 03:13:44,422 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:13:44,422 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 03:13:44,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 03:13:44,422 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:13:44,422 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:13:44,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 03:13:44,423 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:13:44,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:13:44,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1787404818, now seen corresponding path program 1 times [2022-04-28 03:13:44,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:44,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1518812331] [2022-04-28 03:13:48,582 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:13:48,700 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:13:48,702 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:13:48,705 INFO L85 PathProgramCache]: Analyzing trace with hash -899901137, now seen corresponding path program 1 times [2022-04-28 03:13:48,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:13:48,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161382223] [2022-04-28 03:13:48,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:13:48,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:13:48,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:48,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:13:48,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:48,887 INFO L290 TraceCheckUtils]: 0: Hoare triple {284#(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(9, 2); {274#true} is VALID [2022-04-28 03:13:48,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {274#true} assume true; {274#true} is VALID [2022-04-28 03:13:48,887 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {274#true} {274#true} #58#return; {274#true} is VALID [2022-04-28 03:13:48,888 INFO L272 TraceCheckUtils]: 0: Hoare triple {274#true} call ULTIMATE.init(); {284#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:13:48,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {284#(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(9, 2); {274#true} is VALID [2022-04-28 03:13:48,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {274#true} assume true; {274#true} is VALID [2022-04-28 03:13:48,888 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {274#true} {274#true} #58#return; {274#true} is VALID [2022-04-28 03:13:48,888 INFO L272 TraceCheckUtils]: 4: Hoare triple {274#true} call #t~ret3 := main(); {274#true} is VALID [2022-04-28 03:13:48,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {274#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~a~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~b~0 := #t~nondet2;havoc #t~nondet2;havoc ~res~0;havoc ~cnt~0; {274#true} is VALID [2022-04-28 03:13:48,889 INFO L290 TraceCheckUtils]: 6: Hoare triple {274#true} assume !!(~a~0 <= 1000000); {274#true} is VALID [2022-04-28 03:13:48,889 INFO L290 TraceCheckUtils]: 7: Hoare triple {274#true} assume !!(0 <= ~b~0 && ~b~0 <= 1000000);~res~0 := ~a~0;~cnt~0 := ~b~0; {279#(and (<= main_~res~0 (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (+ main_~cnt~0 main_~res~0)) (<= (+ main_~cnt~0 main_~res~0) (+ main_~b~0 main_~a~0)))} is VALID [2022-04-28 03:13:48,890 INFO L290 TraceCheckUtils]: 8: Hoare triple {279#(and (<= main_~res~0 (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (+ main_~cnt~0 main_~res~0)) (<= (+ main_~cnt~0 main_~res~0) (+ main_~b~0 main_~a~0)))} [62] L32-2-->L32-3_primed: Formula: (let ((.cse0 (= v_main_~cnt~0_7 v_main_~cnt~0_6)) (.cse1 (= v_main_~res~0_8 v_main_~res~0_7))) (or (and (= (+ v_main_~cnt~0_7 v_main_~res~0_8) (+ v_main_~cnt~0_6 v_main_~res~0_7)) (< 0 (+ v_main_~cnt~0_6 1)) (< v_main_~cnt~0_6 v_main_~cnt~0_7)) (and .cse0 .cse1 (not (< 0 v_main_~cnt~0_7))) (and .cse0 .cse1))) InVars {main_~res~0=v_main_~res~0_8, main_~cnt~0=v_main_~cnt~0_7} OutVars{main_~res~0=v_main_~res~0_7, main_~cnt~0=v_main_~cnt~0_6} AuxVars[] AssignedVars[main_~res~0, main_~cnt~0] {280#(or (and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (<= (+ main_~b~0 main_~a~0) main_~res~0)) (<= 1 main_~cnt~0))} is VALID [2022-04-28 03:13:48,891 INFO L290 TraceCheckUtils]: 9: Hoare triple {280#(or (and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (<= (+ main_~b~0 main_~a~0) main_~res~0)) (<= 1 main_~cnt~0))} [61] L32-3_primed-->L32-3: Formula: (not (< 0 v_main_~cnt~0_4)) InVars {main_~cnt~0=v_main_~cnt~0_4} OutVars{main_~cnt~0=v_main_~cnt~0_4} AuxVars[] AssignedVars[] {281#(and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (<= (+ main_~b~0 main_~a~0) main_~res~0))} is VALID [2022-04-28 03:13:48,892 INFO L272 TraceCheckUtils]: 10: Hoare triple {281#(and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (<= (+ main_~b~0 main_~a~0) main_~res~0))} call __VERIFIER_assert((if ~res~0 == ~a~0 + ~b~0 then 1 else 0)); {282#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:13:48,892 INFO L290 TraceCheckUtils]: 11: Hoare triple {282#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {283#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:13:48,893 INFO L290 TraceCheckUtils]: 12: Hoare triple {283#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {275#false} is VALID [2022-04-28 03:13:48,893 INFO L290 TraceCheckUtils]: 13: Hoare triple {275#false} assume !false; {275#false} is VALID [2022-04-28 03:13:48,893 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-28 03:13:48,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:13:48,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161382223] [2022-04-28 03:13:48,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161382223] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:13:48,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:13:48,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:13:48,992 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:13:48,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1518812331] [2022-04-28 03:13:48,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1518812331] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:13:48,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:13:48,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:13:48,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371290368] [2022-04-28 03:13:48,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:13:48,993 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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 14 [2022-04-28 03:13:48,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:13:48,994 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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-28 03:13:49,004 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-28 03:13:49,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 03:13:49,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:49,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 03:13:49,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-04-28 03:13:49,006 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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-28 03:13:49,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:49,185 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-28 03:13:49,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 03:13:49,185 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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 14 [2022-04-28 03:13:49,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:13:49,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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-28 03:13:49,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 14 transitions. [2022-04-28 03:13:49,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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-28 03:13:49,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 14 transitions. [2022-04-28 03:13:49,196 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 14 transitions. [2022-04-28 03:13:49,207 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-28 03:13:49,208 INFO L225 Difference]: With dead ends: 15 [2022-04-28 03:13:49,208 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 03:13:49,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-28 03:13:49,209 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 7 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:13:49,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 31 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:13:49,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 03:13:49,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 03:13:49,210 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:13:49,210 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-28 03:13:49,210 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-28 03:13:49,210 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-28 03:13:49,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:49,210 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 03:13:49,210 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 03:13:49,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:49,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:49,210 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-28 03:13:49,210 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-28 03:13:49,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:49,211 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 03:13:49,211 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 03:13:49,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:49,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:49,211 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:13:49,211 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:13:49,211 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-28 03:13:49,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 03:13:49,211 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2022-04-28 03:13:49,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:13:49,211 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 03:13:49,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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-28 03:13:49,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 03:13:49,212 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-28 03:13:49,212 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 03:13:49,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:49,214 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 03:13:49,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 03:13:49,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 03:13:49,288 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-28 03:13:49,289 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-28 03:13:49,289 INFO L899 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-28 03:13:49,289 INFO L899 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-28 03:13:49,289 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-28 03:13:49,289 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-28 03:13:49,289 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-28 03:13:49,289 INFO L895 garLoopResultBuilder]: At program point L32-2(lines 32 35) the Hoare annotation is: (let ((.cse1 (+ main_~cnt~0 main_~res~0)) (.cse0 (+ main_~b~0 main_~a~0))) (and (<= main_~res~0 .cse0) (<= .cse0 .cse1) (<= .cse1 .cse0))) [2022-04-28 03:13:49,289 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 24 38) the Hoare annotation is: true [2022-04-28 03:13:49,289 INFO L902 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: true [2022-04-28 03:13:49,289 INFO L895 garLoopResultBuilder]: At program point L32-3(lines 32 35) the Hoare annotation is: (and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (<= (+ main_~b~0 main_~a~0) main_~res~0)) [2022-04-28 03:13:49,289 INFO L902 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: true [2022-04-28 03:13:49,289 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 24 38) the Hoare annotation is: true [2022-04-28 03:13:49,290 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 24 38) the Hoare annotation is: true [2022-04-28 03:13:49,290 INFO L902 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: true [2022-04-28 03:13:49,290 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 03:13:49,290 INFO L895 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-28 03:13:49,290 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 03:13:49,290 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 03:13:49,290 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 03:13:49,290 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 03:13:49,290 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 03:13:49,290 INFO L902 garLoopResultBuilder]: At program point L18-2(lines 17 22) the Hoare annotation is: true [2022-04-28 03:13:49,290 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-28 03:13:49,290 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: true [2022-04-28 03:13:49,290 INFO L895 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 03:13:49,290 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 03:13:49,291 INFO L895 garLoopResultBuilder]: At program point L18(lines 18 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-28 03:13:49,293 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1] [2022-04-28 03:13:49,294 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 03:13:49,297 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 03:13:49,297 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 03:13:49,297 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 03:13:49,298 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-28 03:13:49,298 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 03:13:49,298 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 03:13:49,299 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-28 03:13:49,302 INFO L163 areAnnotationChecker]: CFG has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 03:13:49,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 03:13:49 BoogieIcfgContainer [2022-04-28 03:13:49,309 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 03:13:49,310 INFO L158 Benchmark]: Toolchain (without parser) took 6351.92ms. Allocated memory was 194.0MB in the beginning and 232.8MB in the end (delta: 38.8MB). Free memory was 145.7MB in the beginning and 131.0MB in the end (delta: 14.7MB). Peak memory consumption was 54.2MB. Max. memory is 8.0GB. [2022-04-28 03:13:49,310 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 194.0MB. Free memory is still 162.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 03:13:49,311 INFO L158 Benchmark]: CACSL2BoogieTranslator took 176.36ms. Allocated memory is still 194.0MB. Free memory was 145.6MB in the beginning and 170.8MB in the end (delta: -25.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 03:13:49,311 INFO L158 Benchmark]: Boogie Preprocessor took 25.20ms. Allocated memory is still 194.0MB. Free memory was 170.8MB in the beginning and 169.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 03:13:49,311 INFO L158 Benchmark]: RCFGBuilder took 204.65ms. Allocated memory is still 194.0MB. Free memory was 169.1MB in the beginning and 158.2MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 03:13:49,311 INFO L158 Benchmark]: TraceAbstraction took 5940.64ms. Allocated memory was 194.0MB in the beginning and 232.8MB in the end (delta: 38.8MB). Free memory was 157.6MB in the beginning and 131.0MB in the end (delta: 26.6MB). Peak memory consumption was 66.4MB. Max. memory is 8.0GB. [2022-04-28 03:13:49,312 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.09ms. Allocated memory is still 194.0MB. Free memory is still 162.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 176.36ms. Allocated memory is still 194.0MB. Free memory was 145.6MB in the beginning and 170.8MB in the end (delta: -25.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.20ms. Allocated memory is still 194.0MB. Free memory was 170.8MB in the beginning and 169.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 204.65ms. Allocated memory is still 194.0MB. Free memory was 169.1MB in the beginning and 158.2MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 5940.64ms. Allocated memory was 194.0MB in the beginning and 232.8MB in the end (delta: 38.8MB). Free memory was 157.6MB in the beginning and 131.0MB in the end (delta: 26.6MB). Peak memory consumption was 66.4MB. 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: 19]: 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 6 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.9s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 34 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 33 mSDsluCounter, 89 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 47 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 67 IncrementalHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 42 mSDtfsCounter, 67 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 17, 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 33 PreInvPairs, 45 NumberOfFragments, 68 HoareAnnotationTreeSize, 33 FomulaSimplifications, 46 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 21 FomulaSimplificationsInter, 31 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: 32]: Loop Invariant Derived loop invariant: (res <= b + a && b + a <= cnt + res) && cnt + res <= b + a - ProcedureContractResult [Line: 24]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-28 03:13:49,358 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...