./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_17_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_17_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 cfb4312ddb8ef331d565c0dcb742b0fff2f6c277374a7ef021bf1dafe0190613 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 13:28:08,862 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 13:28:08,937 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-04 13:28:08,943 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 13:28:08,943 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 13:28:08,958 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 13:28:08,958 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 13:28:08,959 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 13:28:08,959 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 13:28:08,959 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 13:28:08,959 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 13:28:08,959 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 13:28:08,959 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 13:28:08,959 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 13:28:08,960 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 13:28:08,960 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 13:28:08,960 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 13:28:08,960 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 13:28:08,960 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 13:28:08,960 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 13:28:08,960 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 13:28:08,960 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 13:28:08,960 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 13:28:08,960 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 13:28:08,960 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 13:28:08,961 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 13:28:08,961 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 13:28:08,961 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 13:28:08,961 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 13:28:08,961 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 13:28:08,961 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 13:28:08,961 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 13:28:08,961 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 13:28:08,961 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 13:28:08,961 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 13:28:08,961 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 13:28:08,962 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 13:28:08,962 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 13:28:08,962 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 13:28:08,962 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 13:28:08,962 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 13:28:08,962 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 13:28:08,962 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 -> cfb4312ddb8ef331d565c0dcb742b0fff2f6c277374a7ef021bf1dafe0190613 [2025-03-04 13:28:09,180 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 13:28:09,186 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 13:28:09,187 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 13:28:09,188 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 13:28:09,188 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 13:28:09,190 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_17_good.i [2025-03-04 13:28:10,313 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d24fd7276/3a08944f93ae4eabaf77a1035102a938/FLAG9e4e1c2c2 [2025-03-04 13:28:10,646 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 13:28:10,647 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_17_good.i [2025-03-04 13:28:10,669 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d24fd7276/3a08944f93ae4eabaf77a1035102a938/FLAG9e4e1c2c2 [2025-03-04 13:28:10,880 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d24fd7276/3a08944f93ae4eabaf77a1035102a938 [2025-03-04 13:28:10,883 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 13:28:10,884 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 13:28:10,885 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 13:28:10,885 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 13:28:10,888 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 13:28:10,889 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:28:10" (1/1) ... [2025-03-04 13:28:10,889 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@693d9428 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:10, skipping insertion in model container [2025-03-04 13:28:10,889 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:28:10" (1/1) ... [2025-03-04 13:28:10,921 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 13:28:11,494 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 13:28:11,500 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 13:28:11,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 13:28:11,638 INFO L204 MainTranslator]: Completed translation [2025-03-04 13:28:11,638 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:11 WrapperNode [2025-03-04 13:28:11,639 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 13:28:11,639 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 13:28:11,639 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 13:28:11,639 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 13:28:11,644 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:11" (1/1) ... [2025-03-04 13:28:11,658 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:11" (1/1) ... [2025-03-04 13:28:11,677 INFO L138 Inliner]: procedures = 499, calls = 28, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 136 [2025-03-04 13:28:11,678 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 13:28:11,678 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 13:28:11,678 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 13:28:11,678 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 13:28:11,686 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:11" (1/1) ... [2025-03-04 13:28:11,686 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:11" (1/1) ... [2025-03-04 13:28:11,688 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:11" (1/1) ... [2025-03-04 13:28:11,694 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-04 13:28:11,694 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:11" (1/1) ... [2025-03-04 13:28:11,694 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:11" (1/1) ... [2025-03-04 13:28:11,697 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:11" (1/1) ... [2025-03-04 13:28:11,698 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:11" (1/1) ... [2025-03-04 13:28:11,699 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:11" (1/1) ... [2025-03-04 13:28:11,699 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:11" (1/1) ... [2025-03-04 13:28:11,701 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 13:28:11,701 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 13:28:11,701 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 13:28:11,702 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 13:28:11,702 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:11" (1/1) ... [2025-03-04 13:28:11,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 13:28:11,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 13:28:11,728 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-04 13:28:11,730 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-04 13:28:11,746 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-03-04 13:28:11,746 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-03-04 13:28:11,746 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-03-04 13:28:11,746 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-03-04 13:28:11,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 13:28:11,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 13:28:11,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 13:28:11,840 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 13:28:11,842 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 13:28:12,079 INFO L? ?]: Removed 70 outVars from TransFormulas that were not future-live. [2025-03-04 13:28:12,079 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 13:28:12,097 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 13:28:12,097 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 13:28:12,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:28:12 BoogieIcfgContainer [2025-03-04 13:28:12,097 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 13:28:12,099 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 13:28:12,099 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 13:28:12,102 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 13:28:12,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:28:10" (1/3) ... [2025-03-04 13:28:12,103 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64503b6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:28:12, skipping insertion in model container [2025-03-04 13:28:12,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:11" (2/3) ... [2025-03-04 13:28:12,103 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64503b6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:28:12, skipping insertion in model container [2025-03-04 13:28:12,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:28:12" (3/3) ... [2025-03-04 13:28:12,104 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_multiply_17_good.i [2025-03-04 13:28:12,114 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 13:28:12,115 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE190_Integer_Overflow__int_rand_multiply_17_good.i that has 3 procedures, 79 locations, 1 initial locations, 4 loop locations, and 12 error locations. [2025-03-04 13:28:12,146 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 13:28:12,153 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;@5f56fc3f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 13:28:12,153 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-03-04 13:28:12,156 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 59 states have (on average 1.5593220338983051) internal successors, (92), 72 states have internal predecessors, (92), 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-04 13:28:12,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 13:28:12,160 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 13:28:12,160 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 13:28:12,160 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 13:28:12,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 13:28:12,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1182236761, now seen corresponding path program 1 times [2025-03-04 13:28:12,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 13:28:12,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138249797] [2025-03-04 13:28:12,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 13:28:12,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 13:28:12,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 13:28:12,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 13:28:12,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 13:28:12,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 13:28:12,362 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-04 13:28:12,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 13:28:12,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138249797] [2025-03-04 13:28:12,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138249797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 13:28:12,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 13:28:12,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 13:28:12,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688141254] [2025-03-04 13:28:12,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 13:28:12,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 13:28:12,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 13:28:12,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 13:28:12,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 13:28:12,383 INFO L87 Difference]: Start difference. First operand has 79 states, 59 states have (on average 1.5593220338983051) internal successors, (92), 72 states have internal predecessors, (92), 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) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-04 13:28:12,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 13:28:12,431 INFO L93 Difference]: Finished difference Result 150 states and 195 transitions. [2025-03-04 13:28:12,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 13:28:12,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 13 [2025-03-04 13:28:12,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 13:28:12,437 INFO L225 Difference]: With dead ends: 150 [2025-03-04 13:28:12,438 INFO L226 Difference]: Without dead ends: 95 [2025-03-04 13:28:12,439 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-04 13:28:12,441 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 35 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 13:28:12,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 188 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 13:28:12,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-04 13:28:12,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 73. [2025-03-04 13:28:12,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 55 states have (on average 1.5818181818181818) internal successors, (87), 67 states have internal predecessors, (87), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 13:28:12,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 95 transitions. [2025-03-04 13:28:12,466 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 95 transitions. Word has length 13 [2025-03-04 13:28:12,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 13:28:12,467 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 95 transitions. [2025-03-04 13:28:12,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-04 13:28:12,467 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 95 transitions. [2025-03-04 13:28:12,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 13:28:12,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 13:28:12,468 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 13:28:12,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 13:28:12,468 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 13:28:12,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 13:28:12,469 INFO L85 PathProgramCache]: Analyzing trace with hash 283464274, now seen corresponding path program 1 times [2025-03-04 13:28:12,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 13:28:12,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381900327] [2025-03-04 13:28:12,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 13:28:12,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 13:28:12,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 13:28:12,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 13:28:12,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 13:28:12,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 13:28:12,586 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-04 13:28:12,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 13:28:12,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381900327] [2025-03-04 13:28:12,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381900327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 13:28:12,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 13:28:12,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 13:28:12,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578965793] [2025-03-04 13:28:12,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 13:28:12,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 13:28:12,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 13:28:12,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 13:28:12,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 13:28:12,588 INFO L87 Difference]: Start difference. First operand 73 states and 95 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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-04 13:28:12,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 13:28:12,628 INFO L93 Difference]: Finished difference Result 99 states and 134 transitions. [2025-03-04 13:28:12,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 13:28:12,629 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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-04 13:28:12,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 13:28:12,630 INFO L225 Difference]: With dead ends: 99 [2025-03-04 13:28:12,630 INFO L226 Difference]: Without dead ends: 97 [2025-03-04 13:28:12,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 13:28:12,630 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 30 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 13:28:12,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 251 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 13:28:12,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-04 13:28:12,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-03-04 13:28:12,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 79 states have (on average 1.5696202531645569) internal successors, (124), 91 states have internal predecessors, (124), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 13:28:12,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 132 transitions. [2025-03-04 13:28:12,636 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 132 transitions. Word has length 16 [2025-03-04 13:28:12,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 13:28:12,636 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 132 transitions. [2025-03-04 13:28:12,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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-04 13:28:12,636 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 132 transitions. [2025-03-04 13:28:12,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 13:28:12,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 13:28:12,637 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 13:28:12,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 13:28:12,637 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 13:28:12,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 13:28:12,637 INFO L85 PathProgramCache]: Analyzing trace with hash -362961620, now seen corresponding path program 1 times [2025-03-04 13:28:12,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 13:28:12,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132472421] [2025-03-04 13:28:12,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 13:28:12,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 13:28:12,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 13:28:12,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 13:28:12,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 13:28:12,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 13:28:12,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 13:28:12,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 13:28:12,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132472421] [2025-03-04 13:28:12,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132472421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 13:28:12,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 13:28:12,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 13:28:12,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131326432] [2025-03-04 13:28:12,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 13:28:12,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 13:28:12,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 13:28:12,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 13:28:12,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 13:28:12,678 INFO L87 Difference]: Start difference. First operand 97 states and 132 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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-04 13:28:12,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 13:28:12,710 INFO L93 Difference]: Finished difference Result 145 states and 190 transitions. [2025-03-04 13:28:12,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 13:28:12,711 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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 22 [2025-03-04 13:28:12,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 13:28:12,713 INFO L225 Difference]: With dead ends: 145 [2025-03-04 13:28:12,713 INFO L226 Difference]: Without dead ends: 104 [2025-03-04 13:28:12,713 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-04 13:28:12,713 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 11 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 13:28:12,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 168 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 13:28:12,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-04 13:28:12,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2025-03-04 13:28:12,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 84 states have (on average 1.5595238095238095) internal successors, (131), 95 states have internal predecessors, (131), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 13:28:12,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 139 transitions. [2025-03-04 13:28:12,725 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 139 transitions. Word has length 22 [2025-03-04 13:28:12,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 13:28:12,726 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 139 transitions. [2025-03-04 13:28:12,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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-04 13:28:12,726 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 139 transitions. [2025-03-04 13:28:12,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 13:28:12,727 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 13:28:12,727 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 13:28:12,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 13:28:12,727 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 13:28:12,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 13:28:12,728 INFO L85 PathProgramCache]: Analyzing trace with hash -362960914, now seen corresponding path program 1 times [2025-03-04 13:28:12,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 13:28:12,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822190461] [2025-03-04 13:28:12,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 13:28:12,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 13:28:12,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 13:28:12,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 13:28:12,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 13:28:12,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 13:28:12,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 13:28:12,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 13:28:12,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822190461] [2025-03-04 13:28:12,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822190461] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 13:28:12,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 13:28:12,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 13:28:12,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238350688] [2025-03-04 13:28:12,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 13:28:12,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 13:28:12,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 13:28:12,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 13:28:12,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 13:28:12,814 INFO L87 Difference]: Start difference. First operand 101 states and 139 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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-04 13:28:12,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 13:28:12,847 INFO L93 Difference]: Finished difference Result 140 states and 187 transitions. [2025-03-04 13:28:12,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 13:28:12,848 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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 22 [2025-03-04 13:28:12,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 13:28:12,848 INFO L225 Difference]: With dead ends: 140 [2025-03-04 13:28:12,848 INFO L226 Difference]: Without dead ends: 116 [2025-03-04 13:28:12,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 13:28:12,849 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 8 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 13:28:12,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 247 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 13:28:12,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-04 13:28:12,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2025-03-04 13:28:12,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 96 states have (on average 1.5208333333333333) internal successors, (146), 108 states have internal predecessors, (146), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 13:28:12,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 158 transitions. [2025-03-04 13:28:12,858 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 158 transitions. Word has length 22 [2025-03-04 13:28:12,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 13:28:12,858 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 158 transitions. [2025-03-04 13:28:12,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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-04 13:28:12,858 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 158 transitions. [2025-03-04 13:28:12,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 13:28:12,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 13:28:12,859 INFO L218 NwaCegarLoop]: trace histogram [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-04 13:28:12,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 13:28:12,859 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 13:28:12,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 13:28:12,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1633091679, now seen corresponding path program 1 times [2025-03-04 13:28:12,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 13:28:12,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493254993] [2025-03-04 13:28:12,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 13:28:12,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 13:28:12,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 13:28:12,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 13:28:12,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 13:28:12,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 13:28:12,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 13:28:12,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 13:28:12,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493254993] [2025-03-04 13:28:12,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493254993] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 13:28:12,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 13:28:12,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 13:28:12,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611744733] [2025-03-04 13:28:12,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 13:28:12,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 13:28:12,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 13:28:12,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 13:28:12,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 13:28:12,935 INFO L87 Difference]: Start difference. First operand 115 states and 158 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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-04 13:28:12,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 13:28:12,971 INFO L93 Difference]: Finished difference Result 166 states and 218 transitions. [2025-03-04 13:28:12,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 13:28:12,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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 23 [2025-03-04 13:28:12,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 13:28:12,973 INFO L225 Difference]: With dead ends: 166 [2025-03-04 13:28:12,974 INFO L226 Difference]: Without dead ends: 126 [2025-03-04 13:28:12,975 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-04 13:28:12,975 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 45 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 13:28:12,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 164 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 13:28:12,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-04 13:28:12,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 123. [2025-03-04 13:28:12,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 105 states have (on average 1.4857142857142858) internal successors, (156), 114 states have internal predecessors, (156), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 13:28:12,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 168 transitions. [2025-03-04 13:28:12,987 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 168 transitions. Word has length 23 [2025-03-04 13:28:12,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 13:28:12,987 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 168 transitions. [2025-03-04 13:28:12,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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-04 13:28:12,988 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 168 transitions. [2025-03-04 13:28:12,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 13:28:12,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 13:28:12,988 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 13:28:12,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 13:28:12,988 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 13:28:12,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 13:28:12,989 INFO L85 PathProgramCache]: Analyzing trace with hash -989953363, now seen corresponding path program 1 times [2025-03-04 13:28:12,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 13:28:12,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330861576] [2025-03-04 13:28:12,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 13:28:12,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 13:28:12,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 13:28:13,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 13:28:13,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 13:28:13,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 13:28:13,078 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 13:28:13,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 13:28:13,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330861576] [2025-03-04 13:28:13,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330861576] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 13:28:13,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014858896] [2025-03-04 13:28:13,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 13:28:13,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 13:28:13,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 13:28:13,081 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-04 13:28:13,083 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-04 13:28:13,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 13:28:13,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 13:28:13,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 13:28:13,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 13:28:13,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 13:28:13,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 13:28:13,204 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 13:28:13,204 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 13:28:13,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014858896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 13:28:13,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 13:28:13,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 13:28:13,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638803037] [2025-03-04 13:28:13,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 13:28:13,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 13:28:13,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 13:28:13,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 13:28:13,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 13:28:13,206 INFO L87 Difference]: Start difference. First operand 123 states and 168 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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-04 13:28:13,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 13:28:13,233 INFO L93 Difference]: Finished difference Result 191 states and 254 transitions. [2025-03-04 13:28:13,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 13:28:13,235 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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 25 [2025-03-04 13:28:13,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 13:28:13,235 INFO L225 Difference]: With dead ends: 191 [2025-03-04 13:28:13,235 INFO L226 Difference]: Without dead ends: 97 [2025-03-04 13:28:13,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 13:28:13,236 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 29 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 13:28:13,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 239 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 13:28:13,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-04 13:28:13,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-03-04 13:28:13,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 88 states have internal predecessors, (116), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 13:28:13,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 128 transitions. [2025-03-04 13:28:13,244 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 128 transitions. Word has length 25 [2025-03-04 13:28:13,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 13:28:13,248 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 128 transitions. [2025-03-04 13:28:13,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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-04 13:28:13,249 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 128 transitions. [2025-03-04 13:28:13,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 13:28:13,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 13:28:13,249 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] [2025-03-04 13:28:13,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 13:28:13,453 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-04 13:28:13,453 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 13:28:13,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 13:28:13,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1753884013, now seen corresponding path program 1 times [2025-03-04 13:28:13,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 13:28:13,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146814101] [2025-03-04 13:28:13,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 13:28:13,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 13:28:13,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 13:28:13,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 13:28:13,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 13:28:13,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 13:28:13,512 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 13:28:13,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 13:28:13,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146814101] [2025-03-04 13:28:13,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146814101] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 13:28:13,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101915696] [2025-03-04 13:28:13,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 13:28:13,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 13:28:13,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 13:28:13,515 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 13:28:13,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 13:28:13,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 13:28:13,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 13:28:13,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 13:28:13,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 13:28:13,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 13:28:13,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 13:28:13,607 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 13:28:13,607 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 13:28:13,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101915696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 13:28:13,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 13:28:13,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 13:28:13,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885917975] [2025-03-04 13:28:13,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 13:28:13,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 13:28:13,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 13:28:13,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 13:28:13,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 13:28:13,608 INFO L87 Difference]: Start difference. First operand 97 states and 128 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-04 13:28:13,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 13:28:13,641 INFO L93 Difference]: Finished difference Result 126 states and 162 transitions. [2025-03-04 13:28:13,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 13:28:13,642 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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 27 [2025-03-04 13:28:13,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 13:28:13,642 INFO L225 Difference]: With dead ends: 126 [2025-03-04 13:28:13,643 INFO L226 Difference]: Without dead ends: 76 [2025-03-04 13:28:13,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 13:28:13,644 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 6 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 13:28:13,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 297 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 13:28:13,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-04 13:28:13,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 68. [2025-03-04 13:28:13,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 62 states have internal predecessors, (80), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 13:28:13,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 88 transitions. [2025-03-04 13:28:13,648 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 88 transitions. Word has length 27 [2025-03-04 13:28:13,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 13:28:13,648 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 88 transitions. [2025-03-04 13:28:13,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-04 13:28:13,648 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 88 transitions. [2025-03-04 13:28:13,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 13:28:13,649 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 13:28:13,649 INFO L218 NwaCegarLoop]: trace histogram [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-04 13:28:13,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 13:28:13,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-04 13:28:13,849 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 13:28:13,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 13:28:13,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1753869790, now seen corresponding path program 1 times [2025-03-04 13:28:13,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 13:28:13,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858346935] [2025-03-04 13:28:13,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 13:28:13,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 13:28:13,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 13:28:13,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 13:28:13,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 13:28:13,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 13:28:13,882 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 13:28:13,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 13:28:13,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858346935] [2025-03-04 13:28:13,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858346935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 13:28:13,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 13:28:13,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 13:28:13,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441655010] [2025-03-04 13:28:13,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 13:28:13,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 13:28:13,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 13:28:13,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 13:28:13,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 13:28:13,883 INFO L87 Difference]: Start difference. First operand 68 states and 88 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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-04 13:28:13,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 13:28:13,908 INFO L93 Difference]: Finished difference Result 89 states and 111 transitions. [2025-03-04 13:28:13,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 13:28:13,908 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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 27 [2025-03-04 13:28:13,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 13:28:13,908 INFO L225 Difference]: With dead ends: 89 [2025-03-04 13:28:13,908 INFO L226 Difference]: Without dead ends: 71 [2025-03-04 13:28:13,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 13:28:13,909 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 1 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 13:28:13,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 238 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 13:28:13,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-04 13:28:13,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-03-04 13:28:13,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 65 states have internal predecessors, (83), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 13:28:13,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 91 transitions. [2025-03-04 13:28:13,912 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 91 transitions. Word has length 27 [2025-03-04 13:28:13,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 13:28:13,912 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 91 transitions. [2025-03-04 13:28:13,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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-04 13:28:13,912 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 91 transitions. [2025-03-04 13:28:13,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 13:28:13,913 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 13:28:13,913 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 13:28:13,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 13:28:13,913 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 13:28:13,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 13:28:13,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1257759910, now seen corresponding path program 1 times [2025-03-04 13:28:13,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 13:28:13,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486121393] [2025-03-04 13:28:13,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 13:28:13,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 13:28:13,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 13:28:13,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 13:28:13,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 13:28:13,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 13:28:13,974 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 13:28:13,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 13:28:13,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486121393] [2025-03-04 13:28:13,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486121393] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 13:28:13,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136283188] [2025-03-04 13:28:13,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 13:28:13,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 13:28:13,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 13:28:13,977 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 13:28:13,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 13:28:14,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 13:28:14,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 13:28:14,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 13:28:14,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 13:28:14,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 13:28:14,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 13:28:14,062 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 13:28:14,062 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 13:28:14,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136283188] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 13:28:14,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 13:28:14,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 13:28:14,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127580015] [2025-03-04 13:28:14,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 13:28:14,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 13:28:14,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 13:28:14,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 13:28:14,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 13:28:14,063 INFO L87 Difference]: Start difference. First operand 71 states and 91 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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-04 13:28:14,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 13:28:14,083 INFO L93 Difference]: Finished difference Result 88 states and 110 transitions. [2025-03-04 13:28:14,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 13:28:14,084 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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 30 [2025-03-04 13:28:14,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 13:28:14,084 INFO L225 Difference]: With dead ends: 88 [2025-03-04 13:28:14,084 INFO L226 Difference]: Without dead ends: 67 [2025-03-04 13:28:14,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 13:28:14,085 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 232 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-04 13:28:14,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 232 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 13:28:14,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-04 13:28:14,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-04 13:28:14,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 57 states have (on average 1.368421052631579) internal successors, (78), 61 states have internal predecessors, (78), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 13:28:14,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 86 transitions. [2025-03-04 13:28:14,088 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 86 transitions. Word has length 30 [2025-03-04 13:28:14,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 13:28:14,089 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 86 transitions. [2025-03-04 13:28:14,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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-04 13:28:14,089 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2025-03-04 13:28:14,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 13:28:14,089 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 13:28:14,089 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 13:28:14,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 13:28:14,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 13:28:14,290 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 13:28:14,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 13:28:14,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1821617320, now seen corresponding path program 1 times [2025-03-04 13:28:14,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 13:28:14,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326347285] [2025-03-04 13:28:14,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 13:28:14,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 13:28:14,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 13:28:14,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 13:28:14,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 13:28:14,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 13:28:14,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 13:28:14,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 13:28:14,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326347285] [2025-03-04 13:28:14,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326347285] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 13:28:14,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 13:28:14,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 13:28:14,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125357681] [2025-03-04 13:28:14,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 13:28:14,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 13:28:14,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 13:28:14,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 13:28:14,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 13:28:14,327 INFO L87 Difference]: Start difference. First operand 67 states and 86 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 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-04 13:28:14,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 13:28:14,341 INFO L93 Difference]: Finished difference Result 81 states and 103 transitions. [2025-03-04 13:28:14,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 13:28:14,341 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 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 32 [2025-03-04 13:28:14,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 13:28:14,342 INFO L225 Difference]: With dead ends: 81 [2025-03-04 13:28:14,342 INFO L226 Difference]: Without dead ends: 65 [2025-03-04 13:28:14,342 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-04 13:28:14,342 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 8 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 13:28:14,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 139 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 13:28:14,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-04 13:28:14,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-03-04 13:28:14,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 57 states have (on average 1.3157894736842106) internal successors, (75), 59 states have internal predecessors, (75), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 13:28:14,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 83 transitions. [2025-03-04 13:28:14,347 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 83 transitions. Word has length 32 [2025-03-04 13:28:14,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 13:28:14,347 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 83 transitions. [2025-03-04 13:28:14,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 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-04 13:28:14,347 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 83 transitions. [2025-03-04 13:28:14,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-04 13:28:14,351 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 13:28:14,351 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 13:28:14,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 13:28:14,352 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 13:28:14,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 13:28:14,352 INFO L85 PathProgramCache]: Analyzing trace with hash 892553236, now seen corresponding path program 1 times [2025-03-04 13:28:14,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 13:28:14,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530435633] [2025-03-04 13:28:14,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 13:28:14,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 13:28:14,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 13:28:14,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 13:28:14,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 13:28:14,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 13:28:14,414 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 13:28:14,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 13:28:14,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530435633] [2025-03-04 13:28:14,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530435633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 13:28:14,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 13:28:14,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 13:28:14,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959422456] [2025-03-04 13:28:14,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 13:28:14,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 13:28:14,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 13:28:14,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 13:28:14,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 13:28:14,416 INFO L87 Difference]: Start difference. First operand 65 states and 83 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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-04 13:28:14,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 13:28:14,444 INFO L93 Difference]: Finished difference Result 76 states and 95 transitions. [2025-03-04 13:28:14,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 13:28:14,445 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 40 [2025-03-04 13:28:14,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 13:28:14,445 INFO L225 Difference]: With dead ends: 76 [2025-03-04 13:28:14,445 INFO L226 Difference]: Without dead ends: 74 [2025-03-04 13:28:14,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 13:28:14,446 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 1 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 13:28:14,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 220 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 13:28:14,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-04 13:28:14,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-03-04 13:28:14,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 65 states have (on average 1.2769230769230768) internal successors, (83), 67 states have internal predecessors, (83), 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-04 13:28:14,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 93 transitions. [2025-03-04 13:28:14,455 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 93 transitions. Word has length 40 [2025-03-04 13:28:14,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 13:28:14,456 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 93 transitions. [2025-03-04 13:28:14,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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-04 13:28:14,456 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 93 transitions. [2025-03-04 13:28:14,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-04 13:28:14,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 13:28:14,459 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 13:28:14,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 13:28:14,459 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 13:28:14,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 13:28:14,460 INFO L85 PathProgramCache]: Analyzing trace with hash -878151301, now seen corresponding path program 1 times [2025-03-04 13:28:14,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 13:28:14,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336232002] [2025-03-04 13:28:14,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 13:28:14,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 13:28:14,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 13:28:14,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 13:28:14,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 13:28:14,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 13:28:14,564 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 13:28:14,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 13:28:14,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336232002] [2025-03-04 13:28:14,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336232002] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 13:28:14,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056514944] [2025-03-04 13:28:14,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 13:28:14,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 13:28:14,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 13:28:14,570 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 13:28:14,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 13:28:14,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 13:28:14,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 13:28:14,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 13:28:14,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 13:28:14,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 13:28:14,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 13:28:14,693 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 13:28:14,693 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 13:28:14,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056514944] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 13:28:14,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 13:28:14,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 13:28:14,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371404489] [2025-03-04 13:28:14,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 13:28:14,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 13:28:14,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 13:28:14,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 13:28:14,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 13:28:14,695 INFO L87 Difference]: Start difference. First operand 74 states and 93 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 13:28:14,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 13:28:14,724 INFO L93 Difference]: Finished difference Result 78 states and 96 transitions. [2025-03-04 13:28:14,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 13:28:14,725 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 52 [2025-03-04 13:28:14,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 13:28:14,725 INFO L225 Difference]: With dead ends: 78 [2025-03-04 13:28:14,726 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 13:28:14,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 13:28:14,727 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 13:28:14,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 215 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 13:28:14,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 13:28:14,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 13:28:14,728 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-04 13:28:14,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 13:28:14,728 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2025-03-04 13:28:14,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 13:28:14,728 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 13:28:14,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 13:28:14,728 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 13:28:14,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 13:28:14,730 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2025-03-04 13:28:14,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2025-03-04 13:28:14,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2025-03-04 13:28:14,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2025-03-04 13:28:14,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2025-03-04 13:28:14,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2025-03-04 13:28:14,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2025-03-04 13:28:14,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2025-03-04 13:28:14,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2025-03-04 13:28:14,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2025-03-04 13:28:14,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2025-03-04 13:28:14,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2025-03-04 13:28:14,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 13:28:14,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 13:28:14,934 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 13:28:14,936 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 13:28:14,992 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 13:28:15,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 01:28:15 BoogieIcfgContainer [2025-03-04 13:28:15,001 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 13:28:15,002 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 13:28:15,002 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 13:28:15,002 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 13:28:15,003 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:28:12" (3/4) ... [2025-03-04 13:28:15,004 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 13:28:15,008 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printLine [2025-03-04 13:28:15,008 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-03-04 13:28:15,011 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-04 13:28:15,011 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-04 13:28:15,012 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 13:28:15,080 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 13:28:15,081 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 13:28:15,081 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 13:28:15,083 INFO L158 Benchmark]: Toolchain (without parser) took 4197.59ms. Allocated memory was 167.8MB in the beginning and 436.2MB in the end (delta: 268.4MB). Free memory was 126.6MB in the beginning and 302.5MB in the end (delta: -175.8MB). Peak memory consumption was 93.6MB. Max. memory is 16.1GB. [2025-03-04 13:28:15,083 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 184.5MB. Free memory is still 110.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 13:28:15,084 INFO L158 Benchmark]: CACSL2BoogieTranslator took 753.87ms. Allocated memory is still 167.8MB. Free memory was 126.6MB in the beginning and 66.5MB in the end (delta: 60.1MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-04 13:28:15,084 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.30ms. Allocated memory is still 167.8MB. Free memory was 66.5MB in the beginning and 63.7MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 13:28:15,084 INFO L158 Benchmark]: Boogie Preprocessor took 22.78ms. Allocated memory is still 167.8MB. Free memory was 63.7MB in the beginning and 61.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 13:28:15,084 INFO L158 Benchmark]: IcfgBuilder took 395.99ms. Allocated memory is still 167.8MB. Free memory was 61.8MB in the beginning and 119.2MB in the end (delta: -57.4MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. [2025-03-04 13:28:15,085 INFO L158 Benchmark]: TraceAbstraction took 2902.45ms. Allocated memory was 167.8MB in the beginning and 436.2MB in the end (delta: 268.4MB). Free memory was 118.2MB in the beginning and 309.5MB in the end (delta: -191.3MB). Peak memory consumption was 70.8MB. Max. memory is 16.1GB. [2025-03-04 13:28:15,085 INFO L158 Benchmark]: Witness Printer took 79.35ms. Allocated memory is still 436.2MB. Free memory was 309.5MB in the beginning and 302.5MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 13:28:15,086 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.31ms. Allocated memory is still 184.5MB. Free memory is still 110.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 753.87ms. Allocated memory is still 167.8MB. Free memory was 126.6MB in the beginning and 66.5MB in the end (delta: 60.1MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.30ms. Allocated memory is still 167.8MB. Free memory was 66.5MB in the beginning and 63.7MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.78ms. Allocated memory is still 167.8MB. Free memory was 63.7MB in the beginning and 61.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 395.99ms. Allocated memory is still 167.8MB. Free memory was 61.8MB in the beginning and 119.2MB in the end (delta: -57.4MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2902.45ms. Allocated memory was 167.8MB in the beginning and 436.2MB in the end (delta: 268.4MB). Free memory was 118.2MB in the beginning and 309.5MB in the end (delta: -191.3MB). Peak memory consumption was 70.8MB. Max. memory is 16.1GB. * Witness Printer took 79.35ms. Allocated memory is still 436.2MB. Free memory was 309.5MB in the beginning and 302.5MB in the end (delta: 7.0MB). 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: 1582]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1582]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1586]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1586]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1578]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1578]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1557]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1557]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1563]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1563]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1553]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1553]: 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, 79 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 182 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 174 mSDsluCounter, 2598 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1609 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 294 IncrementalHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 989 mSDtfsCounter, 294 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 171 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=123occurred in iteration=5, InterpolantAutomatonStates: 48, 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, 12 MinimizatonAttempts, 37 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 463 NumberOfCodeBlocks, 463 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 447 ConstructedInterpolants, 0 QuantifiedInterpolants, 633 SizeOfPredicates, 0 NumberOfNonLiveVariables, 499 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 16 InterpolantComputations, 12 PerfectInterpolantSequences, 69/73 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 12 specifications checked. All of them hold - InvariantResult [Line: 1553]: Location Invariant Derived location invariant: (((i == 0) && (data <= 1073741822)) || (0 < i)) - InvariantResult [Line: 1557]: Location Invariant Derived location invariant: ((k == 0) || (1 <= k)) - InvariantResult [Line: 1582]: Location Invariant Derived location invariant: (((1 <= j) && (data == 2)) || ((j == 0) && (data == 2))) - InvariantResult [Line: 1578]: Location Invariant Derived location invariant: (((1 <= h) && (data == 2)) || (h == 0)) RESULT: Ultimate proved your program to be correct! [2025-03-04 13:28:15,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE