./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/reducercommutativity/max40-1.i --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/reducercommutativity/max40-1.i -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 a8d5806586012290ae42296af495175d1f0a3275a3232981eda33ec55888f6d2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:22:28,114 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:22:28,172 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 10:22:28,176 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:22:28,176 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:22:28,194 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:22:28,194 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:22:28,194 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:22:28,195 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:22:28,195 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:22:28,195 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:22:28,195 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:22:28,195 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:22:28,195 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:22:28,195 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:22:28,196 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:22:28,196 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:22:28,196 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:22:28,196 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:22:28,196 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:22:28,196 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:22:28,196 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:22:28,196 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:22:28,196 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:22:28,196 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:22:28,196 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:22:28,196 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:22:28,196 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:22:28,196 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:22:28,197 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:22:28,197 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:22:28,197 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:22:28,197 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:22:28,197 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:22:28,197 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:22:28,197 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:22:28,197 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:22:28,197 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:22:28,197 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:22:28,197 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:22:28,197 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:22:28,197 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:22:28,197 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:22:28,198 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:22:28,198 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:22:28,198 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 -> a8d5806586012290ae42296af495175d1f0a3275a3232981eda33ec55888f6d2 [2025-03-04 10:22:28,462 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:22:28,471 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:22:28,473 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:22:28,474 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:22:28,474 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:22:28,476 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/max40-1.i [2025-03-04 10:22:29,679 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75bcb690d/55f10f0f77b440bcb47231fcca89a58b/FLAGff2fb8ea1 [2025-03-04 10:22:29,903 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:22:29,903 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/max40-1.i [2025-03-04 10:22:29,909 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75bcb690d/55f10f0f77b440bcb47231fcca89a58b/FLAGff2fb8ea1 [2025-03-04 10:22:29,922 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75bcb690d/55f10f0f77b440bcb47231fcca89a58b [2025-03-04 10:22:29,925 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:22:29,926 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:22:29,927 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:22:29,927 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:22:29,930 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:22:29,931 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:22:29" (1/1) ... [2025-03-04 10:22:29,931 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@181e7e84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:22:29, skipping insertion in model container [2025-03-04 10:22:29,932 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:22:29" (1/1) ... [2025-03-04 10:22:29,944 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:22:30,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:22:30,107 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:22:30,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:22:30,143 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:22:30,144 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:22:30 WrapperNode [2025-03-04 10:22:30,144 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:22:30,146 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:22:30,146 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:22:30,146 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:22:30,151 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:22:30" (1/1) ... [2025-03-04 10:22:30,160 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:22:30" (1/1) ... [2025-03-04 10:22:30,179 INFO L138 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 71 [2025-03-04 10:22:30,183 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:22:30,183 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:22:30,183 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:22:30,183 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:22:30,191 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:22:30" (1/1) ... [2025-03-04 10:22:30,191 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:22:30" (1/1) ... [2025-03-04 10:22:30,192 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:22:30" (1/1) ... [2025-03-04 10:22:30,208 INFO L175 MemorySlicer]: Split 13 memory accesses to 2 slices as follows [2, 11]. 85 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2025-03-04 10:22:30,210 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:22:30" (1/1) ... [2025-03-04 10:22:30,210 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:22:30" (1/1) ... [2025-03-04 10:22:30,218 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:22:30" (1/1) ... [2025-03-04 10:22:30,219 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:22:30" (1/1) ... [2025-03-04 10:22:30,220 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:22:30" (1/1) ... [2025-03-04 10:22:30,220 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:22:30" (1/1) ... [2025-03-04 10:22:30,223 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:22:30,227 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:22:30,227 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:22:30,227 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:22:30,228 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:22:30" (1/1) ... [2025-03-04 10:22:30,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:22:30,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:22:30,256 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 10:22:30,262 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 10:22:30,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:22:30,281 INFO L130 BoogieDeclarations]: Found specification of procedure max [2025-03-04 10:22:30,281 INFO L138 BoogieDeclarations]: Found implementation of procedure max [2025-03-04 10:22:30,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:22:30,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:22:30,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 10:22:30,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:22:30,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:22:30,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:22:30,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:22:30,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:22:30,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:22:30,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 10:22:30,343 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:22:30,345 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:22:30,500 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L28: call ULTIMATE.dealloc(main_~#x~0#1.base, main_~#x~0#1.offset);havoc main_~#x~0#1.base, main_~#x~0#1.offset; [2025-03-04 10:22:30,511 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-03-04 10:22:30,511 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:22:30,518 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:22:30,519 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:22:30,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:22:30 BoogieIcfgContainer [2025-03-04 10:22:30,520 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:22:30,522 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:22:30,522 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:22:30,525 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:22:30,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:22:29" (1/3) ... [2025-03-04 10:22:30,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a80553d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:22:30, skipping insertion in model container [2025-03-04 10:22:30,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:22:30" (2/3) ... [2025-03-04 10:22:30,528 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a80553d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:22:30, skipping insertion in model container [2025-03-04 10:22:30,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:22:30" (3/3) ... [2025-03-04 10:22:30,530 INFO L128 eAbstractionObserver]: Analyzing ICFG max40-1.i [2025-03-04 10:22:30,554 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:22:30,555 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG max40-1.i that has 2 procedures, 39 locations, 1 initial locations, 3 loop locations, and 8 error locations. [2025-03-04 10:22:30,598 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:22:30,608 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;@1429bd87, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:22:30,608 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-04 10:22:30,611 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 34 states have internal predecessors, (40), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:22:30,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 10:22:30,615 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:22:30,615 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 10:22:30,616 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:22:30,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:22:30,621 INFO L85 PathProgramCache]: Analyzing trace with hash 2246207, now seen corresponding path program 1 times [2025-03-04 10:22:30,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:22:30,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988530014] [2025-03-04 10:22:30,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:22:30,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:22:30,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 10:22:30,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 10:22:30,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:22:30,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:22:30,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:22:30,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:22:30,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988530014] [2025-03-04 10:22:30,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988530014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:22:30,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:22:30,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:22:30,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967455220] [2025-03-04 10:22:30,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:22:30,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:22:30,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:22:30,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:22:30,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:22:30,808 INFO L87 Difference]: Start difference. First operand has 39 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 34 states have internal predecessors, (40), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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 10:22:30,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:22:30,847 INFO L93 Difference]: Finished difference Result 75 states and 89 transitions. [2025-03-04 10:22:30,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:22:30,848 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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) Word has length 4 [2025-03-04 10:22:30,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:22:30,853 INFO L225 Difference]: With dead ends: 75 [2025-03-04 10:22:30,853 INFO L226 Difference]: Without dead ends: 34 [2025-03-04 10:22:30,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:22:30,858 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 1 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:22:30,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 113 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:22:30,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-04 10:22:30,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-03-04 10:22:30,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:22:30,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2025-03-04 10:22:30,888 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 4 [2025-03-04 10:22:30,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:22:30,888 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2025-03-04 10:22:30,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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 10:22:30,888 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2025-03-04 10:22:30,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 10:22:30,889 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:22:30,889 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-04 10:22:30,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:22:30,889 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:22:30,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:22:30,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1802716922, now seen corresponding path program 1 times [2025-03-04 10:22:30,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:22:30,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136503302] [2025-03-04 10:22:30,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:22:30,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:22:30,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:22:30,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:22:30,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:22:30,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:22:31,040 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:22:31,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:22:31,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136503302] [2025-03-04 10:22:31,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136503302] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:22:31,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347120128] [2025-03-04 10:22:31,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:22:31,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:22:31,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:22:31,046 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 10:22:31,047 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 10:22:31,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:22:31,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:22:31,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:22:31,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:22:31,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:22:31,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:22:31,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:22:31,146 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:22:31,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347120128] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:22:31,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:22:31,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 10:22:31,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938647898] [2025-03-04 10:22:31,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:22:31,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:22:31,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:22:31,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:22:31,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:22:31,150 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 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 10:22:31,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:22:31,186 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2025-03-04 10:22:31,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:22:31,186 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 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) Word has length 7 [2025-03-04 10:22:31,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:22:31,187 INFO L225 Difference]: With dead ends: 34 [2025-03-04 10:22:31,187 INFO L226 Difference]: Without dead ends: 33 [2025-03-04 10:22:31,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:22:31,188 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:22:31,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 88 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:22:31,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-04 10:22:31,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-03-04 10:22:31,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.5) internal successors, (33), 29 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:22:31,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2025-03-04 10:22:31,191 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 7 [2025-03-04 10:22:31,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:22:31,191 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2025-03-04 10:22:31,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 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 10:22:31,192 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2025-03-04 10:22:31,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 10:22:31,192 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:22:31,192 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-03-04 10:22:31,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 10:22:31,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:22:31,396 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:22:31,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:22:31,397 INFO L85 PathProgramCache]: Analyzing trace with hash -49649727, now seen corresponding path program 1 times [2025-03-04 10:22:31,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:22:31,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009713105] [2025-03-04 10:22:31,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:22:31,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:22:31,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:22:31,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:22:31,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:22:31,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:22:31,436 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:22:31,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:22:31,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009713105] [2025-03-04 10:22:31,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009713105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:22:31,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:22:31,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:22:31,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381303339] [2025-03-04 10:22:31,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:22:31,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:22:31,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:22:31,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:22:31,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:22:31,438 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 10:22:31,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:22:31,447 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2025-03-04 10:22:31,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:22:31,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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) Word has length 8 [2025-03-04 10:22:31,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:22:31,449 INFO L225 Difference]: With dead ends: 33 [2025-03-04 10:22:31,449 INFO L226 Difference]: Without dead ends: 32 [2025-03-04 10:22:31,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:22:31,449 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:22:31,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:22:31,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-04 10:22:31,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2025-03-04 10:22:31,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.5) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:22:31,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2025-03-04 10:22:31,455 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 8 [2025-03-04 10:22:31,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:22:31,456 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2025-03-04 10:22:31,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 10:22:31,456 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2025-03-04 10:22:31,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 10:22:31,456 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:22:31,456 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:22:31,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:22:31,457 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:22:31,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:22:31,457 INFO L85 PathProgramCache]: Analyzing trace with hash 622525874, now seen corresponding path program 1 times [2025-03-04 10:22:31,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:22:31,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633774495] [2025-03-04 10:22:31,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:22:31,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:22:31,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:22:31,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:22:31,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:22:31,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:22:31,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:22:31,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:22:31,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633774495] [2025-03-04 10:22:31,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633774495] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:22:31,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745206585] [2025-03-04 10:22:31,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:22:31,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:22:31,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:22:31,548 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 10:22:31,556 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 10:22:31,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:22:31,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:22:31,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:22:31,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:22:31,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:22:31,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:22:31,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:22:31,623 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:22:31,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:22:31,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745206585] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:22:31,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:22:31,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 10:22:31,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520080836] [2025-03-04 10:22:31,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:22:31,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:22:31,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:22:31,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:22:31,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:22:31,666 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:22:31,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:22:31,690 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2025-03-04 10:22:31,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:22:31,693 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-04 10:22:31,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:22:31,694 INFO L225 Difference]: With dead ends: 60 [2025-03-04 10:22:31,694 INFO L226 Difference]: Without dead ends: 36 [2025-03-04 10:22:31,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:22:31,695 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:22:31,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 148 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:22:31,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-04 10:22:31,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-04 10:22:31,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 32 states have internal predecessors, (36), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:22:31,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2025-03-04 10:22:31,698 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 12 [2025-03-04 10:22:31,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:22:31,699 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2025-03-04 10:22:31,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:22:31,699 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2025-03-04 10:22:31,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 10:22:31,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:22:31,699 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:22:31,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 10:22:31,903 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,SelfDestructingSolverStorable3 [2025-03-04 10:22:31,903 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:22:31,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:22:31,903 INFO L85 PathProgramCache]: Analyzing trace with hash -432565166, now seen corresponding path program 2 times [2025-03-04 10:22:31,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:22:31,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699834618] [2025-03-04 10:22:31,904 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:22:31,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:22:31,915 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 10:22:31,919 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 18 statements. [2025-03-04 10:22:31,919 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:22:31,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:22:31,949 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:22:31,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:22:31,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699834618] [2025-03-04 10:22:31,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699834618] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:22:31,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:22:31,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:22:31,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935986309] [2025-03-04 10:22:31,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:22:31,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:22:31,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:22:31,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:22:31,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:22:31,950 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:22:31,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:22:31,974 INFO L93 Difference]: Finished difference Result 64 states and 78 transitions. [2025-03-04 10:22:31,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:22:31,974 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-04 10:22:31,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:22:31,975 INFO L225 Difference]: With dead ends: 64 [2025-03-04 10:22:31,975 INFO L226 Difference]: Without dead ends: 41 [2025-03-04 10:22:31,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:22:31,976 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:22:31,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 81 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:22:31,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-04 10:22:31,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2025-03-04 10:22:31,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 36 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:22:31,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2025-03-04 10:22:31,981 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 18 [2025-03-04 10:22:31,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:22:31,981 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2025-03-04 10:22:31,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:22:31,981 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2025-03-04 10:22:31,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 10:22:31,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:22:31,983 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:22:31,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:22:31,984 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:22:31,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:22:31,984 INFO L85 PathProgramCache]: Analyzing trace with hash -524618287, now seen corresponding path program 1 times [2025-03-04 10:22:31,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:22:31,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606106407] [2025-03-04 10:22:31,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:22:31,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:22:31,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:22:31,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:22:31,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:22:31,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:22:32,032 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:22:32,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:22:32,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606106407] [2025-03-04 10:22:32,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606106407] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:22:32,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:22:32,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:22:32,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392529519] [2025-03-04 10:22:32,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:22:32,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:22:32,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:22:32,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:22:32,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:22:32,033 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:22:32,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:22:32,053 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2025-03-04 10:22:32,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:22:32,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-04 10:22:32,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:22:32,056 INFO L225 Difference]: With dead ends: 42 [2025-03-04 10:22:32,056 INFO L226 Difference]: Without dead ends: 41 [2025-03-04 10:22:32,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:22:32,057 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:22:32,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 83 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:22:32,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-04 10:22:32,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-03-04 10:22:32,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 37 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:22:32,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2025-03-04 10:22:32,060 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 19 [2025-03-04 10:22:32,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:22:32,060 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2025-03-04 10:22:32,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:22:32,060 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2025-03-04 10:22:32,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 10:22:32,061 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:22:32,061 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:22:32,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:22:32,061 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:22:32,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:22:32,061 INFO L85 PathProgramCache]: Analyzing trace with hash 2075084781, now seen corresponding path program 1 times [2025-03-04 10:22:32,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:22:32,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467687531] [2025-03-04 10:22:32,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:22:32,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:22:32,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 10:22:32,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:22:32,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:22:32,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:22:32,154 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:22:32,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:22:32,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467687531] [2025-03-04 10:22:32,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467687531] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:22:32,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026677767] [2025-03-04 10:22:32,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:22:32,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:22:32,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:22:32,156 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 10:22:32,158 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 10:22:32,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 10:22:32,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:22:32,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:22:32,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:22:32,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:22:32,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:22:32,242 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:22:32,243 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:22:32,317 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:22:32,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026677767] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:22:32,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:22:32,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-04 10:22:32,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159450064] [2025-03-04 10:22:32,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:22:32,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 10:22:32,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:22:32,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 10:22:32,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:22:32,319 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:22:32,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:22:32,380 INFO L93 Difference]: Finished difference Result 82 states and 97 transitions. [2025-03-04 10:22:32,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 10:22:32,381 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-04 10:22:32,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:22:32,382 INFO L225 Difference]: With dead ends: 82 [2025-03-04 10:22:32,382 INFO L226 Difference]: Without dead ends: 53 [2025-03-04 10:22:32,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:22:32,383 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:22:32,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 179 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:22:32,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-04 10:22:32,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-03-04 10:22:32,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 43 states have (on average 1.255813953488372) internal successors, (54), 49 states have internal predecessors, (54), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:22:32,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2025-03-04 10:22:32,390 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 23 [2025-03-04 10:22:32,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:22:32,390 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2025-03-04 10:22:32,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:22:32,391 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2025-03-04 10:22:32,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-04 10:22:32,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:22:32,392 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:22:32,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 10:22:32,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:22:32,592 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:22:32,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:22:32,593 INFO L85 PathProgramCache]: Analyzing trace with hash -2029008211, now seen corresponding path program 2 times [2025-03-04 10:22:32,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:22:32,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156251902] [2025-03-04 10:22:32,593 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:22:32,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:22:32,608 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-03-04 10:22:32,615 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 10:22:32,615 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:22:32,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:22:32,667 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-04 10:22:32,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:22:32,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156251902] [2025-03-04 10:22:32,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156251902] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:22:32,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460369099] [2025-03-04 10:22:32,667 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:22:32,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:22:32,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:22:32,669 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 10:22:32,671 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 10:22:32,710 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-03-04 10:22:32,728 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 10:22:32,729 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:22:32,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:22:32,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:22:32,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:22:32,923 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:22:32,923 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:22:33,199 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:22:33,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460369099] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:22:33,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:22:33,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 17, 17] total 36 [2025-03-04 10:22:33,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263953478] [2025-03-04 10:22:33,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:22:33,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-04 10:22:33,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:22:33,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-04 10:22:33,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=980, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 10:22:33,204 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand has 36 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 36 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:22:33,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:22:33,320 INFO L93 Difference]: Finished difference Result 105 states and 125 transitions. [2025-03-04 10:22:33,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-04 10:22:33,321 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 36 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-03-04 10:22:33,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:22:33,322 INFO L225 Difference]: With dead ends: 105 [2025-03-04 10:22:33,322 INFO L226 Difference]: Without dead ends: 76 [2025-03-04 10:22:33,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=280, Invalid=980, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 10:22:33,323 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 3 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:22:33,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 252 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:22:33,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-04 10:22:33,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-03-04 10:22:33,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 67 states have (on average 1.1492537313432836) internal successors, (77), 72 states have internal predecessors, (77), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:22:33,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2025-03-04 10:22:33,329 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 35 [2025-03-04 10:22:33,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:22:33,330 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2025-03-04 10:22:33,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 36 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:22:33,330 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2025-03-04 10:22:33,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-04 10:22:33,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:22:33,331 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:22:33,339 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 10:22:33,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:22:33,532 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:22:33,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:22:33,532 INFO L85 PathProgramCache]: Analyzing trace with hash 303535446, now seen corresponding path program 1 times [2025-03-04 10:22:33,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:22:33,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432407602] [2025-03-04 10:22:33,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:22:33,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:22:33,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 10:22:33,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 10:22:33,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:22:33,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:22:33,611 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2025-03-04 10:22:33,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:22:33,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432407602] [2025-03-04 10:22:33,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432407602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:22:33,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:22:33,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:22:33,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612544832] [2025-03-04 10:22:33,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:22:33,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:22:33,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:22:33,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:22:33,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:22:33,612 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:22:33,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:22:33,624 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2025-03-04 10:22:33,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:22:33,624 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-03-04 10:22:33,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:22:33,625 INFO L225 Difference]: With dead ends: 76 [2025-03-04 10:22:33,625 INFO L226 Difference]: Without dead ends: 74 [2025-03-04 10:22:33,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:22:33,625 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 1 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:22:33,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 78 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:22:33,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-04 10:22:33,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2025-03-04 10:22:33,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 66 states have internal predecessors, (70), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:22:33,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2025-03-04 10:22:33,629 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 60 [2025-03-04 10:22:33,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:22:33,629 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2025-03-04 10:22:33,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:22:33,630 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2025-03-04 10:22:33,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-04 10:22:33,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:22:33,630 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:22:33,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 10:22:33,631 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:22:33,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:22:33,631 INFO L85 PathProgramCache]: Analyzing trace with hash 376584954, now seen corresponding path program 1 times [2025-03-04 10:22:33,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:22:33,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233170160] [2025-03-04 10:22:33,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:22:33,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:22:33,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 10:22:33,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 10:22:33,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:22:33,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:22:33,751 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2025-03-04 10:22:33,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:22:33,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233170160] [2025-03-04 10:22:33,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233170160] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:22:33,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581405533] [2025-03-04 10:22:33,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:22:33,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:22:33,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:22:33,754 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 10:22:33,755 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 10:22:33,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 10:22:33,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 10:22:33,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:22:33,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:22:33,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 10:22:33,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:22:33,854 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2025-03-04 10:22:33,854 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:22:33,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581405533] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:22:33,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:22:33,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-04 10:22:33,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055825403] [2025-03-04 10:22:33,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:22:33,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:22:33,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:22:33,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:22:33,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:22:33,856 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:22:33,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:22:33,869 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2025-03-04 10:22:33,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:22:33,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 72 [2025-03-04 10:22:33,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:22:33,871 INFO L225 Difference]: With dead ends: 74 [2025-03-04 10:22:33,871 INFO L226 Difference]: Without dead ends: 73 [2025-03-04 10:22:33,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:22:33,871 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 1 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:22:33,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 48 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:22:33,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-04 10:22:33,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2025-03-04 10:22:33,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 65 states have (on average 1.1076923076923078) internal successors, (72), 68 states have internal predecessors, (72), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:22:33,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2025-03-04 10:22:33,878 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 72 [2025-03-04 10:22:33,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:22:33,880 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2025-03-04 10:22:33,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:22:33,880 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2025-03-04 10:22:33,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-04 10:22:33,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:22:33,882 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:22:33,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 10:22:34,083 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,SelfDestructingSolverStorable9 [2025-03-04 10:22:34,083 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:22:34,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:22:34,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1210768317, now seen corresponding path program 1 times [2025-03-04 10:22:34,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:22:34,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097445679] [2025-03-04 10:22:34,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:22:34,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:22:34,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-04 10:22:34,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 10:22:34,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:22:34,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:22:34,205 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2025-03-04 10:22:34,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:22:34,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097445679] [2025-03-04 10:22:34,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097445679] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:22:34,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479898147] [2025-03-04 10:22:34,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:22:34,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:22:34,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:22:34,207 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 10:22:34,209 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 10:22:34,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-04 10:22:34,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 10:22:34,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:22:34,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:22:34,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 10:22:34,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:22:34,302 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2025-03-04 10:22:34,302 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:22:34,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479898147] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:22:34,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:22:34,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-04 10:22:34,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856550772] [2025-03-04 10:22:34,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:22:34,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:22:34,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:22:34,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:22:34,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:22:34,303 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:22:34,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:22:34,311 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2025-03-04 10:22:34,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:22:34,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 73 [2025-03-04 10:22:34,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:22:34,312 INFO L225 Difference]: With dead ends: 74 [2025-03-04 10:22:34,312 INFO L226 Difference]: Without dead ends: 73 [2025-03-04 10:22:34,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:22:34,313 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:22:34,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:22:34,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-04 10:22:34,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-03-04 10:22:34,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 66 states have (on average 1.106060606060606) internal successors, (73), 69 states have internal predecessors, (73), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:22:34,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2025-03-04 10:22:34,317 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 73 [2025-03-04 10:22:34,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:22:34,317 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2025-03-04 10:22:34,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:22:34,317 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2025-03-04 10:22:34,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-04 10:22:34,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:22:34,318 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:22:34,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 10:22:34,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:22:34,518 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:22:34,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:22:34,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1120887832, now seen corresponding path program 1 times [2025-03-04 10:22:34,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:22:34,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782653483] [2025-03-04 10:22:34,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:22:34,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:22:34,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-04 10:22:34,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 10:22:34,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:22:34,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:22:34,615 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2025-03-04 10:22:34,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:22:34,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782653483] [2025-03-04 10:22:34,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782653483] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:22:34,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37377576] [2025-03-04 10:22:34,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:22:34,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:22:34,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:22:34,617 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 10:22:34,619 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 10:22:34,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-04 10:22:34,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 10:22:34,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:22:34,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:22:34,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 10:22:34,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:22:35,101 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 10:22:35,102 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:22:35,961 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 10:22:35,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37377576] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:22:35,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:22:35,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 33, 33] total 67 [2025-03-04 10:22:35,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109607366] [2025-03-04 10:22:35,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:22:35,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2025-03-04 10:22:35,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:22:35,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2025-03-04 10:22:35,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1063, Invalid=3359, Unknown=0, NotChecked=0, Total=4422 [2025-03-04 10:22:35,966 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand has 67 states, 67 states have (on average 1.9253731343283582) internal successors, (129), 67 states have internal predecessors, (129), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 10:22:36,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:22:36,112 INFO L93 Difference]: Finished difference Result 153 states and 181 transitions. [2025-03-04 10:22:36,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2025-03-04 10:22:36,112 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 1.9253731343283582) internal successors, (129), 67 states have internal predecessors, (129), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 74 [2025-03-04 10:22:36,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:22:36,113 INFO L225 Difference]: With dead ends: 153 [2025-03-04 10:22:36,113 INFO L226 Difference]: Without dead ends: 128 [2025-03-04 10:22:36,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1171 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1063, Invalid=3359, Unknown=0, NotChecked=0, Total=4422 [2025-03-04 10:22:36,115 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 5 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:22:36,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 188 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:22:36,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-04 10:22:36,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2025-03-04 10:22:36,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 119 states have (on average 1.0672268907563025) internal successors, (127), 122 states have internal predecessors, (127), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:22:36,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 131 transitions. [2025-03-04 10:22:36,126 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 131 transitions. Word has length 74 [2025-03-04 10:22:36,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:22:36,127 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 131 transitions. [2025-03-04 10:22:36,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 1.9253731343283582) internal successors, (129), 67 states have internal predecessors, (129), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 10:22:36,127 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 131 transitions. [2025-03-04 10:22:36,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-04 10:22:36,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:22:36,128 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:22:36,140 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 10:22:36,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:22:36,329 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:22:36,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:22:36,329 INFO L85 PathProgramCache]: Analyzing trace with hash 378662560, now seen corresponding path program 2 times [2025-03-04 10:22:36,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:22:36,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576866301] [2025-03-04 10:22:36,329 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:22:36,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:22:36,350 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 132 statements into 2 equivalence classes. [2025-03-04 10:22:36,352 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 132 statements. [2025-03-04 10:22:36,352 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:22:36,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:22:36,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1468 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1468 trivial. 0 not checked. [2025-03-04 10:22:36,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:22:36,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576866301] [2025-03-04 10:22:36,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576866301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:22:36,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:22:36,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:22:36,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231369557] [2025-03-04 10:22:36,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:22:36,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:22:36,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:22:36,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:22:36,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:22:36,372 INFO L87 Difference]: Start difference. First operand 126 states and 131 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:22:36,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:22:36,388 INFO L93 Difference]: Finished difference Result 126 states and 131 transitions. [2025-03-04 10:22:36,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:22:36,388 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 132 [2025-03-04 10:22:36,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:22:36,389 INFO L225 Difference]: With dead ends: 126 [2025-03-04 10:22:36,389 INFO L226 Difference]: Without dead ends: 124 [2025-03-04 10:22:36,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:22:36,390 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 2 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:22:36,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 60 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:22:36,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-03-04 10:22:36,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2025-03-04 10:22:36,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 119 states have (on average 1.050420168067227) internal successors, (125), 120 states have internal predecessors, (125), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:22:36,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 129 transitions. [2025-03-04 10:22:36,395 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 129 transitions. Word has length 132 [2025-03-04 10:22:36,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:22:36,396 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 129 transitions. [2025-03-04 10:22:36,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:22:36,396 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 129 transitions. [2025-03-04 10:22:36,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-04 10:22:36,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:22:36,401 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:22:36,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 10:22:36,401 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:22:36,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:22:36,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1146362535, now seen corresponding path program 1 times [2025-03-04 10:22:36,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:22:36,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967430160] [2025-03-04 10:22:36,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:22:36,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:22:36,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-04 10:22:36,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 10:22:36,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:22:36,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:22:36,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1468 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1468 trivial. 0 not checked. [2025-03-04 10:22:36,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:22:36,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967430160] [2025-03-04 10:22:36,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967430160] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:22:36,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:22:36,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:22:36,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242449496] [2025-03-04 10:22:36,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:22:36,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:22:36,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:22:36,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:22:36,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:22:36,556 INFO L87 Difference]: Start difference. First operand 124 states and 129 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:22:36,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:22:36,573 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2025-03-04 10:22:36,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:22:36,574 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 133 [2025-03-04 10:22:36,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:22:36,575 INFO L225 Difference]: With dead ends: 127 [2025-03-04 10:22:36,575 INFO L226 Difference]: Without dead ends: 126 [2025-03-04 10:22:36,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:22:36,575 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:22:36,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:22:36,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-04 10:22:36,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2025-03-04 10:22:36,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 121 states have (on average 1.0495867768595042) internal successors, (127), 122 states have internal predecessors, (127), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:22:36,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 131 transitions. [2025-03-04 10:22:36,585 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 131 transitions. Word has length 133 [2025-03-04 10:22:36,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:22:36,586 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 131 transitions. [2025-03-04 10:22:36,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:22:36,586 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 131 transitions. [2025-03-04 10:22:36,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-04 10:22:36,588 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:22:36,588 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:22:36,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 10:22:36,588 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:22:36,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:22:36,589 INFO L85 PathProgramCache]: Analyzing trace with hash -2001308762, now seen corresponding path program 1 times [2025-03-04 10:22:36,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:22:36,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997727787] [2025-03-04 10:22:36,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:22:36,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:22:36,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 10:22:36,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 10:22:36,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:22:36,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:22:36,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1469 trivial. 0 not checked. [2025-03-04 10:22:36,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:22:36,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997727787] [2025-03-04 10:22:36,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997727787] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:22:36,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:22:36,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:22:36,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939957341] [2025-03-04 10:22:36,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:22:36,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:22:36,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:22:36,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:22:36,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:22:36,714 INFO L87 Difference]: Start difference. First operand 126 states and 131 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:22:36,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:22:36,722 INFO L93 Difference]: Finished difference Result 126 states and 131 transitions. [2025-03-04 10:22:36,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:22:36,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 136 [2025-03-04 10:22:36,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:22:36,723 INFO L225 Difference]: With dead ends: 126 [2025-03-04 10:22:36,723 INFO L226 Difference]: Without dead ends: 125 [2025-03-04 10:22:36,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:22:36,725 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:22:36,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:22:36,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-04 10:22:36,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2025-03-04 10:22:36,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 121 states have (on average 1.0413223140495869) internal successors, (126), 121 states have internal predecessors, (126), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:22:36,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 130 transitions. [2025-03-04 10:22:36,732 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 130 transitions. Word has length 136 [2025-03-04 10:22:36,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:22:36,733 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 130 transitions. [2025-03-04 10:22:36,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:22:36,733 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 130 transitions. [2025-03-04 10:22:36,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-04 10:22:36,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:22:36,734 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:22:36,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 10:22:36,734 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:22:36,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:22:36,734 INFO L85 PathProgramCache]: Analyzing trace with hash 887628164, now seen corresponding path program 1 times [2025-03-04 10:22:36,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:22:36,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278518194] [2025-03-04 10:22:36,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:22:36,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:22:36,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-04 10:22:36,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-04 10:22:36,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:22:36,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:22:36,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1473 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1469 trivial. 0 not checked. [2025-03-04 10:22:36,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:22:36,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278518194] [2025-03-04 10:22:36,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278518194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:22:36,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:22:36,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:22:36,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112337391] [2025-03-04 10:22:36,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:22:36,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:22:36,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:22:36,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:22:36,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:22:36,840 INFO L87 Difference]: Start difference. First operand 125 states and 130 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:22:36,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:22:36,852 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2025-03-04 10:22:36,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:22:36,853 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 138 [2025-03-04 10:22:36,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:22:36,853 INFO L225 Difference]: With dead ends: 125 [2025-03-04 10:22:36,853 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 10:22:36,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:22:36,856 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:22:36,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:22:36,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 10:22:36,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 10:22:36,858 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 10:22:36,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 10:22:36,858 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 138 [2025-03-04 10:22:36,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:22:36,858 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 10:22:36,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:22:36,858 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 10:22:36,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 10:22:36,860 INFO L782 garLoopResultBuilder]: Registering result SAFE for location maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-03-04 10:22:36,861 INFO L782 garLoopResultBuilder]: Registering result SAFE for location maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-03-04 10:22:36,861 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-03-04 10:22:36,861 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-03-04 10:22:36,861 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-03-04 10:22:36,861 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-03-04 10:22:36,861 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-03-04 10:22:36,862 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-03-04 10:22:36,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 10:22:36,866 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:22:36,868 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 10:22:36,912 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 10:22:36,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 10:22:36 BoogieIcfgContainer [2025-03-04 10:22:36,922 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 10:22:36,923 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 10:22:36,923 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 10:22:36,923 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 10:22:36,924 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:22:30" (3/4) ... [2025-03-04 10:22:36,925 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 10:22:36,929 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure max [2025-03-04 10:22:36,933 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-04 10:22:36,934 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 10:22:36,934 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 10:22:36,934 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 10:22:37,000 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 10:22:37,001 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 10:22:37,001 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 10:22:37,001 INFO L158 Benchmark]: Toolchain (without parser) took 7075.52ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 110.6MB in the beginning and 175.3MB in the end (delta: -64.8MB). Peak memory consumption was 79.3MB. Max. memory is 16.1GB. [2025-03-04 10:22:37,001 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 201.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:22:37,001 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.98ms. Allocated memory is still 142.6MB. Free memory was 110.6MB in the beginning and 98.9MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:22:37,002 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.96ms. Allocated memory is still 142.6MB. Free memory was 98.9MB in the beginning and 98.2MB in the end (delta: 631.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:22:37,002 INFO L158 Benchmark]: Boogie Preprocessor took 43.15ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 96.2MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:22:37,002 INFO L158 Benchmark]: IcfgBuilder took 292.94ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 83.1MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:22:37,002 INFO L158 Benchmark]: TraceAbstraction took 6400.58ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 82.2MB in the beginning and 180.8MB in the end (delta: -98.6MB). Peak memory consumption was 45.8MB. Max. memory is 16.1GB. [2025-03-04 10:22:37,002 INFO L158 Benchmark]: Witness Printer took 78.06ms. Allocated memory is still 285.2MB. Free memory was 180.8MB in the beginning and 175.3MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:22:37,003 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.39ms. Allocated memory is still 201.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 217.98ms. Allocated memory is still 142.6MB. Free memory was 110.6MB in the beginning and 98.9MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.96ms. Allocated memory is still 142.6MB. Free memory was 98.9MB in the beginning and 98.2MB in the end (delta: 631.9kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.15ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 96.2MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 292.94ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 83.1MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 6400.58ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 82.2MB in the beginning and 180.8MB in the end (delta: -98.6MB). Peak memory consumption was 45.8MB. Max. memory is 16.1GB. * Witness Printer took 78.06ms. Allocated memory is still 285.2MB. Free memory was 180.8MB in the beginning and 175.3MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 39 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 6.3s, OverallIterations: 16, TraceHistogramMax: 31, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 17 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 17 mSDsluCounter, 1598 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1162 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 592 IncrementalHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 436 mSDtfsCounter, 592 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 493 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1507 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126occurred in iteration=12, InterpolantAutomatonStates: 169, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 10 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1240 NumberOfCodeBlocks, 1112 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1357 ConstructedInterpolants, 0 QuantifiedInterpolants, 1861 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1378 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 27 InterpolantComputations, 12 PerfectInterpolantSequences, 8042/8920 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 34]: Location Invariant Derived location invariant: ((i == 0) || (0 < i)) - InvariantResult [Line: 43]: Location Invariant Derived location invariant: (0 < (2147483650 + i)) - InvariantResult [Line: 20]: Location Invariant Derived location invariant: ((0 < i) || (i == 0)) RESULT: Ultimate proved your program to be correct! [2025-03-04 10:22:37,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE