./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive-simple/id_i25_o25-2.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-2.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 76955366716759eb9478710f6ef46e3de93d252b9c3177ff4beaca56ee5c75a7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 11:30:11,403 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 11:30:11,444 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:11,449 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 11:30:11,451 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 11:30:11,473 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 11:30:11,474 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 11:30:11,474 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 11:30:11,474 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 11:30:11,475 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 11:30:11,475 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 11:30:11,475 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 11:30:11,475 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 11:30:11,475 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 11:30:11,475 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 11:30:11,475 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 11:30:11,475 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 11:30:11,476 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 11:30:11,476 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 11:30:11,476 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 11:30:11,476 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 11:30:11,476 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 11:30:11,476 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 11:30:11,476 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 11:30:11,476 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 11:30:11,476 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 11:30:11,476 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 11:30:11,476 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 11:30:11,476 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 11:30:11,476 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 11:30:11,477 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 11:30:11,477 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 11:30:11,477 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 11:30:11,477 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 11:30:11,477 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:30:11,477 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 11:30:11,477 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 11:30:11,477 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 11:30:11,477 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 11:30:11,477 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 11:30:11,477 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 11:30:11,477 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 11:30:11,477 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 11:30:11,478 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 11:30:11,478 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 11:30:11,478 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 -> 76955366716759eb9478710f6ef46e3de93d252b9c3177ff4beaca56ee5c75a7 [2025-03-04 11:30:11,685 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 11:30:11,693 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 11:30:11,694 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 11:30:11,696 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 11:30:11,696 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 11:30:11,697 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/id_i25_o25-2.c [2025-03-04 11:30:12,823 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c070022ea/b52f8e8ab7274c04b9443f3304eda3f4/FLAGa3784e975 [2025-03-04 11:30:13,038 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 11:30:13,038 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_i25_o25-2.c [2025-03-04 11:30:13,043 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c070022ea/b52f8e8ab7274c04b9443f3304eda3f4/FLAGa3784e975 [2025-03-04 11:30:13,404 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c070022ea/b52f8e8ab7274c04b9443f3304eda3f4 [2025-03-04 11:30:13,405 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 11:30:13,406 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 11:30:13,407 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 11:30:13,407 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 11:30:13,410 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 11:30:13,411 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:30:13" (1/1) ... [2025-03-04 11:30:13,413 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42f657ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:30:13, skipping insertion in model container [2025-03-04 11:30:13,413 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:30:13" (1/1) ... [2025-03-04 11:30:13,426 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 11:30:13,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:30:13,537 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 11:30:13,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:30:13,559 INFO L204 MainTranslator]: Completed translation [2025-03-04 11:30:13,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:30:13 WrapperNode [2025-03-04 11:30:13,560 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 11:30:13,561 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 11:30:13,561 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 11:30:13,561 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 11:30:13,566 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:13" (1/1) ... [2025-03-04 11:30:13,571 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:13" (1/1) ... [2025-03-04 11:30:13,582 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 19 [2025-03-04 11:30:13,582 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 11:30:13,583 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 11:30:13,583 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 11:30:13,583 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 11:30:13,589 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:13" (1/1) ... [2025-03-04 11:30:13,590 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:13" (1/1) ... [2025-03-04 11:30:13,590 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:13" (1/1) ... [2025-03-04 11:30:13,603 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:13,604 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:13" (1/1) ... [2025-03-04 11:30:13,604 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:13" (1/1) ... [2025-03-04 11:30:13,605 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:13" (1/1) ... [2025-03-04 11:30:13,606 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:13" (1/1) ... [2025-03-04 11:30:13,607 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:13" (1/1) ... [2025-03-04 11:30:13,607 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:13" (1/1) ... [2025-03-04 11:30:13,608 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 11:30:13,609 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 11:30:13,609 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 11:30:13,609 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 11:30:13,609 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:30:13" (1/1) ... [2025-03-04 11:30:13,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:30:13,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:30:13,637 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:13,647 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:13,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 11:30:13,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 11:30:13,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 11:30:13,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 11:30:13,664 INFO L130 BoogieDeclarations]: Found specification of procedure id [2025-03-04 11:30:13,664 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2025-03-04 11:30:13,706 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 11:30:13,707 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 11:30:13,796 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8: havoc #t~ret4; [2025-03-04 11:30:13,804 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-03-04 11:30:13,804 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 11:30:13,812 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 11:30:13,813 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 11:30:13,814 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,814 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 11:30:13,816 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 11:30:13,817 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 11:30:13,820 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 11:30:13,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 11:30:13" (1/3) ... [2025-03-04 11:30:13,821 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@604aa5f2 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,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:30:13" (2/3) ... [2025-03-04 11:30:13,822 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@604aa5f2 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,823 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,824 INFO L128 eAbstractionObserver]: Analyzing ICFG id_i25_o25-2.c [2025-03-04 11:30:13,835 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 11:30:13,838 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG id_i25_o25-2.c that has 2 procedures, 24 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-03-04 11:30:13,880 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 11:30:13,891 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;@6258928d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 11:30:13,892 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 11:30:13,896 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,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 11:30:13,902 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:13,902 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 11:30:13,903 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,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:13,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1123769116, now seen corresponding path program 1 times [2025-03-04 11:30:13,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:13,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483828237] [2025-03-04 11:30:13,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:30:13,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:13,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 11:30:13,979 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,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:30:13,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:14,065 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:14,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:14,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483828237] [2025-03-04 11:30:14,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483828237] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:30:14,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:30:14,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:30:14,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728169590] [2025-03-04 11:30:14,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:30:14,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:30:14,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:30:14,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:30:14,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:30:14,087 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:14,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:30:14,181 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2025-03-04 11:30:14,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:30:14,185 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:14,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:30:14,189 INFO L225 Difference]: With dead ends: 46 [2025-03-04 11:30:14,189 INFO L226 Difference]: Without dead ends: 28 [2025-03-04 11:30:14,192 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:14,196 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.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:30:14,198 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.1s Time] [2025-03-04 11:30:14,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-04 11:30:14,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2025-03-04 11:30:14,219 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:14,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2025-03-04 11:30:14,228 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 6 [2025-03-04 11:30:14,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:30:14,228 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2025-03-04 11:30:14,228 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:14,228 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2025-03-04 11:30:14,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 11:30:14,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:14,228 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:30:14,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 11:30:14,229 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:14,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:14,229 INFO L85 PathProgramCache]: Analyzing trace with hash 477104215, now seen corresponding path program 1 times [2025-03-04 11:30:14,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:14,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321387218] [2025-03-04 11:30:14,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:30:14,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:14,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 11:30:14,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 11:30:14,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:30:14,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:14,277 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:14,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:14,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321387218] [2025-03-04 11:30:14,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321387218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:30:14,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:30:14,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:30:14,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985545904] [2025-03-04 11:30:14,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:30:14,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:30:14,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:30:14,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:30:14,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:30:14,282 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:14,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:30:14,329 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2025-03-04 11:30:14,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:30:14,330 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:14,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:30:14,331 INFO L225 Difference]: With dead ends: 27 [2025-03-04 11:30:14,331 INFO L226 Difference]: Without dead ends: 26 [2025-03-04 11:30:14,332 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:14,332 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:14,332 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:14,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-04 11:30:14,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2025-03-04 11:30:14,337 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:14,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2025-03-04 11:30:14,338 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 7 [2025-03-04 11:30:14,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:30:14,338 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2025-03-04 11:30:14,338 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:14,338 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2025-03-04 11:30:14,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 11:30:14,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:14,339 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:30:14,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 11:30:14,339 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:14,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:14,339 INFO L85 PathProgramCache]: Analyzing trace with hash -638284688, now seen corresponding path program 1 times [2025-03-04 11:30:14,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:14,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319990668] [2025-03-04 11:30:14,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:30:14,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:14,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 11:30:14,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 11:30:14,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:30:14,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:14,432 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:14,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:14,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319990668] [2025-03-04 11:30:14,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319990668] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:30:14,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715003109] [2025-03-04 11:30:14,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:30:14,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:14,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:30:14,435 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:14,437 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:14,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 11:30:14,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 11:30:14,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:30:14,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:14,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 11:30:14,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:30:14,531 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:14,532 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:30:14,609 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:14,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715003109] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:30:14,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:30:14,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-04 11:30:14,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559587551] [2025-03-04 11:30:14,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:30:14,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 11:30:14,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:30:14,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 11:30:14,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:30:14,611 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:14,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:30:14,742 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2025-03-04 11:30:14,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 11:30:14,742 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:14,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:30:14,743 INFO L225 Difference]: With dead ends: 76 [2025-03-04 11:30:14,743 INFO L226 Difference]: Without dead ends: 68 [2025-03-04 11:30:14,743 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:14,744 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:14,744 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:14,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-04 11:30:14,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 54. [2025-03-04 11:30:14,751 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:14,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2025-03-04 11:30:14,752 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 11 [2025-03-04 11:30:14,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:30:14,752 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2025-03-04 11:30:14,752 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:14,752 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2025-03-04 11:30:14,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 11:30:14,752 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:14,753 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:30:14,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 11:30:14,957 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,957 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,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:14,958 INFO L85 PathProgramCache]: Analyzing trace with hash -16539686, now seen corresponding path program 1 times [2025-03-04 11:30:14,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:14,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463391842] [2025-03-04 11:30:14,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:30:14,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:14,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 11:30:14,970 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,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:30:14,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:15,025 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:15,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:15,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463391842] [2025-03-04 11:30:15,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463391842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:30:15,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:30:15,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:30:15,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999630933] [2025-03-04 11:30:15,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:30:15,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:30:15,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:30:15,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:30:15,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:30:15,028 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:15,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:30:15,046 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2025-03-04 11:30:15,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:30:15,046 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:15,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:30:15,048 INFO L225 Difference]: With dead ends: 74 [2025-03-04 11:30:15,048 INFO L226 Difference]: Without dead ends: 72 [2025-03-04 11:30:15,048 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:15,048 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:15,048 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:15,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-04 11:30:15,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-03-04 11:30:15,056 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:15,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2025-03-04 11:30:15,057 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 19 [2025-03-04 11:30:15,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:30:15,057 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2025-03-04 11:30:15,057 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:15,057 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2025-03-04 11:30:15,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 11:30:15,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:15,058 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:15,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 11:30:15,058 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:15,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:15,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1336297931, now seen corresponding path program 1 times [2025-03-04 11:30:15,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:15,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440359565] [2025-03-04 11:30:15,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:30:15,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:15,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 11:30:15,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 11:30:15,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:30:15,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:15,082 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:15,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:15,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440359565] [2025-03-04 11:30:15,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440359565] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:30:15,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:30:15,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:30:15,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637658876] [2025-03-04 11:30:15,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:30:15,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:30:15,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:30:15,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:30:15,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:30:15,084 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:15,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:30:15,093 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2025-03-04 11:30:15,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:30:15,093 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:15,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:30:15,094 INFO L225 Difference]: With dead ends: 72 [2025-03-04 11:30:15,094 INFO L226 Difference]: Without dead ends: 71 [2025-03-04 11:30:15,094 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:15,095 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:15,095 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:15,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-04 11:30:15,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-03-04 11:30:15,103 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:15,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2025-03-04 11:30:15,106 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 24 [2025-03-04 11:30:15,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:30:15,106 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2025-03-04 11:30:15,106 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:15,106 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2025-03-04 11:30:15,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 11:30:15,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:15,108 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1] [2025-03-04 11:30:15,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 11:30:15,108 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:15,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:15,111 INFO L85 PathProgramCache]: Analyzing trace with hash -543218660, now seen corresponding path program 2 times [2025-03-04 11:30:15,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:15,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577963768] [2025-03-04 11:30:15,111 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:30:15,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:15,116 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 11:30:15,121 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:15,121 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:30:15,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:15,290 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:15,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:15,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577963768] [2025-03-04 11:30:15,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577963768] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:30:15,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970310270] [2025-03-04 11:30:15,291 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:30:15,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:15,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:30:15,294 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:15,295 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:15,313 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 11:30:15,322 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:15,322 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:30:15,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:15,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 11:30:15,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:30:15,361 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:15,361 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:30:15,544 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:15,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970310270] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:30:15,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:30:15,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2025-03-04 11:30:15,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966229526] [2025-03-04 11:30:15,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:30:15,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 11:30:15,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:30:15,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 11:30:15,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2025-03-04 11:30:15,546 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:15,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:30:15,826 INFO L93 Difference]: Finished difference Result 188 states and 204 transitions. [2025-03-04 11:30:15,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 11:30:15,826 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:15,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:30:15,828 INFO L225 Difference]: With dead ends: 188 [2025-03-04 11:30:15,828 INFO L226 Difference]: Without dead ends: 156 [2025-03-04 11:30:15,829 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:15,829 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:15,829 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:15,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-04 11:30:15,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 146. [2025-03-04 11:30:15,848 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,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 163 transitions. [2025-03-04 11:30:15,850 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 163 transitions. Word has length 26 [2025-03-04 11:30:15,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:30:15,850 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 163 transitions. [2025-03-04 11:30:15,850 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,850 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 163 transitions. [2025-03-04 11:30:15,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-04 11:30:15,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:15,851 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,858 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:16,051 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:16,052 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:16,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:16,052 INFO L85 PathProgramCache]: Analyzing trace with hash -98645244, now seen corresponding path program 1 times [2025-03-04 11:30:16,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:16,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630680182] [2025-03-04 11:30:16,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:30:16,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:16,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 11:30:16,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 11:30:16,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:30:16,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:16,118 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:16,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:16,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630680182] [2025-03-04 11:30:16,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630680182] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:30:16,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296675395] [2025-03-04 11:30:16,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:30:16,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:16,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:30:16,120 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:16,122 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:16,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 11:30:16,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 11:30:16,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:30:16,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:16,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 11:30:16,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:30:16,288 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:16,289 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:30:16,596 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:16,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296675395] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:30:16,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:30:16,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 14, 15] total 29 [2025-03-04 11:30:16,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356080497] [2025-03-04 11:30:16,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:30:16,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-04 11:30:16,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:30:16,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 11:30:16,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=676, Unknown=0, NotChecked=0, Total=812 [2025-03-04 11:30:16,598 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,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:30:16,954 INFO L93 Difference]: Finished difference Result 208 states and 227 transitions. [2025-03-04 11:30:16,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-04 11:30:16,955 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,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:30:16,956 INFO L225 Difference]: With dead ends: 208 [2025-03-04 11:30:16,956 INFO L226 Difference]: Without dead ends: 142 [2025-03-04 11:30:16,957 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,957 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,957 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,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-04 11:30:16,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 134. [2025-03-04 11:30:16,972 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,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 147 transitions. [2025-03-04 11:30:16,976 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 147 transitions. Word has length 40 [2025-03-04 11:30:16,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:30:16,976 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 147 transitions. [2025-03-04 11:30:16,976 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,976 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 147 transitions. [2025-03-04 11:30:16,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 11:30:16,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:16,977 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 1, 1, 1, 1] [2025-03-04 11:30:16,985 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:17,177 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:17,178 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:17,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:17,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1018977892, now seen corresponding path program 3 times [2025-03-04 11:30:17,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:17,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692782898] [2025-03-04 11:30:17,178 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:30:17,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:17,183 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 11 equivalence classes. [2025-03-04 11:30:17,195 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:17,195 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 11:30:17,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:17,495 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,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:17,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692782898] [2025-03-04 11:30:17,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692782898] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:30:17,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754039884] [2025-03-04 11:30:17,495 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:30:17,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:17,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:30:17,498 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:17,500 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:17,525 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 11 equivalence classes. [2025-03-04 11:30:17,539 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:17,539 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 11:30:17,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:17,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 11:30:17,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:30:17,609 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,609 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:30:18,084 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:18,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754039884] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:30:18,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:30:18,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2025-03-04 11:30:18,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563806927] [2025-03-04 11:30:18,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:30:18,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-04 11:30:18,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:30:18,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-04 11:30:18,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=556, Invalid=1700, Unknown=0, NotChecked=0, Total=2256 [2025-03-04 11:30:18,087 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:18,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:30:18,704 INFO L93 Difference]: Finished difference Result 438 states and 470 transitions. [2025-03-04 11:30:18,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-04 11:30:18,705 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:18,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:30:18,708 INFO L225 Difference]: With dead ends: 438 [2025-03-04 11:30:18,708 INFO L226 Difference]: Without dead ends: 386 [2025-03-04 11:30:18,712 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:18,713 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:18,713 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:18,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2025-03-04 11:30:18,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 364. [2025-03-04 11:30:18,733 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,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 400 transitions. [2025-03-04 11:30:18,735 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 400 transitions. Word has length 56 [2025-03-04 11:30:18,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:30:18,735 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 400 transitions. [2025-03-04 11:30:18,735 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,735 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 400 transitions. [2025-03-04 11:30:18,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-04 11:30:18,738 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:18,738 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,744 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,939 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,939 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,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:18,939 INFO L85 PathProgramCache]: Analyzing trace with hash 2136562119, now seen corresponding path program 2 times [2025-03-04 11:30:18,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:18,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777129770] [2025-03-04 11:30:18,940 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:30:18,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:18,944 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes. [2025-03-04 11:30:18,958 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,958 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:30:18,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:19,334 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:19,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:19,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777129770] [2025-03-04 11:30:19,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777129770] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:30:19,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332249664] [2025-03-04 11:30:19,335 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:30:19,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:19,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:30:19,337 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:19,339 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:19,359 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes. [2025-03-04 11:30:19,376 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:19,376 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:30:19,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:19,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 11:30:19,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:30:19,474 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:19,475 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:30:20,076 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:20,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332249664] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:30:20,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:30:20,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 27] total 49 [2025-03-04 11:30:20,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640900523] [2025-03-04 11:30:20,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:30:20,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-04 11:30:20,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:30:20,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-04 11:30:20,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=478, Invalid=1874, Unknown=0, NotChecked=0, Total=2352 [2025-03-04 11:30:20,079 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,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:30:20,664 INFO L93 Difference]: Finished difference Result 481 states and 516 transitions. [2025-03-04 11:30:20,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-04 11:30:20,666 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,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:30:20,668 INFO L225 Difference]: With dead ends: 481 [2025-03-04 11:30:20,668 INFO L226 Difference]: Without dead ends: 290 [2025-03-04 11:30:20,672 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,672 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,672 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,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-03-04 11:30:20,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 264. [2025-03-04 11:30:20,691 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,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 290 transitions. [2025-03-04 11:30:20,692 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 290 transitions. Word has length 75 [2025-03-04 11:30:20,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:30:20,693 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 290 transitions. [2025-03-04 11:30:20,693 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,693 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 290 transitions. [2025-03-04 11:30:20,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-04 11:30:20,694 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:20,694 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 1, 1, 1, 1] [2025-03-04 11:30:20,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 11:30:20,897 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,897 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,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:20,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1377387364, now seen corresponding path program 4 times [2025-03-04 11:30:20,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:20,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303081005] [2025-03-04 11:30:20,897 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 11:30:20,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:20,902 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 116 statements into 2 equivalence classes. [2025-03-04 11:30:20,918 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,918 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 11:30:20,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:21,775 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,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:21,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303081005] [2025-03-04 11:30:21,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303081005] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:30:21,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404121049] [2025-03-04 11:30:21,776 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 11:30:21,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:21,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:30:21,778 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,779 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,800 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 116 statements into 2 equivalence classes. [2025-03-04 11:30:21,818 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,818 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 11:30:21,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:21,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-04 11:30:21,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:30:21,980 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,980 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:30:23,430 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,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404121049] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:30:23,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:30:23,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 98 [2025-03-04 11:30:23,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990205936] [2025-03-04 11:30:23,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:30:23,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 99 states [2025-03-04 11:30:23,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:30:23,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2025-03-04 11:30:23,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2360, Invalid=7342, Unknown=0, NotChecked=0, Total=9702 [2025-03-04 11:30:23,436 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:25,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:30:25,242 INFO L93 Difference]: Finished difference Result 892 states and 961 transitions. [2025-03-04 11:30:25,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-03-04 11:30:25,243 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:25,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:30:25,245 INFO L225 Difference]: With dead ends: 892 [2025-03-04 11:30:25,245 INFO L226 Difference]: Without dead ends: 770 [2025-03-04 11:30:25,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4638 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=5651, Invalid=15229, Unknown=0, NotChecked=0, Total=20880 [2025-03-04 11:30:25,251 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:25,251 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:25,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2025-03-04 11:30:25,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 724. [2025-03-04 11:30:25,276 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:25,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 796 transitions. [2025-03-04 11:30:25,279 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 796 transitions. Word has length 116 [2025-03-04 11:30:25,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:30:25,279 INFO L471 AbstractCegarLoop]: Abstraction has 724 states and 796 transitions. [2025-03-04 11:30:25,280 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:25,280 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 796 transitions. [2025-03-04 11:30:25,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-04 11:30:25,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:25,281 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,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 11:30:25,481 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,481 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,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:25,482 INFO L85 PathProgramCache]: Analyzing trace with hash -445489465, now seen corresponding path program 3 times [2025-03-04 11:30:25,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:25,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170200559] [2025-03-04 11:30:25,482 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:30:25,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:25,486 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 135 statements into 24 equivalence classes. [2025-03-04 11:30:25,489 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,489 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 11:30:25,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:25,548 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,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:25,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170200559] [2025-03-04 11:30:25,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170200559] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:30:25,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379578491] [2025-03-04 11:30:25,548 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:30:25,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:25,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:30:25,550 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,551 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,577 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 135 statements into 24 equivalence classes. [2025-03-04 11:30:25,586 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,586 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 11:30:25,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:25,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:30:25,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:30:25,615 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,615 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:30:25,742 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,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379578491] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:30:25,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:30:25,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-03-04 11:30:25,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697975417] [2025-03-04 11:30:25,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:30:25,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 11:30:25,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:30:25,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 11:30:25,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2025-03-04 11:30:25,744 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,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:30:25,825 INFO L93 Difference]: Finished difference Result 1287 states and 1476 transitions. [2025-03-04 11:30:25,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 11:30:25,825 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,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:30:25,829 INFO L225 Difference]: With dead ends: 1287 [2025-03-04 11:30:25,829 INFO L226 Difference]: Without dead ends: 1286 [2025-03-04 11:30:25,830 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,830 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,830 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,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2025-03-04 11:30:25,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 1286. [2025-03-04 11:30:25,889 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,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 1362 transitions. [2025-03-04 11:30:25,894 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 1362 transitions. Word has length 135 [2025-03-04 11:30:25,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:30:25,894 INFO L471 AbstractCegarLoop]: Abstraction has 1286 states and 1362 transitions. [2025-03-04 11:30:25,895 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,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1362 transitions. [2025-03-04 11:30:25,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 11:30:25,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:25,898 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,904 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:26,099 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:26,099 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:26,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:26,100 INFO L85 PathProgramCache]: Analyzing trace with hash 31812359, now seen corresponding path program 4 times [2025-03-04 11:30:26,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:26,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945927987] [2025-03-04 11:30:26,100 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 11:30:26,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:26,108 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 155 statements into 2 equivalence classes. [2025-03-04 11:30:26,125 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,125 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 11:30:26,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:26,382 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,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:26,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945927987] [2025-03-04 11:30:26,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945927987] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:30:26,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172907849] [2025-03-04 11:30:26,383 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 11:30:26,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:26,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:30:26,384 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,386 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,411 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 155 statements into 2 equivalence classes. [2025-03-04 11:30:26,435 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,435 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 11:30:26,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:26,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-04 11:30:26,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:30:27,262 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,262 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:30:29,176 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,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172907849] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:30:29,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:30:29,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 45, 51] total 69 [2025-03-04 11:30:29,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782360492] [2025-03-04 11:30:29,177 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:30:29,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2025-03-04 11:30:29,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:30:29,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2025-03-04 11:30:29,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=4026, Unknown=0, NotChecked=0, Total=4692 [2025-03-04 11:30:29,179 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,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:30:30,193 INFO L93 Difference]: Finished difference Result 1538 states and 1642 transitions. [2025-03-04 11:30:30,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-03-04 11:30:30,194 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,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:30:30,198 INFO L225 Difference]: With dead ends: 1538 [2025-03-04 11:30:30,198 INFO L226 Difference]: Without dead ends: 1387 [2025-03-04 11:30:30,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 235 SyntacticMatches, 39 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3729 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1621, Invalid=8479, Unknown=0, NotChecked=0, Total=10100 [2025-03-04 11:30:30,200 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,200 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,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2025-03-04 11:30:30,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 1369. [2025-03-04 11:30:30,248 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,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 1444 transitions. [2025-03-04 11:30:30,253 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 1444 transitions. Word has length 155 [2025-03-04 11:30:30,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:30:30,254 INFO L471 AbstractCegarLoop]: Abstraction has 1369 states and 1444 transitions. [2025-03-04 11:30:30,254 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,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 1444 transitions. [2025-03-04 11:30:30,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-04 11:30:30,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:30,256 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,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 11:30:30,456 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,457 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,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:30,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1813431716, now seen corresponding path program 5 times [2025-03-04 11:30:30,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:30,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081365424] [2025-03-04 11:30:30,457 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 11:30:30,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:30,463 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 170 statements into 26 equivalence classes. [2025-03-04 11:30:30,512 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,512 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) [2025-03-04 11:30:30,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:30,713 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,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:30,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081365424] [2025-03-04 11:30:30,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081365424] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:30:30,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656630043] [2025-03-04 11:30:30,714 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 11:30:30,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:30,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:30:30,716 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,717 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,761 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 170 statements into 26 equivalence classes. [2025-03-04 11:30:30,802 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,803 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) [2025-03-04 11:30:30,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:30,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 11:30:30,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:30:30,847 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,848 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:30:32,205 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,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656630043] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:30:32,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:30:32,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2025-03-04 11:30:32,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507871652] [2025-03-04 11:30:32,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:30:32,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-04 11:30:32,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:30:32,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-04 11:30:32,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=817, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 11:30:32,209 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,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:30:32,335 INFO L93 Difference]: Finished difference Result 2882 states and 3271 transitions. [2025-03-04 11:30:32,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-04 11:30:32,335 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,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:30:32,344 INFO L225 Difference]: With dead ends: 2882 [2025-03-04 11:30:32,344 INFO L226 Difference]: Without dead ends: 2881 [2025-03-04 11:30:32,346 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,346 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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,347 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,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2881 states. [2025-03-04 11:30:32,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2881 to 2881. [2025-03-04 11:30:32,452 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,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2881 states to 2881 states and 2965 transitions. [2025-03-04 11:30:32,460 INFO L78 Accepts]: Start accepts. Automaton has 2881 states and 2965 transitions. Word has length 170 [2025-03-04 11:30:32,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:30:32,460 INFO L471 AbstractCegarLoop]: Abstraction has 2881 states and 2965 transitions. [2025-03-04 11:30:32,461 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,461 INFO L276 IsEmpty]: Start isEmpty. Operand 2881 states and 2965 transitions. [2025-03-04 11:30:32,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-04 11:30:32,465 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:32,465 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,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 11:30:32,669 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,669 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,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:32,670 INFO L85 PathProgramCache]: Analyzing trace with hash 453478695, now seen corresponding path program 6 times [2025-03-04 11:30:32,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:32,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795599091] [2025-03-04 11:30:32,670 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 11:30:32,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:32,675 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 215 statements into 26 equivalence classes. [2025-03-04 11:30:32,706 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,707 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 26 check-sat command(s) [2025-03-04 11:30:32,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:33,300 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,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:33,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795599091] [2025-03-04 11:30:33,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795599091] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:30:33,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060638450] [2025-03-04 11:30:33,301 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 11:30:33,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:33,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:30:33,302 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,303 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,354 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 215 statements into 26 equivalence classes. [2025-03-04 11:30:33,389 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,389 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 26 check-sat command(s) [2025-03-04 11:30:33,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:33,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-04 11:30:33,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:30:33,474 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,474 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:30:45,920 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:45,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060638450] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:30:45,920 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:30:45,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 71 [2025-03-04 11:30:45,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585336341] [2025-03-04 11:30:45,920 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:30:45,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2025-03-04 11:30:45,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:30:45,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2025-03-04 11:30:45,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=3781, Unknown=0, NotChecked=0, Total=5112 [2025-03-04 11:30:45,922 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:46,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:30:46,228 INFO L93 Difference]: Finished difference Result 6896 states and 7797 transitions. [2025-03-04 11:30:46,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2025-03-04 11:30:46,229 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:46,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:30:46,244 INFO L225 Difference]: With dead ends: 6896 [2025-03-04 11:30:46,244 INFO L226 Difference]: Without dead ends: 5420 [2025-03-04 11:30:46,248 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:46,248 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:46,248 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:46,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5420 states. [2025-03-04 11:30:46,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5420 to 5420. [2025-03-04 11:30:46,470 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:46,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5420 states to 5420 states and 5512 transitions. [2025-03-04 11:30:46,483 INFO L78 Accepts]: Start accepts. Automaton has 5420 states and 5512 transitions. Word has length 215 [2025-03-04 11:30:46,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:30:46,484 INFO L471 AbstractCegarLoop]: Abstraction has 5420 states and 5512 transitions. [2025-03-04 11:30:46,484 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:46,484 INFO L276 IsEmpty]: Start isEmpty. Operand 5420 states and 5512 transitions. [2025-03-04 11:30:46,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-03-04 11:30:46,486 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:46,486 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 46, 46, 46, 1, 1, 1, 1] [2025-03-04 11:30:46,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 11:30:46,686 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:46,686 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:46,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:46,687 INFO L85 PathProgramCache]: Analyzing trace with hash -164269412, now seen corresponding path program 5 times [2025-03-04 11:30:46,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:46,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039549017] [2025-03-04 11:30:46,687 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 11:30:46,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:46,697 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 236 statements into 47 equivalence classes. [2025-03-04 11:30:46,782 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:46,782 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-03-04 11:30:46,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:49,602 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:49,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:49,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039549017] [2025-03-04 11:30:49,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039549017] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:30:49,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659324386] [2025-03-04 11:30:49,602 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 11:30:49,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:49,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:30:49,604 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:49,605 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:49,808 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 236 statements into 47 equivalence classes. [2025-03-04 11:30:49,892 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:49,892 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-03-04 11:30:49,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:49,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-03-04 11:30:49,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:30:50,090 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,090 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:30:54,921 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:54,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659324386] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:30:54,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:30:54,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2025-03-04 11:30:54,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438329021] [2025-03-04 11:30:54,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:30:54,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 192 states [2025-03-04 11:30:54,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:30:54,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2025-03-04 11:30:54,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9124, Invalid=27548, Unknown=0, NotChecked=0, Total=36672 [2025-03-04 11:30:54,928 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:56,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:30:56,122 INFO L93 Difference]: Finished difference Result 5445 states and 5512 transitions. [2025-03-04 11:30:56,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-03-04 11:30:56,123 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:56,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:30:56,135 INFO L225 Difference]: With dead ends: 5445 [2025-03-04 11:30:56,136 INFO L226 Difference]: Without dead ends: 5444 [2025-03-04 11:30:56,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 593 GetRequests, 376 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11393 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=13906, Invalid=33836, Unknown=0, NotChecked=0, Total=47742 [2025-03-04 11:30:56,140 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 827 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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:56,140 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:56,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5444 states. [2025-03-04 11:30:56,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5444 to 5419. [2025-03-04 11:30:56,308 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:56,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5419 states to 5419 states and 5511 transitions. [2025-03-04 11:30:56,317 INFO L78 Accepts]: Start accepts. Automaton has 5419 states and 5511 transitions. Word has length 236 [2025-03-04 11:30:56,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:30:56,317 INFO L471 AbstractCegarLoop]: Abstraction has 5419 states and 5511 transitions. [2025-03-04 11:30:56,318 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:56,318 INFO L276 IsEmpty]: Start isEmpty. Operand 5419 states and 5511 transitions. [2025-03-04 11:30:56,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2025-03-04 11:30:56,327 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:30:56,327 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:56,335 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:56,527 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:56,528 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:56,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:30:56,529 INFO L85 PathProgramCache]: Analyzing trace with hash 831571399, now seen corresponding path program 7 times [2025-03-04 11:30:56,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:30:56,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841534490] [2025-03-04 11:30:56,529 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 11:30:56,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:30:56,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-03-04 11:30:56,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-03-04 11:30:56,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:30:56,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:58,519 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:30:58,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:30:58,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841534490] [2025-03-04 11:30:58,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841534490] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:30:58,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564295184] [2025-03-04 11:30:58,520 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 11:30:58,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:30:58,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:30:58,521 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:30:58,522 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:30:58,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-03-04 11:30:58,779 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,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:30:58,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:30:58,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-03-04 11:30:58,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:31:00,087 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:00,087 INFO L312 TraceCheckSpWp]: Computing backward predicates...