./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_predec_02_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/CWE191_Integer_Underflow__int_min_predec_02_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 e83779e870c5df7283e67466f98073debb41c176396e4dd8d3d4b1cd532d7390 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 05:47:00,619 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 05:47:00,679 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-09 05:47:00,683 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 05:47:00,686 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 05:47:00,703 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 05:47:00,704 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 05:47:00,705 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 05:47:00,705 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 05:47:00,705 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 05:47:00,705 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 05:47:00,705 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 05:47:00,705 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 05:47:00,705 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 05:47:00,706 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 05:47:00,706 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 05:47:00,706 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 05:47:00,706 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 05:47:00,706 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 05:47:00,706 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 05:47:00,706 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 05:47:00,706 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 05:47:00,706 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 05:47:00,706 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 05:47:00,706 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 05:47:00,706 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 05:47:00,707 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 05:47:00,707 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 05:47:00,707 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 05:47:00,707 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 05:47:00,707 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 05:47:00,707 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 05:47:00,707 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 05:47:00,707 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 05:47:00,707 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 05:47:00,707 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 05:47:00,708 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 05:47:00,708 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 05:47:00,708 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 05:47:00,708 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 05:47:00,708 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 05:47:00,708 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 05:47:00,708 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 -> e83779e870c5df7283e67466f98073debb41c176396e4dd8d3d4b1cd532d7390 [2025-03-09 05:47:00,942 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 05:47:00,950 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 05:47:00,952 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 05:47:00,954 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 05:47:00,954 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 05:47:00,956 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_predec_02_good.i [2025-03-09 05:47:02,152 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fecea8b40/a17ae86d183644029f91ccf72cc3e657/FLAG435089527 [2025-03-09 05:47:02,506 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 05:47:02,506 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_predec_02_good.i [2025-03-09 05:47:02,524 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fecea8b40/a17ae86d183644029f91ccf72cc3e657/FLAG435089527 [2025-03-09 05:47:02,715 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fecea8b40/a17ae86d183644029f91ccf72cc3e657 [2025-03-09 05:47:02,716 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 05:47:02,717 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 05:47:02,718 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 05:47:02,718 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 05:47:02,721 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 05:47:02,721 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:47:02" (1/1) ... [2025-03-09 05:47:02,722 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ca826b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:47:02, skipping insertion in model container [2025-03-09 05:47:02,722 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:47:02" (1/1) ... [2025-03-09 05:47:02,760 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 05:47:03,341 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 05:47:03,348 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 05:47:03,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 05:47:03,518 INFO L204 MainTranslator]: Completed translation [2025-03-09 05:47:03,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:47:03 WrapperNode [2025-03-09 05:47:03,519 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 05:47:03,520 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 05:47:03,520 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 05:47:03,520 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 05:47:03,524 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:47:03" (1/1) ... [2025-03-09 05:47:03,537 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:47:03" (1/1) ... [2025-03-09 05:47:03,551 INFO L138 Inliner]: procedures = 501, calls = 38, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 89 [2025-03-09 05:47:03,551 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 05:47:03,552 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 05:47:03,552 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 05:47:03,552 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 05:47:03,558 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:47:03" (1/1) ... [2025-03-09 05:47:03,559 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:47:03" (1/1) ... [2025-03-09 05:47:03,565 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:47:03" (1/1) ... [2025-03-09 05:47:03,574 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-09 05:47:03,578 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:47:03" (1/1) ... [2025-03-09 05:47:03,578 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:47:03" (1/1) ... [2025-03-09 05:47:03,584 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:47:03" (1/1) ... [2025-03-09 05:47:03,585 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:47:03" (1/1) ... [2025-03-09 05:47:03,585 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:47:03" (1/1) ... [2025-03-09 05:47:03,586 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:47:03" (1/1) ... [2025-03-09 05:47:03,591 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 05:47:03,592 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 05:47:03,592 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 05:47:03,592 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 05:47:03,593 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:47:03" (1/1) ... [2025-03-09 05:47:03,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 05:47:03,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:47:03,619 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 05:47:03,633 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 05:47:03,650 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-03-09 05:47:03,651 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-03-09 05:47:03,651 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-03-09 05:47:03,651 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-03-09 05:47:03,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 05:47:03,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 05:47:03,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 05:47:03,759 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 05:47:03,761 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 05:47:03,850 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-03-09 05:47:03,850 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 05:47:03,860 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 05:47:03,860 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 05:47:03,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:47:03 BoogieIcfgContainer [2025-03-09 05:47:03,861 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 05:47:03,863 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 05:47:03,863 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 05:47:03,866 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 05:47:03,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 05:47:02" (1/3) ... [2025-03-09 05:47:03,868 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b676f39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:47:03, skipping insertion in model container [2025-03-09 05:47:03,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:47:03" (2/3) ... [2025-03-09 05:47:03,869 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b676f39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:47:03, skipping insertion in model container [2025-03-09 05:47:03,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:47:03" (3/3) ... [2025-03-09 05:47:03,870 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_min_predec_02_good.i [2025-03-09 05:47:03,883 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 05:47:03,884 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE191_Integer_Underflow__int_min_predec_02_good.i that has 3 procedures, 59 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-03-09 05:47:03,929 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 05:47:03,944 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;@10ed4769, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 05:47:03,945 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-09 05:47:03,956 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 38 states have (on average 1.5) internal successors, (57), 50 states have internal predecessors, (57), 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 05:47:03,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-09 05:47:03,965 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:47:03,966 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:47:03,966 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 05:47:03,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:47:03,971 INFO L85 PathProgramCache]: Analyzing trace with hash 676505076, now seen corresponding path program 1 times [2025-03-09 05:47:03,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:47:03,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215620349] [2025-03-09 05:47:03,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:47:03,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:47:04,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 05:47:04,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 05:47:04,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:47:04,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:47:04,192 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 05:47:04,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:47:04,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215620349] [2025-03-09 05:47:04,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215620349] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:47:04,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:47:04,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 05:47:04,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66151696] [2025-03-09 05:47:04,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:47:04,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:47:04,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:47:04,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:47:04,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:47:04,216 INFO L87 Difference]: Start difference. First operand has 59 states, 38 states have (on average 1.5) internal successors, (57), 50 states have internal predecessors, (57), 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 05:47:04,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:47:04,242 INFO L93 Difference]: Finished difference Result 105 states and 136 transitions. [2025-03-09 05:47:04,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:47:04,244 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 05:47:04,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:47:04,248 INFO L225 Difference]: With dead ends: 105 [2025-03-09 05:47:04,248 INFO L226 Difference]: Without dead ends: 42 [2025-03-09 05:47:04,250 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 05:47:04,255 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:47:04,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:47:04,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-09 05:47:04,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-03-09 05:47:04,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 35 states have internal predecessors, (36), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 05:47:04,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2025-03-09 05:47:04,282 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 12 [2025-03-09 05:47:04,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:47:04,283 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2025-03-09 05:47:04,284 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 05:47:04,284 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2025-03-09 05:47:04,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-09 05:47:04,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:47:04,285 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:47:04,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 05:47:04,286 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 05:47:04,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:47:04,287 INFO L85 PathProgramCache]: Analyzing trace with hash -603011060, now seen corresponding path program 1 times [2025-03-09 05:47:04,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:47:04,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763515865] [2025-03-09 05:47:04,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:47:04,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:47:04,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 05:47:04,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 05:47:04,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:47:04,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:47:04,368 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 05:47:04,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:47:04,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763515865] [2025-03-09 05:47:04,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763515865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:47:04,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:47:04,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 05:47:04,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100454681] [2025-03-09 05:47:04,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:47:04,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:47:04,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:47:04,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:47:04,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:47:04,372 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 05:47:04,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:47:04,384 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2025-03-09 05:47:04,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:47:04,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 21 [2025-03-09 05:47:04,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:47:04,385 INFO L225 Difference]: With dead ends: 61 [2025-03-09 05:47:04,385 INFO L226 Difference]: Without dead ends: 36 [2025-03-09 05:47:04,386 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 05:47:04,386 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:47:04,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:47:04,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-09 05:47:04,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-09 05:47:04,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 29 states have internal predecessors, (30), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 05:47:04,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2025-03-09 05:47:04,391 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 21 [2025-03-09 05:47:04,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:47:04,391 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2025-03-09 05:47:04,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 05:47:04,391 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2025-03-09 05:47:04,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-09 05:47:04,393 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:47:04,393 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] [2025-03-09 05:47:04,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 05:47:04,394 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 05:47:04,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:47:04,395 INFO L85 PathProgramCache]: Analyzing trace with hash 666369048, now seen corresponding path program 1 times [2025-03-09 05:47:04,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:47:04,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074906482] [2025-03-09 05:47:04,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:47:04,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:47:04,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 05:47:04,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 05:47:04,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:47:04,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:47:04,474 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 05:47:04,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:47:04,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074906482] [2025-03-09 05:47:04,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074906482] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:47:04,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:47:04,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:47:04,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183830312] [2025-03-09 05:47:04,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:47:04,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:47:04,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:47:04,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:47:04,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:47:04,478 INFO L87 Difference]: Start difference. First operand 36 states and 38 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, (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 05:47:04,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:47:04,492 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2025-03-09 05:47:04,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:47:04,493 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, (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 29 [2025-03-09 05:47:04,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:47:04,494 INFO L225 Difference]: With dead ends: 36 [2025-03-09 05:47:04,494 INFO L226 Difference]: Without dead ends: 35 [2025-03-09 05:47:04,494 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 05:47:04,495 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:47:04,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 64 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:47:04,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-09 05:47:04,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-03-09 05:47:04,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 28 states have internal predecessors, (29), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 05:47:04,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2025-03-09 05:47:04,502 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 29 [2025-03-09 05:47:04,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:47:04,503 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2025-03-09 05:47:04,503 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, (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 05:47:04,503 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2025-03-09 05:47:04,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 05:47:04,504 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:47:04,505 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] [2025-03-09 05:47:04,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 05:47:04,505 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 05:47:04,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:47:04,506 INFO L85 PathProgramCache]: Analyzing trace with hash -817395997, now seen corresponding path program 1 times [2025-03-09 05:47:04,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:47:04,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144219332] [2025-03-09 05:47:04,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:47:04,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:47:04,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 05:47:04,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 05:47:04,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:47:04,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:47:04,572 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 05:47:04,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:47:04,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144219332] [2025-03-09 05:47:04,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144219332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:47:04,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:47:04,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:47:04,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566712065] [2025-03-09 05:47:04,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:47:04,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:47:04,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:47:04,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:47:04,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:47:04,574 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (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 05:47:04,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:47:04,585 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2025-03-09 05:47:04,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:47:04,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (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 30 [2025-03-09 05:47:04,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:47:04,586 INFO L225 Difference]: With dead ends: 35 [2025-03-09 05:47:04,587 INFO L226 Difference]: Without dead ends: 34 [2025-03-09 05:47:04,587 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 05:47:04,588 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:47:04,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:47:04,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-09 05:47:04,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-03-09 05:47:04,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 27 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 05:47:04,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2025-03-09 05:47:04,592 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 30 [2025-03-09 05:47:04,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:47:04,592 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2025-03-09 05:47:04,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (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 05:47:04,593 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2025-03-09 05:47:04,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-09 05:47:04,593 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:47:04,593 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] [2025-03-09 05:47:04,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 05:47:04,594 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 05:47:04,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:47:04,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1674074834, now seen corresponding path program 1 times [2025-03-09 05:47:04,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:47:04,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305270702] [2025-03-09 05:47:04,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:47:04,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:47:04,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-09 05:47:04,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-09 05:47:04,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:47:04,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:47:04,666 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 05:47:04,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:47:04,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305270702] [2025-03-09 05:47:04,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305270702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:47:04,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:47:04,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:47:04,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790667778] [2025-03-09 05:47:04,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:47:04,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:47:04,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:47:04,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:47:04,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:47:04,686 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (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 05:47:04,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:47:04,695 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2025-03-09 05:47:04,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:47:04,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (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 39 [2025-03-09 05:47:04,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:47:04,698 INFO L225 Difference]: With dead ends: 34 [2025-03-09 05:47:04,698 INFO L226 Difference]: Without dead ends: 33 [2025-03-09 05:47:04,698 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 05:47:04,699 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:47:04,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 63 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:47:04,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-09 05:47:04,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-03-09 05:47:04,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 05:47:04,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2025-03-09 05:47:04,705 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 39 [2025-03-09 05:47:04,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:47:04,705 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2025-03-09 05:47:04,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (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 05:47:04,705 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2025-03-09 05:47:04,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-09 05:47:04,706 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:47:04,706 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:47:04,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 05:47:04,706 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 05:47:04,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:47:04,706 INFO L85 PathProgramCache]: Analyzing trace with hash 356712286, now seen corresponding path program 1 times [2025-03-09 05:47:04,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:47:04,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155996106] [2025-03-09 05:47:04,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:47:04,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:47:04,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-09 05:47:04,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 05:47:04,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:47:04,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:47:04,759 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 05:47:04,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:47:04,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155996106] [2025-03-09 05:47:04,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155996106] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:47:04,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:47:04,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:47:04,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068377458] [2025-03-09 05:47:04,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:47:04,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:47:04,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:47:04,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:47:04,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:47:04,761 INFO L87 Difference]: Start difference. First operand 33 states and 35 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, (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 05:47:04,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:47:04,768 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2025-03-09 05:47:04,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:47:04,768 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, (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 40 [2025-03-09 05:47:04,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:47:04,768 INFO L225 Difference]: With dead ends: 33 [2025-03-09 05:47:04,768 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 05:47:04,769 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 05:47:04,770 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:47:04,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:47:04,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 05:47:04,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 05:47:04,772 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 05:47:04,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 05:47:04,772 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2025-03-09 05:47:04,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:47:04,772 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 05:47:04,772 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, (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 05:47:04,773 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 05:47:04,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 05:47:04,775 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-03-09 05:47:04,775 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-03-09 05:47:04,775 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-03-09 05:47:04,775 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-03-09 05:47:04,776 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-03-09 05:47:04,776 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-03-09 05:47:04,776 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-03-09 05:47:04,776 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-03-09 05:47:04,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 05:47:04,778 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-09 05:47:04,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 05:47:04,801 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 05:47:04,807 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 05:47:04 BoogieIcfgContainer [2025-03-09 05:47:04,807 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 05:47:04,808 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 05:47:04,808 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 05:47:04,808 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 05:47:04,808 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:47:03" (3/4) ... [2025-03-09 05:47:04,810 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 05:47:04,813 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printLine [2025-03-09 05:47:04,813 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-03-09 05:47:04,816 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-09 05:47:04,816 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-03-09 05:47:04,816 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-09 05:47:04,816 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 05:47:04,877 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 05:47:04,877 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 05:47:04,877 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 05:47:04,879 INFO L158 Benchmark]: Toolchain (without parser) took 2160.94ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 91.9MB in the end (delta: 18.5MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. [2025-03-09 05:47:04,879 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 05:47:04,880 INFO L158 Benchmark]: CACSL2BoogieTranslator took 801.41ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 50.3MB in the end (delta: 60.1MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-03-09 05:47:04,880 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.73ms. Allocated memory is still 142.6MB. Free memory was 50.3MB in the beginning and 46.9MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 05:47:04,880 INFO L158 Benchmark]: Boogie Preprocessor took 39.33ms. Allocated memory is still 142.6MB. Free memory was 46.9MB in the beginning and 45.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 05:47:04,881 INFO L158 Benchmark]: IcfgBuilder took 269.06ms. Allocated memory is still 142.6MB. Free memory was 45.8MB in the beginning and 100.8MB in the end (delta: -55.0MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2025-03-09 05:47:04,881 INFO L158 Benchmark]: TraceAbstraction took 944.41ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 98.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.3MB. Max. memory is 16.1GB. [2025-03-09 05:47:04,881 INFO L158 Benchmark]: Witness Printer took 69.90ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 91.9MB in the end (delta: 6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 05:47:04,882 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.29ms. Allocated memory is still 201.3MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 801.41ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 50.3MB in the end (delta: 60.1MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.73ms. Allocated memory is still 142.6MB. Free memory was 50.3MB in the beginning and 46.9MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.33ms. Allocated memory is still 142.6MB. Free memory was 46.9MB in the beginning and 45.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 269.06ms. Allocated memory is still 142.6MB. Free memory was 45.8MB in the beginning and 100.8MB in the end (delta: -55.0MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. * TraceAbstraction took 944.41ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 98.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.3MB. Max. memory is 16.1GB. * Witness Printer took 69.90ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 91.9MB in the end (delta: 6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1628]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1628]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1611]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1611]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1586]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1586]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1564]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1564]: 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, 59 locations, 87 edges, 8 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 432 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 205 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24 IncrementalHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 227 mSDtfsCounter, 24 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=0, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 171 NumberOfCodeBlocks, 171 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 165 ConstructedInterpolants, 0 QuantifiedInterpolants, 221 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 52/52 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 05:47:04,898 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