/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/benchmark37_conjunctive.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 07:11:10,013 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 07:11:10,015 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 07:11:10,039 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 07:11:10,039 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 07:11:10,041 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 07:11:10,042 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 07:11:10,043 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 07:11:10,044 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 07:11:10,045 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 07:11:10,046 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 07:11:10,047 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 07:11:10,047 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 07:11:10,048 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 07:11:10,049 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 07:11:10,050 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 07:11:10,050 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 07:11:10,051 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 07:11:10,053 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 07:11:10,055 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 07:11:10,056 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 07:11:10,058 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 07:11:10,059 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 07:11:10,060 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 07:11:10,061 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 07:11:10,063 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 07:11:10,064 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 07:11:10,064 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 07:11:10,065 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 07:11:10,065 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 07:11:10,066 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 07:11:10,067 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 07:11:10,067 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 07:11:10,068 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 07:11:10,069 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 07:11:10,070 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 07:11:10,070 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 07:11:10,071 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 07:11:10,071 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 07:11:10,071 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 07:11:10,072 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 07:11:10,076 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 07:11:10,076 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:11:10,086 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 07:11:10,086 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 07:11:10,087 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 07:11:10,087 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 07:11:10,088 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 07:11:10,088 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 07:11:10,088 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 07:11:10,088 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 07:11:10,088 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 07:11:10,088 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 07:11:10,090 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 07:11:10,091 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 07:11:10,091 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 07:11:10,091 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 07:11:10,091 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 07:11:10,091 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 07:11:10,091 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 07:11:10,092 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 07:11:10,092 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 07:11:10,092 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 07:11:10,092 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 07:11:10,092 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 07:11:10,093 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 07:11:10,093 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 07:11:10,093 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 07:11:10,093 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:11:10,352 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 07:11:10,374 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 07:11:10,376 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 07:11:10,377 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 07:11:10,378 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 07:11:10,379 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-zilu/benchmark37_conjunctive.i [2022-04-15 07:11:10,464 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0086a8bc9/1ba11b7a30984993b12bf5d6e664d5c5/FLAG2a68dabdd [2022-04-15 07:11:10,837 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 07:11:10,838 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark37_conjunctive.i [2022-04-15 07:11:10,843 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0086a8bc9/1ba11b7a30984993b12bf5d6e664d5c5/FLAG2a68dabdd [2022-04-15 07:11:10,857 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0086a8bc9/1ba11b7a30984993b12bf5d6e664d5c5 [2022-04-15 07:11:10,860 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 07:11:10,861 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 07:11:10,865 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 07:11:10,866 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 07:11:10,868 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 07:11:10,869 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 07:11:10" (1/1) ... [2022-04-15 07:11:10,870 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1eaef829 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:11:10, skipping insertion in model container [2022-04-15 07:11:10,870 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 07:11:10" (1/1) ... [2022-04-15 07:11:10,878 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 07:11:10,892 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 07:11:11,036 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/benchmark37_conjunctive.i[873,886] [2022-04-15 07:11:11,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 07:11:11,056 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 07:11:11,067 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/benchmark37_conjunctive.i[873,886] [2022-04-15 07:11:11,071 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 07:11:11,084 INFO L208 MainTranslator]: Completed translation [2022-04-15 07:11:11,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:11:11 WrapperNode [2022-04-15 07:11:11,085 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 07:11:11,086 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 07:11:11,086 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 07:11:11,086 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 07:11:11,095 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:11:11" (1/1) ... [2022-04-15 07:11:11,096 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:11:11" (1/1) ... [2022-04-15 07:11:11,101 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:11:11" (1/1) ... [2022-04-15 07:11:11,102 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:11:11" (1/1) ... [2022-04-15 07:11:11,107 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:11:11" (1/1) ... [2022-04-15 07:11:11,112 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:11:11" (1/1) ... [2022-04-15 07:11:11,113 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:11:11" (1/1) ... [2022-04-15 07:11:11,114 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 07:11:11,115 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 07:11:11,116 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 07:11:11,116 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 07:11:11,117 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:11:11" (1/1) ... [2022-04-15 07:11:11,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 07:11:11,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:11:11,152 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:11:11,159 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:11:11,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 07:11:11,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 07:11:11,185 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 07:11:11,185 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 07:11:11,185 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 07:11:11,185 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 07:11:11,185 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 07:11:11,186 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 07:11:11,186 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 07:11:11,186 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 07:11:11,186 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 07:11:11,186 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-04-15 07:11:11,186 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 07:11:11,186 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 07:11:11,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 07:11:11,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 07:11:11,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 07:11:11,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 07:11:11,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 07:11:11,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 07:11:11,249 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 07:11:11,250 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 07:11:11,374 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 07:11:11,381 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 07:11:11,381 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 07:11:11,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 07:11:11 BoogieIcfgContainer [2022-04-15 07:11:11,383 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 07:11:11,385 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 07:11:11,385 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 07:11:11,388 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 07:11:11,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 07:11:10" (1/3) ... [2022-04-15 07:11:11,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60704801 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 07:11:11, skipping insertion in model container [2022-04-15 07:11:11,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:11:11" (2/3) ... [2022-04-15 07:11:11,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60704801 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 07:11:11, skipping insertion in model container [2022-04-15 07:11:11,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 07:11:11" (3/3) ... [2022-04-15 07:11:11,391 INFO L111 eAbstractionObserver]: Analyzing ICFG benchmark37_conjunctive.i [2022-04-15 07:11:11,395 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 07:11:11,396 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 07:11:11,436 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 07:11:11,443 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:11:11,443 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 07:11:11,460 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:11:11,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 07:11:11,467 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:11:11,468 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:11:11,468 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:11:11,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:11:11,473 INFO L85 PathProgramCache]: Analyzing trace with hash -304977768, now seen corresponding path program 1 times [2022-04-15 07:11:11,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:11:11,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [526410701] [2022-04-15 07:11:11,505 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:11:11,505 INFO L85 PathProgramCache]: Analyzing trace with hash -304977768, now seen corresponding path program 2 times [2022-04-15 07:11:11,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:11:11,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951325415] [2022-04-15 07:11:11,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:11:11,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:11:11,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:11,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:11:11,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:11,779 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(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(26, 2); {23#true} is VALID [2022-04-15 07:11:11,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-15 07:11:11,779 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #45#return; {23#true} is VALID [2022-04-15 07:11:11,783 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:11:11,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(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(26, 2); {23#true} is VALID [2022-04-15 07:11:11,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-15 07:11:11,784 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #45#return; {23#true} is VALID [2022-04-15 07:11:11,784 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret5 := main(); {23#true} is VALID [2022-04-15 07:11:11,785 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:11:11,786 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} assume !!(~x~0 == ~y~0 && ~x~0 >= 0); {28#(<= 0 main_~y~0)} is VALID [2022-04-15 07:11:11,788 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#(<= 0 main_~y~0)} assume !(~x~0 > 0); {28#(<= 0 main_~y~0)} is VALID [2022-04-15 07:11:11,790 INFO L272 TraceCheckUtils]: 8: Hoare triple {28#(<= 0 main_~y~0)} call __VERIFIER_assert((if ~y~0 >= 0 then 1 else 0)); {29#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:11:11,792 INFO L290 TraceCheckUtils]: 9: Hoare triple {29#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {30#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:11:11,794 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {24#false} is VALID [2022-04-15 07:11:11,794 INFO L290 TraceCheckUtils]: 11: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-15 07:11:11,795 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:11:11,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:11:11,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951325415] [2022-04-15 07:11:11,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951325415] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:11:11,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:11:11,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 07:11:11,802 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:11:11,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [526410701] [2022-04-15 07:11:11,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [526410701] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:11:11,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:11:11,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 07:11:11,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777998940] [2022-04-15 07:11:11,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:11:11,811 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 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:11:11,812 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:11:11,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 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:11:11,836 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:11:11,836 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 07:11:11,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:11:11,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 07:11:11,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 07:11:11,867 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 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 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:11:12,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:12,137 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2022-04-15 07:11:12,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 07:11:12,137 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 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:11:12,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:11:12,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 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:11:12,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 49 transitions. [2022-04-15 07:11:12,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 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:11:12,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 49 transitions. [2022-04-15 07:11:12,178 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 49 transitions. [2022-04-15 07:11:12,227 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:11:12,234 INFO L225 Difference]: With dead ends: 41 [2022-04-15 07:11:12,234 INFO L226 Difference]: Without dead ends: 14 [2022-04-15 07:11:12,237 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-15 07:11:12,241 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 25 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:11:12,242 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 40 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:11:12,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-15 07:11:12,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-15 07:11:12,267 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:11:12,268 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:11:12,268 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:11:12,269 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:11:12,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:12,271 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-15 07:11:12,271 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 07:11:12,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:11:12,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:11:12,272 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:11:12,272 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:11:12,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:12,275 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-15 07:11:12,275 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 07:11:12,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:11:12,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:11:12,275 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:11:12,276 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:11:12,276 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:11:12,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-15 07:11:12,279 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-15 07:11:12,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:11:12,280 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-15 07:11:12,280 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 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:11:12,280 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 14 transitions. [2022-04-15 07:11:12,294 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:11:12,295 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 07:11:12,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 07:11:12,295 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:11:12,295 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:11:12,296 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 07:11:12,296 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:11:12,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:11:12,297 INFO L85 PathProgramCache]: Analyzing trace with hash -828987386, now seen corresponding path program 1 times [2022-04-15 07:11:12,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:11:12,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1649262729] [2022-04-15 07:11:12,649 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:12,651 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:11:12,655 INFO L85 PathProgramCache]: Analyzing trace with hash 28963623, now seen corresponding path program 1 times [2022-04-15 07:11:12,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:11:12,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501590400] [2022-04-15 07:11:12,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:11:12,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:11:12,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:12,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:11:12,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:12,802 INFO L290 TraceCheckUtils]: 0: Hoare triple {189#(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(26, 2); {180#true} is VALID [2022-04-15 07:11:12,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {180#true} assume true; {180#true} is VALID [2022-04-15 07:11:12,803 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {180#true} {180#true} #45#return; {180#true} is VALID [2022-04-15 07:11:12,804 INFO L272 TraceCheckUtils]: 0: Hoare triple {180#true} call ULTIMATE.init(); {189#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:11:12,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {189#(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(26, 2); {180#true} is VALID [2022-04-15 07:11:12,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {180#true} assume true; {180#true} is VALID [2022-04-15 07:11:12,805 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {180#true} {180#true} #45#return; {180#true} is VALID [2022-04-15 07:11:12,805 INFO L272 TraceCheckUtils]: 4: Hoare triple {180#true} call #t~ret5 := main(); {180#true} is VALID [2022-04-15 07:11:12,805 INFO L290 TraceCheckUtils]: 5: Hoare triple {180#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; {180#true} is VALID [2022-04-15 07:11:12,807 INFO L290 TraceCheckUtils]: 6: Hoare triple {180#true} assume !!(~x~0 == ~y~0 && ~x~0 >= 0); {185#(and (<= 0 main_~y~0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-15 07:11:12,809 INFO L290 TraceCheckUtils]: 7: Hoare triple {185#(and (<= 0 main_~y~0) (<= main_~x~0 main_~y~0))} [49] L23-2-->L23-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_8 v_main_~x~0_7)) (.cse1 (= v_main_~y~0_9 v_main_~y~0_8)) (.cse2 (= |v_main_#t~post3_4| |v_main_#t~post3_3|)) (.cse3 (= |v_main_#t~post4_4| |v_main_#t~post4_3|))) (or (and (< v_main_~y~0_9 (+ v_main_~x~0_8 v_main_~y~0_8 1)) (< v_main_~y~0_8 v_main_~y~0_9) (= (+ v_main_~x~0_7 v_main_~y~0_9) (+ v_main_~x~0_8 v_main_~y~0_8))) (and .cse0 (not (< 0 v_main_~x~0_8)) .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3))) InVars {main_#t~post4=|v_main_#t~post4_4|, main_~y~0=v_main_~y~0_9, main_#t~post3=|v_main_#t~post3_4|, main_~x~0=v_main_~x~0_8} OutVars{main_#t~post4=|v_main_#t~post4_3|, main_~y~0=v_main_~y~0_8, main_#t~post3=|v_main_#t~post3_3|, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post3] {186#(<= 0 main_~y~0)} is VALID [2022-04-15 07:11:12,810 INFO L290 TraceCheckUtils]: 8: Hoare triple {186#(<= 0 main_~y~0)} [48] L23-3_primed-->L23-3: Formula: (not (< 0 v_main_~x~0_1)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {186#(<= 0 main_~y~0)} is VALID [2022-04-15 07:11:12,811 INFO L272 TraceCheckUtils]: 9: Hoare triple {186#(<= 0 main_~y~0)} call __VERIFIER_assert((if ~y~0 >= 0 then 1 else 0)); {187#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:11:12,811 INFO L290 TraceCheckUtils]: 10: Hoare triple {187#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {188#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:11:12,812 INFO L290 TraceCheckUtils]: 11: Hoare triple {188#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {181#false} is VALID [2022-04-15 07:11:12,812 INFO L290 TraceCheckUtils]: 12: Hoare triple {181#false} assume !false; {181#false} is VALID [2022-04-15 07:11:12,813 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:11:12,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:11:12,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501590400] [2022-04-15 07:11:12,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501590400] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:11:12,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:11:12,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 07:11:12,969 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:11:12,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1649262729] [2022-04-15 07:11:12,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1649262729] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:11:12,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:11:12,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 07:11:12,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360451320] [2022-04-15 07:11:12,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:11:12,972 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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:11:12,972 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:11:12,973 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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:11:12,988 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:11:12,988 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 07:11:12,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:11:12,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 07:11:12,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-15 07:11:12,990 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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:11:13,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:13,102 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-15 07:11:13,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 07:11:13,102 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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:11:13,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:11:13,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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:11:13,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2022-04-15 07:11:13,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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:11:13,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2022-04-15 07:11:13,109 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 13 transitions. [2022-04-15 07:11:13,122 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:11:13,122 INFO L225 Difference]: With dead ends: 14 [2022-04-15 07:11:13,123 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 07:11:13,124 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-04-15 07:11:13,127 INFO L913 BasicCegarLoop]: 8 mSDtfsCounter, 7 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:11:13,127 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 30 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 07:11:13,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 07:11:13,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 07:11:13,130 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:11:13,130 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:11:13,130 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:11:13,131 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:11:13,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:13,131 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 07:11:13,131 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 07:11:13,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:11:13,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:11:13,131 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:11:13,132 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:11:13,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:13,133 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 07:11:13,133 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 07:11:13,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:11:13,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:11:13,133 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:11:13,134 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:11:13,134 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:11:13,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 07:11:13,135 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2022-04-15 07:11:13,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:11:13,135 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 07:11:13,135 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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:11:13,135 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 07:11:13,135 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:11:13,136 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 07:11:13,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:11:13,139 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 07:11:13,140 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 07:11:13,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 07:11:13,225 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 11) no Hoare annotation was computed. [2022-04-15 07:11:13,228 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 11) no Hoare annotation was computed. [2022-04-15 07:11:13,228 INFO L882 garLoopResultBuilder]: For program point L11-1(line 11) no Hoare annotation was computed. [2022-04-15 07:11:13,229 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 19 29) the Hoare annotation is: true [2022-04-15 07:11:13,229 INFO L885 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: true [2022-04-15 07:11:13,232 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 19 29) the Hoare annotation is: true [2022-04-15 07:11:13,232 INFO L885 garLoopResultBuilder]: At program point L22(line 22) the Hoare annotation is: true [2022-04-15 07:11:13,232 INFO L878 garLoopResultBuilder]: At program point L23-2(lines 23 26) the Hoare annotation is: (and (<= main_~x~0 main_~y~0) (< 0 (+ main_~x~0 1))) [2022-04-15 07:11:13,232 INFO L878 garLoopResultBuilder]: At program point L23-3(lines 23 26) the Hoare annotation is: (<= 0 main_~y~0) [2022-04-15 07:11:13,233 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 19 29) the Hoare annotation is: true [2022-04-15 07:11:13,233 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-15 07:11:13,233 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:11:13,233 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-15 07:11:13,233 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 07:11:13,234 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 07:11:13,234 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 07:11:13,234 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 07:11:13,235 INFO L878 garLoopResultBuilder]: At program point L16(line 16) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-15 07:11:13,236 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:11:13,239 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 18) the Hoare annotation is: true [2022-04-15 07:11:13,240 INFO L878 garLoopResultBuilder]: At program point L15-2(lines 14 18) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-15 07:11:13,243 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 14 18) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-15 07:11:13,243 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:11:13,249 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2022-04-15 07:11:13,250 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 07:11:13,255 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 07:11:13,255 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 07:11:13,257 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2022-04-15 07:11:13,262 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:11:13,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 07:11:13 BoogieIcfgContainer [2022-04-15 07:11:13,269 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 07:11:13,270 INFO L158 Benchmark]: Toolchain (without parser) took 2409.51ms. Allocated memory is still 175.1MB. Free memory was 123.6MB in the beginning and 88.8MB in the end (delta: 34.8MB). Peak memory consumption was 36.0MB. Max. memory is 8.0GB. [2022-04-15 07:11:13,271 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 175.1MB. Free memory is still 140.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 07:11:13,271 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.50ms. Allocated memory is still 175.1MB. Free memory was 123.5MB in the beginning and 150.7MB in the end (delta: -27.2MB). Peak memory consumption was 13.0MB. Max. memory is 8.0GB. [2022-04-15 07:11:13,272 INFO L158 Benchmark]: Boogie Preprocessor took 29.12ms. Allocated memory is still 175.1MB. Free memory was 150.7MB in the beginning and 149.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 07:11:13,272 INFO L158 Benchmark]: RCFGBuilder took 267.71ms. Allocated memory is still 175.1MB. Free memory was 149.2MB in the beginning and 138.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-15 07:11:13,272 INFO L158 Benchmark]: TraceAbstraction took 1884.72ms. Allocated memory is still 175.1MB. Free memory was 138.1MB in the beginning and 88.8MB in the end (delta: 49.3MB). Peak memory consumption was 50.2MB. Max. memory is 8.0GB. [2022-04-15 07:11:13,274 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.17ms. Allocated memory is still 175.1MB. Free memory is still 140.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 219.50ms. Allocated memory is still 175.1MB. Free memory was 123.5MB in the beginning and 150.7MB in the end (delta: -27.2MB). Peak memory consumption was 13.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.12ms. Allocated memory is still 175.1MB. Free memory was 150.7MB in the beginning and 149.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 267.71ms. Allocated memory is still 175.1MB. Free memory was 149.2MB in the beginning and 138.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 1884.72ms. Allocated memory is still 175.1MB. Free memory was 138.1MB in the beginning and 88.8MB in the end (delta: 49.3MB). Peak memory consumption was 50.2MB. 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: 1.8s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 33 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 32 mSDsluCounter, 70 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 43 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 76 IncrementalHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 27 mSDtfsCounter, 76 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, InterpolantAutomatonStates: 13, 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, 32 PreInvPairs, 47 NumberOfFragments, 61 HoareAnnotationTreeSize, 32 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 20 FomulaSimplificationsInter, 56 FormulaSimplificationTreeSizeReductionInter, 0.1s 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 && 0 < x + 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: \old(cond) == 0 || !(cond == 0) RESULT: Ultimate proved your program to be correct! [2022-04-15 07:11:13,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...