./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive-simple/id_i25_o25-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/recursive-simple/id_i25_o25-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-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 32bit --witnessprinter.graph.data.programhash 2409cd2f018515417b0b6bf5d396e4bc80c02540769112137ebf388167bdf776 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 11:30:10,680 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 11:30:10,720 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 11:30:10,724 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 11:30:10,724 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 11:30:10,750 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 11:30:10,751 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 11:30:10,751 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 11:30:10,751 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 11:30:10,751 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 11:30:10,751 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 11:30:10,751 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 11:30:10,751 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 11:30:10,752 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 11:30:10,753 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 11:30:10,753 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 11:30:10,753 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 11:30:10,753 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 11:30:10,753 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 11:30:10,753 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 11:30:10,754 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 11:30:10,754 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 11:30:10,754 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 11:30:10,754 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 11:30:10,754 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 11:30:10,754 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 11:30:10,754 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 11:30:10,754 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 11:30:10,754 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 11:30:10,754 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 11:30:10,754 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 11:30:10,754 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 11:30:10,754 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 11:30:10,754 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 11:30:10,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:30:10,754 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 11:30:10,754 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 11:30:10,754 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 11:30:10,754 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 11:30:10,754 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 11:30:10,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 11:30:10,754 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 11:30:10,755 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 11:30:10,755 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 11:30:10,755 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 11:30:10,755 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2409cd2f018515417b0b6bf5d396e4bc80c02540769112137ebf388167bdf776 [2025-03-04 11:30:11,000 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 11:30:11,008 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 11:30:11,010 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 11:30:11,012 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 11:30:11,012 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 11:30:11,013 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/id_i25_o25-1.c [2025-03-04 11:30:12,123 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/362384361/65d5381462fb41409d1cdfe0c4896ad0/FLAGe03b6a512 [2025-03-04 11:30:12,323 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 11:30:12,324 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_i25_o25-1.c [2025-03-04 11:30:12,341 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/362384361/65d5381462fb41409d1cdfe0c4896ad0/FLAGe03b6a512 [2025-03-04 11:30:12,687 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/362384361/65d5381462fb41409d1cdfe0c4896ad0 [2025-03-04 11:30:12,689 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 11:30:12,689 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 11:30:12,690 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 11:30:12,690 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 11:30:12,693 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 11:30:12,694 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:30:12" (1/1) ... [2025-03-04 11:30:12,694 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f73aac9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:30:12, skipping insertion in model container [2025-03-04 11:30:12,694 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:30:12" (1/1) ... [2025-03-04 11:30:12,702 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 11:30:12,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:30:12,789 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 11:30:12,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:30:12,809 INFO L204 MainTranslator]: Completed translation [2025-03-04 11:30:12,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:30:12 WrapperNode [2025-03-04 11:30:12,809 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 11:30:12,810 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 11:30:12,810 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 11:30:12,810 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 11:30:12,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:30:12" (1/1) ... [2025-03-04 11:30:12,820 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:30:12" (1/1) ... [2025-03-04 11:30:12,831 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 19 [2025-03-04 11:30:12,832 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 11:30:12,832 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 11:30:12,833 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 11:30:12,833 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 11:30:12,838 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:30:12" (1/1) ... [2025-03-04 11:30:12,838 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:30:12" (1/1) ... [2025-03-04 11:30:12,839 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:30:12" (1/1) ... [2025-03-04 11:30:12,850 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 11:30:12,850 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:30:12" (1/1) ... [2025-03-04 11:30:12,850 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:30:12" (1/1) ... [2025-03-04 11:30:12,851 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:30:12" (1/1) ... [2025-03-04 11:30:12,852 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:30:12" (1/1) ... [2025-03-04 11:30:12,852 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:30:12" (1/1) ... [2025-03-04 11:30:12,853 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:30:12" (1/1) ... [2025-03-04 11:30:12,853 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 11:30:12,856 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 11:30:12,856 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 11:30:12,857 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 11:30:12,858 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:30:12" (1/1) ... [2025-03-04 11:30:12,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:30:12,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:30:12,886 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 11:30:12,890 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 11:30:12,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 11:30:12,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 11:30:12,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 11:30:12,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 11:30:12,909 INFO L130 BoogieDeclarations]: Found specification of procedure id [2025-03-04 11:30:12,909 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2025-03-04 11:30:12,950 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 11:30:12,952 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 11:30:13,039 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8: havoc #t~ret4; [2025-03-04 11:30:13,043 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-03-04 11:30:13,043 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 11:30:13,049 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 11:30:13,050 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 11:30:13,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:30:13 BoogieIcfgContainer [2025-03-04 11:30:13,050 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 11:30:13,052 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 11:30:13,052 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 11:30:13,055 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 11:30:13,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 11:30:12" (1/3) ... [2025-03-04 11:30:13,056 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14e80eeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:30:13, skipping insertion in model container [2025-03-04 11:30:13,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:30:12" (2/3) ... [2025-03-04 11:30:13,056 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14e80eeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:30:13, skipping insertion in model container [2025-03-04 11:30:13,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:30:13" (3/3) ... [2025-03-04 11:30:13,057 INFO L128 eAbstractionObserver]: Analyzing ICFG id_i25_o25-1.c [2025-03-04 11:30:13,068 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 11:30:13,069 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG id_i25_o25-1.c that has 2 procedures, 24 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-03-04 11:30:13,109 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 11:30:13,122 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;@225f91b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 11:30:13,123 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 11:30:13,126 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.375) internal successors, (22), 20 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:30:13,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 11:30:13,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:13,132 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 11:30:13,132 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 11:30:13,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:13,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1123769116, now seen corresponding path program 1 times [2025-03-04 11:30:13,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:13,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335587483] [2025-03-04 11:30:13,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:30:13,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:13,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 11:30:13,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 11:30:13,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:30:13,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:13,295 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 11:30:13,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:13,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335587483] [2025-03-04 11:30:13,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335587483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:30:13,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:30:13,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:30:13,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458427620] [2025-03-04 11:30:13,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:30:13,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:30:13,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:30:13,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:30:13,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:30:13,316 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.375) internal successors, (22), 20 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:30:13,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:30:13,380 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2025-03-04 11:30:13,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:30:13,382 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 11:30:13,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:30:13,385 INFO L225 Difference]: With dead ends: 46 [2025-03-04 11:30:13,385 INFO L226 Difference]: Without dead ends: 28 [2025-03-04 11:30:13,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:30:13,389 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 22 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:30:13,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 67 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:30:13,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-04 11:30:13,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2025-03-04 11:30:13,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:30:13,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2025-03-04 11:30:13,412 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 6 [2025-03-04 11:30:13,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:30:13,413 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2025-03-04 11:30:13,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:30:13,413 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2025-03-04 11:30:13,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 11:30:13,413 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:13,414 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:30:13,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 11:30:13,414 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 11:30:13,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:13,415 INFO L85 PathProgramCache]: Analyzing trace with hash 477104215, now seen corresponding path program 1 times [2025-03-04 11:30:13,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:13,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918645894] [2025-03-04 11:30:13,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:30:13,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:13,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 11:30:13,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 11:30:13,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:30:13,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:13,466 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 11:30:13,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:13,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918645894] [2025-03-04 11:30:13,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918645894] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:30:13,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:30:13,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:30:13,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263980424] [2025-03-04 11:30:13,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:30:13,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:30:13,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:30:13,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:30:13,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:30:13,469 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:30:13,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:30:13,501 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2025-03-04 11:30:13,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:30:13,502 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 11:30:13,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:30:13,503 INFO L225 Difference]: With dead ends: 27 [2025-03-04 11:30:13,503 INFO L226 Difference]: Without dead ends: 26 [2025-03-04 11:30:13,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:30:13,504 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 19 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:30:13,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 26 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:30:13,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-04 11:30:13,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2025-03-04 11:30:13,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:30:13,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2025-03-04 11:30:13,510 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 7 [2025-03-04 11:30:13,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:30:13,510 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2025-03-04 11:30:13,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:30:13,511 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2025-03-04 11:30:13,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 11:30:13,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:13,511 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:30:13,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 11:30:13,512 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 11:30:13,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:13,512 INFO L85 PathProgramCache]: Analyzing trace with hash -638284688, now seen corresponding path program 1 times [2025-03-04 11:30:13,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:13,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978106874] [2025-03-04 11:30:13,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:30:13,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:13,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 11:30:13,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 11:30:13,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:30:13,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:13,602 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:30:13,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:13,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978106874] [2025-03-04 11:30:13,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978106874] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:30:13,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133358705] [2025-03-04 11:30:13,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:30:13,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:13,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:30:13,611 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 11:30:13,613 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 11:30:13,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 11:30:13,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 11:30:13,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:30:13,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:13,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 11:30:13,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:30:13,702 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:30:13,703 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:30:13,781 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:30:13,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133358705] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:30:13,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:30:13,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-04 11:30:13,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164218607] [2025-03-04 11:30:13,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:30:13,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 11:30:13,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:30:13,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 11:30:13,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:30:13,783 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 12 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:30:13,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:30:13,905 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2025-03-04 11:30:13,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 11:30:13,906 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-04 11:30:13,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:30:13,906 INFO L225 Difference]: With dead ends: 76 [2025-03-04 11:30:13,906 INFO L226 Difference]: Without dead ends: 68 [2025-03-04 11:30:13,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-03-04 11:30:13,907 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 99 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:30:13,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 95 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:30:13,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-04 11:30:13,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 54. [2025-03-04 11:30:13,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 43 states have internal predecessors, (54), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:30:13,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2025-03-04 11:30:13,923 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 11 [2025-03-04 11:30:13,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:30:13,923 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2025-03-04 11:30:13,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:30:13,923 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2025-03-04 11:30:13,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 11:30:13,924 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:13,924 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:30:13,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 11:30:14,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:14,124 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 11:30:14,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:14,126 INFO L85 PathProgramCache]: Analyzing trace with hash -16539686, now seen corresponding path program 1 times [2025-03-04 11:30:14,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:14,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801801592] [2025-03-04 11:30:14,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:30:14,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:14,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 11:30:14,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 11:30:14,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:30:14,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:14,193 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 11:30:14,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:14,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801801592] [2025-03-04 11:30:14,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801801592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:30:14,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:30:14,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:30:14,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529649281] [2025-03-04 11:30:14,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:30:14,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:30:14,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:30:14,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:30:14,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:30:14,196 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:30:14,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:30:14,213 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2025-03-04 11:30:14,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:30:14,213 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2025-03-04 11:30:14,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:30:14,214 INFO L225 Difference]: With dead ends: 74 [2025-03-04 11:30:14,214 INFO L226 Difference]: Without dead ends: 72 [2025-03-04 11:30:14,214 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 11:30:14,215 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:30:14,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 39 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:30:14,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-04 11:30:14,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-03-04 11:30:14,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 57 states have internal predecessors, (69), 6 states have call successors, (6), 5 states have call predecessors, (6), 7 states have return successors, (9), 9 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-04 11:30:14,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2025-03-04 11:30:14,233 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 19 [2025-03-04 11:30:14,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:30:14,233 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2025-03-04 11:30:14,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:30:14,233 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2025-03-04 11:30:14,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 11:30:14,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:14,234 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:30:14,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 11:30:14,234 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 11:30:14,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:14,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1336297931, now seen corresponding path program 1 times [2025-03-04 11:30:14,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:14,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460801820] [2025-03-04 11:30:14,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:30:14,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:14,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 11:30:14,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 11:30:14,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:30:14,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:14,278 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:30:14,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:14,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460801820] [2025-03-04 11:30:14,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460801820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:30:14,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:30:14,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:30:14,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567947444] [2025-03-04 11:30:14,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:30:14,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:30:14,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:30:14,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:30:14,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:30:14,281 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:30:14,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:30:14,296 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2025-03-04 11:30:14,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:30:14,297 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2025-03-04 11:30:14,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:30:14,297 INFO L225 Difference]: With dead ends: 72 [2025-03-04 11:30:14,298 INFO L226 Difference]: Without dead ends: 71 [2025-03-04 11:30:14,299 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 11:30:14,299 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 1 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:30:14,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 25 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:30:14,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-04 11:30:14,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-03-04 11:30:14,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 56 states have internal predecessors, (64), 6 states have call successors, (6), 5 states have call predecessors, (6), 7 states have return successors, (9), 9 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-04 11:30:14,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2025-03-04 11:30:14,322 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 24 [2025-03-04 11:30:14,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:30:14,322 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2025-03-04 11:30:14,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:30:14,323 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2025-03-04 11:30:14,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 11:30:14,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:14,323 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1] [2025-03-04 11:30:14,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 11:30:14,324 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 11:30:14,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:14,324 INFO L85 PathProgramCache]: Analyzing trace with hash -543218660, now seen corresponding path program 2 times [2025-03-04 11:30:14,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:14,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420223762] [2025-03-04 11:30:14,324 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:30:14,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:14,332 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 11:30:14,337 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 11:30:14,337 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:30:14,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:14,471 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:30:14,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:14,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420223762] [2025-03-04 11:30:14,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420223762] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:30:14,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2882824] [2025-03-04 11:30:14,472 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:30:14,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:14,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:30:14,474 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 11:30:14,475 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 11:30:14,495 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 11:30:14,504 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 11:30:14,504 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:30:14,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:14,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 11:30:14,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:30:14,542 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:30:14,542 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:30:14,711 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:30:14,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2882824] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:30:14,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:30:14,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2025-03-04 11:30:14,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057205794] [2025-03-04 11:30:14,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:30:14,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 11:30:14,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:30:14,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 11:30:14,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2025-03-04 11:30:14,713 INFO L87 Difference]: Start difference. First operand 71 states and 79 transitions. Second operand has 24 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 14 states have internal predecessors, (41), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:30:14,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:30:14,994 INFO L93 Difference]: Finished difference Result 188 states and 204 transitions. [2025-03-04 11:30:14,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 11:30:14,995 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 14 states have internal predecessors, (41), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-04 11:30:14,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:30:14,996 INFO L225 Difference]: With dead ends: 188 [2025-03-04 11:30:14,996 INFO L226 Difference]: Without dead ends: 156 [2025-03-04 11:30:14,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=311, Invalid=811, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 11:30:14,997 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 247 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:30:14,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 223 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:30:14,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-04 11:30:15,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 146. [2025-03-04 11:30:15,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 116 states have (on average 1.146551724137931) internal successors, (133), 116 states have internal predecessors, (133), 12 states have call successors, (12), 11 states have call predecessors, (12), 16 states have return successors, (18), 18 states have call predecessors, (18), 11 states have call successors, (18) [2025-03-04 11:30:15,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 163 transitions. [2025-03-04 11:30:15,011 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 163 transitions. Word has length 26 [2025-03-04 11:30:15,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:30:15,012 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 163 transitions. [2025-03-04 11:30:15,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 14 states have internal predecessors, (41), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:30:15,012 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 163 transitions. [2025-03-04 11:30:15,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-04 11:30:15,012 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:15,012 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 11:30:15,019 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 11:30:15,213 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,SelfDestructingSolverStorable5 [2025-03-04 11:30:15,213 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 11:30:15,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:15,214 INFO L85 PathProgramCache]: Analyzing trace with hash -98645244, now seen corresponding path program 1 times [2025-03-04 11:30:15,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:15,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180243320] [2025-03-04 11:30:15,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:30:15,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:15,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 11:30:15,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 11:30:15,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:30:15,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:15,305 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 11:30:15,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:15,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180243320] [2025-03-04 11:30:15,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180243320] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:30:15,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160485524] [2025-03-04 11:30:15,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:30:15,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:15,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:30:15,307 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 11:30:15,309 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 11:30:15,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 11:30:15,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 11:30:15,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:30:15,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:15,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 11:30:15,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:30:15,494 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 3 proven. 60 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 11:30:15,495 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:30:15,802 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 3 proven. 61 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 11:30:15,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160485524] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:30:15,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:30:15,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 14, 15] total 29 [2025-03-04 11:30:15,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822168164] [2025-03-04 11:30:15,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:30:15,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-04 11:30:15,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:30:15,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 11:30:15,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=676, Unknown=0, NotChecked=0, Total=812 [2025-03-04 11:30:15,804 INFO L87 Difference]: Start difference. First operand 146 states and 163 transitions. Second operand has 29 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 21 states have internal predecessors, (68), 13 states have call successors, (14), 9 states have call predecessors, (14), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 11:30:16,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:30:16,155 INFO L93 Difference]: Finished difference Result 208 states and 227 transitions. [2025-03-04 11:30:16,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-04 11:30:16,155 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 21 states have internal predecessors, (68), 13 states have call successors, (14), 9 states have call predecessors, (14), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 40 [2025-03-04 11:30:16,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:30:16,156 INFO L225 Difference]: With dead ends: 208 [2025-03-04 11:30:16,156 INFO L226 Difference]: Without dead ends: 142 [2025-03-04 11:30:16,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=306, Invalid=1334, Unknown=0, NotChecked=0, Total=1640 [2025-03-04 11:30:16,162 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 164 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:30:16,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 462 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:30:16,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-04 11:30:16,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 134. [2025-03-04 11:30:16,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 107 states have (on average 1.1121495327102804) internal successors, (119), 106 states have internal predecessors, (119), 12 states have call successors, (12), 11 states have call predecessors, (12), 13 states have return successors, (16), 16 states have call predecessors, (16), 11 states have call successors, (16) [2025-03-04 11:30:16,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 147 transitions. [2025-03-04 11:30:16,178 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 147 transitions. Word has length 40 [2025-03-04 11:30:16,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:30:16,179 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 147 transitions. [2025-03-04 11:30:16,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 21 states have internal predecessors, (68), 13 states have call successors, (14), 9 states have call predecessors, (14), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 11:30:16,179 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 147 transitions. [2025-03-04 11:30:16,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 11:30:16,181 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:16,181 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 1, 1, 1, 1] [2025-03-04 11:30:16,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 11:30:16,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:16,382 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 11:30:16,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:16,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1018977892, now seen corresponding path program 3 times [2025-03-04 11:30:16,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:16,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266618556] [2025-03-04 11:30:16,382 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:30:16,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:16,387 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 11 equivalence classes. [2025-03-04 11:30:16,403 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 11:30:16,403 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 11:30:16,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:16,746 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:30:16,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:16,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266618556] [2025-03-04 11:30:16,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266618556] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:30:16,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474722796] [2025-03-04 11:30:16,747 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:30:16,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:16,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:30:16,749 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 11:30:16,750 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 11:30:16,769 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 11 equivalence classes. [2025-03-04 11:30:16,786 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 11:30:16,787 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 11:30:16,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:16,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 11:30:16,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:30:16,871 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:30:16,871 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:30:17,384 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:30:17,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474722796] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:30:17,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:30:17,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2025-03-04 11:30:17,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270553470] [2025-03-04 11:30:17,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:30:17,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-04 11:30:17,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:30:17,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-04 11:30:17,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=556, Invalid=1700, Unknown=0, NotChecked=0, Total=2256 [2025-03-04 11:30:17,387 INFO L87 Difference]: Start difference. First operand 134 states and 147 transitions. Second operand has 48 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 26 states have internal predecessors, (89), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:30:17,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:30:17,983 INFO L93 Difference]: Finished difference Result 438 states and 470 transitions. [2025-03-04 11:30:17,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-04 11:30:17,984 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 26 states have internal predecessors, (89), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-03-04 11:30:17,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:30:17,986 INFO L225 Difference]: With dead ends: 438 [2025-03-04 11:30:17,987 INFO L226 Difference]: Without dead ends: 386 [2025-03-04 11:30:17,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1337, Invalid=3493, Unknown=0, NotChecked=0, Total=4830 [2025-03-04 11:30:17,990 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 789 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 790 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:30:17,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [790 Valid, 471 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:30:17,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2025-03-04 11:30:18,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 364. [2025-03-04 11:30:18,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 291 states have (on average 1.120274914089347) internal successors, (326), 290 states have internal predecessors, (326), 24 states have call successors, (24), 23 states have call predecessors, (24), 47 states have return successors, (50), 50 states have call predecessors, (50), 23 states have call successors, (50) [2025-03-04 11:30:18,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 400 transitions. [2025-03-04 11:30:18,021 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 400 transitions. Word has length 56 [2025-03-04 11:30:18,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:30:18,022 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 400 transitions. [2025-03-04 11:30:18,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 26 states have internal predecessors, (89), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:30:18,022 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 400 transitions. [2025-03-04 11:30:18,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-04 11:30:18,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:18,023 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2025-03-04 11:30:18,029 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 11:30:18,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:18,228 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 11:30:18,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:18,230 INFO L85 PathProgramCache]: Analyzing trace with hash 2136562119, now seen corresponding path program 2 times [2025-03-04 11:30:18,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:18,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457015989] [2025-03-04 11:30:18,230 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:30:18,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:18,234 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes. [2025-03-04 11:30:18,248 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 75 of 75 statements. [2025-03-04 11:30:18,249 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:30:18,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:18,649 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 6 proven. 299 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 11:30:18,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:18,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457015989] [2025-03-04 11:30:18,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457015989] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:30:18,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421544588] [2025-03-04 11:30:18,649 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:30:18,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:18,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:30:18,651 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:30:18,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 11:30:18,673 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes. [2025-03-04 11:30:18,689 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 75 of 75 statements. [2025-03-04 11:30:18,689 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:30:18,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:18,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 11:30:18,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:30:18,773 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 6 proven. 297 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 11:30:18,774 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:30:19,427 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 6 proven. 303 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 11:30:19,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421544588] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:30:19,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:30:19,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 27] total 49 [2025-03-04 11:30:19,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138505579] [2025-03-04 11:30:19,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:30:19,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-04 11:30:19,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:30:19,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-04 11:30:19,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=478, Invalid=1874, Unknown=0, NotChecked=0, Total=2352 [2025-03-04 11:30:19,430 INFO L87 Difference]: Start difference. First operand 364 states and 400 transitions. Second operand has 49 states, 47 states have (on average 2.234042553191489) internal successors, (105), 31 states have internal predecessors, (105), 23 states have call successors, (23), 19 states have call predecessors, (23), 4 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-04 11:30:20,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:30:20,012 INFO L93 Difference]: Finished difference Result 481 states and 516 transitions. [2025-03-04 11:30:20,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-04 11:30:20,013 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 47 states have (on average 2.234042553191489) internal successors, (105), 31 states have internal predecessors, (105), 23 states have call successors, (23), 19 states have call predecessors, (23), 4 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 75 [2025-03-04 11:30:20,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:30:20,018 INFO L225 Difference]: With dead ends: 481 [2025-03-04 11:30:20,018 INFO L226 Difference]: Without dead ends: 290 [2025-03-04 11:30:20,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 125 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1114 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1144, Invalid=3686, Unknown=0, NotChecked=0, Total=4830 [2025-03-04 11:30:20,021 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 492 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:30:20,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 739 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:30:20,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-03-04 11:30:20,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 264. [2025-03-04 11:30:20,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 211 states have (on average 1.1184834123222749) internal successors, (236), 210 states have internal predecessors, (236), 24 states have call successors, (24), 23 states have call predecessors, (24), 27 states have return successors, (30), 30 states have call predecessors, (30), 23 states have call successors, (30) [2025-03-04 11:30:20,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 290 transitions. [2025-03-04 11:30:20,044 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 290 transitions. Word has length 75 [2025-03-04 11:30:20,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:30:20,046 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 290 transitions. [2025-03-04 11:30:20,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 47 states have (on average 2.234042553191489) internal successors, (105), 31 states have internal predecessors, (105), 23 states have call successors, (23), 19 states have call predecessors, (23), 4 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-04 11:30:20,046 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 290 transitions. [2025-03-04 11:30:20,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-04 11:30:20,047 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:20,047 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 1, 1, 1, 1] [2025-03-04 11:30:20,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 11:30:20,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:20,248 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 11:30:20,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:20,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1377387364, now seen corresponding path program 4 times [2025-03-04 11:30:20,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:20,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920830879] [2025-03-04 11:30:20,249 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 11:30:20,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:20,255 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 116 statements into 2 equivalence classes. [2025-03-04 11:30:20,274 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 11:30:20,275 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 11:30:20,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:21,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:30:21,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:21,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920830879] [2025-03-04 11:30:21,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920830879] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:30:21,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307773130] [2025-03-04 11:30:21,249 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 11:30:21,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:21,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:30:21,251 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:30:21,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 11:30:21,275 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 116 statements into 2 equivalence classes. [2025-03-04 11:30:21,294 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 11:30:21,294 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 11:30:21,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:21,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-04 11:30:21,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:30:21,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:30:21,455 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:30:23,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:30:23,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307773130] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:30:23,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:30:23,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 98 [2025-03-04 11:30:23,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038079465] [2025-03-04 11:30:23,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:30:23,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 99 states [2025-03-04 11:30:23,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:30:23,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2025-03-04 11:30:23,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2360, Invalid=7342, Unknown=0, NotChecked=0, Total=9702 [2025-03-04 11:30:23,120 INFO L87 Difference]: Start difference. First operand 264 states and 290 transitions. Second operand has 99 states, 95 states have (on average 2.0) internal successors, (190), 52 states have internal predecessors, (190), 48 states have call successors, (48), 47 states have call predecessors, (48), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:30:24,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:30:24,960 INFO L93 Difference]: Finished difference Result 892 states and 961 transitions. [2025-03-04 11:30:24,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-03-04 11:30:24,961 INFO L78 Accepts]: Start accepts. Automaton has has 99 states, 95 states have (on average 2.0) internal successors, (190), 52 states have internal predecessors, (190), 48 states have call successors, (48), 47 states have call predecessors, (48), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2025-03-04 11:30:24,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:30:24,964 INFO L225 Difference]: With dead ends: 892 [2025-03-04 11:30:24,964 INFO L226 Difference]: Without dead ends: 770 [2025-03-04 11:30:24,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4638 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=5651, Invalid=15229, Unknown=0, NotChecked=0, Total=20880 [2025-03-04 11:30:24,968 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 1937 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1938 SdHoareTripleChecker+Valid, 1308 SdHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:30:24,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1938 Valid, 1308 Invalid, 984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:30:24,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2025-03-04 11:30:24,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 724. [2025-03-04 11:30:24,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 579 states have (on average 1.1226252158894645) internal successors, (650), 578 states have internal predecessors, (650), 48 states have call successors, (48), 47 states have call predecessors, (48), 95 states have return successors, (98), 98 states have call predecessors, (98), 47 states have call successors, (98) [2025-03-04 11:30:24,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 796 transitions. [2025-03-04 11:30:24,998 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 796 transitions. Word has length 116 [2025-03-04 11:30:24,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:30:24,998 INFO L471 AbstractCegarLoop]: Abstraction has 724 states and 796 transitions. [2025-03-04 11:30:24,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 99 states, 95 states have (on average 2.0) internal successors, (190), 52 states have internal predecessors, (190), 48 states have call successors, (48), 47 states have call predecessors, (48), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:30:24,999 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 796 transitions. [2025-03-04 11:30:25,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-04 11:30:25,000 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:25,000 INFO L218 NwaCegarLoop]: trace histogram [24, 23, 23, 23, 23, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2025-03-04 11:30:25,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 11:30:25,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:25,201 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 11:30:25,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:25,201 INFO L85 PathProgramCache]: Analyzing trace with hash -445489465, now seen corresponding path program 3 times [2025-03-04 11:30:25,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:25,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145615186] [2025-03-04 11:30:25,201 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:30:25,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:25,205 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 135 statements into 24 equivalence classes. [2025-03-04 11:30:25,209 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 30 of 135 statements. [2025-03-04 11:30:25,209 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 11:30:25,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:25,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1311 trivial. 0 not checked. [2025-03-04 11:30:25,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:25,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145615186] [2025-03-04 11:30:25,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145615186] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:30:25,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303868382] [2025-03-04 11:30:25,299 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:30:25,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:25,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:30:25,301 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:30:25,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 11:30:25,349 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 135 statements into 24 equivalence classes. [2025-03-04 11:30:25,360 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 30 of 135 statements. [2025-03-04 11:30:25,360 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 11:30:25,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:25,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:30:25,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:30:25,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1311 trivial. 0 not checked. [2025-03-04 11:30:25,396 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:30:25,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1311 trivial. 0 not checked. [2025-03-04 11:30:25,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303868382] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:30:25,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:30:25,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-03-04 11:30:25,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140648113] [2025-03-04 11:30:25,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:30:25,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 11:30:25,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:30:25,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 11:30:25,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2025-03-04 11:30:25,542 INFO L87 Difference]: Start difference. First operand 724 states and 796 transitions. Second operand has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 16 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 7 states have return successors, (7), 7 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-04 11:30:25,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:30:25,613 INFO L93 Difference]: Finished difference Result 1287 states and 1476 transitions. [2025-03-04 11:30:25,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 11:30:25,613 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 16 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 7 states have return successors, (7), 7 states have call predecessors, (7), 1 states have call successors, (7) Word has length 135 [2025-03-04 11:30:25,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:30:25,618 INFO L225 Difference]: With dead ends: 1287 [2025-03-04 11:30:25,618 INFO L226 Difference]: Without dead ends: 1286 [2025-03-04 11:30:25,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2025-03-04 11:30:25,619 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:30:25,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:30:25,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2025-03-04 11:30:25,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 1286. [2025-03-04 11:30:25,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1286 states, 1031 states have (on average 1.0688651794374393) internal successors, (1102), 1026 states have internal predecessors, (1102), 48 states have call successors, (48), 47 states have call predecessors, (48), 205 states have return successors, (212), 212 states have call predecessors, (212), 47 states have call successors, (212) [2025-03-04 11:30:25,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 1362 transitions. [2025-03-04 11:30:25,684 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 1362 transitions. Word has length 135 [2025-03-04 11:30:25,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:30:25,684 INFO L471 AbstractCegarLoop]: Abstraction has 1286 states and 1362 transitions. [2025-03-04 11:30:25,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 16 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 7 states have return successors, (7), 7 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-04 11:30:25,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1362 transitions. [2025-03-04 11:30:25,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 11:30:25,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:25,685 INFO L218 NwaCegarLoop]: trace histogram [24, 23, 23, 23, 23, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1] [2025-03-04 11:30:25,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 11:30:25,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:25,886 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 11:30:25,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:25,886 INFO L85 PathProgramCache]: Analyzing trace with hash 31812359, now seen corresponding path program 4 times [2025-03-04 11:30:25,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:25,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737777581] [2025-03-04 11:30:25,887 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 11:30:25,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:25,891 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 155 statements into 2 equivalence classes. [2025-03-04 11:30:25,899 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 11:30:25,900 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 11:30:25,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:26,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 1311 trivial. 0 not checked. [2025-03-04 11:30:26,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:26,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737777581] [2025-03-04 11:30:26,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737777581] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:30:26,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161100991] [2025-03-04 11:30:26,144 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 11:30:26,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:26,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:30:26,146 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:30:26,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 11:30:26,175 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 155 statements into 2 equivalence classes. [2025-03-04 11:30:26,199 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 11:30:26,199 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 11:30:26,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:26,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-04 11:30:26,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:30:27,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 18 proven. 1311 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2025-03-04 11:30:27,023 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:30:29,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 18 proven. 1377 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 11:30:29,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161100991] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:30:29,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:30:29,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 45, 51] total 69 [2025-03-04 11:30:29,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43384161] [2025-03-04 11:30:29,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:30:29,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2025-03-04 11:30:29,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:30:29,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2025-03-04 11:30:29,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=4026, Unknown=0, NotChecked=0, Total=4692 [2025-03-04 11:30:29,011 INFO L87 Difference]: Start difference. First operand 1286 states and 1362 transitions. Second operand has 69 states, 67 states have (on average 2.5074626865671643) internal successors, (168), 51 states have internal predecessors, (168), 28 states have call successors, (30), 19 states have call predecessors, (30), 14 states have return successors, (21), 14 states have call predecessors, (21), 10 states have call successors, (21) [2025-03-04 11:30:30,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:30:30,124 INFO L93 Difference]: Finished difference Result 1538 states and 1642 transitions. [2025-03-04 11:30:30,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-03-04 11:30:30,125 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 67 states have (on average 2.5074626865671643) internal successors, (168), 51 states have internal predecessors, (168), 28 states have call successors, (30), 19 states have call predecessors, (30), 14 states have return successors, (21), 14 states have call predecessors, (21), 10 states have call successors, (21) Word has length 155 [2025-03-04 11:30:30,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:30:30,130 INFO L225 Difference]: With dead ends: 1538 [2025-03-04 11:30:30,130 INFO L226 Difference]: Without dead ends: 1387 [2025-03-04 11:30:30,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 235 SyntacticMatches, 39 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3729 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1621, Invalid=8479, Unknown=0, NotChecked=0, Total=10100 [2025-03-04 11:30:30,134 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 488 mSDsluCounter, 1186 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:30:30,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 1280 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 804 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:30:30,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2025-03-04 11:30:30,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 1369. [2025-03-04 11:30:30,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1369 states, 1098 states have (on average 1.0628415300546448) internal successors, (1167), 1092 states have internal predecessors, (1167), 48 states have call successors, (48), 47 states have call predecessors, (48), 221 states have return successors, (229), 229 states have call predecessors, (229), 47 states have call successors, (229) [2025-03-04 11:30:30,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 1444 transitions. [2025-03-04 11:30:30,192 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 1444 transitions. Word has length 155 [2025-03-04 11:30:30,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:30:30,192 INFO L471 AbstractCegarLoop]: Abstraction has 1369 states and 1444 transitions. [2025-03-04 11:30:30,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 67 states have (on average 2.5074626865671643) internal successors, (168), 51 states have internal predecessors, (168), 28 states have call successors, (30), 19 states have call predecessors, (30), 14 states have return successors, (21), 14 states have call predecessors, (21), 10 states have call successors, (21) [2025-03-04 11:30:30,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 1444 transitions. [2025-03-04 11:30:30,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-04 11:30:30,195 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:30,195 INFO L218 NwaCegarLoop]: trace histogram [26, 25, 25, 25, 25, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1] [2025-03-04 11:30:30,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 11:30:30,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-04 11:30:30,400 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 11:30:30,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:30,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1813431716, now seen corresponding path program 5 times [2025-03-04 11:30:30,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:30,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120404855] [2025-03-04 11:30:30,400 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 11:30:30,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:30,405 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 170 statements into 26 equivalence classes. [2025-03-04 11:30:30,451 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) and asserted 170 of 170 statements. [2025-03-04 11:30:30,451 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) [2025-03-04 11:30:30,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:30,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1690 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2025-03-04 11:30:30,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:30,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120404855] [2025-03-04 11:30:30,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120404855] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:30:30,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725904070] [2025-03-04 11:30:30,668 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 11:30:30,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:30,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:30:30,670 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:30:30,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 11:30:30,716 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 170 statements into 26 equivalence classes. [2025-03-04 11:30:30,763 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) and asserted 170 of 170 statements. [2025-03-04 11:30:30,763 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) [2025-03-04 11:30:30,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:30,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 11:30:30,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:30:30,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1690 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2025-03-04 11:30:30,812 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:30:32,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1690 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2025-03-04 11:30:32,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725904070] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:30:32,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:30:32,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2025-03-04 11:30:32,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515075470] [2025-03-04 11:30:32,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:30:32,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-04 11:30:32,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:30:32,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-04 11:30:32,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=817, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 11:30:32,273 INFO L87 Difference]: Start difference. First operand 1369 states and 1444 transitions. Second operand has 34 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 34 states have internal predecessors, (72), 1 states have call successors, (2), 1 states have call predecessors, (2), 16 states have return successors, (16), 16 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 11:30:32,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:30:32,430 INFO L93 Difference]: Finished difference Result 2882 states and 3271 transitions. [2025-03-04 11:30:32,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-04 11:30:32,431 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 34 states have internal predecessors, (72), 1 states have call successors, (2), 1 states have call predecessors, (2), 16 states have return successors, (16), 16 states have call predecessors, (16), 1 states have call successors, (16) Word has length 170 [2025-03-04 11:30:32,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:30:32,441 INFO L225 Difference]: With dead ends: 2882 [2025-03-04 11:30:32,442 INFO L226 Difference]: Without dead ends: 2881 [2025-03-04 11:30:32,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=305, Invalid=817, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 11:30:32,444 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:30:32,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:30:32,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2881 states. [2025-03-04 11:30:32,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2881 to 2881. [2025-03-04 11:30:32,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2881 states, 2313 states have (on average 1.0298313878080414) internal successors, (2382), 2298 states have internal predecessors, (2382), 48 states have call successors, (48), 47 states have call predecessors, (48), 518 states have return successors, (535), 535 states have call predecessors, (535), 47 states have call successors, (535) [2025-03-04 11:30:32,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2881 states to 2881 states and 2965 transitions. [2025-03-04 11:30:32,563 INFO L78 Accepts]: Start accepts. Automaton has 2881 states and 2965 transitions. Word has length 170 [2025-03-04 11:30:32,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:30:32,564 INFO L471 AbstractCegarLoop]: Abstraction has 2881 states and 2965 transitions. [2025-03-04 11:30:32,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 34 states have internal predecessors, (72), 1 states have call successors, (2), 1 states have call predecessors, (2), 16 states have return successors, (16), 16 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 11:30:32,564 INFO L276 IsEmpty]: Start isEmpty. Operand 2881 states and 2965 transitions. [2025-03-04 11:30:32,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-04 11:30:32,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:32,568 INFO L218 NwaCegarLoop]: trace histogram [26, 25, 25, 25, 25, 17, 17, 17, 17, 16, 1, 1, 1, 1, 1] [2025-03-04 11:30:32,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 11:30:32,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 11:30:32,769 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 11:30:32,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:32,770 INFO L85 PathProgramCache]: Analyzing trace with hash 453478695, now seen corresponding path program 6 times [2025-03-04 11:30:32,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:32,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904785425] [2025-03-04 11:30:32,771 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 11:30:32,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:32,778 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 215 statements into 26 equivalence classes. [2025-03-04 11:30:32,807 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 26 check-sat command(s) and asserted 215 of 215 statements. [2025-03-04 11:30:32,808 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 26 check-sat command(s) [2025-03-04 11:30:32,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:33,464 INFO L134 CoverageAnalysis]: Checked inductivity of 2230 backedges. 0 proven. 680 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2025-03-04 11:30:33,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:33,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904785425] [2025-03-04 11:30:33,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904785425] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:30:33,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617456502] [2025-03-04 11:30:33,464 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 11:30:33,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:33,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:30:33,469 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:30:33,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 11:30:33,527 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 215 statements into 26 equivalence classes. [2025-03-04 11:30:33,570 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 26 check-sat command(s) and asserted 215 of 215 statements. [2025-03-04 11:30:33,570 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 26 check-sat command(s) [2025-03-04 11:30:33,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:33,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-04 11:30:33,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:30:33,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2230 backedges. 0 proven. 680 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2025-03-04 11:30:33,675 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:30:47,006 INFO L134 CoverageAnalysis]: Checked inductivity of 2230 backedges. 0 proven. 680 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2025-03-04 11:30:47,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617456502] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:30:47,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:30:47,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 71 [2025-03-04 11:30:47,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421378857] [2025-03-04 11:30:47,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:30:47,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2025-03-04 11:30:47,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:30:47,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2025-03-04 11:30:47,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=3781, Unknown=0, NotChecked=0, Total=5112 [2025-03-04 11:30:47,010 INFO L87 Difference]: Start difference. First operand 2881 states and 2965 transitions. Second operand has 72 states, 71 states have (on average 2.0985915492957745) internal successors, (149), 72 states have internal predecessors, (149), 1 states have call successors, (2), 1 states have call predecessors, (2), 35 states have return successors, (35), 35 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-04 11:30:47,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:30:47,297 INFO L93 Difference]: Finished difference Result 6896 states and 7797 transitions. [2025-03-04 11:30:47,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2025-03-04 11:30:47,297 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 71 states have (on average 2.0985915492957745) internal successors, (149), 72 states have internal predecessors, (149), 1 states have call successors, (2), 1 states have call predecessors, (2), 35 states have return successors, (35), 35 states have call predecessors, (35), 1 states have call successors, (35) Word has length 215 [2025-03-04 11:30:47,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:30:47,313 INFO L225 Difference]: With dead ends: 6896 [2025-03-04 11:30:47,313 INFO L226 Difference]: Without dead ends: 5420 [2025-03-04 11:30:47,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 393 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1575 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1331, Invalid=3781, Unknown=0, NotChecked=0, Total=5112 [2025-03-04 11:30:47,317 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:30:47,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 148 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:30:47,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5420 states. [2025-03-04 11:30:47,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5420 to 5420. [2025-03-04 11:30:47,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5420 states, 4355 states have (on average 1.0135476463834672) internal successors, (4414), 4322 states have internal predecessors, (4414), 48 states have call successors, (48), 47 states have call predecessors, (48), 1015 states have return successors, (1050), 1050 states have call predecessors, (1050), 47 states have call successors, (1050) [2025-03-04 11:30:47,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5420 states to 5420 states and 5512 transitions. [2025-03-04 11:30:47,525 INFO L78 Accepts]: Start accepts. Automaton has 5420 states and 5512 transitions. Word has length 215 [2025-03-04 11:30:47,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:30:47,526 INFO L471 AbstractCegarLoop]: Abstraction has 5420 states and 5512 transitions. [2025-03-04 11:30:47,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 71 states have (on average 2.0985915492957745) internal successors, (149), 72 states have internal predecessors, (149), 1 states have call successors, (2), 1 states have call predecessors, (2), 35 states have return successors, (35), 35 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-04 11:30:47,526 INFO L276 IsEmpty]: Start isEmpty. Operand 5420 states and 5512 transitions. [2025-03-04 11:30:47,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-03-04 11:30:47,528 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:47,528 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 46, 46, 46, 1, 1, 1, 1] [2025-03-04 11:30:47,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 11:30:47,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 11:30:47,729 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 11:30:47,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:47,730 INFO L85 PathProgramCache]: Analyzing trace with hash -164269412, now seen corresponding path program 5 times [2025-03-04 11:30:47,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:47,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321058513] [2025-03-04 11:30:47,730 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 11:30:47,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:47,740 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 236 statements into 47 equivalence classes. [2025-03-04 11:30:47,803 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 236 of 236 statements. [2025-03-04 11:30:47,804 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-03-04 11:30:47,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:50,892 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 5313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:30:50,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:50,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321058513] [2025-03-04 11:30:50,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321058513] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:30:50,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211745640] [2025-03-04 11:30:50,892 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 11:30:50,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:50,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:30:50,894 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:30:50,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 11:30:51,108 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 236 statements into 47 equivalence classes. [2025-03-04 11:30:51,218 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 236 of 236 statements. [2025-03-04 11:30:51,218 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-03-04 11:30:51,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:51,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-03-04 11:30:51,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:30:51,435 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 5313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:30:51,436 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:30:57,228 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 5313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:30:57,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211745640] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:30:57,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:30:57,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2025-03-04 11:30:57,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908073636] [2025-03-04 11:30:57,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:30:57,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 192 states [2025-03-04 11:30:57,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:30:57,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2025-03-04 11:30:57,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9124, Invalid=27548, Unknown=0, NotChecked=0, Total=36672 [2025-03-04 11:30:57,233 INFO L87 Difference]: Start difference. First operand 5420 states and 5512 transitions. Second operand has 192 states, 189 states have (on average 1.9947089947089947) internal successors, (377), 98 states have internal predecessors, (377), 94 states have call successors, (94), 94 states have call predecessors, (94), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:30:58,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:30:58,467 INFO L93 Difference]: Finished difference Result 5445 states and 5512 transitions. [2025-03-04 11:30:58,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-03-04 11:30:58,469 INFO L78 Accepts]: Start accepts. Automaton has has 192 states, 189 states have (on average 1.9947089947089947) internal successors, (377), 98 states have internal predecessors, (377), 94 states have call successors, (94), 94 states have call predecessors, (94), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 236 [2025-03-04 11:30:58,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:30:58,482 INFO L225 Difference]: With dead ends: 5445 [2025-03-04 11:30:58,482 INFO L226 Difference]: Without dead ends: 5444 [2025-03-04 11:30:58,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 593 GetRequests, 376 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11393 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=13906, Invalid=33836, Unknown=0, NotChecked=0, Total=47742 [2025-03-04 11:30:58,488 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 827 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:30:58,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 849 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:30:58,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5444 states. [2025-03-04 11:30:58,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5444 to 5419. [2025-03-04 11:30:58,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5419 states, 4355 states have (on average 1.0133180252583238) internal successors, (4413), 4321 states have internal predecessors, (4413), 48 states have call successors, (48), 47 states have call predecessors, (48), 1015 states have return successors, (1050), 1050 states have call predecessors, (1050), 47 states have call successors, (1050) [2025-03-04 11:30:58,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5419 states to 5419 states and 5511 transitions. [2025-03-04 11:30:58,679 INFO L78 Accepts]: Start accepts. Automaton has 5419 states and 5511 transitions. Word has length 236 [2025-03-04 11:30:58,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:30:58,680 INFO L471 AbstractCegarLoop]: Abstraction has 5419 states and 5511 transitions. [2025-03-04 11:30:58,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 192 states, 189 states have (on average 1.9947089947089947) internal successors, (377), 98 states have internal predecessors, (377), 94 states have call successors, (94), 94 states have call predecessors, (94), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:30:58,680 INFO L276 IsEmpty]: Start isEmpty. Operand 5419 states and 5511 transitions. [2025-03-04 11:30:58,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2025-03-04 11:30:58,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:58,688 INFO L218 NwaCegarLoop]: trace histogram [36, 35, 35, 35, 35, 35, 35, 35, 35, 34, 1, 1, 1, 1, 1] [2025-03-04 11:30:58,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 11:30:58,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 11:30:58,888 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 11:30:58,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:58,889 INFO L85 PathProgramCache]: Analyzing trace with hash 831571399, now seen corresponding path program 7 times [2025-03-04 11:30:58,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:58,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926796387] [2025-03-04 11:30:58,889 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 11:30:58,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:58,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-03-04 11:30:58,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-03-04 11:30:58,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:30:58,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:00,939 INFO L134 CoverageAnalysis]: Checked inductivity of 6020 backedges. 0 proven. 2975 refuted. 0 times theorem prover too weak. 3045 trivial. 0 not checked. [2025-03-04 11:31:00,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:00,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926796387] [2025-03-04 11:31:00,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926796387] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:31:00,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928475922] [2025-03-04 11:31:00,940 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 11:31:00,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:31:00,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:31:00,941 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:31:00,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 11:31:01,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-03-04 11:31:01,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-03-04 11:31:01,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:01,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:01,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-03-04 11:31:01,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:31:02,633 INFO L134 CoverageAnalysis]: Checked inductivity of 6020 backedges. 2975 proven. 172 refuted. 0 times theorem prover too weak. 2873 trivial. 0 not checked. [2025-03-04 11:31:02,633 INFO L312 TraceCheckSpWp]: Computing backward predicates...