./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_22_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 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_add_22_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 5b813d903352cf8cb710f0846bc7d64f26d06b58305e80ee472acca780e52098 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 17:43:19,231 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 17:43:19,282 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-17 17:43:19,286 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 17:43:19,287 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 17:43:19,305 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 17:43:19,305 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 17:43:19,306 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 17:43:19,306 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 17:43:19,306 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 17:43:19,306 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 17:43:19,306 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 17:43:19,307 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 17:43:19,307 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 17:43:19,307 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 17:43:19,307 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 17:43:19,308 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 17:43:19,308 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 17:43:19,308 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 17:43:19,308 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 17:43:19,308 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 17:43:19,308 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 17:43:19,308 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 17:43:19,308 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 17:43:19,308 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 17:43:19,308 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 17:43:19,308 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 17:43:19,309 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 17:43:19,309 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 17:43:19,309 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 17:43:19,309 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 17:43:19,309 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 17:43:19,309 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 17:43:19,309 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 17:43:19,309 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 17:43:19,309 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 17:43:19,309 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 17:43:19,309 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 17:43:19,309 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 17:43:19,309 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 17:43:19,309 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 17:43:19,309 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 17:43:19,309 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 -> 5b813d903352cf8cb710f0846bc7d64f26d06b58305e80ee472acca780e52098 [2025-03-17 17:43:19,529 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 17:43:19,534 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 17:43:19,536 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 17:43:19,537 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 17:43:19,537 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 17:43:19,538 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_add_22_good.i [2025-03-17 17:43:20,636 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45e8e55b0/3c909ad685ea4f27b561ce8d36e0ef84/FLAG58ac88da8 [2025-03-17 17:43:21,010 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 17:43:21,011 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_22_good.i [2025-03-17 17:43:21,038 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45e8e55b0/3c909ad685ea4f27b561ce8d36e0ef84/FLAG58ac88da8 [2025-03-17 17:43:21,209 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45e8e55b0/3c909ad685ea4f27b561ce8d36e0ef84 [2025-03-17 17:43:21,211 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 17:43:21,212 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 17:43:21,213 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 17:43:21,213 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 17:43:21,216 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 17:43:21,217 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:43:21" (1/1) ... [2025-03-17 17:43:21,217 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2db4a4c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:21, skipping insertion in model container [2025-03-17 17:43:21,217 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:43:21" (1/1) ... [2025-03-17 17:43:21,254 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 17:43:21,808 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 17:43:21,815 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 17:43:21,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 17:43:21,957 INFO L204 MainTranslator]: Completed translation [2025-03-17 17:43:21,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:21 WrapperNode [2025-03-17 17:43:21,958 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 17:43:21,959 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 17:43:21,959 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 17:43:21,959 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 17:43:21,963 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:21" (1/1) ... [2025-03-17 17:43:21,976 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:21" (1/1) ... [2025-03-17 17:43:21,992 INFO L138 Inliner]: procedures = 503, calls = 37, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 189 [2025-03-17 17:43:21,993 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 17:43:21,994 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 17:43:21,994 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 17:43:21,994 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 17:43:22,000 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:21" (1/1) ... [2025-03-17 17:43:22,001 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:21" (1/1) ... [2025-03-17 17:43:22,003 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:21" (1/1) ... [2025-03-17 17:43:22,010 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-17 17:43:22,010 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:21" (1/1) ... [2025-03-17 17:43:22,011 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:21" (1/1) ... [2025-03-17 17:43:22,014 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:21" (1/1) ... [2025-03-17 17:43:22,015 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:21" (1/1) ... [2025-03-17 17:43:22,016 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:21" (1/1) ... [2025-03-17 17:43:22,017 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:21" (1/1) ... [2025-03-17 17:43:22,019 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 17:43:22,019 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 17:43:22,020 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 17:43:22,020 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 17:43:22,020 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:21" (1/1) ... [2025-03-17 17:43:22,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 17:43:22,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 17:43:22,059 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-17 17:43:22,063 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-17 17:43:22,077 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-03-17 17:43:22,077 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-03-17 17:43:22,077 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-03-17 17:43:22,077 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-03-17 17:43:22,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 17:43:22,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 17:43:22,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 17:43:22,195 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 17:43:22,197 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 17:43:22,455 INFO L? ?]: Removed 105 outVars from TransFormulas that were not future-live. [2025-03-17 17:43:22,456 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 17:43:22,470 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 17:43:22,470 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 17:43:22,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:43:22 BoogieIcfgContainer [2025-03-17 17:43:22,470 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 17:43:22,472 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 17:43:22,472 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 17:43:22,475 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 17:43:22,475 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:43:21" (1/3) ... [2025-03-17 17:43:22,475 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@266bfc1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:43:22, skipping insertion in model container [2025-03-17 17:43:22,475 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:21" (2/3) ... [2025-03-17 17:43:22,475 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@266bfc1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:43:22, skipping insertion in model container [2025-03-17 17:43:22,475 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:43:22" (3/3) ... [2025-03-17 17:43:22,476 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_add_22_good.i [2025-03-17 17:43:22,485 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 17:43:22,486 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE190_Integer_Overflow__int_rand_add_22_good.i that has 3 procedures, 87 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2025-03-17 17:43:22,515 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 17:43:22,522 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;@2b320bab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 17:43:22,523 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-17 17:43:22,525 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 70 states have (on average 1.542857142857143) internal successors, (108), 79 states have internal predecessors, (108), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 17:43:22,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-17 17:43:22,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 17:43:22,529 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 17:43:22,529 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 17:43:22,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 17:43:22,532 INFO L85 PathProgramCache]: Analyzing trace with hash 363450750, now seen corresponding path program 1 times [2025-03-17 17:43:22,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 17:43:22,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057277566] [2025-03-17 17:43:22,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 17:43:22,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 17:43:22,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 17:43:22,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 17:43:22,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 17:43:22,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 17:43:22,811 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-17 17:43:22,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 17:43:22,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057277566] [2025-03-17 17:43:22,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057277566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 17:43:22,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 17:43:22,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 17:43:22,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501164868] [2025-03-17 17:43:22,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 17:43:22,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 17:43:22,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 17:43:22,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 17:43:22,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 17:43:22,827 INFO L87 Difference]: Start difference. First operand has 87 states, 70 states have (on average 1.542857142857143) internal successors, (108), 79 states have internal predecessors, (108), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) 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-17 17:43:22,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 17:43:22,875 INFO L93 Difference]: Finished difference Result 88 states and 125 transitions. [2025-03-17 17:43:22,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 17:43:22,877 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-17 17:43:22,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 17:43:22,881 INFO L225 Difference]: With dead ends: 88 [2025-03-17 17:43:22,882 INFO L226 Difference]: Without dead ends: 80 [2025-03-17 17:43:22,885 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-17 17:43:22,888 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 2 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 17:43:22,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 216 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 17:43:22,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-17 17:43:22,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2025-03-17 17:43:22,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 66 states have (on average 1.5303030303030303) internal successors, (101), 73 states have internal predecessors, (101), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 17:43:22,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 113 transitions. [2025-03-17 17:43:22,927 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 113 transitions. Word has length 16 [2025-03-17 17:43:22,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 17:43:22,928 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 113 transitions. [2025-03-17 17:43:22,928 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-17 17:43:22,929 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 113 transitions. [2025-03-17 17:43:22,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-17 17:43:22,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 17:43:22,931 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 17:43:22,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 17:43:22,931 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 17:43:22,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 17:43:22,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1617928596, now seen corresponding path program 1 times [2025-03-17 17:43:22,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 17:43:22,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849604500] [2025-03-17 17:43:22,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 17:43:22,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 17:43:22,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 17:43:22,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 17:43:22,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 17:43:22,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 17:43:23,043 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-17 17:43:23,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 17:43:23,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849604500] [2025-03-17 17:43:23,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849604500] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 17:43:23,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 17:43:23,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 17:43:23,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457017753] [2025-03-17 17:43:23,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 17:43:23,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 17:43:23,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 17:43:23,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 17:43:23,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 17:43:23,048 INFO L87 Difference]: Start difference. First operand 79 states and 113 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-17 17:43:23,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 17:43:23,103 INFO L93 Difference]: Finished difference Result 79 states and 113 transitions. [2025-03-17 17:43:23,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 17:43:23,103 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-17 17:43:23,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 17:43:23,105 INFO L225 Difference]: With dead ends: 79 [2025-03-17 17:43:23,105 INFO L226 Difference]: Without dead ends: 78 [2025-03-17 17:43:23,105 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-17 17:43:23,105 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 17:43:23,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 200 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 17:43:23,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-17 17:43:23,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-03-17 17:43:23,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 66 states have (on average 1.5151515151515151) internal successors, (100), 72 states have internal predecessors, (100), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 17:43:23,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 112 transitions. [2025-03-17 17:43:23,115 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 112 transitions. Word has length 17 [2025-03-17 17:43:23,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 17:43:23,115 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 112 transitions. [2025-03-17 17:43:23,115 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-17 17:43:23,115 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 112 transitions. [2025-03-17 17:43:23,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 17:43:23,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 17:43:23,116 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-17 17:43:23,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 17:43:23,116 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 17:43:23,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 17:43:23,116 INFO L85 PathProgramCache]: Analyzing trace with hash 153602859, now seen corresponding path program 1 times [2025-03-17 17:43:23,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 17:43:23,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320495873] [2025-03-17 17:43:23,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 17:43:23,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 17:43:23,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 17:43:23,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 17:43:23,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 17:43:23,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 17:43:23,195 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-17 17:43:23,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 17:43:23,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320495873] [2025-03-17 17:43:23,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320495873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 17:43:23,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 17:43:23,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 17:43:23,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207544987] [2025-03-17 17:43:23,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 17:43:23,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 17:43:23,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 17:43:23,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 17:43:23,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 17:43:23,196 INFO L87 Difference]: Start difference. First operand 78 states and 112 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-17 17:43:23,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 17:43:23,221 INFO L93 Difference]: Finished difference Result 123 states and 172 transitions. [2025-03-17 17:43:23,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 17:43:23,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 29 [2025-03-17 17:43:23,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 17:43:23,222 INFO L225 Difference]: With dead ends: 123 [2025-03-17 17:43:23,222 INFO L226 Difference]: Without dead ends: 77 [2025-03-17 17:43:23,223 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-17 17:43:23,223 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 107 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 100 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-17 17:43:23,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 100 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 17:43:23,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-17 17:43:23,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-17 17:43:23,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 66 states have (on average 1.5) internal successors, (99), 71 states have internal predecessors, (99), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 17:43:23,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 109 transitions. [2025-03-17 17:43:23,229 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 109 transitions. Word has length 29 [2025-03-17 17:43:23,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 17:43:23,229 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 109 transitions. [2025-03-17 17:43:23,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-17 17:43:23,229 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 109 transitions. [2025-03-17 17:43:23,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-17 17:43:23,230 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 17:43:23,230 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-17 17:43:23,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 17:43:23,230 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 17:43:23,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 17:43:23,231 INFO L85 PathProgramCache]: Analyzing trace with hash -622316860, now seen corresponding path program 1 times [2025-03-17 17:43:23,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 17:43:23,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793919924] [2025-03-17 17:43:23,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 17:43:23,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 17:43:23,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 17:43:23,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 17:43:23,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 17:43:23,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 17:43:23,463 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-17 17:43:23,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 17:43:23,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793919924] [2025-03-17 17:43:23,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793919924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 17:43:23,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 17:43:23,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 17:43:23,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18847635] [2025-03-17 17:43:23,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 17:43:23,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 17:43:23,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 17:43:23,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 17:43:23,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 17:43:23,464 INFO L87 Difference]: Start difference. First operand 77 states and 109 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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-17 17:43:23,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 17:43:23,550 INFO L93 Difference]: Finished difference Result 85 states and 120 transitions. [2025-03-17 17:43:23,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 17:43:23,551 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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-17 17:43:23,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 17:43:23,552 INFO L225 Difference]: With dead ends: 85 [2025-03-17 17:43:23,552 INFO L226 Difference]: Without dead ends: 84 [2025-03-17 17:43:23,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 17:43:23,553 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 5 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 17:43:23,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 434 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 17:43:23,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-17 17:43:23,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2025-03-17 17:43:23,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 71 states have (on average 1.4929577464788732) internal successors, (106), 76 states have internal predecessors, (106), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 17:43:23,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 116 transitions. [2025-03-17 17:43:23,558 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 116 transitions. Word has length 30 [2025-03-17 17:43:23,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 17:43:23,559 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 116 transitions. [2025-03-17 17:43:23,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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-17 17:43:23,559 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 116 transitions. [2025-03-17 17:43:23,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-17 17:43:23,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 17:43:23,560 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-17 17:43:23,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 17:43:23,560 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 17:43:23,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 17:43:23,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1606353769, now seen corresponding path program 1 times [2025-03-17 17:43:23,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 17:43:23,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166516112] [2025-03-17 17:43:23,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 17:43:23,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 17:43:23,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 17:43:23,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 17:43:23,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 17:43:23,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 17:43:23,676 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-17 17:43:23,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 17:43:23,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166516112] [2025-03-17 17:43:23,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166516112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 17:43:23,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 17:43:23,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 17:43:23,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486415289] [2025-03-17 17:43:23,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 17:43:23,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 17:43:23,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 17:43:23,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 17:43:23,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 17:43:23,680 INFO L87 Difference]: Start difference. First operand 82 states and 116 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-17 17:43:23,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 17:43:23,711 INFO L93 Difference]: Finished difference Result 83 states and 117 transitions. [2025-03-17 17:43:23,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 17:43:23,712 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-17 17:43:23,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 17:43:23,713 INFO L225 Difference]: With dead ends: 83 [2025-03-17 17:43:23,715 INFO L226 Difference]: Without dead ends: 82 [2025-03-17 17:43:23,715 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-17 17:43:23,716 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 2 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 17:43:23,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 186 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 17:43:23,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-17 17:43:23,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 76. [2025-03-17 17:43:23,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 70 states have internal predecessors, (98), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 17:43:23,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 108 transitions. [2025-03-17 17:43:23,726 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 108 transitions. Word has length 30 [2025-03-17 17:43:23,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 17:43:23,726 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 108 transitions. [2025-03-17 17:43:23,726 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-17 17:43:23,726 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 108 transitions. [2025-03-17 17:43:23,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-17 17:43:23,727 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 17:43:23,727 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] [2025-03-17 17:43:23,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 17:43:23,727 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 17:43:23,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 17:43:23,727 INFO L85 PathProgramCache]: Analyzing trace with hash -2111953486, now seen corresponding path program 1 times [2025-03-17 17:43:23,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 17:43:23,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605612658] [2025-03-17 17:43:23,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 17:43:23,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 17:43:23,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 17:43:23,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 17:43:23,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 17:43:23,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 17:43:23,756 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-17 17:43:23,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 17:43:23,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605612658] [2025-03-17 17:43:23,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605612658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 17:43:23,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 17:43:23,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 17:43:23,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634687937] [2025-03-17 17:43:23,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 17:43:23,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 17:43:23,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 17:43:23,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 17:43:23,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 17:43:23,758 INFO L87 Difference]: Start difference. First operand 76 states and 108 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 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-17 17:43:23,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 17:43:23,780 INFO L93 Difference]: Finished difference Result 76 states and 108 transitions. [2025-03-17 17:43:23,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 17:43:23,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 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 31 [2025-03-17 17:43:23,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 17:43:23,781 INFO L225 Difference]: With dead ends: 76 [2025-03-17 17:43:23,781 INFO L226 Difference]: Without dead ends: 75 [2025-03-17 17:43:23,782 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-17 17:43:23,782 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 0 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 17:43:23,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 190 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 17:43:23,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-17 17:43:23,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-03-17 17:43:23,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 66 states have (on average 1.4696969696969697) internal successors, (97), 69 states have internal predecessors, (97), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 17:43:23,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 107 transitions. [2025-03-17 17:43:23,786 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 107 transitions. Word has length 31 [2025-03-17 17:43:23,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 17:43:23,786 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 107 transitions. [2025-03-17 17:43:23,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 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-17 17:43:23,786 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 107 transitions. [2025-03-17 17:43:23,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-17 17:43:23,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 17:43:23,787 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] [2025-03-17 17:43:23,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 17:43:23,787 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 17:43:23,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 17:43:23,787 INFO L85 PathProgramCache]: Analyzing trace with hash -2111931607, now seen corresponding path program 1 times [2025-03-17 17:43:23,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 17:43:23,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377800786] [2025-03-17 17:43:23,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 17:43:23,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 17:43:23,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 17:43:23,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 17:43:23,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 17:43:23,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 17:43:23,858 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 17:43:23,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 17:43:23,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377800786] [2025-03-17 17:43:23,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377800786] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 17:43:23,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330672383] [2025-03-17 17:43:23,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 17:43:23,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 17:43:23,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 17:43:23,861 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 17:43:23,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 17:43:23,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 17:43:23,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 17:43:23,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 17:43:23,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 17:43:23,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 17:43:23,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 17:43:23,960 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-17 17:43:23,961 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 17:43:23,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330672383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 17:43:23,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 17:43:23,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-17 17:43:23,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540885657] [2025-03-17 17:43:23,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 17:43:23,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 17:43:23,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 17:43:23,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 17:43:23,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 17:43:23,964 INFO L87 Difference]: Start difference. First operand 75 states and 107 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-17 17:43:23,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 17:43:23,983 INFO L93 Difference]: Finished difference Result 88 states and 118 transitions. [2025-03-17 17:43:23,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 17:43:23,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 31 [2025-03-17 17:43:23,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 17:43:23,985 INFO L225 Difference]: With dead ends: 88 [2025-03-17 17:43:23,985 INFO L226 Difference]: Without dead ends: 82 [2025-03-17 17:43:23,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 17:43:23,987 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 21 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 17:43:23,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 184 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 17:43:23,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-17 17:43:23,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-03-17 17:43:23,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 71 states have (on average 1.4366197183098592) internal successors, (102), 74 states have internal predecessors, (102), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 17:43:23,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 112 transitions. [2025-03-17 17:43:23,992 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 112 transitions. Word has length 31 [2025-03-17 17:43:23,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 17:43:23,992 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 112 transitions. [2025-03-17 17:43:23,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-17 17:43:23,993 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 112 transitions. [2025-03-17 17:43:23,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-17 17:43:23,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 17:43:23,995 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] [2025-03-17 17:43:24,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 17:43:24,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 17:43:24,198 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 17:43:24,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 17:43:24,198 INFO L85 PathProgramCache]: Analyzing trace with hash 2094441540, now seen corresponding path program 1 times [2025-03-17 17:43:24,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 17:43:24,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053436060] [2025-03-17 17:43:24,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 17:43:24,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 17:43:24,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 17:43:24,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 17:43:24,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 17:43:24,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 17:43:24,251 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-17 17:43:24,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 17:43:24,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053436060] [2025-03-17 17:43:24,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053436060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 17:43:24,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 17:43:24,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 17:43:24,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320293929] [2025-03-17 17:43:24,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 17:43:24,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 17:43:24,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 17:43:24,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 17:43:24,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 17:43:24,254 INFO L87 Difference]: Start difference. First operand 82 states and 112 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 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-17 17:43:24,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 17:43:24,267 INFO L93 Difference]: Finished difference Result 82 states and 112 transitions. [2025-03-17 17:43:24,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 17:43:24,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 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 37 [2025-03-17 17:43:24,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 17:43:24,267 INFO L225 Difference]: With dead ends: 82 [2025-03-17 17:43:24,268 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 17:43:24,268 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-17 17:43:24,268 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 1 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 17:43:24,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 188 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 17:43:24,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 17:43:24,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 17:43:24,269 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-17 17:43:24,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 17:43:24,269 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2025-03-17 17:43:24,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 17:43:24,269 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 17:43:24,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 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-17 17:43:24,269 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 17:43:24,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 17:43:24,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-03-17 17:43:24,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-03-17 17:43:24,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-03-17 17:43:24,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-03-17 17:43:24,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-03-17 17:43:24,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-03-17 17:43:24,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 17:43:24,276 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 17:43:24,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 17:43:24,306 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 17:43:24,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 05:43:24 BoogieIcfgContainer [2025-03-17 17:43:24,309 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 17:43:24,310 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 17:43:24,310 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 17:43:24,310 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 17:43:24,310 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:43:22" (3/4) ... [2025-03-17 17:43:24,312 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 17:43:24,322 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printLine [2025-03-17 17:43:24,322 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-03-17 17:43:24,334 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-03-17 17:43:24,335 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-17 17:43:24,335 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 17:43:24,335 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 17:43:24,405 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 17:43:24,406 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 17:43:24,406 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 17:43:24,407 INFO L158 Benchmark]: Toolchain (without parser) took 3194.44ms. Allocated memory is still 142.6MB. Free memory was 101.9MB in the beginning and 98.9MB in the end (delta: 3.0MB). Peak memory consumption was 79.7MB. Max. memory is 16.1GB. [2025-03-17 17:43:24,407 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 17:43:24,407 INFO L158 Benchmark]: CACSL2BoogieTranslator took 745.12ms. Allocated memory is still 142.6MB. Free memory was 101.9MB in the beginning and 40.1MB in the end (delta: 61.8MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-03-17 17:43:24,407 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.26ms. Allocated memory is still 142.6MB. Free memory was 40.1MB in the beginning and 36.0MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 17:43:24,407 INFO L158 Benchmark]: Boogie Preprocessor took 25.38ms. Allocated memory is still 142.6MB. Free memory was 36.0MB in the beginning and 35.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 17:43:24,408 INFO L158 Benchmark]: IcfgBuilder took 450.72ms. Allocated memory is still 142.6MB. Free memory was 35.0MB in the beginning and 81.1MB in the end (delta: -46.1MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. [2025-03-17 17:43:24,408 INFO L158 Benchmark]: TraceAbstraction took 1837.73ms. Allocated memory is still 142.6MB. Free memory was 80.4MB in the beginning and 30.6MB in the end (delta: 49.7MB). Peak memory consumption was 49.5MB. Max. memory is 16.1GB. [2025-03-17 17:43:24,408 INFO L158 Benchmark]: Witness Printer took 96.21ms. Allocated memory is still 142.6MB. Free memory was 30.6MB in the beginning and 98.9MB in the end (delta: -68.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 17:43:24,409 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.22ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 745.12ms. Allocated memory is still 142.6MB. Free memory was 101.9MB in the beginning and 40.1MB in the end (delta: 61.8MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.26ms. Allocated memory is still 142.6MB. Free memory was 40.1MB in the beginning and 36.0MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.38ms. Allocated memory is still 142.6MB. Free memory was 36.0MB in the beginning and 35.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 450.72ms. Allocated memory is still 142.6MB. Free memory was 35.0MB in the beginning and 81.1MB in the end (delta: -46.1MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1837.73ms. Allocated memory is still 142.6MB. Free memory was 80.4MB in the beginning and 30.6MB in the end (delta: 49.7MB). Peak memory consumption was 49.5MB. Max. memory is 16.1GB. * Witness Printer took 96.21ms. Allocated memory is still 142.6MB. Free memory was 30.6MB in the beginning and 98.9MB in the end (delta: -68.2MB). 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: 1634]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1634]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1620]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1620]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1605]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1605]: 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, 132 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 139 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 138 mSDsluCounter, 1698 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 906 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 244 IncrementalHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 792 mSDtfsCounter, 244 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=0, InterpolantAutomatonStates: 27, 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, 8 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 252 NumberOfCodeBlocks, 252 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 243 ConstructedInterpolants, 0 QuantifiedInterpolants, 332 SizeOfPredicates, 0 NumberOfNonLiveVariables, 158 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 9 InterpolantComputations, 8 PerfectInterpolantSequences, 33/36 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 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 17:43:24,423 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