./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_13_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_rand_multiply_13_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 0bca47636b4231e1e02f7da14efe27510625818f6dbb09dce5542e7979f80afe --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 04:40:54,399 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 04:40:54,443 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-09 04:40:54,446 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 04:40:54,446 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 04:40:54,461 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 04:40:54,461 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 04:40:54,461 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 04:40:54,461 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 04:40:54,462 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 04:40:54,462 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 04:40:54,462 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 04:40:54,462 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 04:40:54,462 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 04:40:54,462 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 04:40:54,462 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 04:40:54,462 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 04:40:54,462 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 04:40:54,462 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 04:40:54,462 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 04:40:54,462 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 04:40:54,462 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 04:40:54,462 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 04:40:54,463 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 04:40:54,463 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 04:40:54,463 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 04:40:54,463 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 04:40:54,463 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 04:40:54,463 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 04:40:54,463 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 04:40:54,463 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 04:40:54,463 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 04:40:54,463 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 04:40:54,463 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 04:40:54,463 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 04:40:54,463 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 04:40:54,463 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 04:40:54,463 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 04:40:54,463 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 04:40:54,463 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 04:40:54,463 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 04:40:54,464 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 04:40:54,464 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 -> 0bca47636b4231e1e02f7da14efe27510625818f6dbb09dce5542e7979f80afe [2025-03-09 04:40:54,679 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 04:40:54,686 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 04:40:54,689 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 04:40:54,690 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 04:40:54,690 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 04:40:54,692 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_rand_multiply_13_good.i [2025-03-09 04:40:55,843 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57ae5eee0/3c4e8751b0de43d39c2285ce36d2820d/FLAGc595b37ae [2025-03-09 04:40:56,209 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 04:40:56,209 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_13_good.i [2025-03-09 04:40:56,235 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57ae5eee0/3c4e8751b0de43d39c2285ce36d2820d/FLAGc595b37ae [2025-03-09 04:40:56,424 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57ae5eee0/3c4e8751b0de43d39c2285ce36d2820d [2025-03-09 04:40:56,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 04:40:56,427 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 04:40:56,428 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 04:40:56,428 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 04:40:56,432 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 04:40:56,433 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 04:40:56" (1/1) ... [2025-03-09 04:40:56,433 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25600980 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:40:56, skipping insertion in model container [2025-03-09 04:40:56,434 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 04:40:56" (1/1) ... [2025-03-09 04:40:56,465 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 04:40:56,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 04:40:56,939 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 04:40:57,022 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 04:40:57,097 INFO L204 MainTranslator]: Completed translation [2025-03-09 04:40:57,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:40:57 WrapperNode [2025-03-09 04:40:57,098 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 04:40:57,098 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 04:40:57,098 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 04:40:57,098 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 04:40:57,102 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:40:57" (1/1) ... [2025-03-09 04:40:57,117 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:40:57" (1/1) ... [2025-03-09 04:40:57,135 INFO L138 Inliner]: procedures = 501, calls = 38, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 197 [2025-03-09 04:40:57,136 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 04:40:57,136 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 04:40:57,136 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 04:40:57,136 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 04:40:57,142 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:40:57" (1/1) ... [2025-03-09 04:40:57,143 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:40:57" (1/1) ... [2025-03-09 04:40:57,146 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:40:57" (1/1) ... [2025-03-09 04:40:57,163 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-09 04:40:57,163 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:40:57" (1/1) ... [2025-03-09 04:40:57,163 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:40:57" (1/1) ... [2025-03-09 04:40:57,167 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:40:57" (1/1) ... [2025-03-09 04:40:57,167 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:40:57" (1/1) ... [2025-03-09 04:40:57,168 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:40:57" (1/1) ... [2025-03-09 04:40:57,175 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:40:57" (1/1) ... [2025-03-09 04:40:57,177 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 04:40:57,178 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 04:40:57,178 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 04:40:57,178 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 04:40:57,178 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:40:57" (1/1) ... [2025-03-09 04:40:57,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 04:40:57,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 04:40:57,206 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 04:40:57,209 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 04:40:57,226 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-03-09 04:40:57,226 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-03-09 04:40:57,226 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-03-09 04:40:57,226 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-03-09 04:40:57,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 04:40:57,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 04:40:57,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 04:40:57,340 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 04:40:57,341 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 04:40:57,590 INFO L? ?]: Removed 104 outVars from TransFormulas that were not future-live. [2025-03-09 04:40:57,590 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 04:40:57,608 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 04:40:57,610 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 04:40:57,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 04:40:57 BoogieIcfgContainer [2025-03-09 04:40:57,611 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 04:40:57,612 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 04:40:57,613 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 04:40:57,616 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 04:40:57,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 04:40:56" (1/3) ... [2025-03-09 04:40:57,617 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6199e146 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 04:40:57, skipping insertion in model container [2025-03-09 04:40:57,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:40:57" (2/3) ... [2025-03-09 04:40:57,617 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6199e146 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 04:40:57, skipping insertion in model container [2025-03-09 04:40:57,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 04:40:57" (3/3) ... [2025-03-09 04:40:57,619 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_multiply_13_good.i [2025-03-09 04:40:57,631 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 04:40:57,632 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE190_Integer_Overflow__int_rand_multiply_13_good.i that has 3 procedures, 107 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-03-09 04:40:57,676 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 04:40:57,689 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;@21531ada, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 04:40:57,689 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-09 04:40:57,693 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 86 states have (on average 1.569767441860465) internal successors, (135), 98 states have internal predecessors, (135), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-09 04:40:57,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-09 04:40:57,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 04:40:57,698 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 04:40:57,699 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 04:40:57,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 04:40:57,704 INFO L85 PathProgramCache]: Analyzing trace with hash -109010770, now seen corresponding path program 1 times [2025-03-09 04:40:57,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 04:40:57,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284034652] [2025-03-09 04:40:57,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 04:40:57,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 04:40:57,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 04:40:57,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 04:40:57,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 04:40:57,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 04:40:57,862 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 04:40:57,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 04:40:57,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284034652] [2025-03-09 04:40:57,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284034652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 04:40:57,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 04:40:57,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 04:40:57,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864873643] [2025-03-09 04:40:57,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 04:40:57,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 04:40:57,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 04:40:57,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 04:40:57,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 04:40:57,883 INFO L87 Difference]: Start difference. First operand has 107 states, 86 states have (on average 1.569767441860465) internal successors, (135), 98 states have internal predecessors, (135), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 04:40:57,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 04:40:57,944 INFO L93 Difference]: Finished difference Result 185 states and 264 transitions. [2025-03-09 04:40:57,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 04:40:57,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 13 [2025-03-09 04:40:57,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 04:40:57,949 INFO L225 Difference]: With dead ends: 185 [2025-03-09 04:40:57,950 INFO L226 Difference]: Without dead ends: 96 [2025-03-09 04:40:57,951 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 04:40:57,955 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 139 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 04:40:57,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 127 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 04:40:57,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-09 04:40:57,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-03-09 04:40:57,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 80 states have (on average 1.4875) internal successors, (119), 89 states have internal predecessors, (119), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 04:40:57,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 131 transitions. [2025-03-09 04:40:57,982 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 131 transitions. Word has length 13 [2025-03-09 04:40:57,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 04:40:57,983 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 131 transitions. [2025-03-09 04:40:57,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 04:40:57,983 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 131 transitions. [2025-03-09 04:40:57,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-09 04:40:57,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 04:40:57,984 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 04:40:57,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 04:40:57,984 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 04:40:57,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 04:40:57,986 INFO L85 PathProgramCache]: Analyzing trace with hash 416642793, now seen corresponding path program 1 times [2025-03-09 04:40:57,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 04:40:57,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884800397] [2025-03-09 04:40:57,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 04:40:57,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 04:40:58,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 04:40:58,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 04:40:58,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 04:40:58,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 04:40:58,077 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 04:40:58,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 04:40:58,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884800397] [2025-03-09 04:40:58,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884800397] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 04:40:58,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 04:40:58,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 04:40:58,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701569810] [2025-03-09 04:40:58,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 04:40:58,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 04:40:58,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 04:40:58,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 04:40:58,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 04:40:58,079 INFO L87 Difference]: Start difference. First operand 96 states and 131 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 04:40:58,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 04:40:58,116 INFO L93 Difference]: Finished difference Result 96 states and 131 transitions. [2025-03-09 04:40:58,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 04:40:58,117 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2025-03-09 04:40:58,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 04:40:58,117 INFO L225 Difference]: With dead ends: 96 [2025-03-09 04:40:58,117 INFO L226 Difference]: Without dead ends: 95 [2025-03-09 04:40:58,118 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 04:40:58,118 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 1 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 04:40:58,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 229 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 04:40:58,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-09 04:40:58,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-03-09 04:40:58,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 80 states have (on average 1.475) internal successors, (118), 88 states have internal predecessors, (118), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 04:40:58,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 130 transitions. [2025-03-09 04:40:58,128 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 130 transitions. Word has length 19 [2025-03-09 04:40:58,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 04:40:58,128 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 130 transitions. [2025-03-09 04:40:58,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 04:40:58,128 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 130 transitions. [2025-03-09 04:40:58,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-09 04:40:58,129 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 04:40:58,129 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] [2025-03-09 04:40:58,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 04:40:58,129 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 04:40:58,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 04:40:58,130 INFO L85 PathProgramCache]: Analyzing trace with hash 31024762, now seen corresponding path program 1 times [2025-03-09 04:40:58,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 04:40:58,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458392875] [2025-03-09 04:40:58,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 04:40:58,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 04:40:58,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 04:40:58,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 04:40:58,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 04:40:58,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 04:40:58,191 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 04:40:58,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 04:40:58,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458392875] [2025-03-09 04:40:58,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458392875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 04:40:58,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 04:40:58,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 04:40:58,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329796120] [2025-03-09 04:40:58,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 04:40:58,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 04:40:58,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 04:40:58,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 04:40:58,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 04:40:58,193 INFO L87 Difference]: Start difference. First operand 95 states and 130 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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 04:40:58,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 04:40:58,227 INFO L93 Difference]: Finished difference Result 95 states and 130 transitions. [2025-03-09 04:40:58,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 04:40:58,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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 20 [2025-03-09 04:40:58,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 04:40:58,229 INFO L225 Difference]: With dead ends: 95 [2025-03-09 04:40:58,229 INFO L226 Difference]: Without dead ends: 94 [2025-03-09 04:40:58,229 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 04:40:58,231 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 35 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 04:40:58,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 200 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 04:40:58,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-09 04:40:58,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-03-09 04:40:58,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 80 states have (on average 1.4625) internal successors, (117), 87 states have internal predecessors, (117), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 04:40:58,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 129 transitions. [2025-03-09 04:40:58,242 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 129 transitions. Word has length 20 [2025-03-09 04:40:58,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 04:40:58,244 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 129 transitions. [2025-03-09 04:40:58,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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 04:40:58,245 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 129 transitions. [2025-03-09 04:40:58,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-09 04:40:58,245 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 04:40:58,245 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 04:40:58,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 04:40:58,245 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 04:40:58,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 04:40:58,246 INFO L85 PathProgramCache]: Analyzing trace with hash 437172021, now seen corresponding path program 1 times [2025-03-09 04:40:58,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 04:40:58,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628891501] [2025-03-09 04:40:58,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 04:40:58,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 04:40:58,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 04:40:58,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 04:40:58,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 04:40:58,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 04:40:58,325 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 04:40:58,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 04:40:58,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628891501] [2025-03-09 04:40:58,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628891501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 04:40:58,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 04:40:58,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 04:40:58,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632653199] [2025-03-09 04:40:58,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 04:40:58,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 04:40:58,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 04:40:58,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 04:40:58,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 04:40:58,328 INFO L87 Difference]: Start difference. First operand 94 states and 129 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 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 04:40:58,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 04:40:58,364 INFO L93 Difference]: Finished difference Result 94 states and 129 transitions. [2025-03-09 04:40:58,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 04:40:58,364 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 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 29 [2025-03-09 04:40:58,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 04:40:58,365 INFO L225 Difference]: With dead ends: 94 [2025-03-09 04:40:58,366 INFO L226 Difference]: Without dead ends: 93 [2025-03-09 04:40:58,366 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 04:40:58,367 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 1 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 04:40:58,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 225 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 04:40:58,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-09 04:40:58,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-09 04:40:58,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 80 states have (on average 1.45) internal successors, (116), 86 states have internal predecessors, (116), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 04:40:58,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 128 transitions. [2025-03-09 04:40:58,374 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 128 transitions. Word has length 29 [2025-03-09 04:40:58,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 04:40:58,374 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 128 transitions. [2025-03-09 04:40:58,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 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 04:40:58,375 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 128 transitions. [2025-03-09 04:40:58,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 04:40:58,376 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 04:40:58,376 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 04:40:58,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 04:40:58,376 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 04:40:58,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 04:40:58,377 INFO L85 PathProgramCache]: Analyzing trace with hash 667430774, now seen corresponding path program 1 times [2025-03-09 04:40:58,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 04:40:58,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489640495] [2025-03-09 04:40:58,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 04:40:58,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 04:40:58,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 04:40:58,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 04:40:58,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 04:40:58,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 04:40:58,430 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 04:40:58,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 04:40:58,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489640495] [2025-03-09 04:40:58,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489640495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 04:40:58,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 04:40:58,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 04:40:58,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560607671] [2025-03-09 04:40:58,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 04:40:58,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 04:40:58,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 04:40:58,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 04:40:58,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 04:40:58,431 INFO L87 Difference]: Start difference. First operand 93 states and 128 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, (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 04:40:58,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 04:40:58,451 INFO L93 Difference]: Finished difference Result 93 states and 128 transitions. [2025-03-09 04:40:58,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 04:40:58,451 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, (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 30 [2025-03-09 04:40:58,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 04:40:58,452 INFO L225 Difference]: With dead ends: 93 [2025-03-09 04:40:58,452 INFO L226 Difference]: Without dead ends: 92 [2025-03-09 04:40:58,452 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 04:40:58,453 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 35 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 04:40:58,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 196 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 04:40:58,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-09 04:40:58,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-03-09 04:40:58,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 80 states have (on average 1.4375) internal successors, (115), 85 states have internal predecessors, (115), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 04:40:58,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 127 transitions. [2025-03-09 04:40:58,457 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 127 transitions. Word has length 30 [2025-03-09 04:40:58,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 04:40:58,457 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 127 transitions. [2025-03-09 04:40:58,457 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, (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 04:40:58,457 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 127 transitions. [2025-03-09 04:40:58,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-09 04:40:58,458 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 04:40:58,458 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 04:40:58,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 04:40:58,458 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 04:40:58,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 04:40:58,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1471871498, now seen corresponding path program 1 times [2025-03-09 04:40:58,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 04:40:58,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102482211] [2025-03-09 04:40:58,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 04:40:58,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 04:40:58,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-09 04:40:58,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 04:40:58,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 04:40:58,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 04:40:58,496 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 04:40:58,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 04:40:58,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102482211] [2025-03-09 04:40:58,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102482211] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 04:40:58,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 04:40:58,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 04:40:58,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81013376] [2025-03-09 04:40:58,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 04:40:58,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 04:40:58,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 04:40:58,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 04:40:58,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 04:40:58,501 INFO L87 Difference]: Start difference. First operand 92 states and 127 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 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 04:40:58,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 04:40:58,529 INFO L93 Difference]: Finished difference Result 100 states and 134 transitions. [2025-03-09 04:40:58,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 04:40:58,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 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 32 [2025-03-09 04:40:58,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 04:40:58,530 INFO L225 Difference]: With dead ends: 100 [2025-03-09 04:40:58,531 INFO L226 Difference]: Without dead ends: 90 [2025-03-09 04:40:58,531 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 04:40:58,531 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 1 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 04:40:58,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 222 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 04:40:58,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-09 04:40:58,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-03-09 04:40:58,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 80 states have (on average 1.4) internal successors, (112), 83 states have internal predecessors, (112), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 04:40:58,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 124 transitions. [2025-03-09 04:40:58,538 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 124 transitions. Word has length 32 [2025-03-09 04:40:58,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 04:40:58,539 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 124 transitions. [2025-03-09 04:40:58,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 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 04:40:58,539 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 124 transitions. [2025-03-09 04:40:58,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-09 04:40:58,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 04:40:58,540 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 04:40:58,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 04:40:58,540 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 04:40:58,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 04:40:58,541 INFO L85 PathProgramCache]: Analyzing trace with hash 162682030, now seen corresponding path program 1 times [2025-03-09 04:40:58,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 04:40:58,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942320741] [2025-03-09 04:40:58,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 04:40:58,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 04:40:58,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-09 04:40:58,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-09 04:40:58,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 04:40:58,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 04:40:58,614 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 04:40:58,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 04:40:58,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942320741] [2025-03-09 04:40:58,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942320741] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 04:40:58,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 04:40:58,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 04:40:58,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159400654] [2025-03-09 04:40:58,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 04:40:58,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 04:40:58,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 04:40:58,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 04:40:58,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 04:40:58,616 INFO L87 Difference]: Start difference. First operand 90 states and 124 transitions. Second operand has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 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 04:40:58,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 04:40:58,638 INFO L93 Difference]: Finished difference Result 90 states and 124 transitions. [2025-03-09 04:40:58,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 04:40:58,638 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 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 43 [2025-03-09 04:40:58,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 04:40:58,638 INFO L225 Difference]: With dead ends: 90 [2025-03-09 04:40:58,638 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 04:40:58,639 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 04:40:58,639 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 1 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 04:40:58,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 221 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 04:40:58,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 04:40:58,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 04:40:58,641 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 04:40:58,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 04:40:58,641 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2025-03-09 04:40:58,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 04:40:58,641 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 04:40:58,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 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 04:40:58,642 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 04:40:58,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 04:40:58,644 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-03-09 04:40:58,644 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-03-09 04:40:58,644 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-03-09 04:40:58,644 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-03-09 04:40:58,644 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-03-09 04:40:58,644 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-03-09 04:40:58,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-03-09 04:40:58,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-03-09 04:40:58,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 04:40:58,647 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-09 04:40:58,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 04:40:58,680 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 04:40:58,685 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 04:40:58 BoogieIcfgContainer [2025-03-09 04:40:58,685 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 04:40:58,686 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 04:40:58,686 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 04:40:58,686 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 04:40:58,687 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 04:40:57" (3/4) ... [2025-03-09 04:40:58,688 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 04:40:58,692 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printLine [2025-03-09 04:40:58,692 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-03-09 04:40:58,699 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-09 04:40:58,699 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-03-09 04:40:58,700 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-09 04:40:58,700 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 04:40:58,773 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 04:40:58,773 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 04:40:58,773 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 04:40:58,774 INFO L158 Benchmark]: Toolchain (without parser) took 2346.54ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 105.1MB in the end (delta: 4.9MB). Peak memory consumption was 64.3MB. Max. memory is 16.1GB. [2025-03-09 04:40:58,774 INFO L158 Benchmark]: CDTParser took 0.52ms. Allocated memory is still 201.3MB. Free memory is still 122.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 04:40:58,774 INFO L158 Benchmark]: CACSL2BoogieTranslator took 669.57ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 50.8MB in the end (delta: 59.2MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-09 04:40:58,774 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.27ms. Allocated memory is still 142.6MB. Free memory was 50.8MB in the beginning and 47.3MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 04:40:58,774 INFO L158 Benchmark]: Boogie Preprocessor took 41.15ms. Allocated memory is still 142.6MB. Free memory was 47.3MB in the beginning and 45.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 04:40:58,775 INFO L158 Benchmark]: IcfgBuilder took 433.22ms. Allocated memory is still 142.6MB. Free memory was 45.3MB in the beginning and 89.6MB in the end (delta: -44.3MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. [2025-03-09 04:40:58,775 INFO L158 Benchmark]: TraceAbstraction took 1072.50ms. Allocated memory is still 142.6MB. Free memory was 88.8MB in the beginning and 53.7MB in the end (delta: 35.1MB). Peak memory consumption was 33.2MB. Max. memory is 16.1GB. [2025-03-09 04:40:58,775 INFO L158 Benchmark]: Witness Printer took 87.45ms. Allocated memory is still 142.6MB. Free memory was 53.7MB in the beginning and 105.1MB in the end (delta: -51.3MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. [2025-03-09 04:40:58,776 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.52ms. Allocated memory is still 201.3MB. Free memory is still 122.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 669.57ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 50.8MB in the end (delta: 59.2MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.27ms. Allocated memory is still 142.6MB. Free memory was 50.8MB in the beginning and 47.3MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.15ms. Allocated memory is still 142.6MB. Free memory was 47.3MB in the beginning and 45.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 433.22ms. Allocated memory is still 142.6MB. Free memory was 45.3MB in the beginning and 89.6MB in the end (delta: -44.3MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. * TraceAbstraction took 1072.50ms. Allocated memory is still 142.6MB. Free memory was 88.8MB in the beginning and 53.7MB in the end (delta: 35.1MB). Peak memory consumption was 33.2MB. Max. memory is 16.1GB. * Witness Printer took 87.45ms. Allocated memory is still 142.6MB. Free memory was 53.7MB in the beginning and 105.1MB in the end (delta: -51.3MB). Peak memory consumption was 8.6MB. 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: 1633]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1633]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1616]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1616]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1590]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1590]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1566]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1566]: 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, 107 locations, 165 edges, 8 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 213 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 213 mSDsluCounter, 1420 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 600 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 153 IncrementalHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 820 mSDtfsCounter, 153 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=0, InterpolantAutomatonStates: 21, 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, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 179 ConstructedInterpolants, 0 QuantifiedInterpolants, 215 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 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 04:40:58,788 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