/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/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-lit/css2003.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 09:33:42,184 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 09:33:42,186 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 09:33:42,203 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 09:33:42,205 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 09:33:42,206 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 09:33:42,209 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 09:33:42,213 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 09:33:42,215 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 09:33:42,218 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 09:33:42,219 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 09:33:42,220 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 09:33:42,220 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 09:33:42,221 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 09:33:42,222 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 09:33:42,223 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 09:33:42,223 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 09:33:42,224 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 09:33:42,227 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 09:33:42,231 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 09:33:42,232 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 09:33:42,233 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 09:33:42,233 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 09:33:42,234 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 09:33:42,235 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 09:33:42,239 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 09:33:42,239 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 09:33:42,239 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 09:33:42,240 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 09:33:42,240 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 09:33:42,241 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 09:33:42,241 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 09:33:42,242 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 09:33:42,243 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 09:33:42,243 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 09:33:42,243 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 09:33:42,244 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 09:33:42,244 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 09:33:42,244 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 09:33:42,244 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 09:33:42,245 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 09:33:42,246 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 09:33:42,246 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 09:33:42,253 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 09:33:42,253 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 09:33:42,254 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 09:33:42,254 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 09:33:42,254 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 09:33:42,254 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 09:33:42,254 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 09:33:42,254 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 09:33:42,254 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 09:33:42,255 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 09:33:42,255 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 09:33:42,255 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 09:33:42,255 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 09:33:42,255 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 09:33:42,255 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 09:33:42,255 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:33:42,256 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 09:33:42,256 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 09:33:42,256 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 09:33:42,256 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 09:33:42,256 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 09:33:42,256 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 09:33:42,256 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-08 09:33:42,438 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 09:33:42,454 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 09:33:42,455 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 09:33:42,456 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 09:33:42,457 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 09:33:42,457 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/css2003.i [2022-04-08 09:33:42,491 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee913b7a0/4e033334ecee43668a2a5276cfee9446/FLAG03a99afab [2022-04-08 09:33:42,878 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 09:33:42,878 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/css2003.i [2022-04-08 09:33:42,882 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee913b7a0/4e033334ecee43668a2a5276cfee9446/FLAG03a99afab [2022-04-08 09:33:42,896 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee913b7a0/4e033334ecee43668a2a5276cfee9446 [2022-04-08 09:33:42,898 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 09:33:42,899 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 09:33:42,901 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 09:33:42,902 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 09:33:42,904 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 09:33:42,908 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:33:42" (1/1) ... [2022-04-08 09:33:42,909 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f2f7712 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:33:42, skipping insertion in model container [2022-04-08 09:33:42,909 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:33:42" (1/1) ... [2022-04-08 09:33:42,914 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 09:33:42,925 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 09:33:43,095 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/css2003.i[895,908] [2022-04-08 09:33:43,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:33:43,118 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 09:33:43,128 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/css2003.i[895,908] [2022-04-08 09:33:43,138 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:33:43,147 INFO L208 MainTranslator]: Completed translation [2022-04-08 09:33:43,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:33:43 WrapperNode [2022-04-08 09:33:43,148 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 09:33:43,149 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 09:33:43,149 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 09:33:43,149 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 09:33:43,156 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:33:43" (1/1) ... [2022-04-08 09:33:43,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:33:43" (1/1) ... [2022-04-08 09:33:43,161 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:33:43" (1/1) ... [2022-04-08 09:33:43,161 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:33:43" (1/1) ... [2022-04-08 09:33:43,166 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:33:43" (1/1) ... [2022-04-08 09:33:43,172 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:33:43" (1/1) ... [2022-04-08 09:33:43,178 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:33:43" (1/1) ... [2022-04-08 09:33:43,184 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 09:33:43,185 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 09:33:43,185 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 09:33:43,185 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 09:33:43,187 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:33:43" (1/1) ... [2022-04-08 09:33:43,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:33:43,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:33:43,224 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-08 09:33:43,233 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-08 09:33:43,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 09:33:43,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 09:33:43,256 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 09:33:43,256 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 09:33:43,256 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 09:33:43,256 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 09:33:43,256 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 09:33:43,256 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 09:33:43,256 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-08 09:33:43,256 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-08 09:33:43,256 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 09:33:43,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 09:33:43,256 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 09:33:43,256 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 09:33:43,256 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 09:33:43,257 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 09:33:43,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 09:33:43,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 09:33:43,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 09:33:43,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 09:33:43,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 09:33:43,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 09:33:43,300 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 09:33:43,301 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 09:33:43,493 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 09:33:43,498 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 09:33:43,498 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 09:33:43,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:33:43 BoogieIcfgContainer [2022-04-08 09:33:43,499 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 09:33:43,501 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 09:33:43,501 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 09:33:43,513 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 09:33:43,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 09:33:42" (1/3) ... [2022-04-08 09:33:43,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aa1c2f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:33:43, skipping insertion in model container [2022-04-08 09:33:43,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:33:43" (2/3) ... [2022-04-08 09:33:43,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aa1c2f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:33:43, skipping insertion in model container [2022-04-08 09:33:43,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:33:43" (3/3) ... [2022-04-08 09:33:43,515 INFO L111 eAbstractionObserver]: Analyzing ICFG css2003.i [2022-04-08 09:33:43,518 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 09:33:43,519 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 09:33:43,580 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 09:33:43,587 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-08 09:33:43,587 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 09:33:43,613 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 14 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-08 09:33:43,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 09:33:43,617 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:33:43,617 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:33:43,617 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:33:43,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:33:43,621 INFO L85 PathProgramCache]: Analyzing trace with hash 255759161, now seen corresponding path program 1 times [2022-04-08 09:33:43,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:33:43,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [176910553] [2022-04-08 09:33:43,633 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:33:43,633 INFO L85 PathProgramCache]: Analyzing trace with hash 255759161, now seen corresponding path program 2 times [2022-04-08 09:33:43,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:33:43,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451858755] [2022-04-08 09:33:43,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:33:43,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:33:43,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:33:43,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:33:43,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:33:43,962 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#(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); {23#true} is VALID [2022-04-08 09:33:43,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-08 09:33:43,962 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #54#return; {23#true} is VALID [2022-04-08 09:33:43,976 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:33:43,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#(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); {23#true} is VALID [2022-04-08 09:33:43,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-08 09:33:43,976 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #54#return; {23#true} is VALID [2022-04-08 09:33:43,976 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret2 := main(); {23#true} is VALID [2022-04-08 09:33:43,977 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 1;~j~0 := 1;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {28#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-08 09:33:43,978 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#(= (+ (- 1) main_~i~0) 0)} assume !!(0 <= ~k~0 && ~k~0 <= 1); {29#(and (<= 0 main_~k~0) (<= main_~k~0 1) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-08 09:33:43,978 INFO L290 TraceCheckUtils]: 7: Hoare triple {29#(and (<= 0 main_~k~0) (<= main_~k~0 1) (= (+ (- 1) main_~i~0) 0))} assume !!(~i~0 < 1000000);~i~0 := 1 + ~i~0;~j~0 := ~j~0 + ~k~0;~k~0 := ~k~0 - 1; {30#(and (<= 2 main_~i~0) (<= (+ main_~i~0 main_~k~0) 2) (<= 1 (+ main_~i~0 main_~k~0)))} is VALID [2022-04-08 09:33:43,979 INFO L272 TraceCheckUtils]: 8: Hoare triple {30#(and (<= 2 main_~i~0) (<= (+ main_~i~0 main_~k~0) 2) (<= 1 (+ main_~i~0 main_~k~0)))} call __VERIFIER_assert((if (1 <= ~i~0 + ~k~0 && ~i~0 + ~k~0 <= 2) && ~i~0 >= 1 then 1 else 0)); {31#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:33:43,980 INFO L290 TraceCheckUtils]: 9: Hoare triple {31#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {32#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:33:43,980 INFO L290 TraceCheckUtils]: 10: Hoare triple {32#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {24#false} is VALID [2022-04-08 09:33:43,981 INFO L290 TraceCheckUtils]: 11: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-08 09:33:43,981 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-08 09:33:43,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:33:43,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451858755] [2022-04-08 09:33:43,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451858755] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:33:43,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:33:43,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 09:33:43,984 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:33:43,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [176910553] [2022-04-08 09:33:43,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [176910553] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:33:43,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:33:43,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 09:33:43,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298465244] [2022-04-08 09:33:43,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:33:43,988 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 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-08 09:33:43,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:33:43,991 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 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-08 09:33:44,002 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-08 09:33:44,002 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 09:33:44,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:33:44,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 09:33:44,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-08 09:33:44,016 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 14 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 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 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-08 09:33:44,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:33:44,237 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2022-04-08 09:33:44,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 09:33:44,238 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 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-08 09:33:44,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:33:44,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 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-08 09:33:44,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-04-08 09:33:44,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 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-08 09:33:44,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-04-08 09:33:44,245 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 42 transitions. [2022-04-08 09:33:44,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:33:44,280 INFO L225 Difference]: With dead ends: 34 [2022-04-08 09:33:44,280 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 09:33:44,282 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-04-08 09:33:44,284 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 21 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:33:44,284 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 49 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:33:44,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 09:33:44,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 09:33:44,296 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:33:44,296 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-08 09:33:44,297 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-08 09:33:44,297 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-08 09:33:44,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:33:44,297 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 09:33:44,297 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:33:44,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:33:44,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:33:44,298 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-08 09:33:44,298 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-08 09:33:44,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:33:44,298 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 09:33:44,298 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:33:44,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:33:44,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:33:44,298 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:33:44,298 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:33:44,298 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-08 09:33:44,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 09:33:44,299 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2022-04-08 09:33:44,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:33:44,299 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 09:33:44,300 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 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-08 09:33:44,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 09:33:44,300 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-08 09:33:44,300 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:33:44,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:33:44,301 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 09:33:44,302 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 09:33:44,303 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 09:33:44,398 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-08 09:33:44,399 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-08 09:33:44,399 INFO L882 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-08 09:33:44,399 INFO L882 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-08 09:33:44,399 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-08 09:33:44,399 INFO L882 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-08 09:33:44,399 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-08 09:33:44,399 INFO L878 garLoopResultBuilder]: At program point L34-1(lines 30 35) the Hoare annotation is: (or (and (<= 0 main_~k~0) (<= main_~k~0 1) (= (+ (- 1) main_~i~0) 0)) (let ((.cse0 (+ main_~i~0 main_~k~0))) (and (<= 2 main_~i~0) (<= .cse0 2) (<= 1 .cse0)))) [2022-04-08 09:33:44,399 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 24 37) the Hoare annotation is: true [2022-04-08 09:33:44,400 INFO L878 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: (= (+ (- 1) main_~i~0) 0) [2022-04-08 09:33:44,400 INFO L878 garLoopResultBuilder]: At program point L30-2(lines 30 35) the Hoare annotation is: (let ((.cse0 (+ main_~i~0 main_~k~0))) (and (<= 2 main_~i~0) (<= .cse0 2) (<= 1 .cse0))) [2022-04-08 09:33:44,400 INFO L878 garLoopResultBuilder]: At program point mainEXIT(lines 24 37) the Hoare annotation is: (or (let ((.cse0 (+ main_~i~0 main_~k~0))) (and (<= 2 main_~i~0) (<= .cse0 2) (<= 1 .cse0))) (= (+ (- 1) main_~i~0) 0)) [2022-04-08 09:33:44,400 INFO L878 garLoopResultBuilder]: At program point mainFINAL(lines 24 37) the Hoare annotation is: (or (let ((.cse0 (+ main_~i~0 main_~k~0))) (and (<= 2 main_~i~0) (<= .cse0 2) (<= 1 .cse0))) (= (+ (- 1) main_~i~0) 0)) [2022-04-08 09:33:44,400 INFO L878 garLoopResultBuilder]: At program point L34(line 34) the Hoare annotation is: (let ((.cse0 (+ main_~i~0 main_~k~0))) (and (<= 2 main_~i~0) (<= .cse0 2) (<= 1 .cse0))) [2022-04-08 09:33:44,400 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 09:33:44,400 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-08 09:33:44,400 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 09:33:44,400 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 09:33:44,400 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 09:33:44,401 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 09:33:44,401 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 09:33:44,401 INFO L878 garLoopResultBuilder]: At program point L18-2(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-08 09:33:44,401 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-08 09:33:44,401 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-08 09:33:44,401 INFO L878 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 09:33:44,401 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 09:33:44,401 INFO L878 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-08 09:33:44,403 INFO L719 BasicCegarLoop]: Path program histogram: [2] [2022-04-08 09:33:44,404 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 09:33:44,406 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 09:33:44,406 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 09:33:44,407 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-08 09:33:44,408 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-08 09:33:44,408 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-08 09:33:44,408 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-08 09:33:44,409 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-08 09:33:44,418 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-08 09:33:44,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 09:33:44 BoogieIcfgContainer [2022-04-08 09:33:44,425 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 09:33:44,426 INFO L158 Benchmark]: Toolchain (without parser) took 1526.50ms. Allocated memory was 167.8MB in the beginning and 212.9MB in the end (delta: 45.1MB). Free memory was 116.6MB in the beginning and 184.8MB in the end (delta: -68.2MB). Peak memory consumption was 48.3MB. Max. memory is 8.0GB. [2022-04-08 09:33:44,426 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 167.8MB. Free memory was 133.0MB in the beginning and 132.8MB in the end (delta: 136.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 09:33:44,426 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.70ms. Allocated memory was 167.8MB in the beginning and 212.9MB in the end (delta: 45.1MB). Free memory was 116.5MB in the beginning and 190.0MB in the end (delta: -73.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-08 09:33:44,427 INFO L158 Benchmark]: Boogie Preprocessor took 35.90ms. Allocated memory is still 212.9MB. Free memory was 190.0MB in the beginning and 188.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 09:33:44,427 INFO L158 Benchmark]: RCFGBuilder took 314.26ms. Allocated memory is still 212.9MB. Free memory was 188.4MB in the beginning and 177.4MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-08 09:33:44,427 INFO L158 Benchmark]: TraceAbstraction took 924.43ms. Allocated memory is still 212.9MB. Free memory was 176.4MB in the beginning and 184.8MB in the end (delta: -8.3MB). Peak memory consumption was 62.9MB. Max. memory is 8.0GB. [2022-04-08 09:33:44,429 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.11ms. Allocated memory is still 167.8MB. Free memory was 133.0MB in the beginning and 132.8MB in the end (delta: 136.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 246.70ms. Allocated memory was 167.8MB in the beginning and 212.9MB in the end (delta: 45.1MB). Free memory was 116.5MB in the beginning and 190.0MB in the end (delta: -73.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.90ms. Allocated memory is still 212.9MB. Free memory was 190.0MB in the beginning and 188.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 314.26ms. Allocated memory is still 212.9MB. Free memory was 188.4MB in the beginning and 177.4MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 924.43ms. Allocated memory is still 212.9MB. Free memory was 176.4MB in the beginning and 184.8MB in the end (delta: -8.3MB). Peak memory consumption was 62.9MB. 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, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 21 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21 mSDsluCounter, 49 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 33 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 71 IncrementalHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 16 mSDtfsCounter, 71 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, InterpolantAutomatonStates: 8, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 26 PreInvPairs, 38 NumberOfFragments, 145 HoareAnnotationTreeSize, 26 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 20 FomulaSimplificationsInter, 15 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: 30]: Loop Invariant Derived loop invariant: ((0 <= k && k <= 1) && -1 + i == 0) || ((2 <= i && i + k <= 2) && 1 <= i + k) - ProcedureContractResult [Line: 24]: Procedure Contract for main Derived contract for procedure main: ((2 <= i && i + k <= 2) && 1 <= i + k) || -1 + i == 0 - ProcedureContractResult [Line: 17]: 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-08 09:33:44,455 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...