./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_17_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_17_good.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash 0d9fe6afba387bdc3df869af849969106aba5d49894367553fbb218bd7a49eac --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 12:35:14,389 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 12:35:14,425 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-04 12:35:14,428 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 12:35:14,428 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 12:35:14,442 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 12:35:14,443 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 12:35:14,443 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 12:35:14,443 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 12:35:14,443 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 12:35:14,443 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 12:35:14,443 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 12:35:14,443 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 12:35:14,443 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 12:35:14,444 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 12:35:14,444 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 12:35:14,444 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 12:35:14,444 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 12:35:14,444 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 12:35:14,444 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 12:35:14,444 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 12:35:14,444 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 12:35:14,444 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 12:35:14,444 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 12:35:14,444 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 12:35:14,444 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 12:35:14,444 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 12:35:14,444 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 12:35:14,444 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 12:35:14,445 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 12:35:14,445 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 12:35:14,445 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 12:35:14,445 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 12:35:14,445 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 12:35:14,445 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 12:35:14,445 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 12:35:14,445 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 12:35:14,445 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 12:35:14,445 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 12:35:14,445 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 12:35:14,445 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 12:35:14,445 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 12:35:14,445 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0d9fe6afba387bdc3df869af849969106aba5d49894367553fbb218bd7a49eac [2025-03-04 12:35:14,633 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 12:35:14,641 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 12:35:14,646 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 12:35:14,647 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 12:35:14,647 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 12:35:14,648 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_17_good.i [2025-03-04 12:35:15,798 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d976375c/8add5be9caec4b70ac8f23ac9860e8ee/FLAG9b3c53702 [2025-03-04 12:35:16,168 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 12:35:16,171 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_17_good.i [2025-03-04 12:35:16,196 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d976375c/8add5be9caec4b70ac8f23ac9860e8ee/FLAG9b3c53702 [2025-03-04 12:35:16,373 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d976375c/8add5be9caec4b70ac8f23ac9860e8ee [2025-03-04 12:35:16,374 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 12:35:16,376 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 12:35:16,377 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 12:35:16,377 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 12:35:16,381 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 12:35:16,382 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:35:16" (1/1) ... [2025-03-04 12:35:16,382 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b95671 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:35:16, skipping insertion in model container [2025-03-04 12:35:16,383 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:35:16" (1/1) ... [2025-03-04 12:35:16,414 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 12:35:16,918 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 12:35:16,927 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 12:35:16,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 12:35:17,062 INFO L204 MainTranslator]: Completed translation [2025-03-04 12:35:17,062 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:35:17 WrapperNode [2025-03-04 12:35:17,062 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 12:35:17,063 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 12:35:17,063 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 12:35:17,063 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 12:35:17,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:35:17" (1/1) ... [2025-03-04 12:35:17,082 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:35:17" (1/1) ... [2025-03-04 12:35:17,101 INFO L138 Inliner]: procedures = 500, calls = 32, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 102 [2025-03-04 12:35:17,101 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 12:35:17,101 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 12:35:17,101 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 12:35:17,101 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 12:35:17,109 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:35:17" (1/1) ... [2025-03-04 12:35:17,109 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:35:17" (1/1) ... [2025-03-04 12:35:17,112 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:35:17" (1/1) ... [2025-03-04 12:35:17,121 INFO L175 MemorySlicer]: Split 1 memory accesses to 1 slices as follows [1]. 100 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1]. The 0 writes are split as follows [0]. [2025-03-04 12:35:17,121 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:35:17" (1/1) ... [2025-03-04 12:35:17,121 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:35:17" (1/1) ... [2025-03-04 12:35:17,124 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:35:17" (1/1) ... [2025-03-04 12:35:17,125 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:35:17" (1/1) ... [2025-03-04 12:35:17,125 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:35:17" (1/1) ... [2025-03-04 12:35:17,126 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:35:17" (1/1) ... [2025-03-04 12:35:17,127 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 12:35:17,128 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 12:35:17,128 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 12:35:17,128 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 12:35:17,129 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:35:17" (1/1) ... [2025-03-04 12:35:17,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 12:35:17,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 12:35:17,161 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) [2025-03-04 12:35:17,163 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 [2025-03-04 12:35:17,178 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-03-04 12:35:17,178 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-03-04 12:35:17,178 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-03-04 12:35:17,178 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-03-04 12:35:17,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 12:35:17,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 12:35:17,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 12:35:17,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 12:35:17,281 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 12:35:17,283 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 12:35:17,460 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2025-03-04 12:35:17,461 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 12:35:17,469 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 12:35:17,470 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 12:35:17,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:35:17 BoogieIcfgContainer [2025-03-04 12:35:17,471 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 12:35:17,473 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 12:35:17,473 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 12:35:17,476 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 12:35:17,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:35:16" (1/3) ... [2025-03-04 12:35:17,476 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50c15cfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:35:17, skipping insertion in model container [2025-03-04 12:35:17,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:35:17" (2/3) ... [2025-03-04 12:35:17,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50c15cfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:35:17, skipping insertion in model container [2025-03-04 12:35:17,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:35:17" (3/3) ... [2025-03-04 12:35:17,478 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_multiply_17_good.i [2025-03-04 12:35:17,490 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 12:35:17,491 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE190_Integer_Overflow__int_fgets_multiply_17_good.i that has 3 procedures, 60 locations, 1 initial locations, 4 loop locations, and 12 error locations. [2025-03-04 12:35:17,528 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 12:35:17,536 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;@5728c6dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 12:35:17,537 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-03-04 12:35:17,539 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 39 states have (on average 1.5384615384615385) internal successors, (60), 53 states have internal predecessors, (60), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 12:35:17,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 12:35:17,545 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:35:17,545 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 12:35:17,545 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 12:35:17,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:35:17,550 INFO L85 PathProgramCache]: Analyzing trace with hash -440559836, now seen corresponding path program 1 times [2025-03-04 12:35:17,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:35:17,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94369034] [2025-03-04 12:35:17,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:35:17,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:35:17,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 12:35:17,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 12:35:17,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:35:17,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:35:17,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 12:35:17,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:35:17,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94369034] [2025-03-04 12:35:17,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94369034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:35:17,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 12:35:17,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 12:35:17,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693118783] [2025-03-04 12:35:17,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:35:17,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 12:35:17,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:35:17,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 12:35:17,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 12:35:17,838 INFO L87 Difference]: Start difference. First operand has 60 states, 39 states have (on average 1.5384615384615385) internal successors, (60), 53 states have internal predecessors, (60), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 12:35:17,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:35:17,877 INFO L93 Difference]: Finished difference Result 116 states and 139 transitions. [2025-03-04 12:35:17,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 12:35:17,878 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-03-04 12:35:17,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:35:17,882 INFO L225 Difference]: With dead ends: 116 [2025-03-04 12:35:17,883 INFO L226 Difference]: Without dead ends: 59 [2025-03-04 12:35:17,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 12:35:17,887 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 2 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 12:35:17,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 199 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:35:17,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-04 12:35:17,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-03-04 12:35:17,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 39 states have (on average 1.5384615384615385) internal successors, (60), 53 states have internal predecessors, (60), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 12:35:17,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2025-03-04 12:35:17,918 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 12 [2025-03-04 12:35:17,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:35:17,919 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2025-03-04 12:35:17,919 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 12:35:17,919 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2025-03-04 12:35:17,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 12:35:17,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:35:17,920 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 12:35:17,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 12:35:17,920 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 12:35:17,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:35:17,921 INFO L85 PathProgramCache]: Analyzing trace with hash 317317102, now seen corresponding path program 1 times [2025-03-04 12:35:17,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:35:17,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2318477] [2025-03-04 12:35:17,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:35:17,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:35:17,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 12:35:17,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 12:35:17,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:35:17,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:35:18,030 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 12:35:18,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:35:18,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2318477] [2025-03-04 12:35:18,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2318477] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 12:35:18,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714670942] [2025-03-04 12:35:18,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:35:18,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 12:35:18,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 12:35:18,032 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) [2025-03-04 12:35:18,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 12:35:18,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 12:35:18,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 12:35:18,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:35:18,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:35:18,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 12:35:18,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 12:35:18,164 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 12:35:18,164 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 12:35:18,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714670942] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:35:18,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 12:35:18,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 12:35:18,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869810066] [2025-03-04 12:35:18,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:35:18,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 12:35:18,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:35:18,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 12:35:18,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 12:35:18,166 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 12:35:18,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:35:18,193 INFO L93 Difference]: Finished difference Result 101 states and 122 transitions. [2025-03-04 12:35:18,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 12:35:18,194 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-03-04 12:35:18,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:35:18,194 INFO L225 Difference]: With dead ends: 101 [2025-03-04 12:35:18,194 INFO L226 Difference]: Without dead ends: 52 [2025-03-04 12:35:18,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 12:35:18,195 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 1 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 12:35:18,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 166 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:35:18,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-04 12:35:18,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-03-04 12:35:18,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 35 states have (on average 1.4857142857142858) internal successors, (52), 46 states have internal predecessors, (52), 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) [2025-03-04 12:35:18,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2025-03-04 12:35:18,199 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 17 [2025-03-04 12:35:18,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:35:18,199 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2025-03-04 12:35:18,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 12:35:18,199 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2025-03-04 12:35:18,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 12:35:18,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:35:18,200 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 12:35:18,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 12:35:18,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 12:35:18,403 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 12:35:18,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:35:18,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1238336638, now seen corresponding path program 1 times [2025-03-04 12:35:18,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:35:18,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948542066] [2025-03-04 12:35:18,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:35:18,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:35:18,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 12:35:18,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 12:35:18,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:35:18,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:35:18,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 12:35:18,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:35:18,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948542066] [2025-03-04 12:35:18,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948542066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:35:18,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 12:35:18,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 12:35:18,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783638925] [2025-03-04 12:35:18,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:35:18,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 12:35:18,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:35:18,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 12:35:18,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 12:35:18,448 INFO L87 Difference]: Start difference. First operand 52 states and 62 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 12:35:18,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:35:18,472 INFO L93 Difference]: Finished difference Result 100 states and 120 transitions. [2025-03-04 12:35:18,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 12:35:18,473 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2025-03-04 12:35:18,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:35:18,474 INFO L225 Difference]: With dead ends: 100 [2025-03-04 12:35:18,474 INFO L226 Difference]: Without dead ends: 59 [2025-03-04 12:35:18,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 12:35:18,474 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 11 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 12:35:18,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 112 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:35:18,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-04 12:35:18,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2025-03-04 12:35:18,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.475) internal successors, (59), 50 states have internal predecessors, (59), 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) [2025-03-04 12:35:18,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 69 transitions. [2025-03-04 12:35:18,481 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 69 transitions. Word has length 18 [2025-03-04 12:35:18,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:35:18,481 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 69 transitions. [2025-03-04 12:35:18,481 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 12:35:18,481 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 69 transitions. [2025-03-04 12:35:18,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 12:35:18,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:35:18,484 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 12:35:18,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 12:35:18,484 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 12:35:18,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:35:18,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1238337344, now seen corresponding path program 1 times [2025-03-04 12:35:18,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:35:18,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376668308] [2025-03-04 12:35:18,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:35:18,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:35:18,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 12:35:18,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 12:35:18,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:35:18,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:35:18,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 12:35:18,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:35:18,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376668308] [2025-03-04 12:35:18,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376668308] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:35:18,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 12:35:18,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 12:35:18,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861189273] [2025-03-04 12:35:18,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:35:18,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 12:35:18,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:35:18,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 12:35:18,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 12:35:18,593 INFO L87 Difference]: Start difference. First operand 56 states and 69 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 12:35:18,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:35:18,622 INFO L93 Difference]: Finished difference Result 95 states and 117 transitions. [2025-03-04 12:35:18,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 12:35:18,623 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2025-03-04 12:35:18,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:35:18,624 INFO L225 Difference]: With dead ends: 95 [2025-03-04 12:35:18,625 INFO L226 Difference]: Without dead ends: 71 [2025-03-04 12:35:18,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 12:35:18,625 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 8 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 12:35:18,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 165 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:35:18,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-04 12:35:18,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2025-03-04 12:35:18,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 63 states have internal predecessors, (74), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 12:35:18,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 88 transitions. [2025-03-04 12:35:18,637 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 88 transitions. Word has length 18 [2025-03-04 12:35:18,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:35:18,638 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 88 transitions. [2025-03-04 12:35:18,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 12:35:18,639 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2025-03-04 12:35:18,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 12:35:18,639 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:35:18,639 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 12:35:18,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 12:35:18,640 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 12:35:18,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:35:18,640 INFO L85 PathProgramCache]: Analyzing trace with hash -266269875, now seen corresponding path program 1 times [2025-03-04 12:35:18,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:35:18,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350856340] [2025-03-04 12:35:18,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:35:18,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:35:18,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 12:35:18,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 12:35:18,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:35:18,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:35:18,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 12:35:18,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:35:18,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350856340] [2025-03-04 12:35:18,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350856340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:35:18,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 12:35:18,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 12:35:18,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463406721] [2025-03-04 12:35:18,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:35:18,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 12:35:18,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:35:18,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 12:35:18,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 12:35:18,688 INFO L87 Difference]: Start difference. First operand 70 states and 88 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 12:35:18,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:35:18,710 INFO L93 Difference]: Finished difference Result 132 states and 162 transitions. [2025-03-04 12:35:18,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 12:35:18,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2025-03-04 12:35:18,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:35:18,714 INFO L225 Difference]: With dead ends: 132 [2025-03-04 12:35:18,714 INFO L226 Difference]: Without dead ends: 88 [2025-03-04 12:35:18,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 12:35:18,715 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 16 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 12:35:18,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 109 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:35:18,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-04 12:35:18,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2025-03-04 12:35:18,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 75 states have internal predecessors, (92), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 12:35:18,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 106 transitions. [2025-03-04 12:35:18,726 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 106 transitions. Word has length 19 [2025-03-04 12:35:18,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:35:18,726 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 106 transitions. [2025-03-04 12:35:18,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 12:35:18,726 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 106 transitions. [2025-03-04 12:35:18,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 12:35:18,726 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:35:18,726 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 12:35:18,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 12:35:18,727 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 12:35:18,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:35:18,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1262796417, now seen corresponding path program 1 times [2025-03-04 12:35:18,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:35:18,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57189665] [2025-03-04 12:35:18,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:35:18,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:35:18,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 12:35:18,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 12:35:18,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:35:18,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:35:18,794 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 12:35:18,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:35:18,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57189665] [2025-03-04 12:35:18,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57189665] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 12:35:18,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651192880] [2025-03-04 12:35:18,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:35:18,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 12:35:18,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 12:35:18,797 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 12:35:18,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 12:35:18,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 12:35:18,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 12:35:18,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:35:18,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:35:18,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 12:35:18,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 12:35:18,877 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 12:35:18,877 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 12:35:18,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651192880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:35:18,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 12:35:18,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 12:35:18,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262767239] [2025-03-04 12:35:18,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:35:18,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 12:35:18,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:35:18,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 12:35:18,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 12:35:18,878 INFO L87 Difference]: Start difference. First operand 85 states and 106 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 12:35:18,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:35:18,897 INFO L93 Difference]: Finished difference Result 114 states and 140 transitions. [2025-03-04 12:35:18,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 12:35:18,898 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2025-03-04 12:35:18,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:35:18,899 INFO L225 Difference]: With dead ends: 114 [2025-03-04 12:35:18,899 INFO L226 Difference]: Without dead ends: 64 [2025-03-04 12:35:18,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 12:35:18,899 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 6 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 12:35:18,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 193 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:35:18,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-04 12:35:18,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 56. [2025-03-04 12:35:18,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 43 states have (on average 1.302325581395349) internal successors, (56), 49 states have internal predecessors, (56), 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) [2025-03-04 12:35:18,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2025-03-04 12:35:18,907 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 23 [2025-03-04 12:35:18,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:35:18,907 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2025-03-04 12:35:18,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 12:35:18,907 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2025-03-04 12:35:18,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 12:35:18,908 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:35:18,908 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 12:35:18,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 12:35:19,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 12:35:19,108 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 12:35:19,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:35:19,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1262810640, now seen corresponding path program 1 times [2025-03-04 12:35:19,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:35:19,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404754530] [2025-03-04 12:35:19,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:35:19,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:35:19,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 12:35:19,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 12:35:19,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:35:19,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:35:19,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 12:35:19,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:35:19,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404754530] [2025-03-04 12:35:19,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404754530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:35:19,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 12:35:19,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 12:35:19,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136652228] [2025-03-04 12:35:19,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:35:19,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 12:35:19,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:35:19,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 12:35:19,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 12:35:19,174 INFO L87 Difference]: Start difference. First operand 56 states and 66 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 12:35:19,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:35:19,190 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2025-03-04 12:35:19,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 12:35:19,191 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2025-03-04 12:35:19,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:35:19,193 INFO L225 Difference]: With dead ends: 77 [2025-03-04 12:35:19,193 INFO L226 Difference]: Without dead ends: 59 [2025-03-04 12:35:19,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 12:35:19,194 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 1 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 160 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 [2025-03-04 12:35:19,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 160 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:35:19,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-04 12:35:19,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-03-04 12:35:19,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 52 states have internal predecessors, (59), 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) [2025-03-04 12:35:19,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2025-03-04 12:35:19,202 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 23 [2025-03-04 12:35:19,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:35:19,202 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2025-03-04 12:35:19,202 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 12:35:19,203 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2025-03-04 12:35:19,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 12:35:19,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:35:19,203 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 12:35:19,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 12:35:19,203 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 12:35:19,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:35:19,204 INFO L85 PathProgramCache]: Analyzing trace with hash 773228716, now seen corresponding path program 1 times [2025-03-04 12:35:19,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:35:19,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315653307] [2025-03-04 12:35:19,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:35:19,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:35:19,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 12:35:19,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 12:35:19,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:35:19,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:35:19,278 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 12:35:19,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:35:19,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315653307] [2025-03-04 12:35:19,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315653307] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 12:35:19,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023990788] [2025-03-04 12:35:19,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:35:19,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 12:35:19,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 12:35:19,280 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 12:35:19,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 12:35:19,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 12:35:19,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 12:35:19,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:35:19,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:35:19,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 12:35:19,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 12:35:19,379 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 12:35:19,379 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 12:35:19,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023990788] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:35:19,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 12:35:19,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 12:35:19,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319626133] [2025-03-04 12:35:19,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:35:19,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 12:35:19,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:35:19,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 12:35:19,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 12:35:19,380 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 12:35:19,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:35:19,389 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2025-03-04 12:35:19,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 12:35:19,389 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-03-04 12:35:19,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:35:19,389 INFO L225 Difference]: With dead ends: 76 [2025-03-04 12:35:19,389 INFO L226 Difference]: Without dead ends: 55 [2025-03-04 12:35:19,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 12:35:19,390 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 12:35:19,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:35:19,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-04 12:35:19,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-03-04 12:35:19,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 48 states have internal predecessors, (54), 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) [2025-03-04 12:35:19,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2025-03-04 12:35:19,393 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 26 [2025-03-04 12:35:19,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:35:19,393 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2025-03-04 12:35:19,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 12:35:19,393 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2025-03-04 12:35:19,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 12:35:19,394 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:35:19,394 INFO L218 NwaCegarLoop]: trace histogram [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, 1] [2025-03-04 12:35:19,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 12:35:19,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 12:35:19,594 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 12:35:19,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:35:19,595 INFO L85 PathProgramCache]: Analyzing trace with hash 43299882, now seen corresponding path program 1 times [2025-03-04 12:35:19,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:35:19,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782735776] [2025-03-04 12:35:19,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:35:19,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:35:19,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 12:35:19,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 12:35:19,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:35:19,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:35:19,631 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 12:35:19,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:35:19,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782735776] [2025-03-04 12:35:19,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782735776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:35:19,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 12:35:19,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 12:35:19,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44048430] [2025-03-04 12:35:19,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:35:19,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 12:35:19,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:35:19,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 12:35:19,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 12:35:19,632 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 12:35:19,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:35:19,641 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2025-03-04 12:35:19,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 12:35:19,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2025-03-04 12:35:19,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:35:19,642 INFO L225 Difference]: With dead ends: 69 [2025-03-04 12:35:19,642 INFO L226 Difference]: Without dead ends: 53 [2025-03-04 12:35:19,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 12:35:19,643 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 8 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 12:35:19,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 87 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:35:19,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-04 12:35:19,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-03-04 12:35:19,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 46 states have internal predecessors, (51), 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) [2025-03-04 12:35:19,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2025-03-04 12:35:19,646 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 28 [2025-03-04 12:35:19,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:35:19,646 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2025-03-04 12:35:19,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 12:35:19,646 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2025-03-04 12:35:19,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-04 12:35:19,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:35:19,647 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 12:35:19,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 12:35:19,647 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 12:35:19,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:35:19,647 INFO L85 PathProgramCache]: Analyzing trace with hash 177517574, now seen corresponding path program 1 times [2025-03-04 12:35:19,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:35:19,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849280779] [2025-03-04 12:35:19,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:35:19,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:35:19,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 12:35:19,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 12:35:19,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:35:19,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:35:19,706 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 12:35:19,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:35:19,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849280779] [2025-03-04 12:35:19,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849280779] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:35:19,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 12:35:19,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 12:35:19,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121949495] [2025-03-04 12:35:19,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:35:19,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 12:35:19,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:35:19,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 12:35:19,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 12:35:19,708 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 12:35:19,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:35:19,728 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2025-03-04 12:35:19,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 12:35:19,728 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2025-03-04 12:35:19,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:35:19,730 INFO L225 Difference]: With dead ends: 64 [2025-03-04 12:35:19,731 INFO L226 Difference]: Without dead ends: 62 [2025-03-04 12:35:19,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 12:35:19,731 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 1 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 12:35:19,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 142 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:35:19,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-04 12:35:19,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-03-04 12:35:19,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 54 states have internal predecessors, (59), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 12:35:19,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2025-03-04 12:35:19,737 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 36 [2025-03-04 12:35:19,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:35:19,739 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2025-03-04 12:35:19,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 12:35:19,739 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2025-03-04 12:35:19,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-04 12:35:19,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:35:19,742 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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, 1] [2025-03-04 12:35:19,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 12:35:19,742 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 12:35:19,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:35:19,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1751939187, now seen corresponding path program 1 times [2025-03-04 12:35:19,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:35:19,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776223813] [2025-03-04 12:35:19,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:35:19,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:35:19,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 12:35:19,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 12:35:19,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:35:19,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:35:19,798 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 12:35:19,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:35:19,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776223813] [2025-03-04 12:35:19,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776223813] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 12:35:19,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548186747] [2025-03-04 12:35:19,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:35:19,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 12:35:19,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 12:35:19,800 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 12:35:19,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 12:35:19,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 12:35:19,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 12:35:19,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:35:19,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:35:19,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 12:35:19,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 12:35:19,916 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 12:35:19,916 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 12:35:19,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548186747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:35:19,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 12:35:19,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 12:35:19,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848473363] [2025-03-04 12:35:19,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:35:19,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 12:35:19,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:35:19,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 12:35:19,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 12:35:19,917 INFO L87 Difference]: Start difference. First operand 62 states and 71 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 12:35:19,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:35:19,930 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2025-03-04 12:35:19,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 12:35:19,931 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 48 [2025-03-04 12:35:19,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:35:19,932 INFO L225 Difference]: With dead ends: 66 [2025-03-04 12:35:19,932 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 12:35:19,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 12:35:19,934 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 12:35:19,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:35:19,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 12:35:19,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 12:35:19,934 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) [2025-03-04 12:35:19,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 12:35:19,935 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2025-03-04 12:35:19,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:35:19,935 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 12:35:19,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 12:35:19,936 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 12:35:19,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 12:35:19,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2025-03-04 12:35:19,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2025-03-04 12:35:19,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2025-03-04 12:35:19,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2025-03-04 12:35:19,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2025-03-04 12:35:19,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2025-03-04 12:35:19,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2025-03-04 12:35:19,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2025-03-04 12:35:19,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2025-03-04 12:35:19,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2025-03-04 12:35:19,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2025-03-04 12:35:19,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2025-03-04 12:35:19,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 12:35:20,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 12:35:20,145 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 12:35:20,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 12:35:20,205 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 12:35:20,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:35:20 BoogieIcfgContainer [2025-03-04 12:35:20,216 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 12:35:20,217 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 12:35:20,217 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 12:35:20,217 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 12:35:20,218 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:35:17" (3/4) ... [2025-03-04 12:35:20,219 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 12:35:20,223 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printLine [2025-03-04 12:35:20,223 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-03-04 12:35:20,226 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-03-04 12:35:20,227 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-03-04 12:35:20,227 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 12:35:20,227 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 12:35:20,290 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 12:35:20,290 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 12:35:20,290 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 12:35:20,291 INFO L158 Benchmark]: Toolchain (without parser) took 3914.62ms. Allocated memory is still 167.8MB. Free memory was 119.3MB in the beginning and 48.0MB in the end (delta: 71.3MB). Peak memory consumption was 71.1MB. Max. memory is 16.1GB. [2025-03-04 12:35:20,291 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 118.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 12:35:20,291 INFO L158 Benchmark]: CACSL2BoogieTranslator took 685.73ms. Allocated memory is still 167.8MB. Free memory was 118.8MB in the beginning and 59.6MB in the end (delta: 59.2MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-04 12:35:20,291 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.68ms. Allocated memory is still 167.8MB. Free memory was 59.6MB in the beginning and 57.1MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 12:35:20,291 INFO L158 Benchmark]: Boogie Preprocessor took 26.20ms. Allocated memory is still 167.8MB. Free memory was 57.1MB in the beginning and 55.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 12:35:20,291 INFO L158 Benchmark]: IcfgBuilder took 343.04ms. Allocated memory is still 167.8MB. Free memory was 55.2MB in the beginning and 39.9MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 12:35:20,296 INFO L158 Benchmark]: TraceAbstraction took 2743.98ms. Allocated memory is still 167.8MB. Free memory was 39.0MB in the beginning and 54.7MB in the end (delta: -15.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 12:35:20,297 INFO L158 Benchmark]: Witness Printer took 72.86ms. Allocated memory is still 167.8MB. Free memory was 54.7MB in the beginning and 48.0MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 12:35:20,298 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.14ms. Allocated memory is still 201.3MB. Free memory is still 118.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 685.73ms. Allocated memory is still 167.8MB. Free memory was 118.8MB in the beginning and 59.6MB in the end (delta: 59.2MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.68ms. Allocated memory is still 167.8MB. Free memory was 59.6MB in the beginning and 57.1MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.20ms. Allocated memory is still 167.8MB. Free memory was 57.1MB in the beginning and 55.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 343.04ms. Allocated memory is still 167.8MB. Free memory was 55.2MB in the beginning and 39.9MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2743.98ms. Allocated memory is still 167.8MB. Free memory was 39.0MB in the beginning and 54.7MB in the end (delta: -15.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 72.86ms. Allocated memory is still 167.8MB. Free memory was 54.7MB in the beginning and 48.0MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. 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: 1592]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1592]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1596]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1596]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1588]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1588]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1567]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1567]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1573]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1573]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1553]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1553]: 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, 60 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 65 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 54 mSDsluCounter, 1624 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1007 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 156 IncrementalHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 617 mSDtfsCounter, 156 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 148 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=5, InterpolantAutomatonStates: 45, 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, 11 MinimizatonAttempts, 15 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 382 NumberOfCodeBlocks, 382 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 367 ConstructedInterpolants, 0 QuantifiedInterpolants, 527 SizeOfPredicates, 0 NumberOfNonLiveVariables, 604 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 15 InterpolantComputations, 11 PerfectInterpolantSequences, 61/65 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, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold - InvariantResult [Line: 1553]: Location Invariant Derived location invariant: (((i == 0) && (data <= 1073741822)) || (0 < i)) - InvariantResult [Line: 1588]: Location Invariant Derived location invariant: (((1 <= h) && (data == 2)) || (h == 0)) - InvariantResult [Line: 1592]: Location Invariant Derived location invariant: (((1 <= j) && (data == 2)) || ((j == 0) && (data == 2))) - InvariantResult [Line: 1567]: Location Invariant Derived location invariant: ((k == 0) || (1 <= k)) RESULT: Ultimate proved your program to be correct! [2025-03-04 12:35:20,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE