./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_04_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_04_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 83a476f7230972f2bd32ac165bdd81b2702503a3b7501d64fea6d186c4e0b266 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 04:42:09,563 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 04:42:09,600 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-09 04:42:09,603 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 04:42:09,604 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 04:42:09,619 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 04:42:09,619 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 04:42:09,619 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 04:42:09,619 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 04:42:09,619 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 04:42:09,619 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 04:42:09,619 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 04:42:09,620 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 04:42:09,620 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 04:42:09,620 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 04:42:09,620 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 04:42:09,620 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 04:42:09,620 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 04:42:09,620 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 04:42:09,620 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 04:42:09,620 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 04:42:09,620 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 04:42:09,620 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 04:42:09,620 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 04:42:09,620 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 04:42:09,620 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 04:42:09,621 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 04:42:09,621 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 04:42:09,621 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 04:42:09,621 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 04:42:09,621 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 04:42:09,621 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 04:42:09,621 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 04:42:09,621 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 04:42:09,621 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 04:42:09,621 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 04:42:09,621 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 04:42:09,621 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 04:42:09,621 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 04:42:09,621 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 04:42:09,621 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 04:42:09,621 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 04:42:09,621 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 -> 83a476f7230972f2bd32ac165bdd81b2702503a3b7501d64fea6d186c4e0b266 [2025-03-09 04:42:09,818 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 04:42:09,823 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 04:42:09,824 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 04:42:09,825 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 04:42:09,825 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 04:42:09,825 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_preinc_04_good.i [2025-03-09 04:42:10,972 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2d301985/4ad12cd07e9044f4ac51b0c3f0398710/FLAGd718ca112 [2025-03-09 04:42:11,286 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 04:42:11,289 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_04_good.i [2025-03-09 04:42:11,306 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2d301985/4ad12cd07e9044f4ac51b0c3f0398710/FLAGd718ca112 [2025-03-09 04:42:11,536 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2d301985/4ad12cd07e9044f4ac51b0c3f0398710 [2025-03-09 04:42:11,538 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 04:42:11,539 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 04:42:11,541 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 04:42:11,541 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 04:42:11,548 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 04:42:11,549 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 04:42:11" (1/1) ... [2025-03-09 04:42:11,549 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b7aad5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:42:11, skipping insertion in model container [2025-03-09 04:42:11,549 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 04:42:11" (1/1) ... [2025-03-09 04:42:11,592 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 04:42:12,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 04:42:12,213 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 04:42:12,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 04:42:12,361 INFO L204 MainTranslator]: Completed translation [2025-03-09 04:42:12,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:42:12 WrapperNode [2025-03-09 04:42:12,362 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 04:42:12,363 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 04:42:12,363 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 04:42:12,363 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 04:42:12,368 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:42:12" (1/1) ... [2025-03-09 04:42:12,385 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:42:12" (1/1) ... [2025-03-09 04:42:12,405 INFO L138 Inliner]: procedures = 501, calls = 38, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 207 [2025-03-09 04:42:12,405 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 04:42:12,405 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 04:42:12,406 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 04:42:12,406 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 04:42:12,411 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:42:12" (1/1) ... [2025-03-09 04:42:12,412 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:42:12" (1/1) ... [2025-03-09 04:42:12,414 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:42:12" (1/1) ... [2025-03-09 04:42:12,421 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-09 04:42:12,423 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:42:12" (1/1) ... [2025-03-09 04:42:12,423 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:42:12" (1/1) ... [2025-03-09 04:42:12,428 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:42:12" (1/1) ... [2025-03-09 04:42:12,429 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:42:12" (1/1) ... [2025-03-09 04:42:12,430 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:42:12" (1/1) ... [2025-03-09 04:42:12,431 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:42:12" (1/1) ... [2025-03-09 04:42:12,433 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 04:42:12,433 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 04:42:12,433 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 04:42:12,434 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 04:42:12,434 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:42:12" (1/1) ... [2025-03-09 04:42:12,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 04:42:12,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 04:42:12,470 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 04:42:12,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 04:42:12,490 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-03-09 04:42:12,490 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-03-09 04:42:12,490 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-03-09 04:42:12,490 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-03-09 04:42:12,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 04:42:12,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 04:42:12,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 04:42:12,602 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 04:42:12,603 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 04:42:12,910 INFO L? ?]: Removed 100 outVars from TransFormulas that were not future-live. [2025-03-09 04:42:12,910 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 04:42:12,934 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 04:42:12,934 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 04:42:12,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 04:42:12 BoogieIcfgContainer [2025-03-09 04:42:12,934 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 04:42:12,936 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 04:42:12,936 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 04:42:12,939 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 04:42:12,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 04:42:11" (1/3) ... [2025-03-09 04:42:12,940 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75fbb009 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 04:42:12, skipping insertion in model container [2025-03-09 04:42:12,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:42:12" (2/3) ... [2025-03-09 04:42:12,940 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75fbb009 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 04:42:12, skipping insertion in model container [2025-03-09 04:42:12,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 04:42:12" (3/3) ... [2025-03-09 04:42:12,941 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_preinc_04_good.i [2025-03-09 04:42:12,953 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 04:42:12,955 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE190_Integer_Overflow__int_rand_preinc_04_good.i that has 3 procedures, 103 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-03-09 04:42:13,005 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 04:42:13,014 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;@15934d94, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 04:42:13,015 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-09 04:42:13,018 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 82 states have (on average 1.548780487804878) internal successors, (127), 94 states have internal predecessors, (127), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-09 04:42:13,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-09 04:42:13,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 04:42:13,024 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 04:42:13,024 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 04:42:13,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 04:42:13,028 INFO L85 PathProgramCache]: Analyzing trace with hash -703880834, now seen corresponding path program 1 times [2025-03-09 04:42:13,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 04:42:13,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219046475] [2025-03-09 04:42:13,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 04:42:13,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 04:42:13,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 04:42:13,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 04:42:13,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 04:42:13,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 04:42:13,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 04:42:13,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 04:42:13,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219046475] [2025-03-09 04:42:13,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219046475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 04:42:13,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 04:42:13,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 04:42:13,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303803237] [2025-03-09 04:42:13,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 04:42:13,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 04:42:13,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 04:42:13,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 04:42:13,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 04:42:13,247 INFO L87 Difference]: Start difference. First operand has 103 states, 82 states have (on average 1.548780487804878) internal successors, (127), 94 states have internal predecessors, (127), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 04:42:13,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 04:42:13,304 INFO L93 Difference]: Finished difference Result 179 states and 252 transitions. [2025-03-09 04:42:13,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 04:42:13,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-03-09 04:42:13,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 04:42:13,313 INFO L225 Difference]: With dead ends: 179 [2025-03-09 04:42:13,313 INFO L226 Difference]: Without dead ends: 94 [2025-03-09 04:42:13,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 04:42:13,318 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 137 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 04:42:13,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 127 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 04:42:13,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-09 04:42:13,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-03-09 04:42:13,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 76 states have (on average 1.5) internal successors, (114), 87 states have internal predecessors, (114), 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-09 04:42:13,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 130 transitions. [2025-03-09 04:42:13,355 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 130 transitions. Word has length 12 [2025-03-09 04:42:13,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 04:42:13,356 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 130 transitions. [2025-03-09 04:42:13,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 04:42:13,357 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 130 transitions. [2025-03-09 04:42:13,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-09 04:42:13,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 04:42:13,357 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 04:42:13,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 04:42:13,358 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 04:42:13,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 04:42:13,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1875977488, now seen corresponding path program 1 times [2025-03-09 04:42:13,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 04:42:13,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525364772] [2025-03-09 04:42:13,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 04:42:13,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 04:42:13,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 04:42:13,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 04:42:13,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 04:42:13,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 04:42:13,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 04:42:13,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 04:42:13,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525364772] [2025-03-09 04:42:13,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525364772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 04:42:13,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 04:42:13,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 04:42:13,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192856886] [2025-03-09 04:42:13,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 04:42:13,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 04:42:13,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 04:42:13,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 04:42:13,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 04:42:13,582 INFO L87 Difference]: Start difference. First operand 94 states and 130 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 04:42:13,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 04:42:13,697 INFO L93 Difference]: Finished difference Result 103 states and 143 transitions. [2025-03-09 04:42:13,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 04:42:13,697 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2025-03-09 04:42:13,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 04:42:13,698 INFO L225 Difference]: With dead ends: 103 [2025-03-09 04:42:13,699 INFO L226 Difference]: Without dead ends: 102 [2025-03-09 04:42:13,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-09 04:42:13,700 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 41 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 04:42:13,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 514 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 04:42:13,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-09 04:42:13,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 99. [2025-03-09 04:42:13,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 81 states have (on average 1.4938271604938271) internal successors, (121), 92 states have internal predecessors, (121), 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-09 04:42:13,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 137 transitions. [2025-03-09 04:42:13,712 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 137 transitions. Word has length 18 [2025-03-09 04:42:13,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 04:42:13,712 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 137 transitions. [2025-03-09 04:42:13,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 04:42:13,712 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 137 transitions. [2025-03-09 04:42:13,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-09 04:42:13,713 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 04:42:13,713 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 04:42:13,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 04:42:13,713 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 04:42:13,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 04:42:13,714 INFO L85 PathProgramCache]: Analyzing trace with hash 891940579, now seen corresponding path program 1 times [2025-03-09 04:42:13,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 04:42:13,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408690823] [2025-03-09 04:42:13,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 04:42:13,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 04:42:13,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 04:42:13,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 04:42:13,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 04:42:13,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 04:42:13,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 04:42:13,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 04:42:13,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408690823] [2025-03-09 04:42:13,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408690823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 04:42:13,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 04:42:13,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 04:42:13,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140663527] [2025-03-09 04:42:13,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 04:42:13,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 04:42:13,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 04:42:13,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 04:42:13,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 04:42:13,784 INFO L87 Difference]: Start difference. First operand 99 states and 137 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 04:42:13,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 04:42:13,830 INFO L93 Difference]: Finished difference Result 100 states and 138 transitions. [2025-03-09 04:42:13,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 04:42:13,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2025-03-09 04:42:13,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 04:42:13,832 INFO L225 Difference]: With dead ends: 100 [2025-03-09 04:42:13,833 INFO L226 Difference]: Without dead ends: 99 [2025-03-09 04:42:13,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 04:42:13,834 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 37 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 04:42:13,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 196 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 04:42:13,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-09 04:42:13,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 93. [2025-03-09 04:42:13,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 76 states have (on average 1.486842105263158) internal successors, (113), 86 states have internal predecessors, (113), 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-09 04:42:13,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 129 transitions. [2025-03-09 04:42:13,842 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 129 transitions. Word has length 18 [2025-03-09 04:42:13,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 04:42:13,844 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 129 transitions. [2025-03-09 04:42:13,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 04:42:13,844 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 129 transitions. [2025-03-09 04:42:13,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-09 04:42:13,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 04:42:13,845 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 04:42:13,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 04:42:13,845 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 04:42:13,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 04:42:13,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1974239955, now seen corresponding path program 1 times [2025-03-09 04:42:13,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 04:42:13,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728729367] [2025-03-09 04:42:13,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 04:42:13,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 04:42:13,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 04:42:13,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 04:42:13,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 04:42:13,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 04:42:13,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 04:42:13,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 04:42:13,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728729367] [2025-03-09 04:42:13,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728729367] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 04:42:13,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 04:42:13,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 04:42:13,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297613034] [2025-03-09 04:42:13,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 04:42:13,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 04:42:13,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 04:42:13,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 04:42:13,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 04:42:13,884 INFO L87 Difference]: Start difference. First operand 93 states and 129 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 04:42:13,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 04:42:13,908 INFO L93 Difference]: Finished difference Result 93 states and 129 transitions. [2025-03-09 04:42:13,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 04:42:13,908 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2025-03-09 04:42:13,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 04:42:13,909 INFO L225 Difference]: With dead ends: 93 [2025-03-09 04:42:13,909 INFO L226 Difference]: Without dead ends: 92 [2025-03-09 04:42:13,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 04:42:13,910 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 35 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 04:42:13,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 200 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 04:42:13,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-09 04:42:13,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-03-09 04:42:13,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 76 states have (on average 1.4736842105263157) internal successors, (112), 85 states have internal predecessors, (112), 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-09 04:42:13,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 128 transitions. [2025-03-09 04:42:13,915 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 128 transitions. Word has length 19 [2025-03-09 04:42:13,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 04:42:13,915 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 128 transitions. [2025-03-09 04:42:13,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 04:42:13,916 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 128 transitions. [2025-03-09 04:42:13,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-09 04:42:13,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 04:42:13,916 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 04:42:13,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 04:42:13,917 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 04:42:13,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 04:42:13,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1046574390, now seen corresponding path program 1 times [2025-03-09 04:42:13,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 04:42:13,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406457532] [2025-03-09 04:42:13,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 04:42:13,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 04:42:13,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-09 04:42:13,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 04:42:13,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 04:42:13,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 04:42:13,961 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 04:42:13,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 04:42:13,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406457532] [2025-03-09 04:42:13,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406457532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 04:42:13,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 04:42:13,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 04:42:13,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906891316] [2025-03-09 04:42:13,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 04:42:13,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 04:42:13,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 04:42:13,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 04:42:13,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 04:42:13,962 INFO L87 Difference]: Start difference. First operand 92 states and 128 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 04:42:13,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 04:42:13,979 INFO L93 Difference]: Finished difference Result 148 states and 200 transitions. [2025-03-09 04:42:13,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 04:42:13,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 32 [2025-03-09 04:42:13,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 04:42:13,980 INFO L225 Difference]: With dead ends: 148 [2025-03-09 04:42:13,980 INFO L226 Difference]: Without dead ends: 90 [2025-03-09 04:42:13,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 04:42:13,981 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 111 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 04:42:13,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 112 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 04:42:13,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-09 04:42:13,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-03-09 04:42:13,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 76 states have (on average 1.4473684210526316) internal successors, (110), 83 states have internal predecessors, (110), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 04:42:13,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 122 transitions. [2025-03-09 04:42:13,992 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 122 transitions. Word has length 32 [2025-03-09 04:42:13,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 04:42:13,992 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 122 transitions. [2025-03-09 04:42:13,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 04:42:13,992 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 122 transitions. [2025-03-09 04:42:13,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-09 04:42:13,993 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 04:42:13,993 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 04:42:13,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 04:42:13,993 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 04:42:13,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 04:42:13,993 INFO L85 PathProgramCache]: Analyzing trace with hash 110300588, now seen corresponding path program 1 times [2025-03-09 04:42:13,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 04:42:13,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782371595] [2025-03-09 04:42:13,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 04:42:13,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 04:42:14,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-09 04:42:14,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 04:42:14,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 04:42:14,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 04:42:14,084 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 04:42:14,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 04:42:14,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782371595] [2025-03-09 04:42:14,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782371595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 04:42:14,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 04:42:14,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 04:42:14,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197199639] [2025-03-09 04:42:14,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 04:42:14,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 04:42:14,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 04:42:14,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 04:42:14,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 04:42:14,088 INFO L87 Difference]: Start difference. First operand 90 states and 122 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 04:42:14,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 04:42:14,111 INFO L93 Difference]: Finished difference Result 90 states and 122 transitions. [2025-03-09 04:42:14,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 04:42:14,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (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 33 [2025-03-09 04:42:14,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 04:42:14,112 INFO L225 Difference]: With dead ends: 90 [2025-03-09 04:42:14,112 INFO L226 Difference]: Without dead ends: 89 [2025-03-09 04:42:14,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 04:42:14,113 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 36 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 04:42:14,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 181 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 04:42:14,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-09 04:42:14,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-03-09 04:42:14,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 82 states have internal predecessors, (109), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 04:42:14,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 121 transitions. [2025-03-09 04:42:14,124 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 121 transitions. Word has length 33 [2025-03-09 04:42:14,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 04:42:14,124 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 121 transitions. [2025-03-09 04:42:14,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 04:42:14,124 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 121 transitions. [2025-03-09 04:42:14,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-09 04:42:14,126 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 04:42:14,126 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 04:42:14,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 04:42:14,127 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 04:42:14,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 04:42:14,128 INFO L85 PathProgramCache]: Analyzing trace with hash -875649061, now seen corresponding path program 1 times [2025-03-09 04:42:14,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 04:42:14,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137669852] [2025-03-09 04:42:14,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 04:42:14,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 04:42:14,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 04:42:14,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 04:42:14,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 04:42:14,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 04:42:14,164 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 04:42:14,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 04:42:14,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137669852] [2025-03-09 04:42:14,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137669852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 04:42:14,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 04:42:14,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 04:42:14,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693605447] [2025-03-09 04:42:14,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 04:42:14,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 04:42:14,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 04:42:14,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 04:42:14,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 04:42:14,166 INFO L87 Difference]: Start difference. First operand 89 states and 121 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 04:42:14,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 04:42:14,189 INFO L93 Difference]: Finished difference Result 89 states and 121 transitions. [2025-03-09 04:42:14,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 04:42:14,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (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 34 [2025-03-09 04:42:14,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 04:42:14,190 INFO L225 Difference]: With dead ends: 89 [2025-03-09 04:42:14,190 INFO L226 Difference]: Without dead ends: 88 [2025-03-09 04:42:14,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 04:42:14,191 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 35 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 04:42:14,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 184 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 04:42:14,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-09 04:42:14,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-03-09 04:42:14,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 81 states have internal predecessors, (108), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 04:42:14,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 120 transitions. [2025-03-09 04:42:14,202 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 120 transitions. Word has length 34 [2025-03-09 04:42:14,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 04:42:14,202 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 120 transitions. [2025-03-09 04:42:14,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 04:42:14,202 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 120 transitions. [2025-03-09 04:42:14,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-09 04:42:14,202 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 04:42:14,203 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 04:42:14,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 04:42:14,203 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 04:42:14,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 04:42:14,203 INFO L85 PathProgramCache]: Analyzing trace with hash -602825388, now seen corresponding path program 1 times [2025-03-09 04:42:14,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 04:42:14,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516383566] [2025-03-09 04:42:14,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 04:42:14,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 04:42:14,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-09 04:42:14,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-09 04:42:14,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 04:42:14,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 04:42:14,247 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 04:42:14,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 04:42:14,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516383566] [2025-03-09 04:42:14,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516383566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 04:42:14,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 04:42:14,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 04:42:14,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747477516] [2025-03-09 04:42:14,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 04:42:14,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 04:42:14,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 04:42:14,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 04:42:14,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 04:42:14,249 INFO L87 Difference]: Start difference. First operand 88 states and 120 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 04:42:14,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 04:42:14,270 INFO L93 Difference]: Finished difference Result 88 states and 120 transitions. [2025-03-09 04:42:14,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 04:42:14,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 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 41 [2025-03-09 04:42:14,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 04:42:14,271 INFO L225 Difference]: With dead ends: 88 [2025-03-09 04:42:14,271 INFO L226 Difference]: Without dead ends: 86 [2025-03-09 04:42:14,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 04:42:14,272 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 1 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 04:42:14,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 212 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 04:42:14,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-09 04:42:14,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-03-09 04:42:14,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 76 states have (on average 1.394736842105263) internal successors, (106), 79 states have internal predecessors, (106), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 04:42:14,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 118 transitions. [2025-03-09 04:42:14,276 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 118 transitions. Word has length 41 [2025-03-09 04:42:14,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 04:42:14,276 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 118 transitions. [2025-03-09 04:42:14,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 04:42:14,276 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 118 transitions. [2025-03-09 04:42:14,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-09 04:42:14,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 04:42:14,277 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 04:42:14,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 04:42:14,277 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 04:42:14,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 04:42:14,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1462078514, now seen corresponding path program 1 times [2025-03-09 04:42:14,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 04:42:14,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12318228] [2025-03-09 04:42:14,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 04:42:14,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 04:42:14,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-09 04:42:14,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 04:42:14,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 04:42:14,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 04:42:14,347 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 04:42:14,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 04:42:14,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12318228] [2025-03-09 04:42:14,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12318228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 04:42:14,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 04:42:14,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 04:42:14,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700994227] [2025-03-09 04:42:14,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 04:42:14,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 04:42:14,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 04:42:14,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 04:42:14,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 04:42:14,348 INFO L87 Difference]: Start difference. First operand 86 states and 118 transitions. Second operand has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-09 04:42:14,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 04:42:14,365 INFO L93 Difference]: Finished difference Result 86 states and 118 transitions. [2025-03-09 04:42:14,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 04:42:14,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 51 [2025-03-09 04:42:14,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 04:42:14,366 INFO L225 Difference]: With dead ends: 86 [2025-03-09 04:42:14,366 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 04:42:14,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 04:42:14,367 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 1 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 04:42:14,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 211 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 04:42:14,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 04:42:14,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 04:42:14,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 04:42:14,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 04:42:14,368 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2025-03-09 04:42:14,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 04:42:14,368 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 04:42:14,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-09 04:42:14,368 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 04:42:14,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 04:42:14,370 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-03-09 04:42:14,370 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-03-09 04:42:14,371 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-03-09 04:42:14,371 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-03-09 04:42:14,371 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-03-09 04:42:14,371 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-03-09 04:42:14,371 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-03-09 04:42:14,371 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-03-09 04:42:14,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 04:42:14,373 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 04:42:14,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 04:42:14,441 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 04:42:14,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 04:42:14 BoogieIcfgContainer [2025-03-09 04:42:14,446 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 04:42:14,446 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 04:42:14,446 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 04:42:14,446 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 04:42:14,447 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 04:42:12" (3/4) ... [2025-03-09 04:42:14,448 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 04:42:14,452 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printLine [2025-03-09 04:42:14,452 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-03-09 04:42:14,455 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-09 04:42:14,456 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-03-09 04:42:14,456 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-09 04:42:14,456 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 04:42:14,518 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 04:42:14,518 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 04:42:14,518 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 04:42:14,519 INFO L158 Benchmark]: Toolchain (without parser) took 2979.30ms. Allocated memory is still 167.8MB. Free memory was 118.8MB in the beginning and 113.8MB in the end (delta: 5.0MB). Peak memory consumption was 3.1MB. Max. memory is 16.1GB. [2025-03-09 04:42:14,519 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 121.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 04:42:14,520 INFO L158 Benchmark]: CACSL2BoogieTranslator took 821.78ms. Allocated memory is still 167.8MB. Free memory was 118.5MB in the beginning and 57.3MB in the end (delta: 61.2MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-03-09 04:42:14,520 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.10ms. Allocated memory is still 167.8MB. Free memory was 57.3MB in the beginning and 54.0MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 04:42:14,520 INFO L158 Benchmark]: Boogie Preprocessor took 27.29ms. Allocated memory is still 167.8MB. Free memory was 54.0MB in the beginning and 52.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 04:42:14,521 INFO L158 Benchmark]: IcfgBuilder took 501.11ms. Allocated memory is still 167.8MB. Free memory was 52.1MB in the beginning and 113.3MB in the end (delta: -61.3MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB. [2025-03-09 04:42:14,521 INFO L158 Benchmark]: TraceAbstraction took 1509.83ms. Allocated memory is still 167.8MB. Free memory was 112.5MB in the beginning and 120.7MB in the end (delta: -8.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 04:42:14,521 INFO L158 Benchmark]: Witness Printer took 72.07ms. Allocated memory is still 167.8MB. Free memory was 120.7MB in the beginning and 113.8MB in the end (delta: 6.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 04:42:14,522 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.15ms. Allocated memory is still 201.3MB. Free memory is still 121.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 821.78ms. Allocated memory is still 167.8MB. Free memory was 118.5MB in the beginning and 57.3MB in the end (delta: 61.2MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.10ms. Allocated memory is still 167.8MB. Free memory was 57.3MB in the beginning and 54.0MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.29ms. Allocated memory is still 167.8MB. Free memory was 54.0MB in the beginning and 52.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 501.11ms. Allocated memory is still 167.8MB. Free memory was 52.1MB in the beginning and 113.3MB in the end (delta: -61.3MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1509.83ms. Allocated memory is still 167.8MB. Free memory was 112.5MB in the beginning and 120.7MB in the end (delta: -8.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 72.07ms. Allocated memory is still 167.8MB. Free memory was 120.7MB in the beginning and 113.8MB in the end (delta: 6.9MB). There was no memory consumed. 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: 1630]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1630]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1613]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1613]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1588]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1588]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1566]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1566]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 103 locations, 157 edges, 8 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 436 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 434 mSDsluCounter, 1937 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 919 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 241 IncrementalHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 1018 mSDtfsCounter, 241 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=0, InterpolantAutomatonStates: 30, 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, 9 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 258 NumberOfCodeBlocks, 258 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 249 ConstructedInterpolants, 0 QuantifiedInterpolants, 345 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 36/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 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-09 04:42:14,535 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