./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_preinc_15_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed 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_preinc_15_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 d1f5e193cc11dc4dae3b539cb28f090276e9a5a9837f232803d339a1f1183470 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 03:49:49,473 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 03:49:49,518 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-09 03:49:49,521 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 03:49:49,521 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 03:49:49,538 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 03:49:49,538 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 03:49:49,538 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 03:49:49,538 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 03:49:49,538 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 03:49:49,538 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 03:49:49,538 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 03:49:49,539 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 03:49:49,539 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 03:49:49,539 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 03:49:49,539 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 03:49:49,539 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 03:49:49,539 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 03:49:49,539 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 03:49:49,539 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 03:49:49,539 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 03:49:49,539 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 03:49:49,539 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 03:49:49,539 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 03:49:49,539 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 03:49:49,539 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 03:49:49,540 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 03:49:49,540 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 03:49:49,540 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 03:49:49,540 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 03:49:49,540 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 03:49:49,540 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 03:49:49,540 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 03:49:49,540 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 03:49:49,540 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 03:49:49,540 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 03:49:49,540 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 03:49:49,540 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 03:49:49,540 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 03:49:49,540 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 03:49:49,540 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 03:49:49,540 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 03:49:49,540 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 -> d1f5e193cc11dc4dae3b539cb28f090276e9a5a9837f232803d339a1f1183470 [2025-03-09 03:49:49,752 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 03:49:49,757 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 03:49:49,760 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 03:49:49,761 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 03:49:49,762 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 03:49:49,763 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_preinc_15_good.i [2025-03-09 03:49:50,850 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9885a6bf/18d94edd44da41e4b5325bb9fd3f88ee/FLAGe65f3d7a9 [2025-03-09 03:49:51,264 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 03:49:51,265 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_preinc_15_good.i [2025-03-09 03:49:51,292 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9885a6bf/18d94edd44da41e4b5325bb9fd3f88ee/FLAGe65f3d7a9 [2025-03-09 03:49:51,434 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9885a6bf/18d94edd44da41e4b5325bb9fd3f88ee [2025-03-09 03:49:51,436 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 03:49:51,437 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 03:49:51,439 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 03:49:51,439 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 03:49:51,443 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 03:49:51,444 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 03:49:51" (1/1) ... [2025-03-09 03:49:51,445 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c4a5164 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:49:51, skipping insertion in model container [2025-03-09 03:49:51,445 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 03:49:51" (1/1) ... [2025-03-09 03:49:51,488 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 03:49:51,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 03:49:51,982 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 03:49:52,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 03:49:52,127 INFO L204 MainTranslator]: Completed translation [2025-03-09 03:49:52,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:49:52 WrapperNode [2025-03-09 03:49:52,128 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 03:49:52,128 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 03:49:52,129 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 03:49:52,129 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 03:49:52,133 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:49:52" (1/1) ... [2025-03-09 03:49:52,155 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:49:52" (1/1) ... [2025-03-09 03:49:52,179 INFO L138 Inliner]: procedures = 502, calls = 58, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 213 [2025-03-09 03:49:52,180 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 03:49:52,180 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 03:49:52,180 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 03:49:52,180 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 03:49:52,186 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:49:52" (1/1) ... [2025-03-09 03:49:52,187 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:49:52" (1/1) ... [2025-03-09 03:49:52,189 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:49:52" (1/1) ... [2025-03-09 03:49:52,211 INFO L175 MemorySlicer]: Split 2 memory accesses to 2 slices as follows [1, 1]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [1, 1]. The 0 writes are split as follows [0, 0]. [2025-03-09 03:49:52,211 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:49:52" (1/1) ... [2025-03-09 03:49:52,211 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:49:52" (1/1) ... [2025-03-09 03:49:52,215 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:49:52" (1/1) ... [2025-03-09 03:49:52,216 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:49:52" (1/1) ... [2025-03-09 03:49:52,218 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:49:52" (1/1) ... [2025-03-09 03:49:52,219 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:49:52" (1/1) ... [2025-03-09 03:49:52,223 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 03:49:52,223 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 03:49:52,223 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 03:49:52,223 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 03:49:52,224 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:49:52" (1/1) ... [2025-03-09 03:49:52,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 03:49:52,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 03:49:52,263 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-09 03:49:52,265 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-09 03:49:52,297 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-03-09 03:49:52,297 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-03-09 03:49:52,297 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-03-09 03:49:52,297 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-03-09 03:49:52,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 03:49:52,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 03:49:52,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 03:49:52,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 03:49:52,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 03:49:52,451 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 03:49:52,453 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 03:49:52,664 INFO L? ?]: Removed 54 outVars from TransFormulas that were not future-live. [2025-03-09 03:49:52,664 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 03:49:52,671 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 03:49:52,671 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 03:49:52,672 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 03:49:52 BoogieIcfgContainer [2025-03-09 03:49:52,672 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 03:49:52,673 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 03:49:52,673 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 03:49:52,676 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 03:49:52,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 03:49:51" (1/3) ... [2025-03-09 03:49:52,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@785ff82a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 03:49:52, skipping insertion in model container [2025-03-09 03:49:52,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:49:52" (2/3) ... [2025-03-09 03:49:52,677 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@785ff82a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 03:49:52, skipping insertion in model container [2025-03-09 03:49:52,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 03:49:52" (3/3) ... [2025-03-09 03:49:52,677 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_preinc_15_good.i [2025-03-09 03:49:52,687 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 03:49:52,688 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE190_Integer_Overflow__int_fgets_preinc_15_good.i that has 3 procedures, 87 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-03-09 03:49:52,720 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 03:49:52,727 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;@1f391b49, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 03:49:52,727 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-09 03:49:52,730 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 58 states have (on average 1.5) internal successors, (87), 78 states have internal predecessors, (87), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-09 03:49:52,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-09 03:49:52,733 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 03:49:52,734 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 03:49:52,734 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 03:49:52,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 03:49:52,737 INFO L85 PathProgramCache]: Analyzing trace with hash 804902022, now seen corresponding path program 1 times [2025-03-09 03:49:52,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 03:49:52,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944465068] [2025-03-09 03:49:52,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 03:49:52,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 03:49:52,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 03:49:52,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 03:49:52,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 03:49:52,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 03:49:52,946 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-09 03:49:52,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 03:49:52,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944465068] [2025-03-09 03:49:52,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944465068] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 03:49:52,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 03:49:52,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 03:49:52,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674810320] [2025-03-09 03:49:52,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 03:49:52,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 03:49:52,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 03:49:52,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 03:49:52,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 03:49:52,970 INFO L87 Difference]: Start difference. First operand has 87 states, 58 states have (on average 1.5) internal successors, (87), 78 states have internal predecessors, (87), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-09 03:49:53,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 03:49:53,003 INFO L93 Difference]: Finished difference Result 164 states and 230 transitions. [2025-03-09 03:49:53,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 03:49:53,005 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 15 [2025-03-09 03:49:53,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 03:49:53,010 INFO L225 Difference]: With dead ends: 164 [2025-03-09 03:49:53,011 INFO L226 Difference]: Without dead ends: 73 [2025-03-09 03:49:53,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09 03:49:53,020 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 03:49:53,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 231 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 03:49:53,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-09 03:49:53,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-03-09 03:49:53,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 49 states have (on average 1.489795918367347) internal successors, (73), 66 states have internal predecessors, (73), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-09 03:49:53,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 101 transitions. [2025-03-09 03:49:53,058 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 101 transitions. Word has length 15 [2025-03-09 03:49:53,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 03:49:53,062 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 101 transitions. [2025-03-09 03:49:53,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-09 03:49:53,062 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 101 transitions. [2025-03-09 03:49:53,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-09 03:49:53,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 03:49:53,064 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 03:49:53,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 03:49:53,065 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 03:49:53,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 03:49:53,066 INFO L85 PathProgramCache]: Analyzing trace with hash -551908834, now seen corresponding path program 1 times [2025-03-09 03:49:53,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 03:49:53,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866749332] [2025-03-09 03:49:53,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 03:49:53,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 03:49:53,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 03:49:53,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 03:49:53,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 03:49:53,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 03:49:53,194 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-09 03:49:53,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 03:49:53,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866749332] [2025-03-09 03:49:53,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866749332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 03:49:53,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 03:49:53,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 03:49:53,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984755091] [2025-03-09 03:49:53,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 03:49:53,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 03:49:53,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 03:49:53,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 03:49:53,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 03:49:53,196 INFO L87 Difference]: Start difference. First operand 73 states and 101 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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-09 03:49:53,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 03:49:53,223 INFO L93 Difference]: Finished difference Result 75 states and 103 transitions. [2025-03-09 03:49:53,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 03:49:53,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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 16 [2025-03-09 03:49:53,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 03:49:53,225 INFO L225 Difference]: With dead ends: 75 [2025-03-09 03:49:53,225 INFO L226 Difference]: Without dead ends: 74 [2025-03-09 03:49:53,225 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-09 03:49:53,226 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 6 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 03:49:53,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 177 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 03:49:53,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-09 03:49:53,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2025-03-09 03:49:53,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 49 states have (on average 1.469387755102041) internal successors, (72), 65 states have internal predecessors, (72), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-09 03:49:53,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 100 transitions. [2025-03-09 03:49:53,238 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 100 transitions. Word has length 16 [2025-03-09 03:49:53,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 03:49:53,238 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 100 transitions. [2025-03-09 03:49:53,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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-09 03:49:53,238 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 100 transitions. [2025-03-09 03:49:53,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-09 03:49:53,239 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 03:49:53,239 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 03:49:53,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 03:49:53,239 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 03:49:53,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 03:49:53,240 INFO L85 PathProgramCache]: Analyzing trace with hash 70695404, now seen corresponding path program 1 times [2025-03-09 03:49:53,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 03:49:53,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154468134] [2025-03-09 03:49:53,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 03:49:53,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 03:49:53,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 03:49:53,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 03:49:53,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 03:49:53,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 03:49:53,318 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-09 03:49:53,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 03:49:53,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154468134] [2025-03-09 03:49:53,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154468134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 03:49:53,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 03:49:53,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 03:49:53,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253985864] [2025-03-09 03:49:53,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 03:49:53,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 03:49:53,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 03:49:53,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 03:49:53,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 03:49:53,320 INFO L87 Difference]: Start difference. First operand 72 states and 100 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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-09 03:49:53,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 03:49:53,346 INFO L93 Difference]: Finished difference Result 134 states and 186 transitions. [2025-03-09 03:49:53,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 03:49:53,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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-09 03:49:53,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 03:49:53,348 INFO L225 Difference]: With dead ends: 134 [2025-03-09 03:49:53,348 INFO L226 Difference]: Without dead ends: 79 [2025-03-09 03:49:53,349 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-09 03:49:53,349 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 9 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 03:49:53,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 197 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 03:49:53,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-09 03:49:53,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2025-03-09 03:49:53,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 68 states have internal predecessors, (78), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-09 03:49:53,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 106 transitions. [2025-03-09 03:49:53,363 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 106 transitions. Word has length 17 [2025-03-09 03:49:53,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 03:49:53,363 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 106 transitions. [2025-03-09 03:49:53,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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-09 03:49:53,364 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 106 transitions. [2025-03-09 03:49:53,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-09 03:49:53,364 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 03:49:53,364 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] [2025-03-09 03:49:53,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 03:49:53,364 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 03:49:53,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 03:49:53,365 INFO L85 PathProgramCache]: Analyzing trace with hash -453577006, now seen corresponding path program 1 times [2025-03-09 03:49:53,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 03:49:53,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907336243] [2025-03-09 03:49:53,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 03:49:53,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 03:49:53,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 03:49:53,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 03:49:53,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 03:49:53,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 03:49:53,446 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-09 03:49:53,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 03:49:53,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907336243] [2025-03-09 03:49:53,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907336243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 03:49:53,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 03:49:53,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 03:49:53,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476334291] [2025-03-09 03:49:53,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 03:49:53,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 03:49:53,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 03:49:53,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 03:49:53,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 03:49:53,450 INFO L87 Difference]: Start difference. First operand 76 states and 106 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-09 03:49:53,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 03:49:53,470 INFO L93 Difference]: Finished difference Result 129 states and 178 transitions. [2025-03-09 03:49:53,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 03:49:53,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 22 [2025-03-09 03:49:53,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 03:49:53,472 INFO L225 Difference]: With dead ends: 129 [2025-03-09 03:49:53,474 INFO L226 Difference]: Without dead ends: 76 [2025-03-09 03:49:53,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09 03:49:53,475 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 0 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 03:49:53,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 188 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 03:49:53,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-09 03:49:53,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-03-09 03:49:53,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 68 states have internal predecessors, (76), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-09 03:49:53,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 104 transitions. [2025-03-09 03:49:53,486 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 104 transitions. Word has length 22 [2025-03-09 03:49:53,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 03:49:53,486 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 104 transitions. [2025-03-09 03:49:53,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-09 03:49:53,487 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 104 transitions. [2025-03-09 03:49:53,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-09 03:49:53,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 03:49:53,487 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, 1, 1, 1] [2025-03-09 03:49:53,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 03:49:53,488 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 03:49:53,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 03:49:53,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1411326476, now seen corresponding path program 1 times [2025-03-09 03:49:53,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 03:49:53,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12206026] [2025-03-09 03:49:53,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 03:49:53,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 03:49:53,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 03:49:53,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 03:49:53,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 03:49:53,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 03:49:53,539 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 03:49:53,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 03:49:53,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12206026] [2025-03-09 03:49:53,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12206026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 03:49:53,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 03:49:53,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 03:49:53,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127167047] [2025-03-09 03:49:53,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 03:49:53,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 03:49:53,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 03:49:53,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 03:49:53,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 03:49:53,543 INFO L87 Difference]: Start difference. First operand 76 states and 104 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-09 03:49:53,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 03:49:53,557 INFO L93 Difference]: Finished difference Result 129 states and 176 transitions. [2025-03-09 03:49:53,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 03:49:53,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 26 [2025-03-09 03:49:53,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 03:49:53,561 INFO L225 Difference]: With dead ends: 129 [2025-03-09 03:49:53,561 INFO L226 Difference]: Without dead ends: 75 [2025-03-09 03:49:53,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09 03:49:53,562 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 03:49:53,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 183 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 03:49:53,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-09 03:49:53,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-03-09 03:49:53,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 67 states have internal predecessors, (74), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-09 03:49:53,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 100 transitions. [2025-03-09 03:49:53,572 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 100 transitions. Word has length 26 [2025-03-09 03:49:53,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 03:49:53,573 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 100 transitions. [2025-03-09 03:49:53,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-09 03:49:53,573 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 100 transitions. [2025-03-09 03:49:53,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-09 03:49:53,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 03:49:53,573 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, 1, 1, 1, 1, 1] [2025-03-09 03:49:53,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 03:49:53,573 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 03:49:53,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 03:49:53,574 INFO L85 PathProgramCache]: Analyzing trace with hash -878502265, now seen corresponding path program 1 times [2025-03-09 03:49:53,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 03:49:53,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796380047] [2025-03-09 03:49:53,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 03:49:53,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 03:49:53,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 03:49:53,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 03:49:53,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 03:49:53,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 03:49:53,614 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 03:49:53,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 03:49:53,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796380047] [2025-03-09 03:49:53,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796380047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 03:49:53,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 03:49:53,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 03:49:53,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277037129] [2025-03-09 03:49:53,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 03:49:53,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 03:49:53,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 03:49:53,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 03:49:53,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 03:49:53,615 INFO L87 Difference]: Start difference. First operand 75 states and 100 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 03:49:53,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 03:49:53,630 INFO L93 Difference]: Finished difference Result 120 states and 159 transitions. [2025-03-09 03:49:53,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 03:49:53,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2025-03-09 03:49:53,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 03:49:53,635 INFO L225 Difference]: With dead ends: 120 [2025-03-09 03:49:53,635 INFO L226 Difference]: Without dead ends: 73 [2025-03-09 03:49:53,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09 03:49:53,635 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 03:49:53,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 175 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 03:49:53,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-09 03:49:53,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-03-09 03:49:53,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 65 states have internal predecessors, (71), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-09 03:49:53,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 95 transitions. [2025-03-09 03:49:53,647 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 95 transitions. Word has length 28 [2025-03-09 03:49:53,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 03:49:53,647 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 95 transitions. [2025-03-09 03:49:53,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 03:49:53,647 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 95 transitions. [2025-03-09 03:49:53,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-09 03:49:53,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 03:49:53,650 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, 1, 1, 1, 1, 1, 1] [2025-03-09 03:49:53,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 03:49:53,650 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 03:49:53,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 03:49:53,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1177266181, now seen corresponding path program 1 times [2025-03-09 03:49:53,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 03:49:53,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374051840] [2025-03-09 03:49:53,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 03:49:53,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 03:49:53,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 03:49:53,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 03:49:53,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 03:49:53,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 03:49:53,719 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 03:49:53,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 03:49:53,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374051840] [2025-03-09 03:49:53,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374051840] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 03:49:53,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 03:49:53,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 03:49:53,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970847767] [2025-03-09 03:49:53,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 03:49:53,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 03:49:53,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 03:49:53,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 03:49:53,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 03:49:53,723 INFO L87 Difference]: Start difference. First operand 73 states and 95 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 03:49:53,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 03:49:53,740 INFO L93 Difference]: Finished difference Result 75 states and 97 transitions. [2025-03-09 03:49:53,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 03:49:53,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2025-03-09 03:49:53,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 03:49:53,741 INFO L225 Difference]: With dead ends: 75 [2025-03-09 03:49:53,741 INFO L226 Difference]: Without dead ends: 74 [2025-03-09 03:49:53,741 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-09 03:49:53,741 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 7 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 03:49:53,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 155 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 03:49:53,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-09 03:49:53,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2025-03-09 03:49:53,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 53 states have (on average 1.320754716981132) internal successors, (70), 64 states have internal predecessors, (70), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-09 03:49:53,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 94 transitions. [2025-03-09 03:49:53,749 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 94 transitions. Word has length 29 [2025-03-09 03:49:53,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 03:49:53,749 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 94 transitions. [2025-03-09 03:49:53,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 03:49:53,749 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 94 transitions. [2025-03-09 03:49:53,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 03:49:53,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 03:49:53,750 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 03:49:53,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 03:49:53,750 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 03:49:53,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 03:49:53,750 INFO L85 PathProgramCache]: Analyzing trace with hash 2135513288, now seen corresponding path program 1 times [2025-03-09 03:49:53,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 03:49:53,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111862903] [2025-03-09 03:49:53,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 03:49:53,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 03:49:53,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 03:49:53,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 03:49:53,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 03:49:53,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 03:49:53,808 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 03:49:53,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 03:49:53,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111862903] [2025-03-09 03:49:53,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111862903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 03:49:53,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 03:49:53,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 03:49:53,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242713979] [2025-03-09 03:49:53,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 03:49:53,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 03:49:53,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 03:49:53,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 03:49:53,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 03:49:53,811 INFO L87 Difference]: Start difference. First operand 72 states and 94 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 03:49:53,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 03:49:53,828 INFO L93 Difference]: Finished difference Result 114 states and 149 transitions. [2025-03-09 03:49:53,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 03:49:53,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2025-03-09 03:49:53,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 03:49:53,835 INFO L225 Difference]: With dead ends: 114 [2025-03-09 03:49:53,835 INFO L226 Difference]: Without dead ends: 79 [2025-03-09 03:49:53,836 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-09 03:49:53,836 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 9 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 03:49:53,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 175 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 03:49:53,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-09 03:49:53,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2025-03-09 03:49:53,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 66 states have internal predecessors, (74), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-09 03:49:53,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 98 transitions. [2025-03-09 03:49:53,843 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 98 transitions. Word has length 30 [2025-03-09 03:49:53,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 03:49:53,843 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 98 transitions. [2025-03-09 03:49:53,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 03:49:53,843 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 98 transitions. [2025-03-09 03:49:53,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-09 03:49:53,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 03:49:53,844 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 03:49:53,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 03:49:53,844 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 03:49:53,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 03:49:53,844 INFO L85 PathProgramCache]: Analyzing trace with hash -355809983, now seen corresponding path program 1 times [2025-03-09 03:49:53,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 03:49:53,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640715992] [2025-03-09 03:49:53,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 03:49:53,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 03:49:53,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-09 03:49:53,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-09 03:49:53,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 03:49:53,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 03:49:53,914 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 03:49:53,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 03:49:53,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640715992] [2025-03-09 03:49:53,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640715992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 03:49:53,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 03:49:53,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 03:49:53,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031552706] [2025-03-09 03:49:53,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 03:49:53,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 03:49:53,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 03:49:53,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 03:49:53,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 03:49:53,915 INFO L87 Difference]: Start difference. First operand 75 states and 98 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 03:49:53,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 03:49:53,922 INFO L93 Difference]: Finished difference Result 108 states and 139 transitions. [2025-03-09 03:49:53,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 03:49:53,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2025-03-09 03:49:53,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 03:49:53,923 INFO L225 Difference]: With dead ends: 108 [2025-03-09 03:49:53,923 INFO L226 Difference]: Without dead ends: 73 [2025-03-09 03:49:53,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09 03:49:53,924 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 03:49:53,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 160 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 03:49:53,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-09 03:49:53,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-03-09 03:49:53,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 56 states have (on average 1.25) internal successors, (70), 64 states have internal predecessors, (70), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-09 03:49:53,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 92 transitions. [2025-03-09 03:49:53,928 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 92 transitions. Word has length 35 [2025-03-09 03:49:53,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 03:49:53,928 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 92 transitions. [2025-03-09 03:49:53,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 03:49:53,928 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 92 transitions. [2025-03-09 03:49:53,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-09 03:49:53,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 03:49:53,929 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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-09 03:49:53,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 03:49:53,929 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 03:49:53,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 03:49:53,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1949112596, now seen corresponding path program 1 times [2025-03-09 03:49:53,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 03:49:53,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098791303] [2025-03-09 03:49:53,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 03:49:53,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 03:49:53,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-09 03:49:53,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 03:49:53,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 03:49:53,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 03:49:53,993 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 03:49:53,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 03:49:53,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098791303] [2025-03-09 03:49:53,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098791303] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 03:49:53,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 03:49:53,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 03:49:53,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469984830] [2025-03-09 03:49:53,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 03:49:53,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 03:49:53,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 03:49:53,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 03:49:53,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 03:49:53,994 INFO L87 Difference]: Start difference. First operand 73 states and 92 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 03:49:54,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 03:49:54,013 INFO L93 Difference]: Finished difference Result 83 states and 105 transitions. [2025-03-09 03:49:54,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 03:49:54,014 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2025-03-09 03:49:54,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 03:49:54,015 INFO L225 Difference]: With dead ends: 83 [2025-03-09 03:49:54,015 INFO L226 Difference]: Without dead ends: 81 [2025-03-09 03:49:54,015 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-09 03:49:54,015 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 5 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 03:49:54,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 158 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 03:49:54,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-09 03:49:54,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2025-03-09 03:49:54,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 60 states have (on average 1.25) internal successors, (75), 68 states have internal predecessors, (75), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-09 03:49:54,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 97 transitions. [2025-03-09 03:49:54,022 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 97 transitions. Word has length 40 [2025-03-09 03:49:54,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 03:49:54,022 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 97 transitions. [2025-03-09 03:49:54,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 03:49:54,022 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 97 transitions. [2025-03-09 03:49:54,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-09 03:49:54,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 03:49:54,023 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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-09 03:49:54,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 03:49:54,023 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 03:49:54,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 03:49:54,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1949142387, now seen corresponding path program 1 times [2025-03-09 03:49:54,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 03:49:54,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293495112] [2025-03-09 03:49:54,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 03:49:54,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 03:49:54,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-09 03:49:54,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 03:49:54,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 03:49:54,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 03:49:54,068 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 03:49:54,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 03:49:54,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293495112] [2025-03-09 03:49:54,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293495112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 03:49:54,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 03:49:54,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 03:49:54,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721086955] [2025-03-09 03:49:54,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 03:49:54,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 03:49:54,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 03:49:54,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 03:49:54,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 03:49:54,069 INFO L87 Difference]: Start difference. First operand 77 states and 97 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 03:49:54,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 03:49:54,080 INFO L93 Difference]: Finished difference Result 105 states and 130 transitions. [2025-03-09 03:49:54,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 03:49:54,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2025-03-09 03:49:54,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 03:49:54,081 INFO L225 Difference]: With dead ends: 105 [2025-03-09 03:49:54,081 INFO L226 Difference]: Without dead ends: 77 [2025-03-09 03:49:54,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09 03:49:54,082 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 03:49:54,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 03:49:54,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-09 03:49:54,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-09 03:49:54,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 67 states have internal predecessors, (74), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-09 03:49:54,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 96 transitions. [2025-03-09 03:49:54,089 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 96 transitions. Word has length 40 [2025-03-09 03:49:54,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 03:49:54,089 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 96 transitions. [2025-03-09 03:49:54,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 03:49:54,090 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 96 transitions. [2025-03-09 03:49:54,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-09 03:49:54,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 03:49:54,090 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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-09 03:49:54,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 03:49:54,094 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 03:49:54,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 03:49:54,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1016179235, now seen corresponding path program 1 times [2025-03-09 03:49:54,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 03:49:54,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491528035] [2025-03-09 03:49:54,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 03:49:54,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 03:49:54,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-09 03:49:54,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 03:49:54,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 03:49:54,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 03:49:54,136 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 03:49:54,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 03:49:54,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491528035] [2025-03-09 03:49:54,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491528035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 03:49:54,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 03:49:54,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 03:49:54,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2820215] [2025-03-09 03:49:54,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 03:49:54,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 03:49:54,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 03:49:54,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 03:49:54,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 03:49:54,137 INFO L87 Difference]: Start difference. First operand 77 states and 96 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 03:49:54,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 03:49:54,145 INFO L93 Difference]: Finished difference Result 99 states and 122 transitions. [2025-03-09 03:49:54,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 03:49:54,146 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 44 [2025-03-09 03:49:54,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 03:49:54,146 INFO L225 Difference]: With dead ends: 99 [2025-03-09 03:49:54,146 INFO L226 Difference]: Without dead ends: 70 [2025-03-09 03:49:54,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09 03:49:54,147 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 03:49:54,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 148 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 03:49:54,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-09 03:49:54,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-03-09 03:49:54,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 56 states have (on average 1.1785714285714286) internal successors, (66), 61 states have internal predecessors, (66), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-09 03:49:54,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 86 transitions. [2025-03-09 03:49:54,153 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 86 transitions. Word has length 44 [2025-03-09 03:49:54,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 03:49:54,154 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 86 transitions. [2025-03-09 03:49:54,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 03:49:54,154 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 86 transitions. [2025-03-09 03:49:54,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-09 03:49:54,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 03:49:54,154 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1] [2025-03-09 03:49:54,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 03:49:54,154 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 03:49:54,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 03:49:54,155 INFO L85 PathProgramCache]: Analyzing trace with hash -377992095, now seen corresponding path program 1 times [2025-03-09 03:49:54,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 03:49:54,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129131299] [2025-03-09 03:49:54,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 03:49:54,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 03:49:54,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-09 03:49:54,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-09 03:49:54,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 03:49:54,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 03:49:54,197 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 03:49:54,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 03:49:54,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129131299] [2025-03-09 03:49:54,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129131299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 03:49:54,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 03:49:54,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 03:49:54,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361821269] [2025-03-09 03:49:54,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 03:49:54,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 03:49:54,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 03:49:54,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 03:49:54,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 03:49:54,199 INFO L87 Difference]: Start difference. First operand 70 states and 86 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 03:49:54,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 03:49:54,208 INFO L93 Difference]: Finished difference Result 85 states and 103 transitions. [2025-03-09 03:49:54,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 03:49:54,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2025-03-09 03:49:54,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 03:49:54,210 INFO L225 Difference]: With dead ends: 85 [2025-03-09 03:49:54,210 INFO L226 Difference]: Without dead ends: 68 [2025-03-09 03:49:54,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09 03:49:54,210 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 03:49:54,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 03:49:54,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-09 03:49:54,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-03-09 03:49:54,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 59 states have internal predecessors, (63), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-09 03:49:54,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 81 transitions. [2025-03-09 03:49:54,216 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 81 transitions. Word has length 46 [2025-03-09 03:49:54,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 03:49:54,216 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 81 transitions. [2025-03-09 03:49:54,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 03:49:54,217 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 81 transitions. [2025-03-09 03:49:54,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-09 03:49:54,217 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 03:49:54,217 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 03:49:54,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 03:49:54,217 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 03:49:54,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 03:49:54,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1876036728, now seen corresponding path program 1 times [2025-03-09 03:49:54,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 03:49:54,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073243500] [2025-03-09 03:49:54,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 03:49:54,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 03:49:54,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-09 03:49:54,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-09 03:49:54,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 03:49:54,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 03:49:54,287 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 03:49:54,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 03:49:54,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073243500] [2025-03-09 03:49:54,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073243500] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 03:49:54,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 03:49:54,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 03:49:54,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726569095] [2025-03-09 03:49:54,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 03:49:54,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 03:49:54,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 03:49:54,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 03:49:54,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 03:49:54,290 INFO L87 Difference]: Start difference. First operand 68 states and 81 transitions. Second operand has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-09 03:49:54,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 03:49:54,298 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2025-03-09 03:49:54,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 03:49:54,298 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 52 [2025-03-09 03:49:54,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 03:49:54,299 INFO L225 Difference]: With dead ends: 74 [2025-03-09 03:49:54,299 INFO L226 Difference]: Without dead ends: 68 [2025-03-09 03:49:54,299 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-09 03:49:54,299 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 1 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 03:49:54,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 138 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 03:49:54,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-09 03:49:54,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-03-09 03:49:54,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 59 states have internal predecessors, (62), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-09 03:49:54,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 80 transitions. [2025-03-09 03:49:54,302 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 80 transitions. Word has length 52 [2025-03-09 03:49:54,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 03:49:54,302 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 80 transitions. [2025-03-09 03:49:54,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-09 03:49:54,302 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 80 transitions. [2025-03-09 03:49:54,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-09 03:49:54,303 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 03:49:54,303 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 03:49:54,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 03:49:54,303 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 03:49:54,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 03:49:54,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1974372720, now seen corresponding path program 1 times [2025-03-09 03:49:54,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 03:49:54,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148999011] [2025-03-09 03:49:54,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 03:49:54,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 03:49:54,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-09 03:49:54,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-09 03:49:54,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 03:49:54,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 03:49:54,347 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 03:49:54,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 03:49:54,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148999011] [2025-03-09 03:49:54,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148999011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 03:49:54,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 03:49:54,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 03:49:54,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510507523] [2025-03-09 03:49:54,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 03:49:54,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 03:49:54,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 03:49:54,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 03:49:54,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 03:49:54,348 INFO L87 Difference]: Start difference. First operand 68 states and 80 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-09 03:49:54,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 03:49:54,353 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2025-03-09 03:49:54,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 03:49:54,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 53 [2025-03-09 03:49:54,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 03:49:54,353 INFO L225 Difference]: With dead ends: 72 [2025-03-09 03:49:54,353 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 03:49:54,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09 03:49:54,355 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 03:49:54,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 03:49:54,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 03:49:54,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 03:49:54,355 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-09 03:49:54,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 03:49:54,355 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 53 [2025-03-09 03:49:54,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 03:49:54,356 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 03:49:54,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-09 03:49:54,356 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 03:49:54,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 03:49:54,358 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-03-09 03:49:54,358 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-03-09 03:49:54,359 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-03-09 03:49:54,359 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-03-09 03:49:54,359 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-03-09 03:49:54,359 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-03-09 03:49:54,359 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-03-09 03:49:54,359 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-03-09 03:49:54,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 03:49:54,361 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 03:49:54,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 03:49:54,407 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 03:49:54,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 03:49:54 BoogieIcfgContainer [2025-03-09 03:49:54,411 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 03:49:54,412 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 03:49:54,412 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 03:49:54,412 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 03:49:54,412 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 03:49:52" (3/4) ... [2025-03-09 03:49:54,413 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 03:49:54,417 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printLine [2025-03-09 03:49:54,417 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-03-09 03:49:54,423 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2025-03-09 03:49:54,423 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-03-09 03:49:54,423 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-09 03:49:54,423 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 03:49:54,423 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 03:49:54,490 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 03:49:54,490 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 03:49:54,490 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 03:49:54,490 INFO L158 Benchmark]: Toolchain (without parser) took 3053.02ms. Allocated memory is still 142.6MB. Free memory was 108.5MB in the beginning and 65.9MB in the end (delta: 42.7MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2025-03-09 03:49:54,491 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 122.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 03:49:54,491 INFO L158 Benchmark]: CACSL2BoogieTranslator took 689.19ms. Allocated memory is still 142.6MB. Free memory was 108.1MB in the beginning and 47.5MB in the end (delta: 60.6MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-09 03:49:54,491 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.42ms. Allocated memory is still 142.6MB. Free memory was 47.5MB in the beginning and 44.3MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 03:49:54,491 INFO L158 Benchmark]: Boogie Preprocessor took 42.47ms. Allocated memory is still 142.6MB. Free memory was 44.3MB in the beginning and 42.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 03:49:54,492 INFO L158 Benchmark]: IcfgBuilder took 448.62ms. Allocated memory is still 142.6MB. Free memory was 42.5MB in the beginning and 92.7MB in the end (delta: -50.2MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. [2025-03-09 03:49:54,492 INFO L158 Benchmark]: TraceAbstraction took 1737.94ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 74.2MB in the end (delta: 18.5MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. [2025-03-09 03:49:54,492 INFO L158 Benchmark]: Witness Printer took 78.32ms. Allocated memory is still 142.6MB. Free memory was 74.2MB in the beginning and 65.9MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 03:49:54,493 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.20ms. Allocated memory is still 201.3MB. Free memory is still 122.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 689.19ms. Allocated memory is still 142.6MB. Free memory was 108.1MB in the beginning and 47.5MB in the end (delta: 60.6MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.42ms. Allocated memory is still 142.6MB. Free memory was 47.5MB in the beginning and 44.3MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.47ms. Allocated memory is still 142.6MB. Free memory was 44.3MB in the beginning and 42.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 448.62ms. Allocated memory is still 142.6MB. Free memory was 42.5MB in the beginning and 92.7MB in the end (delta: -50.2MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1737.94ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 74.2MB in the end (delta: 18.5MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. * Witness Printer took 78.32ms. Allocated memory is still 142.6MB. Free memory was 74.2MB in the beginning and 65.9MB in the end (delta: 8.3MB). 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: 1676]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1676]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1649]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1649]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1618]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1618]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1579]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1579]: 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, 87 locations, 141 edges, 8 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 15, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 46 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 37 mSDsluCounter, 2501 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1198 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 89 IncrementalHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 1303 mSDtfsCounter, 89 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=0, 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, 15 MinimizatonAttempts, 15 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 493 NumberOfCodeBlocks, 493 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 478 ConstructedInterpolants, 0 QuantifiedInterpolants, 544 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 104/104 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 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-09 03:49:54,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE