./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/bh2017-ex-add.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/bh2017-ex-add.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 9067bcd66b4865bfb6aa4fb5c23797c879c2b81c36d918479d6650dc5a4b5edc --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 20:27:55,311 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:27:55,400 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-11 20:27:55,405 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:27:55,408 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:27:55,437 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:27:55,438 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:27:55,438 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:27:55,439 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:27:55,441 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:27:55,442 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:27:55,442 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:27:55,442 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:27:55,443 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:27:55,443 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:27:55,443 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:27:55,444 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 20:27:55,446 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 20:27:55,447 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 20:27:55,447 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 20:27:55,447 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:27:55,448 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 20:27:55,448 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:27:55,449 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 20:27:55,449 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:27:55,453 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 20:27:55,453 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:27:55,454 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 20:27:55,454 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 20:27:55,454 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:27:55,454 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:27:55,454 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:27:55,455 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:27:55,455 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:27:55,455 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:27:55,455 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:27:55,456 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:27:55,456 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 20:27:55,456 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 20:27:55,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 20:27:55,456 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:27:55,457 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:27:55,458 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:27:55,458 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:27:55,458 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-clean/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-clean/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 -> 9067bcd66b4865bfb6aa4fb5c23797c879c2b81c36d918479d6650dc5a4b5edc [2024-10-11 20:27:55,693 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:27:55,716 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:27:55,719 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:27:55,720 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:27:55,720 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:27:55,721 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/bh2017-ex-add.i [2024-10-11 20:27:57,177 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:27:57,341 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:27:57,342 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/bh2017-ex-add.i [2024-10-11 20:27:57,349 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/99388ed65/04efc82414ff4782b3a5c35c7a617281/FLAG6ab42c3a5 [2024-10-11 20:27:57,739 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/99388ed65/04efc82414ff4782b3a5c35c7a617281 [2024-10-11 20:27:57,741 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:27:57,742 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:27:57,744 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:27:57,744 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:27:57,751 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:27:57,751 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:27:57" (1/1) ... [2024-10-11 20:27:57,752 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54234252 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:57, skipping insertion in model container [2024-10-11 20:27:57,752 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:27:57" (1/1) ... [2024-10-11 20:27:57,769 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:27:57,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:27:57,966 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:27:57,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:27:57,996 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:27:57,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:57 WrapperNode [2024-10-11 20:27:57,997 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:27:57,998 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:27:57,998 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:27:57,998 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:27:58,005 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:57" (1/1) ... [2024-10-11 20:27:58,011 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:57" (1/1) ... [2024-10-11 20:27:58,032 INFO L138 Inliner]: procedures = 15, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 61 [2024-10-11 20:27:58,034 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:27:58,035 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:27:58,035 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:27:58,035 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:27:58,045 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:57" (1/1) ... [2024-10-11 20:27:58,045 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:57" (1/1) ... [2024-10-11 20:27:58,046 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:57" (1/1) ... [2024-10-11 20:27:58,083 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 20:27:58,083 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:57" (1/1) ... [2024-10-11 20:27:58,085 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:57" (1/1) ... [2024-10-11 20:27:58,088 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:57" (1/1) ... [2024-10-11 20:27:58,094 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:57" (1/1) ... [2024-10-11 20:27:58,095 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:57" (1/1) ... [2024-10-11 20:27:58,096 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:57" (1/1) ... [2024-10-11 20:27:58,112 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:27:58,129 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:27:58,130 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:27:58,131 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:27:58,131 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:57" (1/1) ... [2024-10-11 20:27:58,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:27:58,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:27:58,175 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 20:27:58,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 20:27:58,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 20:27:58,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 20:27:58,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:27:58,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:27:58,226 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 20:27:58,227 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 20:27:58,283 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:27:58,285 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:27:58,402 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-11 20:27:58,403 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:27:58,424 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:27:58,425 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 20:27:58,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:27:58 BoogieIcfgContainer [2024-10-11 20:27:58,425 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:27:58,427 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:27:58,428 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:27:58,431 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:27:58,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:27:57" (1/3) ... [2024-10-11 20:27:58,432 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1120761 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:27:58, skipping insertion in model container [2024-10-11 20:27:58,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:27:57" (2/3) ... [2024-10-11 20:27:58,433 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1120761 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:27:58, skipping insertion in model container [2024-10-11 20:27:58,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:27:58" (3/3) ... [2024-10-11 20:27:58,434 INFO L112 eAbstractionObserver]: Analyzing ICFG bh2017-ex-add.i [2024-10-11 20:27:58,448 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:27:58,448 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-11 20:27:58,497 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:27:58,503 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;@6e1245ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:27:58,503 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-11 20:27:58,507 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 26 states have internal predecessors, (36), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 20:27:58,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 20:27:58,515 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:27:58,516 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:27:58,517 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:27:58,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:27:58,522 INFO L85 PathProgramCache]: Analyzing trace with hash 896165091, now seen corresponding path program 1 times [2024-10-11 20:27:58,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:27:58,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97427964] [2024-10-11 20:27:58,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:27:58,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:27:58,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:58,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 20:27:58,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:58,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:27:58,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:58,779 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:27:58,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:27:58,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97427964] [2024-10-11 20:27:58,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97427964] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:27:58,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:27:58,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:27:58,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465478157] [2024-10-11 20:27:58,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:27:58,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:27:58,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:27:58,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:27:58,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:27:58,805 INFO L87 Difference]: Start difference. First operand has 32 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 26 states have internal predecessors, (36), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:27:58,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:27:58,869 INFO L93 Difference]: Finished difference Result 79 states and 124 transitions. [2024-10-11 20:27:58,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:27:58,872 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2024-10-11 20:27:58,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:27:58,879 INFO L225 Difference]: With dead ends: 79 [2024-10-11 20:27:58,879 INFO L226 Difference]: Without dead ends: 47 [2024-10-11 20:27:58,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-10-11 20:27:58,888 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 15 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:27:58,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 95 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:27:58,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-11 20:27:58,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2024-10-11 20:27:58,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 36 states have internal predecessors, (50), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 20:27:58,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 64 transitions. [2024-10-11 20:27:58,932 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 64 transitions. Word has length 17 [2024-10-11 20:27:58,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:27:58,933 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 64 transitions. [2024-10-11 20:27:58,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:27:58,933 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 64 transitions. [2024-10-11 20:27:58,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 20:27:58,935 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:27:58,935 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:27:58,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 20:27:58,935 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:27:58,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:27:58,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1483056379, now seen corresponding path program 1 times [2024-10-11 20:27:58,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:27:58,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474100877] [2024-10-11 20:27:58,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:27:58,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:27:58,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:59,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 20:27:59,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:59,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:27:59,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:59,054 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:27:59,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:27:59,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474100877] [2024-10-11 20:27:59,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474100877] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:27:59,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:27:59,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:27:59,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187057939] [2024-10-11 20:27:59,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:27:59,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:27:59,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:27:59,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:27:59,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:27:59,061 INFO L87 Difference]: Start difference. First operand 45 states and 64 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:27:59,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:27:59,112 INFO L93 Difference]: Finished difference Result 123 states and 181 transitions. [2024-10-11 20:27:59,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:27:59,115 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-10-11 20:27:59,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:27:59,117 INFO L225 Difference]: With dead ends: 123 [2024-10-11 20:27:59,117 INFO L226 Difference]: Without dead ends: 79 [2024-10-11 20:27:59,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-10-11 20:27:59,119 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 13 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:27:59,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 99 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:27:59,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-11 20:27:59,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2024-10-11 20:27:59,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 63 states have internal predecessors, (88), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 20:27:59,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 112 transitions. [2024-10-11 20:27:59,139 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 112 transitions. Word has length 19 [2024-10-11 20:27:59,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:27:59,139 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 112 transitions. [2024-10-11 20:27:59,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:27:59,139 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 112 transitions. [2024-10-11 20:27:59,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 20:27:59,142 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:27:59,142 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-11 20:27:59,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 20:27:59,142 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:27:59,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:27:59,143 INFO L85 PathProgramCache]: Analyzing trace with hash -16321711, now seen corresponding path program 1 times [2024-10-11 20:27:59,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:27:59,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034256569] [2024-10-11 20:27:59,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:27:59,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:27:59,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:59,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 20:27:59,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:59,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:27:59,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:59,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 20:27:59,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:59,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 20:27:59,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:59,339 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:27:59,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:27:59,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034256569] [2024-10-11 20:27:59,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034256569] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:27:59,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961599954] [2024-10-11 20:27:59,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:27:59,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:27:59,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:27:59,342 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:27:59,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 20:27:59,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:59,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:27:59,441 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:27:59,558 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:27:59,559 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:27:59,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961599954] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:27:59,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:27:59,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-10-11 20:27:59,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816702115] [2024-10-11 20:27:59,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:27:59,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:27:59,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:27:59,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:27:59,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:27:59,567 INFO L87 Difference]: Start difference. First operand 77 states and 112 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 20:27:59,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:27:59,602 INFO L93 Difference]: Finished difference Result 77 states and 112 transitions. [2024-10-11 20:27:59,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:27:59,603 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 36 [2024-10-11 20:27:59,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:27:59,605 INFO L225 Difference]: With dead ends: 77 [2024-10-11 20:27:59,605 INFO L226 Difference]: Without dead ends: 76 [2024-10-11 20:27:59,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:27:59,608 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 14 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:27:59,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 67 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:27:59,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-11 20:27:59,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-10-11 20:27:59,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 62 states have internal predecessors, (86), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 20:27:59,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 110 transitions. [2024-10-11 20:27:59,629 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 110 transitions. Word has length 36 [2024-10-11 20:27:59,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:27:59,630 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 110 transitions. [2024-10-11 20:27:59,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 20:27:59,630 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 110 transitions. [2024-10-11 20:27:59,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 20:27:59,631 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:27:59,631 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-11 20:27:59,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 20:27:59,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:27:59,832 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-10-11 20:27:59,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:27:59,833 INFO L85 PathProgramCache]: Analyzing trace with hash -505972984, now seen corresponding path program 1 times [2024-10-11 20:27:59,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:27:59,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263887581] [2024-10-11 20:27:59,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:27:59,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:27:59,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:59,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 20:27:59,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:59,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:27:59,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:59,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 20:27:59,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:59,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 20:27:59,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:59,918 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-11 20:27:59,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:27:59,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263887581] [2024-10-11 20:27:59,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263887581] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:27:59,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:27:59,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:27:59,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972762603] [2024-10-11 20:27:59,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:27:59,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:27:59,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:27:59,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:27:59,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:27:59,922 INFO L87 Difference]: Start difference. First operand 76 states and 110 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:27:59,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:27:59,939 INFO L93 Difference]: Finished difference Result 76 states and 110 transitions. [2024-10-11 20:27:59,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:27:59,940 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2024-10-11 20:27:59,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:27:59,941 INFO L225 Difference]: With dead ends: 76 [2024-10-11 20:27:59,943 INFO L226 Difference]: Without dead ends: 75 [2024-10-11 20:27:59,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:27:59,944 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:27:59,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:27:59,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-11 20:27:59,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2024-10-11 20:27:59,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 57 states have internal predecessors, (80), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 20:27:59,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 104 transitions. [2024-10-11 20:27:59,964 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 104 transitions. Word has length 37 [2024-10-11 20:27:59,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:27:59,965 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 104 transitions. [2024-10-11 20:27:59,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:27:59,965 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 104 transitions. [2024-10-11 20:27:59,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 20:27:59,967 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:27:59,967 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2024-10-11 20:27:59,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 20:27:59,967 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:27:59,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:27:59,968 INFO L85 PathProgramCache]: Analyzing trace with hash 2083135731, now seen corresponding path program 1 times [2024-10-11 20:27:59,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:27:59,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210614378] [2024-10-11 20:27:59,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:27:59,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:27:59,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:00,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 20:28:00,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:00,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:28:00,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:00,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 20:28:00,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:00,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 20:28:00,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:00,102 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:28:00,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:28:00,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210614378] [2024-10-11 20:28:00,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210614378] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:28:00,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850965564] [2024-10-11 20:28:00,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:28:00,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:28:00,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:28:00,105 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:28:00,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 20:28:00,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:00,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:28:00,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:28:00,246 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:28:00,247 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:28:00,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850965564] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:28:00,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:28:00,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-10-11 20:28:00,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002105663] [2024-10-11 20:28:00,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:28:00,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:28:00,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:28:00,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:28:00,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:28:00,249 INFO L87 Difference]: Start difference. First operand 71 states and 104 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 20:28:00,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:28:00,279 INFO L93 Difference]: Finished difference Result 71 states and 104 transitions. [2024-10-11 20:28:00,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:28:00,280 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2024-10-11 20:28:00,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:28:00,281 INFO L225 Difference]: With dead ends: 71 [2024-10-11 20:28:00,282 INFO L226 Difference]: Without dead ends: 70 [2024-10-11 20:28:00,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:28:00,283 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 12 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:28:00,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 63 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:28:00,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-11 20:28:00,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-10-11 20:28:00,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 20:28:00,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 102 transitions. [2024-10-11 20:28:00,300 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 102 transitions. Word has length 38 [2024-10-11 20:28:00,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:28:00,300 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 102 transitions. [2024-10-11 20:28:00,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 20:28:00,301 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 102 transitions. [2024-10-11 20:28:00,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 20:28:00,304 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:28:00,304 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2024-10-11 20:28:00,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 20:28:00,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:28:00,505 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:28:00,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:28:00,505 INFO L85 PathProgramCache]: Analyzing trace with hash 152698303, now seen corresponding path program 1 times [2024-10-11 20:28:00,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:28:00,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988430747] [2024-10-11 20:28:00,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:28:00,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:28:00,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:00,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 20:28:00,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:00,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:28:00,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:00,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 20:28:00,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:00,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 20:28:00,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:28:00,560 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-10-11 20:28:00,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:28:00,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988430747] [2024-10-11 20:28:00,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988430747] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:28:00,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:28:00,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:28:00,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323900330] [2024-10-11 20:28:00,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:28:00,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:28:00,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:28:00,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:28:00,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:28:00,564 INFO L87 Difference]: Start difference. First operand 70 states and 102 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:28:00,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:28:00,580 INFO L93 Difference]: Finished difference Result 70 states and 102 transitions. [2024-10-11 20:28:00,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:28:00,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2024-10-11 20:28:00,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:28:00,581 INFO L225 Difference]: With dead ends: 70 [2024-10-11 20:28:00,581 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 20:28:00,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:28:00,582 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:28:00,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:28:00,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 20:28:00,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 20:28:00,584 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-10-11 20:28:00,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 20:28:00,585 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2024-10-11 20:28:00,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:28:00,585 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 20:28:00,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:28:00,585 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 20:28:00,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 20:28:00,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-10-11 20:28:00,589 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-10-11 20:28:00,589 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-10-11 20:28:00,589 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-10-11 20:28:00,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 20:28:00,593 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-11 20:28:00,595 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 20:28:00,700 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 20:28:00,716 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:28:00 BoogieIcfgContainer [2024-10-11 20:28:00,716 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 20:28:00,717 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 20:28:00,717 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 20:28:00,717 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 20:28:00,717 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:27:58" (3/4) ... [2024-10-11 20:28:00,719 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 20:28:00,722 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-11 20:28:00,727 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-11 20:28:00,728 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 20:28:00,729 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 20:28:00,729 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 20:28:00,815 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 20:28:00,815 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 20:28:00,815 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 20:28:00,816 INFO L158 Benchmark]: Toolchain (without parser) took 3073.43ms. Allocated memory is still 178.3MB. Free memory was 110.0MB in the beginning and 64.6MB in the end (delta: 45.4MB). Peak memory consumption was 46.9MB. Max. memory is 16.1GB. [2024-10-11 20:28:00,816 INFO L158 Benchmark]: CDTParser took 0.89ms. Allocated memory is still 113.2MB. Free memory is still 76.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:28:00,816 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.37ms. Allocated memory is still 178.3MB. Free memory was 110.0MB in the beginning and 98.1MB in the end (delta: 12.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 20:28:00,816 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.37ms. Allocated memory is still 178.3MB. Free memory was 98.1MB in the beginning and 96.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:28:00,817 INFO L158 Benchmark]: Boogie Preprocessor took 93.47ms. Allocated memory is still 178.3MB. Free memory was 96.4MB in the beginning and 150.1MB in the end (delta: -53.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 20:28:00,817 INFO L158 Benchmark]: RCFGBuilder took 296.14ms. Allocated memory is still 178.3MB. Free memory was 150.1MB in the beginning and 137.9MB in the end (delta: 12.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 20:28:00,817 INFO L158 Benchmark]: TraceAbstraction took 2288.68ms. Allocated memory is still 178.3MB. Free memory was 137.2MB in the beginning and 69.9MB in the end (delta: 67.3MB). Peak memory consumption was 69.3MB. Max. memory is 16.1GB. [2024-10-11 20:28:00,817 INFO L158 Benchmark]: Witness Printer took 98.51ms. Allocated memory is still 178.3MB. Free memory was 69.9MB in the beginning and 64.6MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 20:28:00,819 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.89ms. Allocated memory is still 113.2MB. Free memory is still 76.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 253.37ms. Allocated memory is still 178.3MB. Free memory was 110.0MB in the beginning and 98.1MB in the end (delta: 12.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.37ms. Allocated memory is still 178.3MB. Free memory was 98.1MB in the beginning and 96.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 93.47ms. Allocated memory is still 178.3MB. Free memory was 96.4MB in the beginning and 150.1MB in the end (delta: -53.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 296.14ms. Allocated memory is still 178.3MB. Free memory was 150.1MB in the beginning and 137.9MB in the end (delta: 12.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2288.68ms. Allocated memory is still 178.3MB. Free memory was 137.2MB in the beginning and 69.9MB in the end (delta: 67.3MB). Peak memory consumption was 69.3MB. Max. memory is 16.1GB. * Witness Printer took 98.51ms. Allocated memory is still 178.3MB. Free memory was 69.9MB in the beginning and 64.6MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * 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: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: 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 2 procedures, 32 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 6, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 60 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 54 mSDsluCounter, 446 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 258 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 67 IncrementalHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 188 mSDtfsCounter, 67 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred in iteration=2, InterpolantAutomatonStates: 22, 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, 6 MinimizatonAttempts, 8 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 260 NumberOfCodeBlocks, 260 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 252 ConstructedInterpolants, 0 QuantifiedInterpolants, 464 SizeOfPredicates, 0 NumberOfNonLiveVariables, 165 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 8 InterpolantComputations, 6 PerfectInterpolantSequences, 190/208 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: 18]: Loop Invariant Derived loop invariant: ((0 <= (m + 2147483648)) && (0 <= (n + 2147483648))) RESULT: Ultimate proved your program to be correct! [2024-10-11 20:28:00,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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