./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/lcm1_unwindbound20.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/nla-digbench-scaling/lcm1_unwindbound20.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 a32548a2dc110e6882a396485f8651f4c4262f9c106b055559dda4621561bdb6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 11:13:49,267 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 11:13:49,324 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 11:13:49,328 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 11:13:49,328 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 11:13:49,351 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 11:13:49,353 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 11:13:49,353 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 11:13:49,353 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 11:13:49,354 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 11:13:49,354 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 11:13:49,354 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 11:13:49,355 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 11:13:49,355 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 11:13:49,355 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 11:13:49,355 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 11:13:49,355 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 11:13:49,355 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 11:13:49,355 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 11:13:49,355 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 11:13:49,355 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 11:13:49,356 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 11:13:49,356 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 11:13:49,356 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 11:13:49,356 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 11:13:49,356 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 11:13:49,356 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 11:13:49,356 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 11:13:49,356 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 11:13:49,356 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 11:13:49,356 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 11:13:49,356 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 11:13:49,357 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 11:13:49,357 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 11:13:49,357 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:13:49,357 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 11:13:49,357 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 11:13:49,357 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 11:13:49,357 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 11:13:49,357 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 11:13:49,357 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 11:13:49,357 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 11:13:49,358 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 11:13:49,358 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 11:13:49,358 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 11:13:49,358 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 -> a32548a2dc110e6882a396485f8651f4c4262f9c106b055559dda4621561bdb6 [2025-03-04 11:13:49,575 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 11:13:49,584 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 11:13:49,586 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 11:13:49,587 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 11:13:49,587 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 11:13:49,587 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/lcm1_unwindbound20.c [2025-03-04 11:13:50,672 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/073f14c5a/2f0179fb3cfc4edc8c2a26f9e02db4fd/FLAGbb94c7887 [2025-03-04 11:13:50,918 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 11:13:50,918 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/lcm1_unwindbound20.c [2025-03-04 11:13:50,923 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/073f14c5a/2f0179fb3cfc4edc8c2a26f9e02db4fd/FLAGbb94c7887 [2025-03-04 11:13:50,933 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/073f14c5a/2f0179fb3cfc4edc8c2a26f9e02db4fd [2025-03-04 11:13:50,935 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 11:13:50,936 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 11:13:50,937 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 11:13:50,937 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 11:13:50,940 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 11:13:50,940 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:13:50" (1/1) ... [2025-03-04 11:13:50,941 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19014b87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:13:50, skipping insertion in model container [2025-03-04 11:13:50,941 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:13:50" (1/1) ... [2025-03-04 11:13:50,951 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 11:13:51,055 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:13:51,062 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 11:13:51,079 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:13:51,094 INFO L204 MainTranslator]: Completed translation [2025-03-04 11:13:51,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:13:51 WrapperNode [2025-03-04 11:13:51,096 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 11:13:51,096 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 11:13:51,097 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 11:13:51,097 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 11:13:51,102 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:13:51" (1/1) ... [2025-03-04 11:13:51,107 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:13:51" (1/1) ... [2025-03-04 11:13:51,122 INFO L138 Inliner]: procedures = 14, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 87 [2025-03-04 11:13:51,122 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 11:13:51,123 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 11:13:51,123 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 11:13:51,123 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 11:13:51,130 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:13:51" (1/1) ... [2025-03-04 11:13:51,130 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:13:51" (1/1) ... [2025-03-04 11:13:51,136 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:13:51" (1/1) ... [2025-03-04 11:13:51,148 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2025-03-04 11:13:51,149 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:13:51" (1/1) ... [2025-03-04 11:13:51,149 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:13:51" (1/1) ... [2025-03-04 11:13:51,151 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:13:51" (1/1) ... [2025-03-04 11:13:51,154 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:13:51" (1/1) ... [2025-03-04 11:13:51,158 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:13:51" (1/1) ... [2025-03-04 11:13:51,159 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:13:51" (1/1) ... [2025-03-04 11:13:51,160 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 11:13:51,161 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 11:13:51,164 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 11:13:51,165 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 11:13:51,165 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:13:51" (1/1) ... [2025-03-04 11:13:51,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:13:51,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:13:51,195 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:13:51,203 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:13:51,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 11:13:51,219 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 11:13:51,219 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 11:13:51,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 11:13:51,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 11:13:51,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 11:13:51,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 11:13:51,219 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 11:13:51,219 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 11:13:51,263 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 11:13:51,265 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 11:13:51,404 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-03-04 11:13:51,404 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 11:13:51,411 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 11:13:51,411 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 11:13:51,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:13:51 BoogieIcfgContainer [2025-03-04 11:13:51,412 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 11:13:51,413 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 11:13:51,413 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 11:13:51,416 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 11:13:51,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 11:13:50" (1/3) ... [2025-03-04 11:13:51,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49e45089 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:13:51, skipping insertion in model container [2025-03-04 11:13:51,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:13:51" (2/3) ... [2025-03-04 11:13:51,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49e45089 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:13:51, skipping insertion in model container [2025-03-04 11:13:51,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:13:51" (3/3) ... [2025-03-04 11:13:51,418 INFO L128 eAbstractionObserver]: Analyzing ICFG lcm1_unwindbound20.c [2025-03-04 11:13:51,429 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 11:13:51,430 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG lcm1_unwindbound20.c that has 3 procedures, 47 locations, 1 initial locations, 3 loop locations, and 6 error locations. [2025-03-04 11:13:51,466 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 11:13:51,476 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;@144de0a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 11:13:51,476 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 11:13:51,481 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 35 states have internal predecessors, (46), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 11:13:51,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 11:13:51,488 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:13:51,488 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:13:51,489 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:13:51,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:13:51,495 INFO L85 PathProgramCache]: Analyzing trace with hash -867382927, now seen corresponding path program 1 times [2025-03-04 11:13:51,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:13:51,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492028429] [2025-03-04 11:13:51,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:51,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:13:51,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 11:13:51,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 11:13:51,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:51,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:51,635 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 11:13:51,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:13:51,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492028429] [2025-03-04 11:13:51,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492028429] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:13:51,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79579913] [2025-03-04 11:13:51,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:51,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:13:51,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:13:51,639 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:13:51,640 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:13:51,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 11:13:51,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 11:13:51,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:51,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:51,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 11:13:51,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:13:51,697 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 11:13:51,699 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:13:51,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79579913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:13:51,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:13:51,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 11:13:51,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918152599] [2025-03-04 11:13:51,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:13:51,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 11:13:51,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:13:51,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 11:13:51,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 11:13:51,720 INFO L87 Difference]: Start difference. First operand has 47 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 35 states have internal predecessors, (46), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 11:13:51,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:13:51,733 INFO L93 Difference]: Finished difference Result 90 states and 132 transitions. [2025-03-04 11:13:51,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 11:13:51,734 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2025-03-04 11:13:51,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:13:51,737 INFO L225 Difference]: With dead ends: 90 [2025-03-04 11:13:51,737 INFO L226 Difference]: Without dead ends: 39 [2025-03-04 11:13:51,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 11:13:51,742 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:13:51,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:13:51,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-04 11:13:51,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-03-04 11:13:51,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 29 states have internal predecessors, (34), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 11:13:51,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2025-03-04 11:13:51,769 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 25 [2025-03-04 11:13:51,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:13:51,769 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2025-03-04 11:13:51,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 11:13:51,770 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2025-03-04 11:13:51,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 11:13:51,770 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:13:51,771 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:13:51,777 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:13:51,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 11:13:51,971 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:13:51,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:13:51,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1360078897, now seen corresponding path program 1 times [2025-03-04 11:13:51,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:13:51,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015066193] [2025-03-04 11:13:51,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:51,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:13:51,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 11:13:52,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 11:13:52,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:52,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:52,123 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:13:52,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:13:52,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015066193] [2025-03-04 11:13:52,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015066193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:13:52,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:13:52,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:13:52,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933108938] [2025-03-04 11:13:52,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:13:52,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:13:52,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:13:52,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:13:52,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:13:52,125 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 11:13:52,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:13:52,177 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2025-03-04 11:13:52,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:13:52,177 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 25 [2025-03-04 11:13:52,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:13:52,179 INFO L225 Difference]: With dead ends: 45 [2025-03-04 11:13:52,179 INFO L226 Difference]: Without dead ends: 43 [2025-03-04 11:13:52,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:13:52,180 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 11 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:13:52,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 112 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:13:52,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-04 11:13:52,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2025-03-04 11:13:52,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 32 states have internal predecessors, (37), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 11:13:52,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2025-03-04 11:13:52,190 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 25 [2025-03-04 11:13:52,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:13:52,191 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2025-03-04 11:13:52,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 11:13:52,192 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2025-03-04 11:13:52,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-04 11:13:52,193 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:13:52,193 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:13:52,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 11:13:52,193 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:13:52,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:13:52,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1700255200, now seen corresponding path program 1 times [2025-03-04 11:13:52,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:13:52,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139277858] [2025-03-04 11:13:52,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:52,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:13:52,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 11:13:52,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 11:13:52,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:52,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:52,393 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:13:52,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:13:52,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139277858] [2025-03-04 11:13:52,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139277858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:13:52,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:13:52,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:13:52,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833412851] [2025-03-04 11:13:52,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:13:52,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:13:52,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:13:52,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:13:52,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:13:52,397 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:13:52,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:13:52,548 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2025-03-04 11:13:52,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:13:52,549 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 35 [2025-03-04 11:13:52,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:13:52,553 INFO L225 Difference]: With dead ends: 62 [2025-03-04 11:13:52,553 INFO L226 Difference]: Without dead ends: 61 [2025-03-04 11:13:52,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:13:52,553 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 28 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:13:52,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 177 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:13:52,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-04 11:13:52,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2025-03-04 11:13:52,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 42 states have internal predecessors, (50), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 11:13:52,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions. [2025-03-04 11:13:52,566 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 68 transitions. Word has length 35 [2025-03-04 11:13:52,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:13:52,567 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 68 transitions. [2025-03-04 11:13:52,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:13:52,567 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2025-03-04 11:13:52,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-04 11:13:52,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:13:52,568 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:13:52,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 11:13:52,569 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:13:52,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:13:52,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1168303653, now seen corresponding path program 1 times [2025-03-04 11:13:52,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:13:52,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163040155] [2025-03-04 11:13:52,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:52,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:13:52,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 11:13:52,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 11:13:52,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:52,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:52,670 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:13:52,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:13:52,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163040155] [2025-03-04 11:13:52,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163040155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:13:52,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:13:52,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:13:52,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609636648] [2025-03-04 11:13:52,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:13:52,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:13:52,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:13:52,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:13:52,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:13:52,672 INFO L87 Difference]: Start difference. First operand 55 states and 68 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:13:52,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:13:52,734 INFO L93 Difference]: Finished difference Result 91 states and 111 transitions. [2025-03-04 11:13:52,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 11:13:52,735 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2025-03-04 11:13:52,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:13:52,736 INFO L225 Difference]: With dead ends: 91 [2025-03-04 11:13:52,736 INFO L226 Difference]: Without dead ends: 63 [2025-03-04 11:13:52,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:13:52,737 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 22 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:13:52,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 144 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:13:52,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-04 11:13:52,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-03-04 11:13:52,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 49 states have internal predecessors, (57), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 11:13:52,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2025-03-04 11:13:52,745 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 36 [2025-03-04 11:13:52,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:13:52,745 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2025-03-04 11:13:52,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:13:52,745 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2025-03-04 11:13:52,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-04 11:13:52,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:13:52,747 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:13:52,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 11:13:52,747 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:13:52,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:13:52,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1272493830, now seen corresponding path program 1 times [2025-03-04 11:13:52,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:13:52,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752446585] [2025-03-04 11:13:52,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:52,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:13:52,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 11:13:52,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 11:13:52,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:52,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:52,905 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 11:13:52,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:13:52,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752446585] [2025-03-04 11:13:52,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752446585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:13:52,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:13:52,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 11:13:52,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049634946] [2025-03-04 11:13:52,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:13:52,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 11:13:52,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:13:52,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 11:13:52,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:13:52,906 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 11:13:53,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:13:53,069 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2025-03-04 11:13:53,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 11:13:53,070 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 45 [2025-03-04 11:13:53,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:13:53,071 INFO L225 Difference]: With dead ends: 81 [2025-03-04 11:13:53,071 INFO L226 Difference]: Without dead ends: 80 [2025-03-04 11:13:53,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-04 11:13:53,071 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 40 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:13:53,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 232 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:13:53,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-04 11:13:53,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 73. [2025-03-04 11:13:53,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 57 states have internal predecessors, (68), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 11:13:53,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 88 transitions. [2025-03-04 11:13:53,077 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 88 transitions. Word has length 45 [2025-03-04 11:13:53,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:13:53,077 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 88 transitions. [2025-03-04 11:13:53,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 11:13:53,078 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 88 transitions. [2025-03-04 11:13:53,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-04 11:13:53,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:13:53,078 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:13:53,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 11:13:53,079 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:13:53,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:13:53,079 INFO L85 PathProgramCache]: Analyzing trace with hash 792603048, now seen corresponding path program 1 times [2025-03-04 11:13:53,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:13:53,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311193620] [2025-03-04 11:13:53,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:53,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:13:53,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 11:13:53,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 11:13:53,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:53,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:53,188 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 11:13:53,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:13:53,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311193620] [2025-03-04 11:13:53,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311193620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:13:53,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:13:53,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 11:13:53,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677160924] [2025-03-04 11:13:53,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:13:53,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 11:13:53,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:13:53,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 11:13:53,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:13:53,190 INFO L87 Difference]: Start difference. First operand 73 states and 88 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 11:13:53,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:13:53,319 INFO L93 Difference]: Finished difference Result 115 states and 139 transitions. [2025-03-04 11:13:53,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 11:13:53,320 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 46 [2025-03-04 11:13:53,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:13:53,321 INFO L225 Difference]: With dead ends: 115 [2025-03-04 11:13:53,321 INFO L226 Difference]: Without dead ends: 87 [2025-03-04 11:13:53,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-03-04 11:13:53,322 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 33 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:13:53,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 186 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:13:53,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-04 11:13:53,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2025-03-04 11:13:53,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 65 states have internal predecessors, (77), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 11:13:53,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 99 transitions. [2025-03-04 11:13:53,333 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 99 transitions. Word has length 46 [2025-03-04 11:13:53,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:13:53,333 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 99 transitions. [2025-03-04 11:13:53,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 11:13:53,333 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 99 transitions. [2025-03-04 11:13:53,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-04 11:13:53,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:13:53,334 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:13:53,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 11:13:53,335 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:13:53,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:13:53,335 INFO L85 PathProgramCache]: Analyzing trace with hash 792675539, now seen corresponding path program 1 times [2025-03-04 11:13:53,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:13:53,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139157997] [2025-03-04 11:13:53,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:53,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:13:53,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 11:13:53,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 11:13:53,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:53,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:53,464 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 11:13:53,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:13:53,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139157997] [2025-03-04 11:13:53,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139157997] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:13:53,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175364842] [2025-03-04 11:13:53,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:53,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:13:53,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:13:53,467 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:13:53,469 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:13:53,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 11:13:53,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 11:13:53,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:53,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:53,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 11:13:53,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:13:53,607 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:13:53,607 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:13:53,733 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 11:13:53,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175364842] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:13:53,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:13:53,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 18 [2025-03-04 11:13:53,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847529014] [2025-03-04 11:13:53,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:13:53,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 11:13:53,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:13:53,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 11:13:53,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2025-03-04 11:13:53,735 INFO L87 Difference]: Start difference. First operand 83 states and 99 transitions. Second operand has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 19 states have internal predecessors, (55), 8 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2025-03-04 11:13:54,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:13:54,207 INFO L93 Difference]: Finished difference Result 233 states and 283 transitions. [2025-03-04 11:13:54,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 11:13:54,208 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 19 states have internal predecessors, (55), 8 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) Word has length 46 [2025-03-04 11:13:54,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:13:54,209 INFO L225 Difference]: With dead ends: 233 [2025-03-04 11:13:54,209 INFO L226 Difference]: Without dead ends: 195 [2025-03-04 11:13:54,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=263, Invalid=667, Unknown=0, NotChecked=0, Total=930 [2025-03-04 11:13:54,210 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 114 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:13:54,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 289 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:13:54,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-04 11:13:54,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 163. [2025-03-04 11:13:54,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 125 states have (on average 1.272) internal successors, (159), 130 states have internal predecessors, (159), 18 states have call successors, (18), 14 states have call predecessors, (18), 14 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 11:13:54,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 195 transitions. [2025-03-04 11:13:54,224 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 195 transitions. Word has length 46 [2025-03-04 11:13:54,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:13:54,224 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 195 transitions. [2025-03-04 11:13:54,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 19 states have internal predecessors, (55), 8 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2025-03-04 11:13:54,225 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 195 transitions. [2025-03-04 11:13:54,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 11:13:54,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:13:54,225 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:13:54,232 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:13:54,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-04 11:13:54,429 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:13:54,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:13:54,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1498090115, now seen corresponding path program 1 times [2025-03-04 11:13:54,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:13:54,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706538099] [2025-03-04 11:13:54,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:54,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:13:54,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 11:13:54,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 11:13:54,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:54,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:54,502 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-04 11:13:54,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:13:54,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706538099] [2025-03-04 11:13:54,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706538099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:13:54,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:13:54,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:13:54,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475598454] [2025-03-04 11:13:54,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:13:54,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:13:54,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:13:54,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:13:54,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:13:54,503 INFO L87 Difference]: Start difference. First operand 163 states and 195 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-04 11:13:54,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:13:54,552 INFO L93 Difference]: Finished difference Result 270 states and 329 transitions. [2025-03-04 11:13:54,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:13:54,553 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 55 [2025-03-04 11:13:54,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:13:54,554 INFO L225 Difference]: With dead ends: 270 [2025-03-04 11:13:54,554 INFO L226 Difference]: Without dead ends: 205 [2025-03-04 11:13:54,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:13:54,555 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 32 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:13:54,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 172 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:13:54,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-04 11:13:54,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 183. [2025-03-04 11:13:54,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 141 states have (on average 1.2907801418439717) internal successors, (182), 146 states have internal predecessors, (182), 22 states have call successors, (22), 14 states have call predecessors, (22), 14 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 11:13:54,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 226 transitions. [2025-03-04 11:13:54,579 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 226 transitions. Word has length 55 [2025-03-04 11:13:54,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:13:54,580 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 226 transitions. [2025-03-04 11:13:54,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-04 11:13:54,580 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 226 transitions. [2025-03-04 11:13:54,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 11:13:54,580 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:13:54,580 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:13:54,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 11:13:54,581 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:13:54,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:13:54,581 INFO L85 PathProgramCache]: Analyzing trace with hash -803810935, now seen corresponding path program 1 times [2025-03-04 11:13:54,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:13:54,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431651487] [2025-03-04 11:13:54,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:54,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:13:54,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 11:13:54,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 11:13:54,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:54,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:54,731 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-04 11:13:54,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:13:54,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431651487] [2025-03-04 11:13:54,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431651487] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:13:54,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141426648] [2025-03-04 11:13:54,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:54,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:13:54,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:13:54,733 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:13:54,735 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:13:54,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 11:13:54,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 11:13:54,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:54,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:54,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 11:13:54,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:13:54,868 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:13:54,868 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:13:55,002 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-04 11:13:55,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141426648] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:13:55,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:13:55,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 24 [2025-03-04 11:13:55,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234675331] [2025-03-04 11:13:55,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:13:55,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 11:13:55,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:13:55,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 11:13:55,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=469, Unknown=0, NotChecked=0, Total=600 [2025-03-04 11:13:55,004 INFO L87 Difference]: Start difference. First operand 183 states and 226 transitions. Second operand has 25 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 25 states have internal predecessors, (73), 11 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 11 states have call predecessors, (17), 11 states have call successors, (17) [2025-03-04 11:13:55,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:13:55,889 INFO L93 Difference]: Finished difference Result 379 states and 473 transitions. [2025-03-04 11:13:55,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-03-04 11:13:55,889 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 25 states have internal predecessors, (73), 11 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 11 states have call predecessors, (17), 11 states have call successors, (17) Word has length 56 [2025-03-04 11:13:55,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:13:55,891 INFO L225 Difference]: With dead ends: 379 [2025-03-04 11:13:55,891 INFO L226 Difference]: Without dead ends: 296 [2025-03-04 11:13:55,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=507, Invalid=1943, Unknown=0, NotChecked=0, Total=2450 [2025-03-04 11:13:55,892 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 175 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 11:13:55,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 327 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 11:13:55,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-03-04 11:13:55,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 263. [2025-03-04 11:13:55,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 206 states have (on average 1.2766990291262137) internal successors, (263), 211 states have internal predecessors, (263), 29 states have call successors, (29), 22 states have call predecessors, (29), 22 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-04 11:13:55,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 321 transitions. [2025-03-04 11:13:55,915 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 321 transitions. Word has length 56 [2025-03-04 11:13:55,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:13:55,915 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 321 transitions. [2025-03-04 11:13:55,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 25 states have internal predecessors, (73), 11 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 11 states have call predecessors, (17), 11 states have call successors, (17) [2025-03-04 11:13:55,915 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 321 transitions. [2025-03-04 11:13:55,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-04 11:13:55,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:13:55,916 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:13:55,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 11:13:56,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:13:56,117 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:13:56,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:13:56,118 INFO L85 PathProgramCache]: Analyzing trace with hash -281102517, now seen corresponding path program 1 times [2025-03-04 11:13:56,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:13:56,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056757163] [2025-03-04 11:13:56,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:56,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:13:56,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 11:13:56,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 11:13:56,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:56,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:56,238 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-04 11:13:56,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:13:56,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056757163] [2025-03-04 11:13:56,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056757163] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:13:56,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501280009] [2025-03-04 11:13:56,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:56,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:13:56,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:13:56,241 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:13:56,242 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:13:56,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 11:13:56,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 11:13:56,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:56,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:56,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 11:13:56,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:13:56,366 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:13:56,366 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:13:56,485 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-04 11:13:56,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501280009] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:13:56,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:13:56,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 21 [2025-03-04 11:13:56,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206094118] [2025-03-04 11:13:56,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:13:56,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 11:13:56,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:13:56,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 11:13:56,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2025-03-04 11:13:56,487 INFO L87 Difference]: Start difference. First operand 263 states and 321 transitions. Second operand has 21 states, 21 states have (on average 3.380952380952381) internal successors, (71), 21 states have internal predecessors, (71), 9 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (21), 9 states have call predecessors, (21), 9 states have call successors, (21) [2025-03-04 11:13:56,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:13:56,979 INFO L93 Difference]: Finished difference Result 471 states and 581 transitions. [2025-03-04 11:13:56,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-04 11:13:56,980 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.380952380952381) internal successors, (71), 21 states have internal predecessors, (71), 9 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (21), 9 states have call predecessors, (21), 9 states have call successors, (21) Word has length 59 [2025-03-04 11:13:56,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:13:56,982 INFO L225 Difference]: With dead ends: 471 [2025-03-04 11:13:56,982 INFO L226 Difference]: Without dead ends: 332 [2025-03-04 11:13:56,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=299, Invalid=1183, Unknown=0, NotChecked=0, Total=1482 [2025-03-04 11:13:56,983 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 118 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:13:56,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 313 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:13:56,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-03-04 11:13:56,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 323. [2025-03-04 11:13:56,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 258 states have (on average 1.244186046511628) internal successors, (321), 263 states have internal predecessors, (321), 33 states have call successors, (33), 26 states have call predecessors, (33), 26 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 11:13:56,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 387 transitions. [2025-03-04 11:13:56,996 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 387 transitions. Word has length 59 [2025-03-04 11:13:56,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:13:56,997 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 387 transitions. [2025-03-04 11:13:56,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.380952380952381) internal successors, (71), 21 states have internal predecessors, (71), 9 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (21), 9 states have call predecessors, (21), 9 states have call successors, (21) [2025-03-04 11:13:56,997 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 387 transitions. [2025-03-04 11:13:56,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-04 11:13:56,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:13:56,998 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:13:57,009 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:13:57,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:13:57,198 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:13:57,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:13:57,199 INFO L85 PathProgramCache]: Analyzing trace with hash -926240830, now seen corresponding path program 1 times [2025-03-04 11:13:57,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:13:57,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56342618] [2025-03-04 11:13:57,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:57,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:13:57,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 11:13:57,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 11:13:57,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:57,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:57,322 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-04 11:13:57,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:13:57,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56342618] [2025-03-04 11:13:57,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56342618] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:13:57,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892767697] [2025-03-04 11:13:57,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:57,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:13:57,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:13:57,324 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:13:57,327 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:13:57,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 11:13:57,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 11:13:57,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:57,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:57,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 11:13:57,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:13:57,510 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:13:57,510 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:13:57,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892767697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:13:57,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:13:57,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 21 [2025-03-04 11:13:57,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719499021] [2025-03-04 11:13:57,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:13:57,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 11:13:57,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:13:57,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 11:13:57,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2025-03-04 11:13:57,511 INFO L87 Difference]: Start difference. First operand 323 states and 387 transitions. Second operand has 11 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 5 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-04 11:13:57,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:13:57,746 INFO L93 Difference]: Finished difference Result 391 states and 469 transitions. [2025-03-04 11:13:57,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 11:13:57,747 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 5 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 65 [2025-03-04 11:13:57,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:13:57,748 INFO L225 Difference]: With dead ends: 391 [2025-03-04 11:13:57,748 INFO L226 Difference]: Without dead ends: 388 [2025-03-04 11:13:57,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=824, Unknown=0, NotChecked=0, Total=992 [2025-03-04 11:13:57,749 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 59 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:13:57,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 141 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:13:57,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-03-04 11:13:57,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 293. [2025-03-04 11:13:57,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 234 states have (on average 1.1623931623931625) internal successors, (272), 237 states have internal predecessors, (272), 31 states have call successors, (31), 25 states have call predecessors, (31), 25 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-04 11:13:57,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 334 transitions. [2025-03-04 11:13:57,769 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 334 transitions. Word has length 65 [2025-03-04 11:13:57,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:13:57,769 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 334 transitions. [2025-03-04 11:13:57,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 5 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-04 11:13:57,770 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 334 transitions. [2025-03-04 11:13:57,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-04 11:13:57,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:13:57,772 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:13:57,778 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:13:57,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 11:13:57,976 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:13:57,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:13:57,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1351305348, now seen corresponding path program 1 times [2025-03-04 11:13:57,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:13:57,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071741816] [2025-03-04 11:13:57,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:57,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:13:57,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 11:13:57,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 11:13:57,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:57,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:58,125 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-04 11:13:58,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:13:58,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071741816] [2025-03-04 11:13:58,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071741816] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:13:58,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707084132] [2025-03-04 11:13:58,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:58,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:13:58,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:13:58,128 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:13:58,129 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:13:58,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 11:13:58,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 11:13:58,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:58,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:58,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 11:13:58,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:13:58,297 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 3 proven. 30 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:13:58,298 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:13:58,473 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-04 11:13:58,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707084132] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:13:58,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:13:58,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 30 [2025-03-04 11:13:58,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438929292] [2025-03-04 11:13:58,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:13:58,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-04 11:13:58,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:13:58,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-04 11:13:58,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=740, Unknown=0, NotChecked=0, Total=930 [2025-03-04 11:13:58,476 INFO L87 Difference]: Start difference. First operand 293 states and 334 transitions. Second operand has 31 states, 30 states have (on average 3.033333333333333) internal successors, (91), 31 states have internal predecessors, (91), 14 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) [2025-03-04 11:13:59,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:13:59,407 INFO L93 Difference]: Finished difference Result 332 states and 381 transitions. [2025-03-04 11:13:59,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-04 11:13:59,407 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.033333333333333) internal successors, (91), 31 states have internal predecessors, (91), 14 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) Word has length 66 [2025-03-04 11:13:59,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:13:59,409 INFO L225 Difference]: With dead ends: 332 [2025-03-04 11:13:59,410 INFO L226 Difference]: Without dead ends: 331 [2025-03-04 11:13:59,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 733 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=715, Invalid=2945, Unknown=0, NotChecked=0, Total=3660 [2025-03-04 11:13:59,411 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 184 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 11:13:59,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 351 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 11:13:59,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2025-03-04 11:13:59,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 306. [2025-03-04 11:13:59,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 245 states have (on average 1.1591836734693877) internal successors, (284), 248 states have internal predecessors, (284), 32 states have call successors, (32), 26 states have call predecessors, (32), 26 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 11:13:59,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 348 transitions. [2025-03-04 11:13:59,430 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 348 transitions. Word has length 66 [2025-03-04 11:13:59,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:13:59,431 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 348 transitions. [2025-03-04 11:13:59,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.033333333333333) internal successors, (91), 31 states have internal predecessors, (91), 14 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) [2025-03-04 11:13:59,431 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 348 transitions. [2025-03-04 11:13:59,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-04 11:13:59,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:13:59,432 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:13:59,438 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:13:59,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:13:59,636 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:13:59,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:13:59,636 INFO L85 PathProgramCache]: Analyzing trace with hash -417891471, now seen corresponding path program 1 times [2025-03-04 11:13:59,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:13:59,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141419354] [2025-03-04 11:13:59,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:59,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:13:59,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-04 11:13:59,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 11:13:59,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:59,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:59,836 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-04 11:13:59,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:13:59,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141419354] [2025-03-04 11:13:59,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141419354] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:13:59,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963126145] [2025-03-04 11:13:59,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:59,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:13:59,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:13:59,839 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:13:59,841 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:13:59,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-04 11:13:59,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 11:13:59,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:59,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:59,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 11:13:59,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:13:59,990 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:13:59,990 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:14:00,192 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-04 11:14:00,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963126145] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:14:00,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:14:00,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 14] total 29 [2025-03-04 11:14:00,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538416583] [2025-03-04 11:14:00,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:14:00,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-04 11:14:00,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:00,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 11:14:00,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=617, Unknown=0, NotChecked=0, Total=812 [2025-03-04 11:14:00,194 INFO L87 Difference]: Start difference. First operand 306 states and 348 transitions. Second operand has 29 states, 29 states have (on average 3.3793103448275863) internal successors, (98), 29 states have internal predecessors, (98), 13 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (27), 13 states have call predecessors, (27), 13 states have call successors, (27) [2025-03-04 11:14:00,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:00,760 INFO L93 Difference]: Finished difference Result 542 states and 628 transitions. [2025-03-04 11:14:00,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-04 11:14:00,761 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.3793103448275863) internal successors, (98), 29 states have internal predecessors, (98), 13 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (27), 13 states have call predecessors, (27), 13 states have call successors, (27) Word has length 80 [2025-03-04 11:14:00,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:00,762 INFO L225 Difference]: With dead ends: 542 [2025-03-04 11:14:00,762 INFO L226 Difference]: Without dead ends: 383 [2025-03-04 11:14:00,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=643, Invalid=1709, Unknown=0, NotChecked=0, Total=2352 [2025-03-04 11:14:00,764 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 173 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:00,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 375 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:14:00,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2025-03-04 11:14:00,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 360. [2025-03-04 11:14:00,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 289 states have (on average 1.1522491349480968) internal successors, (333), 292 states have internal predecessors, (333), 37 states have call successors, (37), 31 states have call predecessors, (37), 31 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-04 11:14:00,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 407 transitions. [2025-03-04 11:14:00,778 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 407 transitions. Word has length 80 [2025-03-04 11:14:00,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:00,778 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 407 transitions. [2025-03-04 11:14:00,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.3793103448275863) internal successors, (98), 29 states have internal predecessors, (98), 13 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (27), 13 states have call predecessors, (27), 13 states have call successors, (27) [2025-03-04 11:14:00,778 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 407 transitions. [2025-03-04 11:14:00,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-04 11:14:00,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:00,779 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:14:00,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 11:14:00,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:00,980 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:14:00,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:00,980 INFO L85 PathProgramCache]: Analyzing trace with hash -312192998, now seen corresponding path program 1 times [2025-03-04 11:14:00,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:00,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930415803] [2025-03-04 11:14:00,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:00,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:00,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 11:14:00,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 11:14:00,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:00,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:01,170 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-04 11:14:01,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:01,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930415803] [2025-03-04 11:14:01,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930415803] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:14:01,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881449423] [2025-03-04 11:14:01,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:01,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:01,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:14:01,173 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:14:01,175 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:14:01,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 11:14:01,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 11:14:01,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:01,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:01,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 11:14:01,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:14:01,400 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:14:01,400 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:14:01,642 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-04 11:14:01,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [881449423] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:14:01,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:14:01,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 42 [2025-03-04 11:14:01,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315433943] [2025-03-04 11:14:01,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:14:01,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-04 11:14:01,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:01,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-04 11:14:01,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=1444, Unknown=0, NotChecked=0, Total=1806 [2025-03-04 11:14:01,644 INFO L87 Difference]: Start difference. First operand 360 states and 407 transitions. Second operand has 43 states, 42 states have (on average 3.0238095238095237) internal successors, (127), 43 states have internal predecessors, (127), 20 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 20 states have call predecessors, (26), 20 states have call successors, (26) [2025-03-04 11:14:03,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:03,111 INFO L93 Difference]: Finished difference Result 776 states and 906 transitions. [2025-03-04 11:14:03,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2025-03-04 11:14:03,112 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 3.0238095238095237) internal successors, (127), 43 states have internal predecessors, (127), 20 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 20 states have call predecessors, (26), 20 states have call successors, (26) Word has length 86 [2025-03-04 11:14:03,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:03,114 INFO L225 Difference]: With dead ends: 776 [2025-03-04 11:14:03,115 INFO L226 Difference]: Without dead ends: 617 [2025-03-04 11:14:03,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2133 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1770, Invalid=7350, Unknown=0, NotChecked=0, Total=9120 [2025-03-04 11:14:03,118 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 546 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:03,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 369 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 11:14:03,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2025-03-04 11:14:03,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 556. [2025-03-04 11:14:03,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 445 states have (on average 1.1752808988764045) internal successors, (523), 448 states have internal predecessors, (523), 57 states have call successors, (57), 51 states have call predecessors, (57), 51 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-04 11:14:03,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 637 transitions. [2025-03-04 11:14:03,141 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 637 transitions. Word has length 86 [2025-03-04 11:14:03,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:03,141 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 637 transitions. [2025-03-04 11:14:03,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 3.0238095238095237) internal successors, (127), 43 states have internal predecessors, (127), 20 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 20 states have call predecessors, (26), 20 states have call successors, (26) [2025-03-04 11:14:03,141 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 637 transitions. [2025-03-04 11:14:03,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-04 11:14:03,143 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:03,143 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:14:03,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 11:14:03,343 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,SelfDestructingSolverStorable13 [2025-03-04 11:14:03,344 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:14:03,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:03,346 INFO L85 PathProgramCache]: Analyzing trace with hash -381304629, now seen corresponding path program 1 times [2025-03-04 11:14:03,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:03,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204505674] [2025-03-04 11:14:03,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:03,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:03,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 11:14:03,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 11:14:03,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:03,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:03,537 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-04 11:14:03,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:03,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204505674] [2025-03-04 11:14:03,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204505674] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:14:03,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640295680] [2025-03-04 11:14:03,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:03,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:03,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:14:03,543 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:14:03,543 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:14:03,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 11:14:03,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 11:14:03,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:03,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:03,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 11:14:03,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:14:03,778 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 3 proven. 96 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:14:03,778 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:14:04,001 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-04 11:14:04,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640295680] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:14:04,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:14:04,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 42 [2025-03-04 11:14:04,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663939633] [2025-03-04 11:14:04,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:14:04,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-04 11:14:04,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:04,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-04 11:14:04,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=368, Invalid=1438, Unknown=0, NotChecked=0, Total=1806 [2025-03-04 11:14:04,003 INFO L87 Difference]: Start difference. First operand 556 states and 637 transitions. Second operand has 43 states, 42 states have (on average 3.0238095238095237) internal successors, (127), 43 states have internal predecessors, (127), 20 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 20 states have call predecessors, (26), 20 states have call successors, (26) [2025-03-04 11:14:05,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:05,412 INFO L93 Difference]: Finished difference Result 716 states and 822 transitions. [2025-03-04 11:14:05,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2025-03-04 11:14:05,416 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 3.0238095238095237) internal successors, (127), 43 states have internal predecessors, (127), 20 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 20 states have call predecessors, (26), 20 states have call successors, (26) Word has length 86 [2025-03-04 11:14:05,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:05,419 INFO L225 Difference]: With dead ends: 716 [2025-03-04 11:14:05,419 INFO L226 Difference]: Without dead ends: 713 [2025-03-04 11:14:05,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1845 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1656, Invalid=6716, Unknown=0, NotChecked=0, Total=8372 [2025-03-04 11:14:05,422 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 347 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:05,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 387 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 11:14:05,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2025-03-04 11:14:05,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 608. [2025-03-04 11:14:05,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 485 states have (on average 1.1814432989690722) internal successors, (573), 488 states have internal predecessors, (573), 63 states have call successors, (63), 57 states have call predecessors, (63), 57 states have return successors, (63), 62 states have call predecessors, (63), 63 states have call successors, (63) [2025-03-04 11:14:05,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 699 transitions. [2025-03-04 11:14:05,464 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 699 transitions. Word has length 86 [2025-03-04 11:14:05,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:05,465 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 699 transitions. [2025-03-04 11:14:05,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 3.0238095238095237) internal successors, (127), 43 states have internal predecessors, (127), 20 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 20 states have call predecessors, (26), 20 states have call successors, (26) [2025-03-04 11:14:05,465 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 699 transitions. [2025-03-04 11:14:05,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-04 11:14:05,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:05,468 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:14:05,474 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:14:05,668 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,SelfDestructingSolverStorable14 [2025-03-04 11:14:05,668 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:14:05,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:05,669 INFO L85 PathProgramCache]: Analyzing trace with hash -707708897, now seen corresponding path program 1 times [2025-03-04 11:14:05,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:05,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762091945] [2025-03-04 11:14:05,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:05,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:05,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 11:14:05,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 11:14:05,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:05,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:05,893 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 3 proven. 58 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-03-04 11:14:05,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:05,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762091945] [2025-03-04 11:14:05,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762091945] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:14:05,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681462848] [2025-03-04 11:14:05,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:05,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:05,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:14:05,895 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:14:05,896 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:14:05,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 11:14:05,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 11:14:05,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:05,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:05,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 11:14:05,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:14:06,027 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 3 proven. 142 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:14:06,028 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:14:06,248 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 3 proven. 58 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-03-04 11:14:06,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681462848] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:14:06,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:14:06,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 18] total 37 [2025-03-04 11:14:06,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458467722] [2025-03-04 11:14:06,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:14:06,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-04 11:14:06,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:06,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-04 11:14:06,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=1053, Unknown=0, NotChecked=0, Total=1332 [2025-03-04 11:14:06,250 INFO L87 Difference]: Start difference. First operand 608 states and 699 transitions. Second operand has 37 states, 37 states have (on average 3.3513513513513513) internal successors, (124), 37 states have internal predecessors, (124), 17 states have call successors, (33), 9 states have call predecessors, (33), 9 states have return successors, (33), 17 states have call predecessors, (33), 17 states have call successors, (33) [2025-03-04 11:14:07,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:07,142 INFO L93 Difference]: Finished difference Result 1131 states and 1314 transitions. [2025-03-04 11:14:07,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-03-04 11:14:07,143 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 3.3513513513513513) internal successors, (124), 37 states have internal predecessors, (124), 17 states have call successors, (33), 9 states have call predecessors, (33), 9 states have return successors, (33), 17 states have call predecessors, (33), 17 states have call successors, (33) Word has length 100 [2025-03-04 11:14:07,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:07,146 INFO L225 Difference]: With dead ends: 1131 [2025-03-04 11:14:07,146 INFO L226 Difference]: Without dead ends: 842 [2025-03-04 11:14:07,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1387 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1135, Invalid=4415, Unknown=0, NotChecked=0, Total=5550 [2025-03-04 11:14:07,150 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 216 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:07,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 588 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 11:14:07,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2025-03-04 11:14:07,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 758. [2025-03-04 11:14:07,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 605 states have (on average 1.1586776859504133) internal successors, (701), 608 states have internal predecessors, (701), 78 states have call successors, (78), 72 states have call predecessors, (78), 72 states have return successors, (78), 77 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-04 11:14:07,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 857 transitions. [2025-03-04 11:14:07,185 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 857 transitions. Word has length 100 [2025-03-04 11:14:07,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:07,185 INFO L471 AbstractCegarLoop]: Abstraction has 758 states and 857 transitions. [2025-03-04 11:14:07,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 3.3513513513513513) internal successors, (124), 37 states have internal predecessors, (124), 17 states have call successors, (33), 9 states have call predecessors, (33), 9 states have return successors, (33), 17 states have call predecessors, (33), 17 states have call successors, (33) [2025-03-04 11:14:07,185 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 857 transitions. [2025-03-04 11:14:07,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-04 11:14:07,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:07,186 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:14:07,196 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:14:07,387 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,SelfDestructingSolverStorable15 [2025-03-04 11:14:07,387 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:14:07,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:07,387 INFO L85 PathProgramCache]: Analyzing trace with hash -801127946, now seen corresponding path program 1 times [2025-03-04 11:14:07,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:07,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655675963] [2025-03-04 11:14:07,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:07,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:07,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 11:14:07,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 11:14:07,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:07,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:07,663 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2025-03-04 11:14:07,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:07,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655675963] [2025-03-04 11:14:07,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655675963] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:14:07,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795599966] [2025-03-04 11:14:07,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:07,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:07,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:14:07,666 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:14:07,667 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:14:07,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 11:14:07,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 11:14:07,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:07,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:07,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 11:14:07,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:14:07,978 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 3 proven. 166 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:14:07,978 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:14:08,307 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 3 proven. 54 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2025-03-04 11:14:08,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795599966] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:14:08,307 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:14:08,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 18] total 54 [2025-03-04 11:14:08,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41659954] [2025-03-04 11:14:08,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:14:08,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-03-04 11:14:08,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:08,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-03-04 11:14:08,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=564, Invalid=2406, Unknown=0, NotChecked=0, Total=2970 [2025-03-04 11:14:08,309 INFO L87 Difference]: Start difference. First operand 758 states and 857 transitions. Second operand has 55 states, 54 states have (on average 3.0185185185185186) internal successors, (163), 55 states have internal predecessors, (163), 26 states have call successors, (32), 9 states have call predecessors, (32), 9 states have return successors, (32), 26 states have call predecessors, (32), 26 states have call successors, (32) [2025-03-04 11:14:10,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:10,200 INFO L93 Difference]: Finished difference Result 927 states and 1052 transitions. [2025-03-04 11:14:10,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2025-03-04 11:14:10,200 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 3.0185185185185186) internal successors, (163), 55 states have internal predecessors, (163), 26 states have call successors, (32), 9 states have call predecessors, (32), 9 states have return successors, (32), 26 states have call predecessors, (32), 26 states have call successors, (32) Word has length 106 [2025-03-04 11:14:10,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:10,204 INFO L225 Difference]: With dead ends: 927 [2025-03-04 11:14:10,204 INFO L226 Difference]: Without dead ends: 925 [2025-03-04 11:14:10,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3588 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2754, Invalid=12008, Unknown=0, NotChecked=0, Total=14762 [2025-03-04 11:14:10,208 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 515 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:10,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 416 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 11:14:10,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2025-03-04 11:14:10,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 624. [2025-03-04 11:14:10,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 497 states have (on average 1.1609657947686116) internal successors, (577), 501 states have internal predecessors, (577), 65 states have call successors, (65), 59 states have call predecessors, (65), 59 states have return successors, (65), 63 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-04 11:14:10,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 707 transitions. [2025-03-04 11:14:10,234 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 707 transitions. Word has length 106 [2025-03-04 11:14:10,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:10,234 INFO L471 AbstractCegarLoop]: Abstraction has 624 states and 707 transitions. [2025-03-04 11:14:10,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 3.0185185185185186) internal successors, (163), 55 states have internal predecessors, (163), 26 states have call successors, (32), 9 states have call predecessors, (32), 9 states have return successors, (32), 26 states have call predecessors, (32), 26 states have call successors, (32) [2025-03-04 11:14:10,235 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 707 transitions. [2025-03-04 11:14:10,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-04 11:14:10,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:10,238 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 7, 7, 7, 7, 7, 7, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:14:10,245 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:14:10,439 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,SelfDestructingSolverStorable16 [2025-03-04 11:14:10,439 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:14:10,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:10,439 INFO L85 PathProgramCache]: Analyzing trace with hash -618230404, now seen corresponding path program 2 times [2025-03-04 11:14:10,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:10,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010455836] [2025-03-04 11:14:10,440 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:14:10,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:10,448 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 146 statements into 2 equivalence classes. [2025-03-04 11:14:10,463 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 146 of 146 statements. [2025-03-04 11:14:10,464 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:14:10,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:10,582 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2025-03-04 11:14:10,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:10,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010455836] [2025-03-04 11:14:10,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010455836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:14:10,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:14:10,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:14:10,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837958256] [2025-03-04 11:14:10,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:14:10,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:14:10,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:10,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:14:10,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:14:10,584 INFO L87 Difference]: Start difference. First operand 624 states and 707 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 11:14:10,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:10,682 INFO L93 Difference]: Finished difference Result 638 states and 721 transitions. [2025-03-04 11:14:10,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:14:10,682 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 146 [2025-03-04 11:14:10,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:10,684 INFO L225 Difference]: With dead ends: 638 [2025-03-04 11:14:10,684 INFO L226 Difference]: Without dead ends: 637 [2025-03-04 11:14:10,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:14:10,685 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 24 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:10,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 133 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:14:10,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2025-03-04 11:14:10,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 624. [2025-03-04 11:14:10,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 497 states have (on average 1.158953722334004) internal successors, (576), 501 states have internal predecessors, (576), 65 states have call successors, (65), 59 states have call predecessors, (65), 59 states have return successors, (65), 63 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-04 11:14:10,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 706 transitions. [2025-03-04 11:14:10,721 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 706 transitions. Word has length 146 [2025-03-04 11:14:10,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:10,721 INFO L471 AbstractCegarLoop]: Abstraction has 624 states and 706 transitions. [2025-03-04 11:14:10,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 11:14:10,722 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 706 transitions. [2025-03-04 11:14:10,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-04 11:14:10,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:10,724 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:14:10,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 11:14:10,724 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:14:10,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:10,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1578962185, now seen corresponding path program 2 times [2025-03-04 11:14:10,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:10,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625657119] [2025-03-04 11:14:10,725 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:14:10,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:10,732 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 150 statements into 2 equivalence classes. [2025-03-04 11:14:10,754 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 11:14:10,754 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:14:10,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:11,213 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 3 proven. 178 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-04 11:14:11,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:11,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625657119] [2025-03-04 11:14:11,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625657119] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:14:11,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868972955] [2025-03-04 11:14:11,213 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:14:11,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:11,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:14:11,217 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:14:11,218 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:14:11,250 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 150 statements into 2 equivalence classes. [2025-03-04 11:14:11,282 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 11:14:11,282 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:14:11,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:11,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 11:14:11,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:14:11,441 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 3 proven. 442 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:14:11,441 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:14:11,911 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 3 proven. 178 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-04 11:14:11,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868972955] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:14:11,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:14:11,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27, 28] total 51 [2025-03-04 11:14:11,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101993840] [2025-03-04 11:14:11,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:14:11,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-04 11:14:11,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:11,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-04 11:14:11,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=470, Invalid=2080, Unknown=0, NotChecked=0, Total=2550 [2025-03-04 11:14:11,913 INFO L87 Difference]: Start difference. First operand 624 states and 706 transitions. Second operand has 51 states, 51 states have (on average 3.7058823529411766) internal successors, (189), 51 states have internal predecessors, (189), 21 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 21 states have call predecessors, (48), 21 states have call successors, (48) [2025-03-04 11:14:13,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:13,368 INFO L93 Difference]: Finished difference Result 1398 states and 1614 transitions. [2025-03-04 11:14:13,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2025-03-04 11:14:13,368 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 3.7058823529411766) internal successors, (189), 51 states have internal predecessors, (189), 21 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 21 states have call predecessors, (48), 21 states have call successors, (48) Word has length 150 [2025-03-04 11:14:13,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:13,375 INFO L225 Difference]: With dead ends: 1398 [2025-03-04 11:14:13,375 INFO L226 Difference]: Without dead ends: 1133 [2025-03-04 11:14:13,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 272 SyntacticMatches, 6 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3121 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2287, Invalid=9055, Unknown=0, NotChecked=0, Total=11342 [2025-03-04 11:14:13,377 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 327 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:13,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 621 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 11:14:13,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2025-03-04 11:14:13,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 958. [2025-03-04 11:14:13,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 958 states, 765 states have (on average 1.1464052287581699) internal successors, (877), 769 states have internal predecessors, (877), 98 states have call successors, (98), 92 states have call predecessors, (98), 92 states have return successors, (98), 96 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-04 11:14:13,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1073 transitions. [2025-03-04 11:14:13,419 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1073 transitions. Word has length 150 [2025-03-04 11:14:13,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:13,419 INFO L471 AbstractCegarLoop]: Abstraction has 958 states and 1073 transitions. [2025-03-04 11:14:13,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 3.7058823529411766) internal successors, (189), 51 states have internal predecessors, (189), 21 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 21 states have call predecessors, (48), 21 states have call successors, (48) [2025-03-04 11:14:13,420 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1073 transitions. [2025-03-04 11:14:13,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-04 11:14:13,421 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:13,422 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 8, 8, 8, 7, 7, 7, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:14:13,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 11:14:13,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:13,622 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:14:13,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:13,623 INFO L85 PathProgramCache]: Analyzing trace with hash -609284084, now seen corresponding path program 1 times [2025-03-04 11:14:13,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:13,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921910546] [2025-03-04 11:14:13,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:13,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:13,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-04 11:14:13,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-04 11:14:13,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:13,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:14,046 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 26 proven. 166 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2025-03-04 11:14:14,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:14,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921910546] [2025-03-04 11:14:14,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921910546] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:14:14,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499147629] [2025-03-04 11:14:14,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:14,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:14,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:14:14,049 INFO L229 MonitoredProcess]: Starting monitored process 14 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:14:14,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 11:14:14,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-04 11:14:14,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-04 11:14:14,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:14,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:14,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 11:14:14,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:14:14,255 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 70 proven. 386 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 11:14:14,255 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:14:14,716 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 26 proven. 166 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2025-03-04 11:14:14,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499147629] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:14:14,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:14:14,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25, 26] total 48 [2025-03-04 11:14:14,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467215265] [2025-03-04 11:14:14,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:14:14,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-04 11:14:14,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:14,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-04 11:14:14,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=448, Invalid=1808, Unknown=0, NotChecked=0, Total=2256 [2025-03-04 11:14:14,719 INFO L87 Difference]: Start difference. First operand 958 states and 1073 transitions. Second operand has 48 states, 48 states have (on average 3.7708333333333335) internal successors, (181), 48 states have internal predecessors, (181), 22 states have call successors, (46), 14 states have call predecessors, (46), 14 states have return successors, (46), 22 states have call predecessors, (46), 22 states have call successors, (46) [2025-03-04 11:14:15,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:15,929 INFO L93 Difference]: Finished difference Result 1673 states and 1898 transitions. [2025-03-04 11:14:15,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2025-03-04 11:14:15,929 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 3.7708333333333335) internal successors, (181), 48 states have internal predecessors, (181), 22 states have call successors, (46), 14 states have call predecessors, (46), 14 states have return successors, (46), 22 states have call predecessors, (46), 22 states have call successors, (46) Word has length 154 [2025-03-04 11:14:15,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:15,934 INFO L225 Difference]: With dead ends: 1673 [2025-03-04 11:14:15,934 INFO L226 Difference]: Without dead ends: 1408 [2025-03-04 11:14:15,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 282 SyntacticMatches, 5 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2644 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1935, Invalid=7571, Unknown=0, NotChecked=0, Total=9506 [2025-03-04 11:14:15,937 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 330 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:15,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 473 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 11:14:15,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2025-03-04 11:14:15,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1316. [2025-03-04 11:14:15,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1316 states, 1053 states have (on average 1.1358024691358024) internal successors, (1196), 1057 states have internal predecessors, (1196), 133 states have call successors, (133), 127 states have call predecessors, (133), 127 states have return successors, (133), 131 states have call predecessors, (133), 133 states have call successors, (133) [2025-03-04 11:14:16,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1462 transitions. [2025-03-04 11:14:16,001 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1462 transitions. Word has length 154 [2025-03-04 11:14:16,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:16,001 INFO L471 AbstractCegarLoop]: Abstraction has 1316 states and 1462 transitions. [2025-03-04 11:14:16,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 3.7708333333333335) internal successors, (181), 48 states have internal predecessors, (181), 22 states have call successors, (46), 14 states have call predecessors, (46), 14 states have return successors, (46), 22 states have call predecessors, (46), 22 states have call successors, (46) [2025-03-04 11:14:16,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1462 transitions. [2025-03-04 11:14:16,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-04 11:14:16,004 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:16,004 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 11, 11, 10, 10, 10, 10, 9, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:14:16,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 11:14:16,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2025-03-04 11:14:16,205 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:14:16,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:16,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1882075903, now seen corresponding path program 1 times [2025-03-04 11:14:16,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:16,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505453430] [2025-03-04 11:14:16,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:16,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:16,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-04 11:14:16,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-04 11:14:16,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:16,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:16,258 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2025-03-04 11:14:16,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:16,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505453430] [2025-03-04 11:14:16,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505453430] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:14:16,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:14:16,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:14:16,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764698779] [2025-03-04 11:14:16,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:14:16,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:14:16,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:16,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:14:16,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:14:16,259 INFO L87 Difference]: Start difference. First operand 1316 states and 1462 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 4 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-04 11:14:16,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:16,348 INFO L93 Difference]: Finished difference Result 1787 states and 2015 transitions. [2025-03-04 11:14:16,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:14:16,349 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 4 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 156 [2025-03-04 11:14:16,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:16,355 INFO L225 Difference]: With dead ends: 1787 [2025-03-04 11:14:16,355 INFO L226 Difference]: Without dead ends: 1366 [2025-03-04 11:14:16,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:14:16,357 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 14 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:16,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 150 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:14:16,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2025-03-04 11:14:16,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 1310. [2025-03-04 11:14:16,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1310 states, 1050 states have (on average 1.1276190476190475) internal successors, (1184), 1054 states have internal predecessors, (1184), 133 states have call successors, (133), 124 states have call predecessors, (133), 124 states have return successors, (133), 131 states have call predecessors, (133), 133 states have call successors, (133) [2025-03-04 11:14:16,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 1450 transitions. [2025-03-04 11:14:16,424 INFO L78 Accepts]: Start accepts. Automaton has 1310 states and 1450 transitions. Word has length 156 [2025-03-04 11:14:16,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:16,424 INFO L471 AbstractCegarLoop]: Abstraction has 1310 states and 1450 transitions. [2025-03-04 11:14:16,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 4 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-04 11:14:16,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 1450 transitions. [2025-03-04 11:14:16,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-04 11:14:16,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:16,427 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:14:16,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 11:14:16,427 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:14:16,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:16,428 INFO L85 PathProgramCache]: Analyzing trace with hash 2021847223, now seen corresponding path program 2 times [2025-03-04 11:14:16,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:16,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820318095] [2025-03-04 11:14:16,428 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:14:16,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:16,434 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 156 statements into 2 equivalence classes. [2025-03-04 11:14:16,441 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 156 of 156 statements. [2025-03-04 11:14:16,441 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:14:16,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:16,504 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 510 trivial. 0 not checked. [2025-03-04 11:14:16,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:16,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820318095] [2025-03-04 11:14:16,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820318095] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:14:16,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:14:16,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:14:16,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069554529] [2025-03-04 11:14:16,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:14:16,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:14:16,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:16,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:14:16,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:14:16,506 INFO L87 Difference]: Start difference. First operand 1310 states and 1450 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 11:14:16,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:16,592 INFO L93 Difference]: Finished difference Result 1325 states and 1466 transitions. [2025-03-04 11:14:16,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:14:16,594 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 156 [2025-03-04 11:14:16,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:16,598 INFO L225 Difference]: With dead ends: 1325 [2025-03-04 11:14:16,598 INFO L226 Difference]: Without dead ends: 1321 [2025-03-04 11:14:16,598 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:14:16,599 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 23 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:16,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 128 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:14:16,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2025-03-04 11:14:16,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1163. [2025-03-04 11:14:16,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1163 states, 934 states have (on average 1.126338329764454) internal successors, (1052), 938 states have internal predecessors, (1052), 117 states have call successors, (117), 109 states have call predecessors, (117), 109 states have return successors, (117), 115 states have call predecessors, (117), 117 states have call successors, (117) [2025-03-04 11:14:16,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 1286 transitions. [2025-03-04 11:14:16,664 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 1286 transitions. Word has length 156 [2025-03-04 11:14:16,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:16,664 INFO L471 AbstractCegarLoop]: Abstraction has 1163 states and 1286 transitions. [2025-03-04 11:14:16,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 11:14:16,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1286 transitions. [2025-03-04 11:14:16,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-04 11:14:16,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:16,666 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:14:16,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 11:14:16,666 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:14:16,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:16,667 INFO L85 PathProgramCache]: Analyzing trace with hash 2131658334, now seen corresponding path program 1 times [2025-03-04 11:14:16,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:16,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663561980] [2025-03-04 11:14:16,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:16,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:16,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-04 11:14:16,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 11:14:16,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:16,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:17,152 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 6 proven. 180 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2025-03-04 11:14:17,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:17,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663561980] [2025-03-04 11:14:17,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663561980] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:14:17,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421577] [2025-03-04 11:14:17,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:17,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:17,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:14:17,155 INFO L229 MonitoredProcess]: Starting monitored process 15 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:14:17,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 11:14:17,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-04 11:14:17,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 11:14:17,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:17,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:17,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 11:14:17,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:14:17,375 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 6 proven. 492 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:14:17,375 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:14:17,917 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 6 proven. 180 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2025-03-04 11:14:17,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421577] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:14:17,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:14:17,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29, 30] total 51 [2025-03-04 11:14:17,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060967950] [2025-03-04 11:14:17,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:14:17,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-04 11:14:17,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:17,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-04 11:14:17,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=2093, Unknown=0, NotChecked=0, Total=2550 [2025-03-04 11:14:17,919 INFO L87 Difference]: Start difference. First operand 1163 states and 1286 transitions. Second operand has 51 states, 51 states have (on average 3.803921568627451) internal successors, (194), 51 states have internal predecessors, (194), 21 states have call successors, (49), 15 states have call predecessors, (49), 15 states have return successors, (49), 21 states have call predecessors, (49), 21 states have call successors, (49) [2025-03-04 11:14:19,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:19,596 INFO L93 Difference]: Finished difference Result 2312 states and 2595 transitions. [2025-03-04 11:14:19,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2025-03-04 11:14:19,596 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 3.803921568627451) internal successors, (194), 51 states have internal predecessors, (194), 21 states have call successors, (49), 15 states have call predecessors, (49), 15 states have return successors, (49), 21 states have call predecessors, (49), 21 states have call successors, (49) Word has length 160 [2025-03-04 11:14:19,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:19,602 INFO L225 Difference]: With dead ends: 2312 [2025-03-04 11:14:19,602 INFO L226 Difference]: Without dead ends: 2049 [2025-03-04 11:14:19,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 290 SyntacticMatches, 10 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3337 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2077, Invalid=9053, Unknown=0, NotChecked=0, Total=11130 [2025-03-04 11:14:19,605 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 335 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:19,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 531 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 11:14:19,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2049 states. [2025-03-04 11:14:19,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2049 to 1238. [2025-03-04 11:14:19,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1238 states, 995 states have (on average 1.1256281407035176) internal successors, (1120), 998 states have internal predecessors, (1120), 124 states have call successors, (124), 116 states have call predecessors, (124), 116 states have return successors, (124), 123 states have call predecessors, (124), 124 states have call successors, (124) [2025-03-04 11:14:19,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 1238 states and 1368 transitions. [2025-03-04 11:14:19,678 INFO L78 Accepts]: Start accepts. Automaton has 1238 states and 1368 transitions. Word has length 160 [2025-03-04 11:14:19,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:19,678 INFO L471 AbstractCegarLoop]: Abstraction has 1238 states and 1368 transitions. [2025-03-04 11:14:19,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 3.803921568627451) internal successors, (194), 51 states have internal predecessors, (194), 21 states have call successors, (49), 15 states have call predecessors, (49), 15 states have return successors, (49), 21 states have call predecessors, (49), 21 states have call successors, (49) [2025-03-04 11:14:19,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 1368 transitions. [2025-03-04 11:14:19,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-04 11:14:19,681 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:19,681 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 10, 10, 10, 10, 10, 10, 8, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:14:19,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-04 11:14:19,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:19,886 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:14:19,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:19,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1911095177, now seen corresponding path program 1 times [2025-03-04 11:14:19,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:19,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050981504] [2025-03-04 11:14:19,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:19,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:19,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-04 11:14:19,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-04 11:14:19,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:19,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:20,388 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2025-03-04 11:14:20,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:20,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050981504] [2025-03-04 11:14:20,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050981504] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:14:20,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [90248140] [2025-03-04 11:14:20,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:20,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:20,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:14:20,390 INFO L229 MonitoredProcess]: Starting monitored process 16 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:14:20,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 11:14:20,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-04 11:14:20,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-04 11:14:20,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:20,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:20,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 11:14:20,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:14:21,066 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 3 proven. 649 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:14:21,067 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:14:21,932 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 3 proven. 285 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2025-03-04 11:14:21,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [90248140] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:14:21,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:14:21,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30, 30] total 90 [2025-03-04 11:14:21,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374798727] [2025-03-04 11:14:21,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:14:21,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2025-03-04 11:14:21,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:21,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2025-03-04 11:14:21,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1638, Invalid=6552, Unknown=0, NotChecked=0, Total=8190 [2025-03-04 11:14:21,935 INFO L87 Difference]: Start difference. First operand 1238 states and 1368 transitions. Second operand has 91 states, 90 states have (on average 3.011111111111111) internal successors, (271), 91 states have internal predecessors, (271), 44 states have call successors, (50), 15 states have call predecessors, (50), 15 states have return successors, (50), 44 states have call predecessors, (50), 44 states have call successors, (50) [2025-03-04 11:14:26,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:26,112 INFO L93 Difference]: Finished difference Result 2453 states and 2798 transitions. [2025-03-04 11:14:26,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2025-03-04 11:14:26,112 INFO L78 Accepts]: Start accepts. Automaton has has 91 states, 90 states have (on average 3.011111111111111) internal successors, (271), 91 states have internal predecessors, (271), 44 states have call successors, (50), 15 states have call predecessors, (50), 15 states have return successors, (50), 44 states have call predecessors, (50), 44 states have call successors, (50) Word has length 166 [2025-03-04 11:14:26,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:26,118 INFO L225 Difference]: With dead ends: 2453 [2025-03-04 11:14:26,118 INFO L226 Difference]: Without dead ends: 2190 [2025-03-04 11:14:26,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11291 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=8721, Invalid=35169, Unknown=0, NotChecked=0, Total=43890 [2025-03-04 11:14:26,122 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 851 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:26,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [851 Valid, 545 Invalid, 886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-04 11:14:26,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2190 states. [2025-03-04 11:14:26,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2190 to 1434. [2025-03-04 11:14:26,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1434 states, 1151 states have (on average 1.1364031277150304) internal successors, (1308), 1154 states have internal predecessors, (1308), 145 states have call successors, (145), 135 states have call predecessors, (145), 135 states have return successors, (145), 144 states have call predecessors, (145), 145 states have call successors, (145) [2025-03-04 11:14:26,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 1598 transitions. [2025-03-04 11:14:26,205 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 1598 transitions. Word has length 166 [2025-03-04 11:14:26,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:26,205 INFO L471 AbstractCegarLoop]: Abstraction has 1434 states and 1598 transitions. [2025-03-04 11:14:26,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 91 states, 90 states have (on average 3.011111111111111) internal successors, (271), 91 states have internal predecessors, (271), 44 states have call successors, (50), 15 states have call predecessors, (50), 15 states have return successors, (50), 44 states have call predecessors, (50), 44 states have call successors, (50) [2025-03-04 11:14:26,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1598 transitions. [2025-03-04 11:14:26,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-04 11:14:26,208 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:26,209 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:14:26,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-04 11:14:26,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:26,410 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:14:26,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:26,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1176328544, now seen corresponding path program 2 times [2025-03-04 11:14:26,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:26,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407418074] [2025-03-04 11:14:26,410 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:14:26,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:26,416 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 174 statements into 2 equivalence classes. [2025-03-04 11:14:26,430 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 174 of 174 statements. [2025-03-04 11:14:26,433 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:14:26,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:26,736 INFO L134 CoverageAnalysis]: Checked inductivity of 634 backedges. 90 proven. 104 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2025-03-04 11:14:26,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:26,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407418074] [2025-03-04 11:14:26,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407418074] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:14:26,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839541525] [2025-03-04 11:14:26,738 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:14:26,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:26,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:14:26,739 INFO L229 MonitoredProcess]: Starting monitored process 17 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:14:26,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 11:14:26,767 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 174 statements into 2 equivalence classes. [2025-03-04 11:14:26,794 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 174 of 174 statements. [2025-03-04 11:14:26,794 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:14:26,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:26,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 11:14:26,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:14:26,906 INFO L134 CoverageAnalysis]: Checked inductivity of 634 backedges. 250 proven. 284 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-04 11:14:26,906 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:14:27,278 INFO L134 CoverageAnalysis]: Checked inductivity of 634 backedges. 90 proven. 104 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2025-03-04 11:14:27,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839541525] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:14:27,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:14:27,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 24] total 46 [2025-03-04 11:14:27,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541708115] [2025-03-04 11:14:27,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:14:27,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-04 11:14:27,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:27,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-04 11:14:27,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=403, Invalid=1667, Unknown=0, NotChecked=0, Total=2070 [2025-03-04 11:14:27,280 INFO L87 Difference]: Start difference. First operand 1434 states and 1598 transitions. Second operand has 46 states, 46 states have (on average 3.6956521739130435) internal successors, (170), 46 states have internal predecessors, (170), 22 states have call successors, (44), 13 states have call predecessors, (44), 13 states have return successors, (44), 22 states have call predecessors, (44), 22 states have call successors, (44) [2025-03-04 11:14:28,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:28,578 INFO L93 Difference]: Finished difference Result 2369 states and 2666 transitions. [2025-03-04 11:14:28,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2025-03-04 11:14:28,579 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 3.6956521739130435) internal successors, (170), 46 states have internal predecessors, (170), 22 states have call successors, (44), 13 states have call predecessors, (44), 13 states have return successors, (44), 22 states have call predecessors, (44), 22 states have call successors, (44) Word has length 174 [2025-03-04 11:14:28,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:28,585 INFO L225 Difference]: With dead ends: 2369 [2025-03-04 11:14:28,585 INFO L226 Difference]: Without dead ends: 1956 [2025-03-04 11:14:28,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 324 SyntacticMatches, 3 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2447 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1677, Invalid=7253, Unknown=0, NotChecked=0, Total=8930 [2025-03-04 11:14:28,587 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 252 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:28,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 534 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 11:14:28,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1956 states. [2025-03-04 11:14:28,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1956 to 1842. [2025-03-04 11:14:28,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1842 states, 1479 states have (on average 1.1271129141311698) internal successors, (1667), 1482 states have internal predecessors, (1667), 185 states have call successors, (185), 175 states have call predecessors, (185), 175 states have return successors, (185), 184 states have call predecessors, (185), 185 states have call successors, (185) [2025-03-04 11:14:28,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2037 transitions. [2025-03-04 11:14:28,678 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 2037 transitions. Word has length 174 [2025-03-04 11:14:28,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:28,678 INFO L471 AbstractCegarLoop]: Abstraction has 1842 states and 2037 transitions. [2025-03-04 11:14:28,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 3.6956521739130435) internal successors, (170), 46 states have internal predecessors, (170), 22 states have call successors, (44), 13 states have call predecessors, (44), 13 states have return successors, (44), 22 states have call predecessors, (44), 22 states have call successors, (44) [2025-03-04 11:14:28,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2037 transitions. [2025-03-04 11:14:28,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-04 11:14:28,682 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:28,682 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 12, 12, 12, 11, 11, 11, 10, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:14:28,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-04 11:14:28,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-04 11:14:28,883 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:14:28,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:28,883 INFO L85 PathProgramCache]: Analyzing trace with hash 2047224091, now seen corresponding path program 1 times [2025-03-04 11:14:28,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:28,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414639373] [2025-03-04 11:14:28,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:28,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:28,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-04 11:14:28,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-04 11:14:28,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:28,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:28,936 INFO L134 CoverageAnalysis]: Checked inductivity of 836 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 662 trivial. 0 not checked. [2025-03-04 11:14:28,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:28,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414639373] [2025-03-04 11:14:28,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414639373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:14:28,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:14:28,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:14:28,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342293547] [2025-03-04 11:14:28,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:14:28,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:14:28,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:28,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:14:28,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:14:28,937 INFO L87 Difference]: Start difference. First operand 1842 states and 2037 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-04 11:14:29,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:29,039 INFO L93 Difference]: Finished difference Result 2698 states and 3017 transitions. [2025-03-04 11:14:29,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:14:29,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 180 [2025-03-04 11:14:29,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:29,045 INFO L225 Difference]: With dead ends: 2698 [2025-03-04 11:14:29,045 INFO L226 Difference]: Without dead ends: 1831 [2025-03-04 11:14:29,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:14:29,047 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 17 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:29,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 115 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:14:29,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1831 states. [2025-03-04 11:14:29,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1831 to 1825. [2025-03-04 11:14:29,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1825 states, 1466 states have (on average 1.1234652114597545) internal successors, (1647), 1470 states have internal predecessors, (1647), 185 states have call successors, (185), 171 states have call predecessors, (185), 171 states have return successors, (185), 183 states have call predecessors, (185), 185 states have call successors, (185) [2025-03-04 11:14:29,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1825 states to 1825 states and 2017 transitions. [2025-03-04 11:14:29,133 INFO L78 Accepts]: Start accepts. Automaton has 1825 states and 2017 transitions. Word has length 180 [2025-03-04 11:14:29,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:29,133 INFO L471 AbstractCegarLoop]: Abstraction has 1825 states and 2017 transitions. [2025-03-04 11:14:29,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-04 11:14:29,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1825 states and 2017 transitions. [2025-03-04 11:14:29,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-04 11:14:29,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:29,137 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 9, 9, 9, 8, 8, 8, 7, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:14:29,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 11:14:29,137 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:14:29,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:29,137 INFO L85 PathProgramCache]: Analyzing trace with hash -951453600, now seen corresponding path program 2 times [2025-03-04 11:14:29,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:29,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037887116] [2025-03-04 11:14:29,137 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:14:29,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:29,144 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 180 statements into 2 equivalence classes. [2025-03-04 11:14:29,157 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 180 of 180 statements. [2025-03-04 11:14:29,157 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:14:29,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:29,648 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 6 proven. 266 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2025-03-04 11:14:29,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:29,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037887116] [2025-03-04 11:14:29,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037887116] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:14:29,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512017261] [2025-03-04 11:14:29,649 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:14:29,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:29,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:14:29,651 INFO L229 MonitoredProcess]: Starting monitored process 18 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:14:29,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 11:14:29,693 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 180 statements into 2 equivalence classes. [2025-03-04 11:14:29,724 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 180 of 180 statements. [2025-03-04 11:14:29,724 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:14:29,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:29,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 11:14:29,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:14:29,893 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 6 proven. 686 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:14:29,893 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:14:30,406 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 6 proven. 266 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2025-03-04 11:14:30,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512017261] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:14:30,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:14:30,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 33, 34] total 55 [2025-03-04 11:14:30,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606578142] [2025-03-04 11:14:30,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:14:30,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-03-04 11:14:30,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:30,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-03-04 11:14:30,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=516, Invalid=2454, Unknown=0, NotChecked=0, Total=2970 [2025-03-04 11:14:30,408 INFO L87 Difference]: Start difference. First operand 1825 states and 2017 transitions. Second operand has 55 states, 55 states have (on average 4.0181818181818185) internal successors, (221), 55 states have internal predecessors, (221), 21 states have call successors, (56), 17 states have call predecessors, (56), 17 states have return successors, (56), 21 states have call predecessors, (56), 21 states have call successors, (56) [2025-03-04 11:14:32,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:32,312 INFO L93 Difference]: Finished difference Result 3641 states and 4054 transitions. [2025-03-04 11:14:32,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2025-03-04 11:14:32,313 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 4.0181818181818185) internal successors, (221), 55 states have internal predecessors, (221), 21 states have call successors, (56), 17 states have call predecessors, (56), 17 states have return successors, (56), 21 states have call predecessors, (56), 21 states have call successors, (56) Word has length 180 [2025-03-04 11:14:32,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:32,321 INFO L225 Difference]: With dead ends: 3641 [2025-03-04 11:14:32,322 INFO L226 Difference]: Without dead ends: 3205 [2025-03-04 11:14:32,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 326 SyntacticMatches, 14 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4332 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2528, Invalid=11278, Unknown=0, NotChecked=0, Total=13806 [2025-03-04 11:14:32,324 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 349 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:32,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 644 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 11:14:32,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3205 states. [2025-03-04 11:14:32,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3205 to 1945. [2025-03-04 11:14:32,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1945 states, 1562 states have (on average 1.1216389244558258) internal successors, (1752), 1566 states have internal predecessors, (1752), 197 states have call successors, (197), 183 states have call predecessors, (197), 183 states have return successors, (197), 195 states have call predecessors, (197), 197 states have call successors, (197) [2025-03-04 11:14:32,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1945 states to 1945 states and 2146 transitions. [2025-03-04 11:14:32,451 INFO L78 Accepts]: Start accepts. Automaton has 1945 states and 2146 transitions. Word has length 180 [2025-03-04 11:14:32,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:32,452 INFO L471 AbstractCegarLoop]: Abstraction has 1945 states and 2146 transitions. [2025-03-04 11:14:32,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 4.0181818181818185) internal successors, (221), 55 states have internal predecessors, (221), 21 states have call successors, (56), 17 states have call predecessors, (56), 17 states have return successors, (56), 21 states have call predecessors, (56), 21 states have call successors, (56) [2025-03-04 11:14:32,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1945 states and 2146 transitions. [2025-03-04 11:14:32,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-04 11:14:32,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:32,457 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:14:32,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-04 11:14:32,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-04 11:14:32,657 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:14:32,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:32,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1639448462, now seen corresponding path program 3 times [2025-03-04 11:14:32,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:32,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189344309] [2025-03-04 11:14:32,658 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:14:32,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:32,665 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 180 statements into 10 equivalence classes. [2025-03-04 11:14:32,670 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 55 of 180 statements. [2025-03-04 11:14:32,670 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 11:14:32,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:32,725 INFO L134 CoverageAnalysis]: Checked inductivity of 696 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2025-03-04 11:14:32,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:32,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189344309] [2025-03-04 11:14:32,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189344309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:14:32,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:14:32,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 11:14:32,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511656040] [2025-03-04 11:14:32,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:14:32,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 11:14:32,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:32,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 11:14:32,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:14:32,726 INFO L87 Difference]: Start difference. First operand 1945 states and 2146 transitions. Second operand has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 11:14:32,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:32,862 INFO L93 Difference]: Finished difference Result 1950 states and 2150 transitions. [2025-03-04 11:14:32,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 11:14:32,862 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 180 [2025-03-04 11:14:32,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:32,867 INFO L225 Difference]: With dead ends: 1950 [2025-03-04 11:14:32,867 INFO L226 Difference]: Without dead ends: 1949 [2025-03-04 11:14:32,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-04 11:14:32,868 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 39 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:32,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 161 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:14:32,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1949 states. [2025-03-04 11:14:32,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1949 to 1657. [2025-03-04 11:14:32,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1657 states, 1329 states have (on average 1.1151241534988714) internal successors, (1482), 1336 states have internal predecessors, (1482), 168 states have call successors, (168), 157 states have call predecessors, (168), 157 states have return successors, (168), 163 states have call predecessors, (168), 168 states have call successors, (168) [2025-03-04 11:14:32,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1657 states and 1818 transitions. [2025-03-04 11:14:32,964 INFO L78 Accepts]: Start accepts. Automaton has 1657 states and 1818 transitions. Word has length 180 [2025-03-04 11:14:32,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:32,965 INFO L471 AbstractCegarLoop]: Abstraction has 1657 states and 1818 transitions. [2025-03-04 11:14:32,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 11:14:32,965 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 1818 transitions. [2025-03-04 11:14:32,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-04 11:14:32,968 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:32,968 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 13, 13, 13, 12, 12, 12, 11, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:14:32,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 11:14:32,968 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:14:32,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:32,969 INFO L85 PathProgramCache]: Analyzing trace with hash -593681116, now seen corresponding path program 3 times [2025-03-04 11:14:32,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:32,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149364796] [2025-03-04 11:14:32,969 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:14:32,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:32,975 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 204 statements into 13 equivalence classes. [2025-03-04 11:14:33,001 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 59 of 204 statements. [2025-03-04 11:14:33,001 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 11:14:33,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:33,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1054 backedges. 98 proven. 1 refuted. 0 times theorem prover too weak. 955 trivial. 0 not checked. [2025-03-04 11:14:33,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:33,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149364796] [2025-03-04 11:14:33,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149364796] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:14:33,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23886615] [2025-03-04 11:14:33,068 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:14:33,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:33,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:14:33,070 INFO L229 MonitoredProcess]: Starting monitored process 19 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:14:33,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 11:14:33,104 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 204 statements into 13 equivalence classes. [2025-03-04 11:14:33,117 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 59 of 204 statements. [2025-03-04 11:14:33,118 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 11:14:33,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:33,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 11:14:33,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:14:33,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1054 backedges. 162 proven. 1 refuted. 0 times theorem prover too weak. 891 trivial. 0 not checked. [2025-03-04 11:14:33,142 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:14:33,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1054 backedges. 98 proven. 1 refuted. 0 times theorem prover too weak. 955 trivial. 0 not checked. [2025-03-04 11:14:33,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23886615] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:14:33,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:14:33,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2025-03-04 11:14:33,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345022103] [2025-03-04 11:14:33,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:14:33,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 11:14:33,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:33,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 11:14:33,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2025-03-04 11:14:33,241 INFO L87 Difference]: Start difference. First operand 1657 states and 1818 transitions. Second operand has 18 states, 17 states have (on average 3.588235294117647) internal successors, (61), 18 states have internal predecessors, (61), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-04 11:14:33,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:33,740 INFO L93 Difference]: Finished difference Result 1765 states and 1944 transitions. [2025-03-04 11:14:33,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 11:14:33,740 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.588235294117647) internal successors, (61), 18 states have internal predecessors, (61), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 204 [2025-03-04 11:14:33,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:33,741 INFO L225 Difference]: With dead ends: 1765 [2025-03-04 11:14:33,741 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 11:14:33,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 399 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=686, Unknown=0, NotChecked=0, Total=870 [2025-03-04 11:14:33,744 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 78 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:33,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 289 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:14:33,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 11:14:33,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 11:14:33,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:14:33,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 11:14:33,745 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 204 [2025-03-04 11:14:33,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:33,745 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 11:14:33,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.588235294117647) internal successors, (61), 18 states have internal predecessors, (61), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-04 11:14:33,745 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 11:14:33,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 11:14:33,747 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-03-04 11:14:33,748 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-03-04 11:14:33,748 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-03-04 11:14:33,748 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-03-04 11:14:33,748 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-03-04 11:14:33,748 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-03-04 11:14:33,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-04 11:14:33,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-04 11:14:33,951 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:14:33,953 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.