/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-lit/cggmp2005.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 03:54:14,176 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 03:54:14,188 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 03:54:14,235 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 03:54:14,235 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 03:54:14,236 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 03:54:14,238 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 03:54:14,239 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 03:54:14,240 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 03:54:14,240 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 03:54:14,241 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 03:54:14,242 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 03:54:14,242 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 03:54:14,243 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 03:54:14,243 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 03:54:14,244 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 03:54:14,244 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 03:54:14,245 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 03:54:14,246 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 03:54:14,248 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 03:54:14,249 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 03:54:14,252 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 03:54:14,252 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 03:54:14,253 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 03:54:14,254 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 03:54:14,256 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 03:54:14,256 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 03:54:14,256 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 03:54:14,257 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 03:54:14,257 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 03:54:14,258 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 03:54:14,258 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 03:54:14,258 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 03:54:14,259 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 03:54:14,260 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 03:54:14,260 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 03:54:14,261 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 03:54:14,261 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 03:54:14,261 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 03:54:14,261 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 03:54:14,262 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 03:54:14,271 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 03:54:14,271 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 03:54:14,283 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 03:54:14,283 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 03:54:14,284 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 03:54:14,284 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 03:54:14,285 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 03:54:14,285 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 03:54:14,285 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 03:54:14,285 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 03:54:14,285 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 03:54:14,286 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 03:54:14,286 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 03:54:14,286 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 03:54:14,286 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 03:54:14,286 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 03:54:14,286 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 03:54:14,286 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 03:54:14,286 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 03:54:14,286 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 03:54:14,287 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 03:54:14,287 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 03:54:14,287 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 03:54:14,287 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 03:54:14,287 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 03:54:14,287 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 03:54:14,287 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 03:54:14,287 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 03:54:14,458 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 03:54:14,473 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 03:54:14,475 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 03:54:14,476 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 03:54:14,477 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 03:54:14,478 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/cggmp2005.i [2022-04-08 03:54:14,527 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be9f8bc63/998e0065f667467a9a7cca6d04b81c36/FLAGfe5dba1cf [2022-04-08 03:54:14,872 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 03:54:14,872 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/cggmp2005.i [2022-04-08 03:54:14,882 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be9f8bc63/998e0065f667467a9a7cca6d04b81c36/FLAGfe5dba1cf [2022-04-08 03:54:14,891 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be9f8bc63/998e0065f667467a9a7cca6d04b81c36 [2022-04-08 03:54:14,893 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 03:54:14,894 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 03:54:14,895 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 03:54:14,896 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 03:54:14,898 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 03:54:14,899 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:54:14" (1/1) ... [2022-04-08 03:54:14,900 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cfa858d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:54:14, skipping insertion in model container [2022-04-08 03:54:14,900 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:54:14" (1/1) ... [2022-04-08 03:54:14,905 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 03:54:14,915 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 03:54:15,034 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/cggmp2005.i[895,908] [2022-04-08 03:54:15,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 03:54:15,046 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 03:54:15,055 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/cggmp2005.i[895,908] [2022-04-08 03:54:15,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 03:54:15,066 INFO L208 MainTranslator]: Completed translation [2022-04-08 03:54:15,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:54:15 WrapperNode [2022-04-08 03:54:15,066 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 03:54:15,067 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 03:54:15,067 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 03:54:15,067 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 03:54:15,075 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:54:15" (1/1) ... [2022-04-08 03:54:15,075 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:54:15" (1/1) ... [2022-04-08 03:54:15,079 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:54:15" (1/1) ... [2022-04-08 03:54:15,079 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:54:15" (1/1) ... [2022-04-08 03:54:15,083 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:54:15" (1/1) ... [2022-04-08 03:54:15,085 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:54:15" (1/1) ... [2022-04-08 03:54:15,086 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:54:15" (1/1) ... [2022-04-08 03:54:15,087 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 03:54:15,087 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 03:54:15,087 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 03:54:15,088 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 03:54:15,088 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:54:15" (1/1) ... [2022-04-08 03:54:15,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 03:54:15,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:54:15,120 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 03:54:15,122 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 03:54:15,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 03:54:15,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 03:54:15,144 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 03:54:15,144 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 03:54:15,144 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 03:54:15,144 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 03:54:15,144 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 03:54:15,145 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 03:54:15,145 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-08 03:54:15,145 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-08 03:54:15,145 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 03:54:15,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 03:54:15,145 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 03:54:15,145 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 03:54:15,145 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 03:54:15,145 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 03:54:15,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 03:54:15,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 03:54:15,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 03:54:15,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 03:54:15,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 03:54:15,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 03:54:15,188 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 03:54:15,189 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 03:54:15,252 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 03:54:15,257 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 03:54:15,257 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 03:54:15,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:54:15 BoogieIcfgContainer [2022-04-08 03:54:15,259 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 03:54:15,260 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 03:54:15,260 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 03:54:15,269 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 03:54:15,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 03:54:14" (1/3) ... [2022-04-08 03:54:15,270 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@280b301f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:54:15, skipping insertion in model container [2022-04-08 03:54:15,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:54:15" (2/3) ... [2022-04-08 03:54:15,270 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@280b301f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:54:15, skipping insertion in model container [2022-04-08 03:54:15,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:54:15" (3/3) ... [2022-04-08 03:54:15,272 INFO L111 eAbstractionObserver]: Analyzing ICFG cggmp2005.i [2022-04-08 03:54:15,276 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 03:54:15,276 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 03:54:15,321 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 03:54:15,342 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 03:54:15,342 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 03:54:15,354 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 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 03:54:15,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 03:54:15,359 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:54:15,359 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:54:15,359 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:54:15,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:54:15,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1817730928, now seen corresponding path program 1 times [2022-04-08 03:54:15,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:54:15,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [204897235] [2022-04-08 03:54:15,377 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:54:15,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1817730928, now seen corresponding path program 2 times [2022-04-08 03:54:15,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:54:15,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564157715] [2022-04-08 03:54:15,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:54:15,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:54:15,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:15,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:54:15,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:15,596 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(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); {22#true} is VALID [2022-04-08 03:54:15,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2022-04-08 03:54:15,596 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #50#return; {22#true} is VALID [2022-04-08 03:54:15,600 INFO L272 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:54:15,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(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); {22#true} is VALID [2022-04-08 03:54:15,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#true} assume true; {22#true} is VALID [2022-04-08 03:54:15,602 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22#true} {22#true} #50#return; {22#true} is VALID [2022-04-08 03:54:15,602 INFO L272 TraceCheckUtils]: 4: Hoare triple {22#true} call #t~ret1 := main(); {22#true} is VALID [2022-04-08 03:54:15,603 INFO L290 TraceCheckUtils]: 5: Hoare triple {22#true} havoc ~i~0;havoc ~j~0;~i~0 := 1;~j~0 := 10; {27#(and (<= 10 main_~j~0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-08 03:54:15,610 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#(and (<= 10 main_~j~0) (= (+ (- 1) main_~i~0) 0))} assume !(~j~0 >= ~i~0); {23#false} is VALID [2022-04-08 03:54:15,610 INFO L272 TraceCheckUtils]: 7: Hoare triple {23#false} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {23#false} is VALID [2022-04-08 03:54:15,611 INFO L290 TraceCheckUtils]: 8: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2022-04-08 03:54:15,611 INFO L290 TraceCheckUtils]: 9: Hoare triple {23#false} assume 0 == ~cond; {23#false} is VALID [2022-04-08 03:54:15,611 INFO L290 TraceCheckUtils]: 10: Hoare triple {23#false} assume !false; {23#false} is VALID [2022-04-08 03:54:15,612 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 03:54:15,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:54:15,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564157715] [2022-04-08 03:54:15,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564157715] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:54:15,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:54:15,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 03:54:15,616 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:54:15,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [204897235] [2022-04-08 03:54:15,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [204897235] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:54:15,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:54:15,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 03:54:15,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041737191] [2022-04-08 03:54:15,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:54:15,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 11 [2022-04-08 03:54:15,627 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:54:15,629 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 03:54:15,649 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:54:15,650 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 03:54:15,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:54:15,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 03:54:15,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 03:54:15,673 INFO L87 Difference]: Start difference. First operand has 19 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 03:54:15,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:54:15,816 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-04-08 03:54:15,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 03:54:15,817 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 11 [2022-04-08 03:54:15,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:54:15,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 03:54:15,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-04-08 03:54:15,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 03:54:15,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-04-08 03:54:15,843 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 37 transitions. [2022-04-08 03:54:15,899 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:54:15,908 INFO L225 Difference]: With dead ends: 32 [2022-04-08 03:54:15,908 INFO L226 Difference]: Without dead ends: 13 [2022-04-08 03:54:15,911 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 03:54:15,915 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 10 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 03:54:15,917 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 26 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 03:54:15,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-08 03:54:15,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-08 03:54:15,945 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:54:15,946 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-08 03:54:15,947 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-08 03:54:15,947 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-08 03:54:15,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:54:15,951 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-08 03:54:15,951 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-08 03:54:15,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:54:15,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:54:15,952 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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 13 states. [2022-04-08 03:54:15,952 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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 13 states. [2022-04-08 03:54:15,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:54:15,953 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-08 03:54:15,953 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-08 03:54:15,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:54:15,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:54:15,954 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:54:15,954 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:54:15,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-08 03:54:15,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-08 03:54:15,957 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-08 03:54:15,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:54:15,958 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-08 03:54:15,961 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 03:54:15,961 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 13 transitions. [2022-04-08 03:54:15,983 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-08 03:54:15,983 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-08 03:54:15,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 03:54:15,984 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:54:15,984 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:54:15,985 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 03:54:15,985 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:54:15,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:54:15,987 INFO L85 PathProgramCache]: Analyzing trace with hash -480588846, now seen corresponding path program 1 times [2022-04-08 03:54:15,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:54:15,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [659210758] [2022-04-08 03:54:16,303 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 03:54:16,306 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 03:54:16,309 INFO L85 PathProgramCache]: Analyzing trace with hash 406914835, now seen corresponding path program 1 times [2022-04-08 03:54:16,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:54:16,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814807735] [2022-04-08 03:54:16,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:54:16,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:54:16,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:16,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:54:16,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:16,519 INFO L290 TraceCheckUtils]: 0: Hoare triple {159#(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); {149#true} is VALID [2022-04-08 03:54:16,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {149#true} assume true; {149#true} is VALID [2022-04-08 03:54:16,520 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {149#true} {149#true} #50#return; {149#true} is VALID [2022-04-08 03:54:16,520 INFO L272 TraceCheckUtils]: 0: Hoare triple {149#true} call ULTIMATE.init(); {159#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:54:16,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {159#(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); {149#true} is VALID [2022-04-08 03:54:16,522 INFO L290 TraceCheckUtils]: 2: Hoare triple {149#true} assume true; {149#true} is VALID [2022-04-08 03:54:16,522 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {149#true} {149#true} #50#return; {149#true} is VALID [2022-04-08 03:54:16,522 INFO L272 TraceCheckUtils]: 4: Hoare triple {149#true} call #t~ret1 := main(); {149#true} is VALID [2022-04-08 03:54:16,522 INFO L290 TraceCheckUtils]: 5: Hoare triple {149#true} havoc ~i~0;havoc ~j~0;~i~0 := 1;~j~0 := 10; {154#(and (<= main_~j~0 10) (<= 10 main_~j~0) (= main_~i~0 1))} is VALID [2022-04-08 03:54:16,524 INFO L290 TraceCheckUtils]: 6: Hoare triple {154#(and (<= main_~j~0 10) (<= 10 main_~j~0) (= main_~i~0 1))} [54] L28-2-->L28-3_primed: Formula: (let ((.cse0 (= v_main_~i~0_8 v_main_~i~0_7)) (.cse1 (= v_main_~j~0_10 v_main_~j~0_9))) (or (and .cse0 .cse1) (and (< v_main_~j~0_9 v_main_~j~0_10) (<= v_main_~j~0_10 (+ v_main_~j~0_9 (div (+ v_main_~j~0_10 (* (- 1) v_main_~i~0_8)) 3) 1)) (= (+ v_main_~i~0_8 (* v_main_~j~0_10 2)) (+ v_main_~i~0_7 (* v_main_~j~0_9 2)))) (and .cse0 (< v_main_~j~0_10 v_main_~i~0_8) .cse1))) InVars {main_~i~0=v_main_~i~0_8, main_~j~0=v_main_~j~0_10} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_9} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {155#(or (and (< 5 main_~j~0) (or (<= main_~j~0 6) (<= (+ (* main_~j~0 2) main_~i~0) 21))) (and (<= 10 main_~j~0) (= main_~i~0 1)))} is VALID [2022-04-08 03:54:16,524 INFO L290 TraceCheckUtils]: 7: Hoare triple {155#(or (and (< 5 main_~j~0) (or (<= main_~j~0 6) (<= (+ (* main_~j~0 2) main_~i~0) 21))) (and (<= 10 main_~j~0) (= main_~i~0 1)))} [53] L28-3_primed-->L28-3: Formula: (not (<= v_main_~i~0_1 v_main_~j~0_1)) InVars {main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_1} OutVars{main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {156#(and (<= main_~j~0 6) (< 5 main_~j~0))} is VALID [2022-04-08 03:54:16,525 INFO L272 TraceCheckUtils]: 8: Hoare triple {156#(and (<= main_~j~0 6) (< 5 main_~j~0))} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {157#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:54:16,525 INFO L290 TraceCheckUtils]: 9: Hoare triple {157#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {158#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:54:16,526 INFO L290 TraceCheckUtils]: 10: Hoare triple {158#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {150#false} is VALID [2022-04-08 03:54:16,526 INFO L290 TraceCheckUtils]: 11: Hoare triple {150#false} assume !false; {150#false} is VALID [2022-04-08 03:54:16,526 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 03:54:16,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:54:16,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814807735] [2022-04-08 03:54:16,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814807735] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:54:16,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:54:16,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 03:54:16,675 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:54:16,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [659210758] [2022-04-08 03:54:16,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [659210758] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:54:16,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:54:16,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 03:54:16,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551971952] [2022-04-08 03:54:16,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:54:16,677 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 03:54:16,677 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:54:16,677 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 03:54:16,689 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 03:54:16,689 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 03:54:16,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:54:16,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 03:54:16,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-08 03:54:16,691 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. 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 03:54:16,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:54:16,772 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-08 03:54:16,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 03:54:16,772 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 03:54:16,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:54:16,773 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 03:54:16,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2022-04-08 03:54:16,774 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 03:54:16,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2022-04-08 03:54:16,781 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 13 transitions. [2022-04-08 03:54:16,794 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-08 03:54:16,795 INFO L225 Difference]: With dead ends: 13 [2022-04-08 03:54:16,795 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 03:54:16,796 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-04-08 03:54:16,798 INFO L913 BasicCegarLoop]: 7 mSDtfsCounter, 3 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 03:54:16,798 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 34 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 8 Unchecked, 0.0s Time] [2022-04-08 03:54:16,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 03:54:16,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 03:54:16,801 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:54:16,801 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 03:54:16,801 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 03:54:16,802 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 03:54:16,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:54:16,802 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 03:54:16,802 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 03:54:16,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:54:16,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:54:16,802 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 03:54:16,802 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 03:54:16,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:54:16,803 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 03:54:16,803 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 03:54:16,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:54:16,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:54:16,803 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:54:16,803 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:54:16,803 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 03:54:16,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 03:54:16,804 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2022-04-08 03:54:16,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:54:16,804 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 03:54:16,804 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 03:54:16,804 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 03:54:16,804 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 03:54:16,804 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 03:54:16,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:54:16,806 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 03:54:16,807 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 03:54:16,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 03:54:16,871 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-08 03:54:16,873 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-08 03:54:16,874 INFO L882 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-08 03:54:16,874 INFO L882 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-08 03:54:16,874 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-08 03:54:16,874 INFO L882 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-08 03:54:16,874 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-08 03:54:16,876 INFO L885 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: true [2022-04-08 03:54:16,876 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 24 34) the Hoare annotation is: true [2022-04-08 03:54:16,876 INFO L878 garLoopResultBuilder]: At program point L28-2(lines 28 31) the Hoare annotation is: (exists ((v_main_~j~0_14 Int)) (and (or (and (= main_~i~0 1) (= v_main_~j~0_14 main_~j~0)) (and (< main_~j~0 v_main_~j~0_14) (<= v_main_~j~0_14 (+ main_~j~0 (div (+ v_main_~j~0_14 (- 1)) 3) 1)) (= (+ (* v_main_~j~0_14 2) 1) (+ (* main_~j~0 2) main_~i~0)))) (<= v_main_~j~0_14 10) (<= 10 v_main_~j~0_14))) [2022-04-08 03:54:16,876 INFO L878 garLoopResultBuilder]: At program point L28-3(lines 28 31) the Hoare annotation is: (and (<= main_~j~0 6) (< 5 main_~j~0)) [2022-04-08 03:54:16,876 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 24 34) the Hoare annotation is: true [2022-04-08 03:54:16,876 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 24 34) the Hoare annotation is: true [2022-04-08 03:54:16,876 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 03:54:16,877 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 03:54:16,877 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 03:54:16,877 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 03:54:16,878 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 03:54:16,880 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 03:54:16,880 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 03:54:16,881 INFO L885 garLoopResultBuilder]: At program point L18-2(lines 17 22) the Hoare annotation is: true [2022-04-08 03:54:16,881 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-08 03:54:16,881 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: true [2022-04-08 03:54:16,881 INFO L878 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 03:54:16,881 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 03:54:16,881 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 03:54:16,884 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2022-04-08 03:54:16,884 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 03:54:16,887 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 03:54:16,887 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 03:54:16,888 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-08 03:54:16,889 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-08 03:54:16,889 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-08 03:54:16,889 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-08 03:54:16,894 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-08 03:54:16,894 INFO L163 areAnnotationChecker]: CFG has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 03:54:16,910 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] [2022-04-08 03:54:16,910 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] [2022-04-08 03:54:16,910 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] [2022-04-08 03:54:16,911 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] [2022-04-08 03:54:16,911 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] [2022-04-08 03:54:16,911 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] [2022-04-08 03:54:16,911 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] [2022-04-08 03:54:16,914 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] [2022-04-08 03:54:16,914 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] [2022-04-08 03:54:16,914 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] [2022-04-08 03:54:16,914 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] [2022-04-08 03:54:16,915 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] [2022-04-08 03:54:16,915 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] [2022-04-08 03:54:16,915 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] [2022-04-08 03:54:16,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 03:54:16 BoogieIcfgContainer [2022-04-08 03:54:16,922 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 03:54:16,927 INFO L158 Benchmark]: Toolchain (without parser) took 2029.16ms. Allocated memory was 207.6MB in the beginning and 255.9MB in the end (delta: 48.2MB). Free memory was 159.7MB in the beginning and 196.8MB in the end (delta: -37.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-08 03:54:16,927 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 207.6MB. Free memory is still 176.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 03:54:16,927 INFO L158 Benchmark]: CACSL2BoogieTranslator took 170.93ms. Allocated memory is still 207.6MB. Free memory was 159.5MB in the beginning and 184.3MB in the end (delta: -24.8MB). Peak memory consumption was 11.0MB. Max. memory is 8.0GB. [2022-04-08 03:54:16,927 INFO L158 Benchmark]: Boogie Preprocessor took 19.99ms. Allocated memory is still 207.6MB. Free memory was 184.3MB in the beginning and 182.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 03:54:16,927 INFO L158 Benchmark]: RCFGBuilder took 171.33ms. Allocated memory is still 207.6MB. Free memory was 182.8MB in the beginning and 172.8MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-08 03:54:16,927 INFO L158 Benchmark]: TraceAbstraction took 1662.50ms. Allocated memory was 207.6MB in the beginning and 255.9MB in the end (delta: 48.2MB). Free memory was 172.3MB in the beginning and 196.8MB in the end (delta: -24.6MB). Peak memory consumption was 24.7MB. Max. memory is 8.0GB. [2022-04-08 03:54:16,928 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 207.6MB. Free memory is still 176.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 170.93ms. Allocated memory is still 207.6MB. Free memory was 159.5MB in the beginning and 184.3MB in the end (delta: -24.8MB). Peak memory consumption was 11.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.99ms. Allocated memory is still 207.6MB. Free memory was 184.3MB in the beginning and 182.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 171.33ms. Allocated memory is still 207.6MB. Free memory was 182.8MB in the beginning and 172.8MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 1662.50ms. Allocated memory was 207.6MB in the beginning and 255.9MB in the end (delta: 48.2MB). Free memory was 172.3MB in the beginning and 196.8MB in the end (delta: -24.6MB). Peak memory consumption was 24.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] * 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, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13 mSDsluCounter, 60 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 8 IncrementalHoareTripleChecker+Unchecked, 36 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24 IncrementalHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 24 mSDtfsCounter, 24 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=0, InterpolantAutomatonStates: 12, 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, 19 LocationsWithAnnotation, 25 PreInvPairs, 34 NumberOfFragments, 82 HoareAnnotationTreeSize, 25 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 19 FomulaSimplificationsInter, 68 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 28]: Loop Invariant [2022-04-08 03:54:16,934 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] [2022-04-08 03:54:16,934 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] [2022-04-08 03:54:16,934 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] [2022-04-08 03:54:16,934 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] [2022-04-08 03:54:16,934 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] [2022-04-08 03:54:16,935 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] [2022-04-08 03:54:16,935 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] [2022-04-08 03:54:16,935 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] [2022-04-08 03:54:16,935 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] [2022-04-08 03:54:16,935 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] [2022-04-08 03:54:16,935 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] [2022-04-08 03:54:16,935 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] [2022-04-08 03:54:16,936 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] [2022-04-08 03:54:16,936 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] Derived loop invariant: (\exists v_main_~j~0_14 : int :: (((i == 1 && v_main_~j~0_14 == j) || ((j < v_main_~j~0_14 && v_main_~j~0_14 <= j + (v_main_~j~0_14 + -1) / 3 + 1) && v_main_~j~0_14 * 2 + 1 == j * 2 + i)) && v_main_~j~0_14 <= 10) && 10 <= v_main_~j~0_14) - ProcedureContractResult [Line: 24]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-08 03:54:16,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...