./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive-with-pointer/simple-recursive.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-with-pointer/simple-recursive.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e4b2b33802a1e3212162c0e55c40efaad08f7abe5e8690f0efef5fec80921b38 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 17:50:28,920 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 17:50:28,991 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-12 17:50:28,996 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 17:50:28,996 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 17:50:29,021 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 17:50:29,023 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 17:50:29,023 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 17:50:29,023 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 17:50:29,024 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 17:50:29,024 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 17:50:29,024 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 17:50:29,025 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 17:50:29,025 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 17:50:29,026 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 17:50:29,026 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 17:50:29,028 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 17:50:29,030 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 17:50:29,031 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 17:50:29,031 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 17:50:29,032 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 17:50:29,032 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 17:50:29,032 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 17:50:29,032 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 17:50:29,033 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 17:50:29,033 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-12 17:50:29,033 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 17:50:29,033 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 17:50:29,034 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 17:50:29,034 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 17:50:29,036 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 17:50:29,037 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 17:50:29,037 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 17:50:29,037 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 17:50:29,037 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 17:50:29,038 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 17:50:29,038 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 17:50:29,038 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 17:50:29,038 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 17:50:29,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 17:50:29,038 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 17:50:29,039 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 17:50:29,039 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 17:50:29,039 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 17:50:29,040 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e4b2b33802a1e3212162c0e55c40efaad08f7abe5e8690f0efef5fec80921b38 [2024-11-12 17:50:29,284 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 17:50:29,309 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 17:50:29,311 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 17:50:29,312 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 17:50:29,312 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 17:50:29,313 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-with-pointer/simple-recursive.c [2024-11-12 17:50:30,677 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 17:50:30,864 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 17:50:30,865 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-with-pointer/simple-recursive.c [2024-11-12 17:50:30,871 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69bf9ee25/a659ec96452045d093c1f74ed5501cc8/FLAG607f1c720 [2024-11-12 17:50:30,883 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69bf9ee25/a659ec96452045d093c1f74ed5501cc8 [2024-11-12 17:50:30,885 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 17:50:30,887 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 17:50:30,890 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 17:50:30,891 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 17:50:30,897 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 17:50:30,898 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:50:30" (1/1) ... [2024-11-12 17:50:30,901 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fa23ca4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:50:30, skipping insertion in model container [2024-11-12 17:50:30,901 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:50:30" (1/1) ... [2024-11-12 17:50:30,920 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 17:50:31,138 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 17:50:31,152 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 17:50:31,169 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 17:50:31,186 INFO L204 MainTranslator]: Completed translation [2024-11-12 17:50:31,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:50:31 WrapperNode [2024-11-12 17:50:31,186 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 17:50:31,187 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 17:50:31,188 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 17:50:31,188 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 17:50:31,196 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:50:31" (1/1) ... [2024-11-12 17:50:31,203 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:50:31" (1/1) ... [2024-11-12 17:50:31,218 INFO L138 Inliner]: procedures = 14, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 32 [2024-11-12 17:50:31,219 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 17:50:31,220 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 17:50:31,220 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 17:50:31,220 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 17:50:31,230 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:50:31" (1/1) ... [2024-11-12 17:50:31,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:50:31" (1/1) ... [2024-11-12 17:50:31,233 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:50:31" (1/1) ... [2024-11-12 17:50:31,247 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 2 writes are split as follows [0, 2]. [2024-11-12 17:50:31,247 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:50:31" (1/1) ... [2024-11-12 17:50:31,247 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:50:31" (1/1) ... [2024-11-12 17:50:31,251 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:50:31" (1/1) ... [2024-11-12 17:50:31,252 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:50:31" (1/1) ... [2024-11-12 17:50:31,254 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:50:31" (1/1) ... [2024-11-12 17:50:31,254 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:50:31" (1/1) ... [2024-11-12 17:50:31,256 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 17:50:31,257 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 17:50:31,257 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 17:50:31,257 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 17:50:31,258 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:50:31" (1/1) ... [2024-11-12 17:50:31,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 17:50:31,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:50:31,292 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 17:50:31,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 17:50:31,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 17:50:31,344 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2024-11-12 17:50:31,345 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2024-11-12 17:50:31,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 17:50:31,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 17:50:31,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-12 17:50:31,346 INFO L130 BoogieDeclarations]: Found specification of procedure plus [2024-11-12 17:50:31,346 INFO L138 BoogieDeclarations]: Found implementation of procedure plus [2024-11-12 17:50:31,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 17:50:31,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 17:50:31,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 17:50:31,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 17:50:31,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 17:50:31,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 17:50:31,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 17:50:31,439 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 17:50:31,442 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 17:50:31,595 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-12 17:50:31,596 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 17:50:31,610 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 17:50:31,612 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-12 17:50:31,612 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:50:31 BoogieIcfgContainer [2024-11-12 17:50:31,612 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 17:50:31,617 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 17:50:31,617 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 17:50:31,621 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 17:50:31,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:50:30" (1/3) ... [2024-11-12 17:50:31,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5188554a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:50:31, skipping insertion in model container [2024-11-12 17:50:31,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:50:31" (2/3) ... [2024-11-12 17:50:31,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5188554a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:50:31, skipping insertion in model container [2024-11-12 17:50:31,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:50:31" (3/3) ... [2024-11-12 17:50:31,624 INFO L112 eAbstractionObserver]: Analyzing ICFG simple-recursive.c [2024-11-12 17:50:31,642 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 17:50:31,642 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-12 17:50:31,702 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 17:50:31,708 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7bea4424, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 17:50:31,708 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-12 17:50:31,711 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 17:50:31,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-12 17:50:31,718 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:50:31,718 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:50:31,719 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting plusErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [plusErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, plusErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 17:50:31,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:50:31,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1588237025, now seen corresponding path program 1 times [2024-11-12 17:50:31,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:50:31,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887878088] [2024-11-12 17:50:31,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:50:31,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:50:31,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:50:32,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 17:50:32,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:50:32,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887878088] [2024-11-12 17:50:32,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887878088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:50:32,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:50:32,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 17:50:32,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335388902] [2024-11-12 17:50:32,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:50:32,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 17:50:32,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:50:32,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 17:50:32,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 17:50:32,302 INFO L87 Difference]: Start difference. First operand has 23 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 7 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 17:50:32,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:50:32,488 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2024-11-12 17:50:32,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 17:50:32,499 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-12 17:50:32,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:50:32,507 INFO L225 Difference]: With dead ends: 46 [2024-11-12 17:50:32,507 INFO L226 Difference]: Without dead ends: 20 [2024-11-12 17:50:32,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-12 17:50:32,513 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 11 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:50:32,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 77 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:50:32,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-12 17:50:32,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2024-11-12 17:50:32,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 17:50:32,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2024-11-12 17:50:32,544 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 8 [2024-11-12 17:50:32,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:50:32,545 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2024-11-12 17:50:32,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 17:50:32,545 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2024-11-12 17:50:32,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-12 17:50:32,546 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:50:32,546 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:50:32,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 17:50:32,546 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting plusErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [plusErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, plusErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 17:50:32,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:50:32,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1990707460, now seen corresponding path program 1 times [2024-11-12 17:50:32,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:50:32,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136212212] [2024-11-12 17:50:32,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:50:32,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:50:32,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:50:32,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 17:50:32,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:50:32,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136212212] [2024-11-12 17:50:32,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136212212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:50:32,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:50:32,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 17:50:32,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4791060] [2024-11-12 17:50:32,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:50:32,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 17:50:32,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:50:32,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 17:50:32,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 17:50:32,756 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 17:50:32,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:50:32,815 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2024-11-12 17:50:32,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 17:50:32,816 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-12 17:50:32,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:50:32,817 INFO L225 Difference]: With dead ends: 19 [2024-11-12 17:50:32,817 INFO L226 Difference]: Without dead ends: 18 [2024-11-12 17:50:32,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-12 17:50:32,819 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 4 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:50:32,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 34 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:50:32,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-12 17:50:32,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-12 17:50:32,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 17:50:32,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2024-11-12 17:50:32,829 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 9 [2024-11-12 17:50:32,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:50:32,829 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2024-11-12 17:50:32,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 17:50:32,829 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2024-11-12 17:50:32,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-12 17:50:32,830 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:50:32,830 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:50:32,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 17:50:32,830 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting plusErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [plusErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, plusErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 17:50:32,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:50:32,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1020302327, now seen corresponding path program 1 times [2024-11-12 17:50:32,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:50:32,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110120372] [2024-11-12 17:50:32,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:50:32,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:50:32,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:50:33,200 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 17:50:33,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:50:33,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110120372] [2024-11-12 17:50:33,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110120372] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:50:33,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356910955] [2024-11-12 17:50:33,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:50:33,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:50:33,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:50:33,205 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:50:33,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 17:50:33,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:50:33,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-12 17:50:33,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:50:33,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-12 17:50:33,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-12 17:50:33,513 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 17:50:33,514 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:50:33,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356910955] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:50:33,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:50:33,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 17 [2024-11-12 17:50:33,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940331000] [2024-11-12 17:50:33,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:50:33,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 17:50:33,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:50:33,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 17:50:33,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2024-11-12 17:50:33,520 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 8 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 17:50:33,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:50:33,639 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2024-11-12 17:50:33,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 17:50:33,640 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-12 17:50:33,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:50:33,641 INFO L225 Difference]: With dead ends: 19 [2024-11-12 17:50:33,641 INFO L226 Difference]: Without dead ends: 18 [2024-11-12 17:50:33,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2024-11-12 17:50:33,643 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 8 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:50:33,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 52 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:50:33,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-12 17:50:33,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2024-11-12 17:50:33,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 17:50:33,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2024-11-12 17:50:33,651 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2024-11-12 17:50:33,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:50:33,652 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2024-11-12 17:50:33,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 17:50:33,653 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2024-11-12 17:50:33,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-12 17:50:33,654 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:50:33,654 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-12 17:50:33,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 17:50:33,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:50:33,859 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting plusErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [plusErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, plusErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 17:50:33,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:50:33,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1564601124, now seen corresponding path program 1 times [2024-11-12 17:50:33,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:50:33,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115692078] [2024-11-12 17:50:33,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:50:33,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:50:33,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:50:34,153 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 17:50:34,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:50:34,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115692078] [2024-11-12 17:50:34,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115692078] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:50:34,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666582112] [2024-11-12 17:50:34,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:50:34,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:50:34,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:50:34,161 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:50:34,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 17:50:34,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:50:34,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-12 17:50:34,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:50:34,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-12 17:50:34,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-12 17:50:34,322 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 17:50:34,322 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:50:34,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666582112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:50:34,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:50:34,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 15 [2024-11-12 17:50:34,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173611783] [2024-11-12 17:50:34,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:50:34,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 17:50:34,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:50:34,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 17:50:34,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-11-12 17:50:34,326 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 17:50:34,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:50:34,360 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2024-11-12 17:50:34,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 17:50:34,362 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-12 17:50:34,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:50:34,363 INFO L225 Difference]: With dead ends: 17 [2024-11-12 17:50:34,363 INFO L226 Difference]: Without dead ends: 0 [2024-11-12 17:50:34,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2024-11-12 17:50:34,364 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:50:34,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 21 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:50:34,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-12 17:50:34,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-12 17:50:34,366 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) [2024-11-12 17:50:34,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-12 17:50:34,366 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2024-11-12 17:50:34,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:50:34,370 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-12 17:50:34,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 17:50:34,371 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-12 17:50:34,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-12 17:50:34,373 INFO L782 garLoopResultBuilder]: Registering result SAFE for location plusErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-12 17:50:34,374 INFO L782 garLoopResultBuilder]: Registering result SAFE for location plusErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-12 17:50:34,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 17:50:34,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-12 17:50:34,578 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-12 17:50:34,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-12 17:50:34,761 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 17:50:34,773 WARN L156 FloydHoareUtils]: Requires clause for foo contained old-variable. Original clause: (let ((.cse0 (select (select |#memory_int#1| |foo_#in~p#1.base|) |foo_#in~p#1.offset|)) (.cse1 (select (select |old(#memory_int#1)| |foo_#in~p#1.base|) |foo_#in~p#1.offset|))) (and (<= 0 (+ .cse0 2147483648)) (<= 0 (+ .cse1 2147483648)) (or (= .cse0 10) (< .cse1 10) (< 10 .cse1)))) Eliminated clause: (let ((.cse0 (select (select |#memory_int#1| |foo_#in~p#1.base|) |foo_#in~p#1.offset|))) (and (<= 0 (+ .cse0 2147483648)) (exists ((|old(#memory_int#1)| (Array Int (Array Int Int)))) (let ((.cse1 (select (select |old(#memory_int#1)| |foo_#in~p#1.base|) |foo_#in~p#1.offset|))) (and (<= 0 (+ .cse1 2147483648)) (or (= .cse0 10) (not (= .cse1 10)))))))) [2024-11-12 17:50:34,784 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-12 17:50:34,784 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-12 17:50:34,784 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~p!base,]]] [2024-11-12 17:50:34,785 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-12 17:50:34,785 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-12 17:50:34,785 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] [2024-11-12 17:50:34,786 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~p!base,]]] [2024-11-12 17:50:34,796 WARN L156 FloydHoareUtils]: Requires clause for plus contained old-variable. Original clause: (let ((.cse0 (select (select |#memory_int#1| |plus_#in~p.base|) |plus_#in~p.offset|)) (.cse1 (select (select |old(#memory_int#1)| |plus_#in~p.base|) |plus_#in~p.offset|))) (and (<= 0 (+ .cse0 2147483648)) (<= .cse1 19) (or (< .cse1 10) (= .cse0 10) (< 10 .cse1)) (<= .cse0 19) (<= 0 (+ .cse1 2147483648)))) Eliminated clause: (let ((.cse0 (select (select |#memory_int#1| |plus_#in~p.base|) |plus_#in~p.offset|))) (and (<= 0 (+ .cse0 2147483648)) (exists ((|old(#memory_int#1)| (Array Int (Array Int Int)))) (let ((.cse1 (select (select |old(#memory_int#1)| |plus_#in~p.base|) |plus_#in~p.offset|))) (and (<= .cse1 19) (or (not (= .cse1 10)) (= .cse0 10)) (<= 0 (+ .cse1 2147483648))))) (<= .cse0 19))) [2024-11-12 17:50:34,802 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-12 17:50:34,803 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-12 17:50:34,804 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~p!base,]]] [2024-11-12 17:50:34,804 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-12 17:50:34,804 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-12 17:50:34,804 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-12 17:50:34,804 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~p!base,]]] [2024-11-12 17:50:34,805 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-12 17:50:34,805 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] [2024-11-12 17:50:34,805 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~p!base,]]] [2024-11-12 17:50:34,805 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-12 17:50:34,805 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] [2024-11-12 17:50:34,805 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~p!base,]]] [2024-11-12 17:50:34,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:50:34 BoogieIcfgContainer [2024-11-12 17:50:34,807 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 17:50:34,808 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 17:50:34,808 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 17:50:34,809 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 17:50:34,810 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:50:31" (3/4) ... [2024-11-12 17:50:34,814 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-12 17:50:34,818 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure foo [2024-11-12 17:50:34,818 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure plus [2024-11-12 17:50:34,822 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-12 17:50:34,823 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-12 17:50:34,823 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-12 17:50:34,824 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-12 17:50:34,912 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 17:50:34,913 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-12 17:50:34,913 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 17:50:34,913 INFO L158 Benchmark]: Toolchain (without parser) took 4026.88ms. Allocated memory was 125.8MB in the beginning and 195.0MB in the end (delta: 69.2MB). Free memory was 53.6MB in the beginning and 129.4MB in the end (delta: -75.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 17:50:34,914 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 125.8MB. Free memory is still 84.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 17:50:34,914 INFO L158 Benchmark]: CACSL2BoogieTranslator took 296.52ms. Allocated memory was 125.8MB in the beginning and 159.4MB in the end (delta: 33.6MB). Free memory was 53.4MB in the beginning and 128.8MB in the end (delta: -75.3MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. [2024-11-12 17:50:34,914 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.06ms. Allocated memory is still 159.4MB. Free memory was 128.8MB in the beginning and 127.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 17:50:34,914 INFO L158 Benchmark]: Boogie Preprocessor took 36.19ms. Allocated memory is still 159.4MB. Free memory was 127.7MB in the beginning and 125.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 17:50:34,915 INFO L158 Benchmark]: RCFGBuilder took 355.50ms. Allocated memory is still 159.4MB. Free memory was 125.6MB in the beginning and 114.1MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-12 17:50:34,915 INFO L158 Benchmark]: TraceAbstraction took 3190.14ms. Allocated memory was 159.4MB in the beginning and 195.0MB in the end (delta: 35.7MB). Free memory was 113.0MB in the beginning and 133.6MB in the end (delta: -20.6MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. [2024-11-12 17:50:34,915 INFO L158 Benchmark]: Witness Printer took 105.36ms. Allocated memory is still 195.0MB. Free memory was 133.6MB in the beginning and 129.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 17:50:34,919 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 125.8MB. Free memory is still 84.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 296.52ms. Allocated memory was 125.8MB in the beginning and 159.4MB in the end (delta: 33.6MB). Free memory was 53.4MB in the beginning and 128.8MB in the end (delta: -75.3MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.06ms. Allocated memory is still 159.4MB. Free memory was 128.8MB in the beginning and 127.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.19ms. Allocated memory is still 159.4MB. Free memory was 127.7MB in the beginning and 125.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 355.50ms. Allocated memory is still 159.4MB. Free memory was 125.6MB in the beginning and 114.1MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3190.14ms. Allocated memory was 159.4MB in the beginning and 195.0MB in the end (delta: 35.7MB). Free memory was 113.0MB in the beginning and 133.6MB in the end (delta: -20.6MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. * Witness Printer took 105.36ms. Allocated memory is still 195.0MB. Free memory was 133.6MB in the beginning and 129.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~p!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~p!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~p!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~p!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~p!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~p!base,]]] * 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: 7]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 7]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 23 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 25 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25 mSDsluCounter, 184 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 142 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 170 IncrementalHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 42 mSDtfsCounter, 170 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=0, InterpolantAutomatonStates: 29, 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, 4 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 79 NumberOfCodeBlocks, 79 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 73 ConstructedInterpolants, 0 QuantifiedInterpolants, 343 SizeOfPredicates, 18 NumberOfNonLiveVariables, 225 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 11/22 InterpolantCoveringCapability, 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 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-12 17:50:34,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE