./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_sub_22_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_rand_sub_22_good.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 01fc94483e275b35551c05d85ddc470ce9e44963cb741226afe5c892aff574f7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 05:50:50,919 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 05:50:50,982 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-09 05:50:50,988 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 05:50:50,989 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 05:50:51,005 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 05:50:51,005 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 05:50:51,005 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 05:50:51,005 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 05:50:51,006 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 05:50:51,006 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 05:50:51,006 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 05:50:51,006 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 05:50:51,006 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 05:50:51,006 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 05:50:51,006 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 05:50:51,006 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 05:50:51,006 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 05:50:51,006 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 05:50:51,006 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 05:50:51,006 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 05:50:51,007 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 05:50:51,007 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 05:50:51,007 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 05:50:51,007 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 05:50:51,007 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 05:50:51,007 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 05:50:51,007 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 05:50:51,007 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 05:50:51,007 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 05:50:51,007 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 05:50:51,007 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 05:50:51,010 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 05:50:51,010 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 05:50:51,010 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 05:50:51,010 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 05:50:51,010 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 05:50:51,010 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 05:50:51,010 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 05:50:51,011 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 05:50:51,011 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 05:50:51,011 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 05:50:51,011 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 -> 01fc94483e275b35551c05d85ddc470ce9e44963cb741226afe5c892aff574f7 [2025-03-09 05:50:51,223 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 05:50:51,229 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 05:50:51,231 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 05:50:51,231 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 05:50:51,231 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 05:50:51,232 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_rand_sub_22_good.i [2025-03-09 05:50:52,440 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73b81ccd9/a93d25d18ce542f78d3c0c7fcb24c0db/FLAG153f6f338 [2025-03-09 05:50:52,829 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 05:50:52,830 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_sub_22_good.i [2025-03-09 05:50:52,860 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73b81ccd9/a93d25d18ce542f78d3c0c7fcb24c0db/FLAG153f6f338 [2025-03-09 05:50:53,019 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73b81ccd9/a93d25d18ce542f78d3c0c7fcb24c0db [2025-03-09 05:50:53,021 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 05:50:53,022 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 05:50:53,023 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 05:50:53,023 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 05:50:53,026 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 05:50:53,026 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:50:53" (1/1) ... [2025-03-09 05:50:53,027 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17b375cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:50:53, skipping insertion in model container [2025-03-09 05:50:53,027 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:50:53" (1/1) ... [2025-03-09 05:50:53,063 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 05:50:53,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 05:50:53,585 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 05:50:53,638 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 05:50:53,715 INFO L204 MainTranslator]: Completed translation [2025-03-09 05:50:53,716 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:50:53 WrapperNode [2025-03-09 05:50:53,716 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 05:50:53,717 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 05:50:53,717 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 05:50:53,717 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 05:50:53,721 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:50:53" (1/1) ... [2025-03-09 05:50:53,741 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:50:53" (1/1) ... [2025-03-09 05:50:53,758 INFO L138 Inliner]: procedures = 503, calls = 37, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 189 [2025-03-09 05:50:53,758 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 05:50:53,758 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 05:50:53,758 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 05:50:53,758 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 05:50:53,768 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:50:53" (1/1) ... [2025-03-09 05:50:53,768 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:50:53" (1/1) ... [2025-03-09 05:50:53,772 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:50:53" (1/1) ... [2025-03-09 05:50:53,782 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-09 05:50:53,783 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:50:53" (1/1) ... [2025-03-09 05:50:53,783 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:50:53" (1/1) ... [2025-03-09 05:50:53,788 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:50:53" (1/1) ... [2025-03-09 05:50:53,788 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:50:53" (1/1) ... [2025-03-09 05:50:53,789 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:50:53" (1/1) ... [2025-03-09 05:50:53,790 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:50:53" (1/1) ... [2025-03-09 05:50:53,792 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 05:50:53,793 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 05:50:53,793 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 05:50:53,793 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 05:50:53,793 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:50:53" (1/1) ... [2025-03-09 05:50:53,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 05:50:53,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:50:53,828 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:50:53,843 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:50:53,864 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-03-09 05:50:53,864 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-03-09 05:50:53,864 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-03-09 05:50:53,865 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-03-09 05:50:53,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 05:50:53,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 05:50:53,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 05:50:53,962 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 05:50:53,963 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 05:50:54,283 INFO L? ?]: Removed 105 outVars from TransFormulas that were not future-live. [2025-03-09 05:50:54,283 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 05:50:54,307 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 05:50:54,307 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 05:50:54,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:50:54 BoogieIcfgContainer [2025-03-09 05:50:54,310 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 05:50:54,312 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 05:50:54,312 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 05:50:54,316 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 05:50:54,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 05:50:53" (1/3) ... [2025-03-09 05:50:54,317 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5396623a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:50:54, skipping insertion in model container [2025-03-09 05:50:54,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:50:53" (2/3) ... [2025-03-09 05:50:54,317 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5396623a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:50:54, skipping insertion in model container [2025-03-09 05:50:54,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:50:54" (3/3) ... [2025-03-09 05:50:54,318 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_rand_sub_22_good.i [2025-03-09 05:50:54,332 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 05:50:54,333 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE191_Integer_Underflow__int_rand_sub_22_good.i that has 3 procedures, 93 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2025-03-09 05:50:54,377 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 05:50:54,386 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;@c15fc33, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 05:50:54,386 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-09 05:50:54,389 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 76 states have (on average 1.5) internal successors, (114), 85 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 05:50:54,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-09 05:50:54,394 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:50:54,395 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:50:54,395 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 05:50:54,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:50:54,399 INFO L85 PathProgramCache]: Analyzing trace with hash -362097115, now seen corresponding path program 1 times [2025-03-09 05:50:54,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:50:54,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024843891] [2025-03-09 05:50:54,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:50:54,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:50:54,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 05:50:54,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 05:50:54,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:50:54,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:50:54,600 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:50:54,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:50:54,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024843891] [2025-03-09 05:50:54,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024843891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:50:54,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:50:54,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:50:54,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004007005] [2025-03-09 05:50:54,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:50:54,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:50:54,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:50:54,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:50:54,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:50:54,620 INFO L87 Difference]: Start difference. First operand has 93 states, 76 states have (on average 1.5) internal successors, (114), 85 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) Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:50:54,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:50:54,675 INFO L93 Difference]: Finished difference Result 93 states and 130 transitions. [2025-03-09 05:50:54,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:50:54,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-03-09 05:50:54,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:50:54,683 INFO L225 Difference]: With dead ends: 93 [2025-03-09 05:50:54,683 INFO L226 Difference]: Without dead ends: 82 [2025-03-09 05:50:54,685 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:50:54,687 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 1 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:50:54,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 232 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:50:54,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-09 05:50:54,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-03-09 05:50:54,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 69 states have (on average 1.5072463768115942) internal successors, (104), 76 states have internal predecessors, (104), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 05:50:54,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 116 transitions. [2025-03-09 05:50:54,718 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 116 transitions. Word has length 17 [2025-03-09 05:50:54,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:50:54,719 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 116 transitions. [2025-03-09 05:50:54,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:50:54,721 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 116 transitions. [2025-03-09 05:50:54,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-09 05:50:54,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:50:54,722 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 05:50:54,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 05:50:54,723 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 05:50:54,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:50:54,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1659891371, now seen corresponding path program 1 times [2025-03-09 05:50:54,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:50:54,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721491988] [2025-03-09 05:50:54,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:50:54,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:50:54,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 05:50:54,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 05:50:54,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:50:54,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:50:54,928 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:50:54,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:50:54,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721491988] [2025-03-09 05:50:54,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721491988] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:50:54,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:50:54,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:50:54,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593113600] [2025-03-09 05:50:54,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:50:54,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:50:54,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:50:54,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:50:54,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:50:54,930 INFO L87 Difference]: Start difference. First operand 82 states and 116 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 05:50:54,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:50:54,963 INFO L93 Difference]: Finished difference Result 83 states and 117 transitions. [2025-03-09 05:50:54,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:50:54,963 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 05:50:54,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:50:54,964 INFO L225 Difference]: With dead ends: 83 [2025-03-09 05:50:54,964 INFO L226 Difference]: Without dead ends: 82 [2025-03-09 05:50:54,964 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:50:54,964 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 1 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:50:54,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 202 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:50:54,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-09 05:50:54,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2025-03-09 05:50:54,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 69 states have (on average 1.4927536231884058) internal successors, (103), 75 states have internal predecessors, (103), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 05:50:54,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 115 transitions. [2025-03-09 05:50:54,973 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 115 transitions. Word has length 18 [2025-03-09 05:50:54,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:50:54,973 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 115 transitions. [2025-03-09 05:50:54,973 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 05:50:54,975 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 115 transitions. [2025-03-09 05:50:54,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-09 05:50:54,979 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:50:54,979 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:50:54,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 05:50:54,979 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 05:50:54,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:50:54,980 INFO L85 PathProgramCache]: Analyzing trace with hash 477474372, now seen corresponding path program 1 times [2025-03-09 05:50:54,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:50:54,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180428290] [2025-03-09 05:50:54,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:50:54,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:50:54,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 05:50:55,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 05:50:55,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:50:55,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:50:55,042 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:50:55,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:50:55,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180428290] [2025-03-09 05:50:55,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180428290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:50:55,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:50:55,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 05:50:55,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092020645] [2025-03-09 05:50:55,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:50:55,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:50:55,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:50:55,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:50:55,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:50:55,044 INFO L87 Difference]: Start difference. First operand 81 states and 115 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 05:50:55,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:50:55,075 INFO L93 Difference]: Finished difference Result 128 states and 177 transitions. [2025-03-09 05:50:55,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:50:55,076 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 31 [2025-03-09 05:50:55,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:50:55,076 INFO L225 Difference]: With dead ends: 128 [2025-03-09 05:50:55,077 INFO L226 Difference]: Without dead ends: 80 [2025-03-09 05:50:55,078 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:50:55,078 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 110 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:50:55,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 103 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:50:55,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-09 05:50:55,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-09 05:50:55,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 69 states have (on average 1.4782608695652173) internal successors, (102), 74 states have internal predecessors, (102), 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:50:55,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 112 transitions. [2025-03-09 05:50:55,087 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 112 transitions. Word has length 31 [2025-03-09 05:50:55,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:50:55,087 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 112 transitions. [2025-03-09 05:50:55,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 05:50:55,088 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 112 transitions. [2025-03-09 05:50:55,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-09 05:50:55,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:50:55,088 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 05:50:55,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 05:50:55,089 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 05:50:55,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:50:55,090 INFO L85 PathProgramCache]: Analyzing trace with hash 30972771, now seen corresponding path program 1 times [2025-03-09 05:50:55,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:50:55,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739044658] [2025-03-09 05:50:55,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:50:55,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:50:55,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-09 05:50:55,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 05:50:55,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:50:55,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:50:55,144 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:50:55,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:50:55,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739044658] [2025-03-09 05:50:55,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739044658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:50:55,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:50:55,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:50:55,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545660347] [2025-03-09 05:50:55,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:50:55,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:50:55,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:50:55,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:50:55,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:50:55,146 INFO L87 Difference]: Start difference. First operand 80 states and 112 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (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:50:55,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:50:55,181 INFO L93 Difference]: Finished difference Result 80 states and 112 transitions. [2025-03-09 05:50:55,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:50:55,181 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, (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 32 [2025-03-09 05:50:55,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:50:55,182 INFO L225 Difference]: With dead ends: 80 [2025-03-09 05:50:55,185 INFO L226 Difference]: Without dead ends: 79 [2025-03-09 05:50:55,186 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:50:55,186 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 1 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:50:55,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 196 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:50:55,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-09 05:50:55,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-09 05:50:55,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 69 states have (on average 1.463768115942029) internal successors, (101), 73 states have internal predecessors, (101), 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:50:55,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 111 transitions. [2025-03-09 05:50:55,194 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 111 transitions. Word has length 32 [2025-03-09 05:50:55,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:50:55,194 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 111 transitions. [2025-03-09 05:50:55,194 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, (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:50:55,194 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 111 transitions. [2025-03-09 05:50:55,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-09 05:50:55,195 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:50:55,195 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 05:50:55,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 05:50:55,195 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 05:50:55,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:50:55,195 INFO L85 PathProgramCache]: Analyzing trace with hash 960155896, now seen corresponding path program 1 times [2025-03-09 05:50:55,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:50:55,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643964055] [2025-03-09 05:50:55,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:50:55,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:50:55,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-09 05:50:55,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 05:50:55,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:50:55,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:50:55,341 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:50:55,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:50:55,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643964055] [2025-03-09 05:50:55,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643964055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:50:55,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:50:55,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:50:55,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280789235] [2025-03-09 05:50:55,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:50:55,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:50:55,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:50:55,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:50:55,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:50:55,344 INFO L87 Difference]: Start difference. First operand 79 states and 111 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 05:50:55,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:50:55,370 INFO L93 Difference]: Finished difference Result 80 states and 112 transitions. [2025-03-09 05:50:55,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:50:55,370 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 05:50:55,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:50:55,371 INFO L225 Difference]: With dead ends: 80 [2025-03-09 05:50:55,371 INFO L226 Difference]: Without dead ends: 79 [2025-03-09 05:50:55,372 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:50:55,372 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 1 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:50:55,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 192 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:50:55,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-09 05:50:55,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2025-03-09 05:50:55,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 69 states have (on average 1.4492753623188406) internal successors, (100), 72 states have internal predecessors, (100), 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:50:55,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 110 transitions. [2025-03-09 05:50:55,378 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 110 transitions. Word has length 33 [2025-03-09 05:50:55,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:50:55,378 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 110 transitions. [2025-03-09 05:50:55,378 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 05:50:55,378 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 110 transitions. [2025-03-09 05:50:55,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-09 05:50:55,379 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:50:55,379 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 05:50:55,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 05:50:55,380 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 05:50:55,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:50:55,380 INFO L85 PathProgramCache]: Analyzing trace with hash -299259068, now seen corresponding path program 1 times [2025-03-09 05:50:55,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:50:55,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512875527] [2025-03-09 05:50:55,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:50:55,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:50:55,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 05:50:55,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 05:50:55,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:50:55,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:50:55,511 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 05:50:55,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:50:55,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512875527] [2025-03-09 05:50:55,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512875527] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:50:55,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230138069] [2025-03-09 05:50:55,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:50:55,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:50:55,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:50:55,516 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:50:55,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 05:50:55,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 05:50:55,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 05:50:55,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:50:55,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:50:55,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 05:50:55,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:50:55,626 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:50:55,627 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:50:55,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230138069] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:50:55,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:50:55,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-09 05:50:55,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408214745] [2025-03-09 05:50:55,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:50:55,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:50:55,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:50:55,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:50:55,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:50:55,628 INFO L87 Difference]: Start difference. First operand 78 states and 110 transitions. Second operand has 3 states, 3 states have (on average 9.0) 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 05:50:55,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:50:55,650 INFO L93 Difference]: Finished difference Result 92 states and 122 transitions. [2025-03-09 05:50:55,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:50:55,650 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 05:50:55,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:50:55,652 INFO L225 Difference]: With dead ends: 92 [2025-03-09 05:50:55,652 INFO L226 Difference]: Without dead ends: 85 [2025-03-09 05:50:55,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:50:55,653 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 22 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:50:55,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 189 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:50:55,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-09 05:50:55,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-03-09 05:50:55,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 74 states have (on average 1.4189189189189189) internal successors, (105), 77 states have internal predecessors, (105), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 05:50:55,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 115 transitions. [2025-03-09 05:50:55,661 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 115 transitions. Word has length 34 [2025-03-09 05:50:55,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:50:55,661 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 115 transitions. [2025-03-09 05:50:55,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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:50:55,661 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 115 transitions. [2025-03-09 05:50:55,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-09 05:50:55,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:50:55,662 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:50:55,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 05:50:55,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-09 05:50:55,868 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 05:50:55,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:50:55,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1635065202, now seen corresponding path program 1 times [2025-03-09 05:50:55,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:50:55,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382198289] [2025-03-09 05:50:55,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:50:55,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:50:55,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-09 05:50:55,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 05:50:55,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:50:55,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:50:55,942 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:50:55,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:50:55,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382198289] [2025-03-09 05:50:55,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382198289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:50:55,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:50:55,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:50:55,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006028228] [2025-03-09 05:50:55,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:50:55,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:50:55,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:50:55,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:50:55,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:50:55,944 INFO L87 Difference]: Start difference. First operand 85 states and 115 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 05:50:55,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:50:55,967 INFO L93 Difference]: Finished difference Result 85 states and 115 transitions. [2025-03-09 05:50:55,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:50:55,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2025-03-09 05:50:55,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:50:55,969 INFO L225 Difference]: With dead ends: 85 [2025-03-09 05:50:55,969 INFO L226 Difference]: Without dead ends: 84 [2025-03-09 05:50:55,969 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:50:55,970 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 1 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:50:55,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 194 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:50:55,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-09 05:50:55,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-03-09 05:50:55,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 74 states have (on average 1.4054054054054055) internal successors, (104), 76 states have internal predecessors, (104), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 05:50:55,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 114 transitions. [2025-03-09 05:50:55,982 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 114 transitions. Word has length 40 [2025-03-09 05:50:55,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:50:55,982 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 114 transitions. [2025-03-09 05:50:55,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 05:50:55,982 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 114 transitions. [2025-03-09 05:50:55,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-09 05:50:55,985 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:50:55,985 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 05:50:55,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 05:50:55,986 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 05:50:55,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:50:55,986 INFO L85 PathProgramCache]: Analyzing trace with hash -852586305, now seen corresponding path program 1 times [2025-03-09 05:50:55,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:50:55,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339823176] [2025-03-09 05:50:55,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:50:55,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:50:55,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-09 05:50:56,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-09 05:50:56,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:50:56,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:50:56,086 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:50:56,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:50:56,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339823176] [2025-03-09 05:50:56,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339823176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:50:56,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:50:56,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:50:56,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166076827] [2025-03-09 05:50:56,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:50:56,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:50:56,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:50:56,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:50:56,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:50:56,087 INFO L87 Difference]: Start difference. First operand 84 states and 114 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 05:50:56,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:50:56,107 INFO L93 Difference]: Finished difference Result 84 states and 114 transitions. [2025-03-09 05:50:56,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:50:56,108 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 05:50:56,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:50:56,110 INFO L225 Difference]: With dead ends: 84 [2025-03-09 05:50:56,111 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 05:50:56,111 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:50:56,111 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:50:56,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 194 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:50:56,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 05:50:56,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 05:50:56,112 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:50:56,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 05:50:56,112 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2025-03-09 05:50:56,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:50:56,112 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 05:50:56,112 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 05:50:56,112 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 05:50:56,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 05:50:56,115 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-03-09 05:50:56,116 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-03-09 05:50:56,116 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-03-09 05:50:56,116 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-03-09 05:50:56,116 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-03-09 05:50:56,116 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-03-09 05:50:56,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 05:50:56,119 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:50:56,121 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 05:50:56,159 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 05:50:56,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 05:50:56 BoogieIcfgContainer [2025-03-09 05:50:56,167 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 05:50:56,168 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 05:50:56,168 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 05:50:56,168 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 05:50:56,169 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:50:54" (3/4) ... [2025-03-09 05:50:56,171 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 05:50:56,175 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printLine [2025-03-09 05:50:56,176 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-03-09 05:50:56,183 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-03-09 05:50:56,183 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-09 05:50:56,184 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-09 05:50:56,184 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 05:50:56,270 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 05:50:56,270 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 05:50:56,271 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 05:50:56,271 INFO L158 Benchmark]: Toolchain (without parser) took 3248.82ms. Allocated memory is still 167.8MB. Free memory was 118.6MB in the beginning and 100.9MB in the end (delta: 17.7MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. [2025-03-09 05:50:56,271 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 119.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 05:50:56,271 INFO L158 Benchmark]: CACSL2BoogieTranslator took 693.03ms. Allocated memory is still 167.8MB. Free memory was 118.6MB in the beginning and 56.9MB in the end (delta: 61.7MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-03-09 05:50:56,276 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.35ms. Allocated memory is still 167.8MB. Free memory was 56.9MB in the beginning and 53.8MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 05:50:56,276 INFO L158 Benchmark]: Boogie Preprocessor took 33.69ms. Allocated memory is still 167.8MB. Free memory was 53.8MB in the beginning and 51.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 05:50:56,276 INFO L158 Benchmark]: IcfgBuilder took 517.50ms. Allocated memory is still 167.8MB. Free memory was 51.9MB in the beginning and 113.9MB in the end (delta: -62.1MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. [2025-03-09 05:50:56,276 INFO L158 Benchmark]: TraceAbstraction took 1854.97ms. Allocated memory is still 167.8MB. Free memory was 113.1MB in the beginning and 109.2MB in the end (delta: 3.9MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. [2025-03-09 05:50:56,276 INFO L158 Benchmark]: Witness Printer took 102.89ms. Allocated memory is still 167.8MB. Free memory was 109.2MB in the beginning and 100.9MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 05:50:56,277 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 119.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 693.03ms. Allocated memory is still 167.8MB. Free memory was 118.6MB in the beginning and 56.9MB in the end (delta: 61.7MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.35ms. Allocated memory is still 167.8MB. Free memory was 56.9MB in the beginning and 53.8MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.69ms. Allocated memory is still 167.8MB. Free memory was 53.8MB in the beginning and 51.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 517.50ms. Allocated memory is still 167.8MB. Free memory was 51.9MB in the beginning and 113.9MB in the end (delta: -62.1MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1854.97ms. Allocated memory is still 167.8MB. Free memory was 113.1MB in the beginning and 109.2MB in the end (delta: 3.9MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. * Witness Printer took 102.89ms. Allocated memory is still 167.8MB. Free memory was 109.2MB in the beginning and 100.9MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1634]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1634]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1620]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1620]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1605]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1605]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 93 locations, 138 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 138 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 137 mSDsluCounter, 1502 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 677 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 158 IncrementalHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 825 mSDtfsCounter, 158 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=0, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 280 NumberOfCodeBlocks, 280 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 271 ConstructedInterpolants, 0 QuantifiedInterpolants, 344 SizeOfPredicates, 0 NumberOfNonLiveVariables, 160 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 9 InterpolantComputations, 8 PerfectInterpolantSequences, 41/44 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-09 05:50:56,300 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