./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/ldv-regression/test22-3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3289d67d 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/ldv-regression/test22-3.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 d801f0525ca26a676000831cf03fb7a7e79d5c4d235bd41da197ed6559b3bbff --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 04:05:37,156 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 04:05:37,236 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-17 04:05:37,239 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 04:05:37,239 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 04:05:37,253 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 04:05:37,253 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 04:05:37,253 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 04:05:37,254 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 04:05:37,254 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 04:05:37,254 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 04:05:37,255 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 04:05:37,255 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 04:05:37,255 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 04:05:37,255 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 04:05:37,256 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 04:05:37,256 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 04:05:37,256 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 04:05:37,256 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 04:05:37,257 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 04:05:37,257 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 04:05:37,257 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 04:05:37,258 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 04:05:37,258 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 04:05:37,258 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 04:05:37,258 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-17 04:05:37,259 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 04:05:37,259 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 04:05:37,259 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 04:05:37,259 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 04:05:37,260 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 04:05:37,260 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 04:05:37,260 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 04:05:37,260 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 04:05:37,260 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 04:05:37,261 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 04:05:37,261 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 04:05:37,261 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-17 04:05:37,261 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 04:05:37,261 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 04:05:37,262 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 04:05:37,262 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 04:05:37,262 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 04:05:37,262 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 04:05:37,262 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 -> d801f0525ca26a676000831cf03fb7a7e79d5c4d235bd41da197ed6559b3bbff [2024-11-17 04:05:37,482 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 04:05:37,506 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 04:05:37,510 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 04:05:37,511 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 04:05:37,512 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 04:05:37,514 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/test22-3.c [2024-11-17 04:05:38,923 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 04:05:39,088 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 04:05:39,088 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test22-3.c [2024-11-17 04:05:39,096 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11e021d39/ae5735c5dddd4613af129538a286b3ba/FLAG2be1da7a9 [2024-11-17 04:05:39,108 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11e021d39/ae5735c5dddd4613af129538a286b3ba [2024-11-17 04:05:39,110 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 04:05:39,111 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 04:05:39,112 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 04:05:39,112 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 04:05:39,116 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 04:05:39,117 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 04:05:39" (1/1) ... [2024-11-17 04:05:39,117 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31239f60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:05:39, skipping insertion in model container [2024-11-17 04:05:39,118 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 04:05:39" (1/1) ... [2024-11-17 04:05:39,135 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 04:05:39,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 04:05:39,330 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 04:05:39,347 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 04:05:39,361 INFO L204 MainTranslator]: Completed translation [2024-11-17 04:05:39,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:05:39 WrapperNode [2024-11-17 04:05:39,362 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 04:05:39,363 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 04:05:39,363 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 04:05:39,363 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 04:05:39,369 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:05:39" (1/1) ... [2024-11-17 04:05:39,374 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:05:39" (1/1) ... [2024-11-17 04:05:39,391 INFO L138 Inliner]: procedures = 17, calls = 31, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 101 [2024-11-17 04:05:39,392 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 04:05:39,392 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 04:05:39,393 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 04:05:39,393 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 04:05:39,401 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:05:39" (1/1) ... [2024-11-17 04:05:39,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:05:39" (1/1) ... [2024-11-17 04:05:39,403 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:05:39" (1/1) ... [2024-11-17 04:05:39,414 INFO L175 MemorySlicer]: Split 16 memory accesses to 2 slices as follows [2, 14]. 88 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 4]. The 4 writes are split as follows [0, 4]. [2024-11-17 04:05:39,414 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:05:39" (1/1) ... [2024-11-17 04:05:39,418 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:05:39" (1/1) ... [2024-11-17 04:05:39,422 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:05:39" (1/1) ... [2024-11-17 04:05:39,423 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:05:39" (1/1) ... [2024-11-17 04:05:39,424 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:05:39" (1/1) ... [2024-11-17 04:05:39,424 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:05:39" (1/1) ... [2024-11-17 04:05:39,426 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 04:05:39,426 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 04:05:39,426 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 04:05:39,427 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 04:05:39,427 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:05:39" (1/1) ... [2024-11-17 04:05:39,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 04:05:39,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:05:39,465 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-17 04:05:39,467 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-17 04:05:39,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 04:05:39,500 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-17 04:05:39,500 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-17 04:05:39,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 04:05:39,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-17 04:05:39,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 04:05:39,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-17 04:05:39,501 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2024-11-17 04:05:39,501 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2024-11-17 04:05:39,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 04:05:39,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 04:05:39,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 04:05:39,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-17 04:05:39,559 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 04:05:39,561 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 04:05:39,604 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L30: havoc #t~nondet10; [2024-11-17 04:05:39,679 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L35: havoc check_#t~mem11#1; [2024-11-17 04:05:39,691 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-11-17 04:05:39,691 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 04:05:39,701 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 04:05:39,701 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 04:05:39,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 04:05:39 BoogieIcfgContainer [2024-11-17 04:05:39,701 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 04:05:39,703 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 04:05:39,703 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 04:05:39,706 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 04:05:39,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 04:05:39" (1/3) ... [2024-11-17 04:05:39,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f3f69be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 04:05:39, skipping insertion in model container [2024-11-17 04:05:39,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:05:39" (2/3) ... [2024-11-17 04:05:39,707 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f3f69be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 04:05:39, skipping insertion in model container [2024-11-17 04:05:39,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 04:05:39" (3/3) ... [2024-11-17 04:05:39,708 INFO L112 eAbstractionObserver]: Analyzing ICFG test22-3.c [2024-11-17 04:05:39,721 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 04:05:39,721 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-17 04:05:39,770 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 04:05:39,775 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;@674a4578, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 04:05:39,775 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-17 04:05:39,779 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 35 states have internal predecessors, (41), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-17 04:05:39,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-17 04:05:39,784 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:05:39,785 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:05:39,786 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-17 04:05:39,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:05:39,790 INFO L85 PathProgramCache]: Analyzing trace with hash 354709909, now seen corresponding path program 1 times [2024-11-17 04:05:39,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:05:39,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987640444] [2024-11-17 04:05:39,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:05:39,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:05:39,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:05:40,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 04:05:40,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:05:40,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-17 04:05:40,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:05:40,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-17 04:05:40,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:05:40,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-17 04:05:40,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:05:40,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-17 04:05:40,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:05:40,132 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-17 04:05:40,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:05:40,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987640444] [2024-11-17 04:05:40,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987640444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:05:40,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:05:40,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 04:05:40,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207149530] [2024-11-17 04:05:40,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:05:40,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-17 04:05:40,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:05:40,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 04:05:40,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 04:05:40,163 INFO L87 Difference]: Start difference. First operand has 43 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 35 states have internal predecessors, (41), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-17 04:05:40,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:05:40,179 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2024-11-17 04:05:40,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 04:05:40,181 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2024-11-17 04:05:40,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:05:40,187 INFO L225 Difference]: With dead ends: 82 [2024-11-17 04:05:40,187 INFO L226 Difference]: Without dead ends: 34 [2024-11-17 04:05:40,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 04:05:40,194 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 04:05:40,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 04:05:40,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-17 04:05:40,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-17 04:05:40,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 26 states have internal predecessors, (28), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-17 04:05:40,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2024-11-17 04:05:40,230 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 33 [2024-11-17 04:05:40,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:05:40,231 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2024-11-17 04:05:40,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-17 04:05:40,231 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2024-11-17 04:05:40,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-17 04:05:40,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:05:40,234 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:05:40,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 04:05:40,235 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-17 04:05:40,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:05:40,236 INFO L85 PathProgramCache]: Analyzing trace with hash -2002391209, now seen corresponding path program 1 times [2024-11-17 04:05:40,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:05:40,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098894400] [2024-11-17 04:05:40,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:05:40,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:05:40,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:05:40,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 04:05:40,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:05:40,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-17 04:05:40,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:05:40,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-17 04:05:40,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:05:40,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-17 04:05:40,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:05:40,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-17 04:05:40,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:05:41,060 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-17 04:05:41,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:05:41,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098894400] [2024-11-17 04:05:41,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098894400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:05:41,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:05:41,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-17 04:05:41,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958699148] [2024-11-17 04:05:41,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:05:41,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-17 04:05:41,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:05:41,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-17 04:05:41,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-17 04:05:41,066 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 13 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-17 04:05:41,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:05:41,450 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2024-11-17 04:05:41,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-17 04:05:41,450 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 33 [2024-11-17 04:05:41,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:05:41,451 INFO L225 Difference]: With dead ends: 38 [2024-11-17 04:05:41,451 INFO L226 Difference]: Without dead ends: 37 [2024-11-17 04:05:41,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2024-11-17 04:05:41,454 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 63 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 04:05:41,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 167 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 04:05:41,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-17 04:05:41,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-17 04:05:41,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 28 states have internal predecessors, (30), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-17 04:05:41,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2024-11-17 04:05:41,469 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 33 [2024-11-17 04:05:41,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:05:41,470 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2024-11-17 04:05:41,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-17 04:05:41,471 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2024-11-17 04:05:41,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-17 04:05:41,473 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:05:41,473 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:05:41,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 04:05:41,473 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-17 04:05:41,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:05:41,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1944585337, now seen corresponding path program 1 times [2024-11-17 04:05:41,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:05:41,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119743691] [2024-11-17 04:05:41,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:05:41,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:05:41,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:05:41,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 04:05:41,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:05:41,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-17 04:05:41,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:05:41,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-17 04:05:41,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:05:41,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-17 04:05:41,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:05:41,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-17 04:05:41,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:05:41,890 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-17 04:05:41,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:05:41,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119743691] [2024-11-17 04:05:41,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119743691] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:05:41,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:05:41,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-17 04:05:41,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119613317] [2024-11-17 04:05:41,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:05:41,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-17 04:05:41,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:05:41,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 04:05:41,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-17 04:05:41,892 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-17 04:05:42,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:05:42,047 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2024-11-17 04:05:42,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 04:05:42,047 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2024-11-17 04:05:42,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:05:42,048 INFO L225 Difference]: With dead ends: 37 [2024-11-17 04:05:42,048 INFO L226 Difference]: Without dead ends: 36 [2024-11-17 04:05:42,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-17 04:05:42,049 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 27 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 04:05:42,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 95 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 04:05:42,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-17 04:05:42,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-17 04:05:42,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-17 04:05:42,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2024-11-17 04:05:42,063 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 34 [2024-11-17 04:05:42,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:05:42,063 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2024-11-17 04:05:42,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-17 04:05:42,064 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2024-11-17 04:05:42,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-17 04:05:42,065 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:05:42,066 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:05:42,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 04:05:42,066 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-17 04:05:42,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:05:42,067 INFO L85 PathProgramCache]: Analyzing trace with hash -2129694878, now seen corresponding path program 1 times [2024-11-17 04:05:42,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:05:42,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445818026] [2024-11-17 04:05:42,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:05:42,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:05:42,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:05:42,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 04:05:42,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:05:42,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-17 04:05:42,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:05:42,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-17 04:05:42,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:05:42,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-17 04:05:42,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:05:42,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-17 04:05:42,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:05:42,152 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-17 04:05:42,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:05:42,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445818026] [2024-11-17 04:05:42,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445818026] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:05:42,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:05:42,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 04:05:42,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696361701] [2024-11-17 04:05:42,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:05:42,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 04:05:42,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:05:42,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 04:05:42,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 04:05:42,155 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-17 04:05:42,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:05:42,172 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2024-11-17 04:05:42,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 04:05:42,172 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 38 [2024-11-17 04:05:42,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:05:42,173 INFO L225 Difference]: With dead ends: 36 [2024-11-17 04:05:42,173 INFO L226 Difference]: Without dead ends: 35 [2024-11-17 04:05:42,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 04:05:42,174 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 04:05:42,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 79 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 04:05:42,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-17 04:05:42,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-17 04:05:42,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-17 04:05:42,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2024-11-17 04:05:42,180 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 38 [2024-11-17 04:05:42,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:05:42,180 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2024-11-17 04:05:42,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-17 04:05:42,181 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2024-11-17 04:05:42,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-17 04:05:42,181 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:05:42,181 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:05:42,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 04:05:42,182 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-17 04:05:42,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:05:42,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1596031789, now seen corresponding path program 1 times [2024-11-17 04:05:42,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:05:42,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472726721] [2024-11-17 04:05:42,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:05:42,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:05:42,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:05:42,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 04:05:42,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:05:42,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-17 04:05:42,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:05:42,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-17 04:05:42,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:05:42,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-17 04:05:42,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:05:42,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-17 04:05:42,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:05:42,690 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-17 04:05:42,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:05:42,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472726721] [2024-11-17 04:05:42,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472726721] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 04:05:42,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410856425] [2024-11-17 04:05:42,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:05:42,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:05:42,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:05:42,693 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-17 04:05:42,694 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-17 04:05:42,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:05:42,769 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-17 04:05:42,777 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 04:05:42,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2024-11-17 04:05:42,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 04:05:42,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2024-11-17 04:05:43,817 INFO L349 Elim1Store]: treesize reduction 29, result has 49.1 percent of original size [2024-11-17 04:05:43,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 58 [2024-11-17 04:05:43,860 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 04:05:43,862 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 04:05:44,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410856425] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 04:05:44,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 04:05:44,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2024-11-17 04:05:44,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869572197] [2024-11-17 04:05:44,370 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 04:05:44,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-17 04:05:44,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:05:44,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-17 04:05:44,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=863, Unknown=0, NotChecked=0, Total=992 [2024-11-17 04:05:44,372 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 25 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 7 states have call successors, (10), 4 states have call predecessors, (10), 6 states have return successors, (10), 9 states have call predecessors, (10), 7 states have call successors, (10) [2024-11-17 04:05:45,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:05:45,037 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2024-11-17 04:05:45,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 04:05:45,037 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 7 states have call successors, (10), 4 states have call predecessors, (10), 6 states have return successors, (10), 9 states have call predecessors, (10), 7 states have call successors, (10) Word has length 39 [2024-11-17 04:05:45,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:05:45,038 INFO L225 Difference]: With dead ends: 35 [2024-11-17 04:05:45,038 INFO L226 Difference]: Without dead ends: 0 [2024-11-17 04:05:45,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=292, Invalid=1268, Unknown=0, NotChecked=0, Total=1560 [2024-11-17 04:05:45,039 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 77 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 04:05:45,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 129 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 04:05:45,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-17 04:05:45,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-17 04:05:45,040 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-17 04:05:45,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-17 04:05:45,041 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2024-11-17 04:05:45,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:05:45,041 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 04:05:45,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 7 states have call successors, (10), 4 states have call predecessors, (10), 6 states have return successors, (10), 9 states have call predecessors, (10), 7 states have call successors, (10) [2024-11-17 04:05:45,041 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-17 04:05:45,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-17 04:05:45,043 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-17 04:05:45,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-17 04:05:45,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-17 04:05:45,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-17 04:05:45,058 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-17 04:05:45,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:05:45,251 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-17 04:05:45,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-17 04:05:45,660 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 04:05:45,693 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#d2~0!offset [2024-11-17 04:05:45,695 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#d1~0!base [2024-11-17 04:05:45,695 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-17 04:05:45,695 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-17 04:05:45,695 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#d2~0!base,GLOBAL]]] [2024-11-17 04:05:45,695 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-17 04:05:45,696 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-17 04:05:45,696 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#d2~0!base,GLOBAL]]] [2024-11-17 04:05:45,696 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-17 04:05:45,696 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-17 04:05:45,696 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IntegerLiteral[4]]] [2024-11-17 04:05:45,696 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-17 04:05:45,701 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-17 04:05:45,701 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IntegerLiteral[4]]] [2024-11-17 04:05:45,701 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#d1~0!offset [2024-11-17 04:05:45,701 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#d2~0!base [2024-11-17 04:05:45,702 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#d2~0!offset [2024-11-17 04:05:45,702 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#d1~0!base [2024-11-17 04:05:45,702 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-17 04:05:45,702 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-17 04:05:45,702 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#d2~0!base,GLOBAL]]] [2024-11-17 04:05:45,702 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-17 04:05:45,702 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-17 04:05:45,702 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#d2~0!base,GLOBAL]]] [2024-11-17 04:05:45,702 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #res!base [2024-11-17 04:05:45,703 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#d2~0!base [2024-11-17 04:05:45,703 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #res!offset [2024-11-17 04:05:45,703 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #res!base [2024-11-17 04:05:45,703 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #res!offset [2024-11-17 04:05:45,703 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-17 04:05:45,703 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-17 04:05:45,703 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IntegerLiteral[4]]] [2024-11-17 04:05:45,703 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-17 04:05:45,703 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-17 04:05:45,703 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IntegerLiteral[4]]] [2024-11-17 04:05:45,703 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#d1~0!offset [2024-11-17 04:05:45,703 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#d2~0!base [2024-11-17 04:05:45,721 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#d2~0!offset [2024-11-17 04:05:45,722 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#d1~0!base [2024-11-17 04:05:45,722 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-17 04:05:45,726 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-17 04:05:45,726 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#d2~0!base,GLOBAL]]] [2024-11-17 04:05:45,726 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-17 04:05:45,726 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-17 04:05:45,726 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IntegerLiteral[4]]] [2024-11-17 04:05:45,727 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#d1~0!offset [2024-11-17 04:05:45,727 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#d2~0!base [2024-11-17 04:05:45,727 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#d2~0!offset [2024-11-17 04:05:45,727 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#d1~0!base [2024-11-17 04:05:45,727 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-17 04:05:45,727 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-17 04:05:45,727 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#d2~0!base,GLOBAL]]] [2024-11-17 04:05:45,727 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-17 04:05:45,727 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-17 04:05:45,727 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IntegerLiteral[4]]] [2024-11-17 04:05:45,727 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#d1~0!offset [2024-11-17 04:05:45,728 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#d2~0!base [2024-11-17 04:05:45,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 04:05:45 BoogieIcfgContainer [2024-11-17 04:05:45,728 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 04:05:45,729 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 04:05:45,729 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 04:05:45,729 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 04:05:45,729 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 04:05:39" (3/4) ... [2024-11-17 04:05:45,736 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-17 04:05:45,744 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure get_dummy [2024-11-17 04:05:45,744 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-17 04:05:45,753 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2024-11-17 04:05:45,753 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-17 04:05:45,753 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-17 04:05:45,753 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-17 04:05:45,855 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-17 04:05:45,856 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-17 04:05:45,856 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 04:05:45,856 INFO L158 Benchmark]: Toolchain (without parser) took 6745.21ms. Allocated memory was 216.0MB in the beginning and 352.3MB in the end (delta: 136.3MB). Free memory was 146.6MB in the beginning and 319.9MB in the end (delta: -173.4MB). Peak memory consumption was 131.9MB. Max. memory is 16.1GB. [2024-11-17 04:05:45,856 INFO L158 Benchmark]: CDTParser took 0.86ms. Allocated memory is still 134.2MB. Free memory is still 97.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 04:05:45,857 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.40ms. Allocated memory is still 216.0MB. Free memory was 146.2MB in the beginning and 133.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-17 04:05:45,857 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.14ms. Allocated memory is still 216.0MB. Free memory was 133.6MB in the beginning and 131.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 04:05:45,857 INFO L158 Benchmark]: Boogie Preprocessor took 33.42ms. Allocated memory is still 216.0MB. Free memory was 131.9MB in the beginning and 129.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 04:05:45,857 INFO L158 Benchmark]: IcfgBuilder took 274.88ms. Allocated memory is still 216.0MB. Free memory was 129.8MB in the beginning and 114.4MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-17 04:05:45,858 INFO L158 Benchmark]: TraceAbstraction took 6025.44ms. Allocated memory was 216.0MB in the beginning and 293.6MB in the end (delta: 77.6MB). Free memory was 113.6MB in the beginning and 99.7MB in the end (delta: 13.9MB). Peak memory consumption was 92.1MB. Max. memory is 16.1GB. [2024-11-17 04:05:45,858 INFO L158 Benchmark]: Witness Printer took 126.99ms. Allocated memory was 293.6MB in the beginning and 352.3MB in the end (delta: 58.7MB). Free memory was 99.7MB in the beginning and 319.9MB in the end (delta: -220.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-17 04:05:45,859 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.86ms. Allocated memory is still 134.2MB. Free memory is still 97.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 250.40ms. Allocated memory is still 216.0MB. Free memory was 146.2MB in the beginning and 133.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.14ms. Allocated memory is still 216.0MB. Free memory was 133.6MB in the beginning and 131.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.42ms. Allocated memory is still 216.0MB. Free memory was 131.9MB in the beginning and 129.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 274.88ms. Allocated memory is still 216.0MB. Free memory was 129.8MB in the beginning and 114.4MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 6025.44ms. Allocated memory was 216.0MB in the beginning and 293.6MB in the end (delta: 77.6MB). Free memory was 113.6MB in the beginning and 99.7MB in the end (delta: 13.9MB). Peak memory consumption was 92.1MB. Max. memory is 16.1GB. * Witness Printer took 126.99ms. Allocated memory was 293.6MB in the beginning and 352.3MB in the end (delta: 58.7MB). Free memory was 99.7MB in the beginning and 319.9MB in the end (delta: -220.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#d2~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#d1~0!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[~#d2~0!base,GLOBAL]]] - 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[~#d2~0!base,GLOBAL]]] - 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],[IntegerLiteral[4]]] - 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],[IntegerLiteral[4]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#d1~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#d2~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#d2~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#d1~0!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[~#d2~0!base,GLOBAL]]] - 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[~#d2~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #res!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#d2~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #res!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #res!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #res!offset - 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],[IntegerLiteral[4]]] - 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],[IntegerLiteral[4]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#d1~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#d2~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#d2~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#d1~0!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[~#d2~0!base,GLOBAL]]] - 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],[IntegerLiteral[4]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#d1~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#d2~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#d2~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#d1~0!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[~#d2~0!base,GLOBAL]]] - 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],[IntegerLiteral[4]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#d1~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#d2~0!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: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: 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, 43 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 5.5s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 173 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 169 mSDsluCounter, 517 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 373 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 519 IncrementalHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 144 mSDtfsCounter, 519 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 178 GetRequests, 102 SyntacticMatches, 4 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=0, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 216 NumberOfCodeBlocks, 216 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 210 ConstructedInterpolants, 12 QuantifiedInterpolants, 2250 SizeOfPredicates, 9 NumberOfNonLiveVariables, 163 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 68/78 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 4 specifications checked. All of them hold - InvariantResult [Line: 46]: Location Invariant Derived location invariant: null - ProcedureContractResult [Line: 28]: Procedure Contract for get_dummy Derived contract for procedure get_dummy. Ensures: ((d1 == \old(d1)) && (d2 == \old(d2))) - ProcedureContractResult [Line: 7]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((cond != 0) && ((d1 == \old(d1)) && (d2 == \old(d2)))) RESULT: Ultimate proved your program to be correct! [2024-11-17 04:05:45,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE