./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 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/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-?-8fc3dc6-m [2025-03-17 18:53:49,971 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 18:53:50,026 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-17 18:53:50,030 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 18:53:50,030 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 18:53:50,043 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 18:53:50,044 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 18:53:50,044 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 18:53:50,044 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 18:53:50,044 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 18:53:50,044 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 18:53:50,045 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 18:53:50,045 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 18:53:50,045 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 18:53:50,045 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 18:53:50,045 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 18:53:50,045 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 18:53:50,045 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 18:53:50,045 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 18:53:50,045 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 18:53:50,046 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 18:53:50,046 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 18:53:50,046 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 18:53:50,046 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 18:53:50,046 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 18:53:50,046 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 18:53:50,046 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 18:53:50,046 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 18:53:50,046 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 18:53:50,046 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 18:53:50,046 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 18:53:50,047 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 18:53:50,047 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 18:53:50,047 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 18:53:50,047 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 18:53:50,047 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 18:53:50,047 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 18:53:50,047 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 18:53:50,047 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 18:53:50,047 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 18:53:50,047 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 18:53:50,047 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 18:53:50,048 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-17 18:53:50,295 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 18:53:50,300 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 18:53:50,305 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 18:53:50,306 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 18:53:50,306 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 18:53:50,307 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-17 18:53:51,405 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bd14e93c/8fd26b8c1fdb4967bb076fe3a5e1fb48/FLAGad9d169ac [2025-03-17 18:53:51,681 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 18:53:51,681 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-17 18:53:51,705 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bd14e93c/8fd26b8c1fdb4967bb076fe3a5e1fb48/FLAGad9d169ac [2025-03-17 18:53:51,964 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bd14e93c/8fd26b8c1fdb4967bb076fe3a5e1fb48 [2025-03-17 18:53:51,966 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 18:53:51,966 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 18:53:51,967 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 18:53:51,967 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 18:53:51,970 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 18:53:51,971 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:53:51" (1/1) ... [2025-03-17 18:53:51,975 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7eac4f55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:53:51, skipping insertion in model container [2025-03-17 18:53:51,975 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:53:51" (1/1) ... [2025-03-17 18:53:52,016 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 18:53:52,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 18:53:52,584 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 18:53:52,688 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 18:53:52,780 INFO L204 MainTranslator]: Completed translation [2025-03-17 18:53:52,781 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:53:52 WrapperNode [2025-03-17 18:53:52,781 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 18:53:52,782 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 18:53:52,782 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 18:53:52,783 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 18:53:52,787 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:53:52" (1/1) ... [2025-03-17 18:53:52,803 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:53:52" (1/1) ... [2025-03-17 18:53:52,824 INFO L138 Inliner]: procedures = 503, calls = 37, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 189 [2025-03-17 18:53:52,826 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 18:53:52,828 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 18:53:52,828 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 18:53:52,828 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 18:53:52,834 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:53:52" (1/1) ... [2025-03-17 18:53:52,834 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:53:52" (1/1) ... [2025-03-17 18:53:52,837 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:53:52" (1/1) ... [2025-03-17 18:53:52,846 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-17 18:53:52,846 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:53:52" (1/1) ... [2025-03-17 18:53:52,846 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:53:52" (1/1) ... [2025-03-17 18:53:52,851 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:53:52" (1/1) ... [2025-03-17 18:53:52,852 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:53:52" (1/1) ... [2025-03-17 18:53:52,853 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:53:52" (1/1) ... [2025-03-17 18:53:52,853 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:53:52" (1/1) ... [2025-03-17 18:53:52,855 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 18:53:52,855 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 18:53:52,856 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 18:53:52,856 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 18:53:52,856 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:53:52" (1/1) ... [2025-03-17 18:53:52,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 18:53:52,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:53:52,897 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 18:53:52,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 18:53:52,915 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-03-17 18:53:52,915 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-03-17 18:53:52,915 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-03-17 18:53:52,915 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-03-17 18:53:52,915 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 18:53:52,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 18:53:52,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 18:53:53,016 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 18:53:53,018 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 18:53:53,309 INFO L? ?]: Removed 105 outVars from TransFormulas that were not future-live. [2025-03-17 18:53:53,311 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 18:53:53,335 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 18:53:53,335 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 18:53:53,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:53:53 BoogieIcfgContainer [2025-03-17 18:53:53,339 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 18:53:53,340 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 18:53:53,340 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 18:53:53,344 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 18:53:53,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:53:51" (1/3) ... [2025-03-17 18:53:53,344 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5abf8e68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:53:53, skipping insertion in model container [2025-03-17 18:53:53,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:53:52" (2/3) ... [2025-03-17 18:53:53,345 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5abf8e68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:53:53, skipping insertion in model container [2025-03-17 18:53:53,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:53:53" (3/3) ... [2025-03-17 18:53:53,346 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_rand_sub_22_good.i [2025-03-17 18:53:53,360 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 18:53:53,362 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE191_Integer_Underflow__int_rand_sub_22_good.i that has 3 procedures, 87 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2025-03-17 18:53:53,410 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 18:53:53,420 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;@bae6666, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 18:53:53,420 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-17 18:53:53,422 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 70 states have (on average 1.542857142857143) internal successors, (108), 79 states have internal predecessors, (108), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 18:53:53,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-17 18:53:53,426 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:53:53,427 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:53:53,427 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 18:53:53,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:53:53,431 INFO L85 PathProgramCache]: Analyzing trace with hash 363450750, now seen corresponding path program 1 times [2025-03-17 18:53:53,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:53:53,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158623210] [2025-03-17 18:53:53,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:53:53,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:53:53,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 18:53:53,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 18:53:53,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:53:53,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:53:53,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 18:53:53,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:53:53,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158623210] [2025-03-17 18:53:53,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158623210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:53:53,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:53:53,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 18:53:53,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874250254] [2025-03-17 18:53:53,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:53:53,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:53:53,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:53:53,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:53:53,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:53:53,622 INFO L87 Difference]: Start difference. First operand has 87 states, 70 states have (on average 1.542857142857143) internal successors, (108), 79 states have internal predecessors, (108), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:53:53,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:53:53,663 INFO L93 Difference]: Finished difference Result 87 states and 124 transitions. [2025-03-17 18:53:53,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:53:53,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-03-17 18:53:53,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:53:53,669 INFO L225 Difference]: With dead ends: 87 [2025-03-17 18:53:53,670 INFO L226 Difference]: Without dead ends: 79 [2025-03-17 18:53:53,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:53:53,675 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 1 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 220 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-17 18:53:53,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 220 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:53:53,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-17 18:53:53,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-17 18:53:53,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 66 states have (on average 1.5303030303030303) internal successors, (101), 73 states have internal predecessors, (101), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 18:53:53,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 113 transitions. [2025-03-17 18:53:53,708 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 113 transitions. Word has length 16 [2025-03-17 18:53:53,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:53:53,709 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 113 transitions. [2025-03-17 18:53:53,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:53:53,710 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 113 transitions. [2025-03-17 18:53:53,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-17 18:53:53,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:53:53,712 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:53:53,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 18:53:53,713 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 18:53:53,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:53:53,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1617928596, now seen corresponding path program 1 times [2025-03-17 18:53:53,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:53:53,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422855675] [2025-03-17 18:53:53,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:53:53,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:53:53,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 18:53:53,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 18:53:53,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:53:53,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:53:53,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 18:53:53,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:53:53,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422855675] [2025-03-17 18:53:53,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422855675] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:53:53,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:53:53,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 18:53:53,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609618739] [2025-03-17 18:53:53,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:53:53,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:53:53,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:53:53,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:53:53,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:53:53,898 INFO L87 Difference]: Start difference. First operand 79 states and 113 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:53:53,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:53:53,934 INFO L93 Difference]: Finished difference Result 80 states and 114 transitions. [2025-03-17 18:53:53,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:53:53,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-03-17 18:53:53,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:53:53,936 INFO L225 Difference]: With dead ends: 80 [2025-03-17 18:53:53,937 INFO L226 Difference]: Without dead ends: 79 [2025-03-17 18:53:53,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:53:53,959 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 1 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 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-17 18:53:53,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 196 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:53:53,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-17 18:53:53,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2025-03-17 18:53:53,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 66 states have (on average 1.5151515151515151) internal successors, (100), 72 states have internal predecessors, (100), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 18:53:53,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 112 transitions. [2025-03-17 18:53:53,968 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 112 transitions. Word has length 17 [2025-03-17 18:53:53,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:53:53,968 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 112 transitions. [2025-03-17 18:53:53,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:53:53,969 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 112 transitions. [2025-03-17 18:53:53,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 18:53:53,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:53:53,970 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:53:53,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 18:53:53,970 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 18:53:53,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:53:53,971 INFO L85 PathProgramCache]: Analyzing trace with hash 153602859, now seen corresponding path program 1 times [2025-03-17 18:53:53,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:53:53,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511481785] [2025-03-17 18:53:53,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:53:53,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:53:53,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 18:53:53,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 18:53:53,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:53:53,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:53:54,025 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 18:53:54,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:53:54,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511481785] [2025-03-17 18:53:54,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511481785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:53:54,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:53:54,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 18:53:54,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842147606] [2025-03-17 18:53:54,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:53:54,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:53:54,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:53:54,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:53:54,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:53:54,027 INFO L87 Difference]: Start difference. First operand 78 states and 112 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 18:53:54,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:53:54,055 INFO L93 Difference]: Finished difference Result 123 states and 172 transitions. [2025-03-17 18:53:54,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:53:54,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2025-03-17 18:53:54,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:53:54,059 INFO L225 Difference]: With dead ends: 123 [2025-03-17 18:53:54,059 INFO L226 Difference]: Without dead ends: 77 [2025-03-17 18:53:54,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:53:54,060 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 107 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 18:53:54,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 100 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:53:54,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-17 18:53:54,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-17 18:53:54,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 66 states have (on average 1.5) internal successors, (99), 71 states have internal predecessors, (99), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 18:53:54,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 109 transitions. [2025-03-17 18:53:54,068 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 109 transitions. Word has length 29 [2025-03-17 18:53:54,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:53:54,069 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 109 transitions. [2025-03-17 18:53:54,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 18:53:54,069 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 109 transitions. [2025-03-17 18:53:54,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-17 18:53:54,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:53:54,069 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:53:54,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 18:53:54,072 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 18:53:54,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:53:54,072 INFO L85 PathProgramCache]: Analyzing trace with hash -622316860, now seen corresponding path program 1 times [2025-03-17 18:53:54,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:53:54,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509487864] [2025-03-17 18:53:54,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:53:54,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:53:54,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 18:53:54,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 18:53:54,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:53:54,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:53:54,114 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 18:53:54,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:53:54,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509487864] [2025-03-17 18:53:54,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509487864] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:53:54,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:53:54,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 18:53:54,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399314743] [2025-03-17 18:53:54,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:53:54,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:53:54,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:53:54,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:53:54,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:53:54,115 INFO L87 Difference]: Start difference. First operand 77 states and 109 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 18:53:54,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:53:54,142 INFO L93 Difference]: Finished difference Result 77 states and 109 transitions. [2025-03-17 18:53:54,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:53:54,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2025-03-17 18:53:54,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:53:54,145 INFO L225 Difference]: With dead ends: 77 [2025-03-17 18:53:54,145 INFO L226 Difference]: Without dead ends: 76 [2025-03-17 18:53:54,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:53:54,146 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 1 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 190 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-17 18:53:54,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 190 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:53:54,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-17 18:53:54,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-03-17 18:53:54,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 70 states have internal predecessors, (98), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 18:53:54,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 108 transitions. [2025-03-17 18:53:54,155 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 108 transitions. Word has length 30 [2025-03-17 18:53:54,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:53:54,155 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 108 transitions. [2025-03-17 18:53:54,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 18:53:54,155 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 108 transitions. [2025-03-17 18:53:54,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-17 18:53:54,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:53:54,156 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:53:54,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 18:53:54,156 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-17 18:53:54,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:53:54,159 INFO L85 PathProgramCache]: Analyzing trace with hash -2111953486, now seen corresponding path program 1 times [2025-03-17 18:53:54,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:53:54,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601195696] [2025-03-17 18:53:54,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:53:54,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:53:54,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 18:53:54,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 18:53:54,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:53:54,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:53:54,247 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 18:53:54,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:53:54,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601195696] [2025-03-17 18:53:54,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601195696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:53:54,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:53:54,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 18:53:54,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766243143] [2025-03-17 18:53:54,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:53:54,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:53:54,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:53:54,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:53:54,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:53:54,249 INFO L87 Difference]: Start difference. First operand 76 states and 108 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 18:53:54,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:53:54,270 INFO L93 Difference]: Finished difference Result 77 states and 109 transitions. [2025-03-17 18:53:54,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:53:54,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2025-03-17 18:53:54,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:53:54,271 INFO L225 Difference]: With dead ends: 77 [2025-03-17 18:53:54,271 INFO L226 Difference]: Without dead ends: 76 [2025-03-17 18:53:54,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:53:54,272 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 1 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 186 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-17 18:53:54,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 186 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:53:54,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-17 18:53:54,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2025-03-17 18:53:54,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 66 states have (on average 1.4696969696969697) internal successors, (97), 69 states have internal predecessors, (97), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 18:53:54,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 107 transitions. [2025-03-17 18:53:54,276 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 107 transitions. Word has length 31 [2025-03-17 18:53:54,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:53:54,276 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 107 transitions. [2025-03-17 18:53:54,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 18:53:54,276 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 107 transitions. [2025-03-17 18:53:54,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-17 18:53:54,276 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:53:54,276 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:53:54,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 18:53:54,276 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-17 18:53:54,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:53:54,277 INFO L85 PathProgramCache]: Analyzing trace with hash -2111931607, now seen corresponding path program 1 times [2025-03-17 18:53:54,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:53:54,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864821175] [2025-03-17 18:53:54,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:53:54,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:53:54,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 18:53:54,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 18:53:54,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:53:54,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:53:54,373 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 18:53:54,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:53:54,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864821175] [2025-03-17 18:53:54,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864821175] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 18:53:54,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672775712] [2025-03-17 18:53:54,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:53:54,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:53:54,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:53:54,376 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 18:53:54,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 18:53:54,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 18:53:54,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 18:53:54,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:53:54,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:53:54,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 18:53:54,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 18:53:54,468 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 18:53:54,468 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 18:53:54,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672775712] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:53:54,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 18:53:54,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-17 18:53:54,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863438029] [2025-03-17 18:53:54,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:53:54,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:53:54,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:53:54,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:53:54,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 18:53:54,470 INFO L87 Difference]: Start difference. First operand 75 states and 107 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 18:53:54,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:53:54,492 INFO L93 Difference]: Finished difference Result 88 states and 118 transitions. [2025-03-17 18:53:54,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:53:54,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2025-03-17 18:53:54,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:53:54,493 INFO L225 Difference]: With dead ends: 88 [2025-03-17 18:53:54,493 INFO L226 Difference]: Without dead ends: 82 [2025-03-17 18:53:54,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 18:53:54,494 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 21 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 18:53:54,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 184 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:53:54,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-17 18:53:54,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-03-17 18:53:54,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 71 states have (on average 1.4366197183098592) internal successors, (102), 74 states have internal predecessors, (102), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 18:53:54,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 112 transitions. [2025-03-17 18:53:54,498 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 112 transitions. Word has length 31 [2025-03-17 18:53:54,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:53:54,499 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 112 transitions. [2025-03-17 18:53:54,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 18:53:54,499 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 112 transitions. [2025-03-17 18:53:54,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-17 18:53:54,499 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:53:54,499 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:53:54,505 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-17 18:53:54,701 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-17 18:53:54,701 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 18:53:54,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:53:54,701 INFO L85 PathProgramCache]: Analyzing trace with hash 2094441540, now seen corresponding path program 1 times [2025-03-17 18:53:54,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:53:54,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470632371] [2025-03-17 18:53:54,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:53:54,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:53:54,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 18:53:54,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 18:53:54,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:53:54,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:53:54,785 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 18:53:54,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:53:54,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470632371] [2025-03-17 18:53:54,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470632371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:53:54,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:53:54,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 18:53:54,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766104725] [2025-03-17 18:53:54,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:53:54,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:53:54,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:53:54,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:53:54,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:53:54,788 INFO L87 Difference]: Start difference. First operand 82 states and 112 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 18:53:54,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:53:54,816 INFO L93 Difference]: Finished difference Result 82 states and 112 transitions. [2025-03-17 18:53:54,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:53:54,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2025-03-17 18:53:54,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:53:54,817 INFO L225 Difference]: With dead ends: 82 [2025-03-17 18:53:54,820 INFO L226 Difference]: Without dead ends: 81 [2025-03-17 18:53:54,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:53:54,820 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 1 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 188 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-17 18:53:54,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 188 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:53:54,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-17 18:53:54,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-03-17 18:53:54,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 71 states have (on average 1.4225352112676057) internal successors, (101), 73 states have internal predecessors, (101), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 18:53:54,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 111 transitions. [2025-03-17 18:53:54,829 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 111 transitions. Word has length 37 [2025-03-17 18:53:54,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:53:54,830 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 111 transitions. [2025-03-17 18:53:54,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 18:53:54,831 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 111 transitions. [2025-03-17 18:53:54,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-17 18:53:54,832 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:53:54,832 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] [2025-03-17 18:53:54,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 18:53:54,832 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-17 18:53:54,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:53:54,834 INFO L85 PathProgramCache]: Analyzing trace with hash 503178281, now seen corresponding path program 1 times [2025-03-17 18:53:54,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:53:54,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241380] [2025-03-17 18:53:54,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:53:54,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:53:54,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 18:53:54,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 18:53:54,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:53:54,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:53:54,933 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 18:53:54,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:53:54,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241380] [2025-03-17 18:53:54,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241380] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:53:54,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:53:54,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 18:53:54,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831351645] [2025-03-17 18:53:54,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:53:54,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:53:54,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:53:54,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:53:54,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:53:54,935 INFO L87 Difference]: Start difference. First operand 81 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 18:53:54,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:53:54,953 INFO L93 Difference]: Finished difference Result 81 states and 111 transitions. [2025-03-17 18:53:54,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:53:54,954 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, (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 38 [2025-03-17 18:53:54,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:53:54,954 INFO L225 Difference]: With dead ends: 81 [2025-03-17 18:53:54,954 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 18:53:54,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:53:54,955 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 188 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-17 18:53:54,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 188 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:53:54,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 18:53:54,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 18:53:54,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 18:53:54,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 18:53:54,956 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2025-03-17 18:53:54,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:53:54,956 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 18:53:54,956 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 18:53:54,956 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 18:53:54,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 18:53:54,958 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-03-17 18:53:54,958 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-03-17 18:53:54,958 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-03-17 18:53:54,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-03-17 18:53:54,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-03-17 18:53:54,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-03-17 18:53:54,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 18:53:54,961 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:53:54,962 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 18:53:54,990 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 18:53:54,993 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 06:53:54 BoogieIcfgContainer [2025-03-17 18:53:54,993 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 18:53:54,994 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 18:53:54,994 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 18:53:54,994 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 18:53:54,994 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:53:53" (3/4) ... [2025-03-17 18:53:54,996 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 18:53:55,006 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printLine [2025-03-17 18:53:55,006 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-03-17 18:53:55,010 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-03-17 18:53:55,010 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-17 18:53:55,010 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 18:53:55,010 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 18:53:55,085 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 18:53:55,085 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 18:53:55,085 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 18:53:55,086 INFO L158 Benchmark]: Toolchain (without parser) took 3119.14ms. Allocated memory is still 142.6MB. Free memory was 107.7MB in the beginning and 100.0MB in the end (delta: 7.7MB). Peak memory consumption was 77.5MB. Max. memory is 16.1GB. [2025-03-17 18:53:55,086 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 226.5MB. Free memory is still 148.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 18:53:55,086 INFO L158 Benchmark]: CACSL2BoogieTranslator took 814.16ms. Allocated memory is still 142.6MB. Free memory was 107.2MB in the beginning and 45.9MB in the end (delta: 61.3MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-17 18:53:55,086 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.82ms. Allocated memory is still 142.6MB. Free memory was 45.9MB in the beginning and 42.8MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 18:53:55,086 INFO L158 Benchmark]: Boogie Preprocessor took 26.79ms. Allocated memory is still 142.6MB. Free memory was 42.8MB in the beginning and 40.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 18:53:55,087 INFO L158 Benchmark]: IcfgBuilder took 483.18ms. Allocated memory is still 142.6MB. Free memory was 40.7MB in the beginning and 86.5MB in the end (delta: -45.8MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. [2025-03-17 18:53:55,087 INFO L158 Benchmark]: TraceAbstraction took 1653.37ms. Allocated memory is still 142.6MB. Free memory was 85.8MB in the beginning and 39.5MB in the end (delta: 46.3MB). Peak memory consumption was 47.2MB. Max. memory is 16.1GB. [2025-03-17 18:53:55,087 INFO L158 Benchmark]: Witness Printer took 91.31ms. Allocated memory is still 142.6MB. Free memory was 39.5MB in the beginning and 100.0MB in the end (delta: -60.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 18:53:55,088 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.21ms. Allocated memory is still 226.5MB. Free memory is still 148.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 814.16ms. Allocated memory is still 142.6MB. Free memory was 107.2MB in the beginning and 45.9MB in the end (delta: 61.3MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.82ms. Allocated memory is still 142.6MB. Free memory was 45.9MB in the beginning and 42.8MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.79ms. Allocated memory is still 142.6MB. Free memory was 42.8MB in the beginning and 40.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 483.18ms. Allocated memory is still 142.6MB. Free memory was 40.7MB in the beginning and 86.5MB in the end (delta: -45.8MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1653.37ms. Allocated memory is still 142.6MB. Free memory was 85.8MB in the beginning and 39.5MB in the end (delta: 46.3MB). Peak memory consumption was 47.2MB. Max. memory is 16.1GB. * Witness Printer took 91.31ms. Allocated memory is still 142.6MB. Free memory was 39.5MB in the beginning and 100.0MB in the end (delta: -60.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1634]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1634]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1620]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1620]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1605]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1605]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 87 locations, 132 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 134 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 133 mSDsluCounter, 1452 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 654 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 158 IncrementalHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 798 mSDtfsCounter, 158 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred 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.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 260 NumberOfCodeBlocks, 260 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 251 ConstructedInterpolants, 0 QuantifiedInterpolants, 324 SizeOfPredicates, 0 NumberOfNonLiveVariables, 158 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-17 18:53:55,099 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