./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-tiling/pnr5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-tiling/pnr5.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c6dc18f387244e600c9c46c5a67fb3c0c9875a9a14eb13d3a621343f4a214b0b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:23:06,207 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:23:06,260 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 10:23:06,265 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:23:06,265 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:23:06,278 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:23:06,279 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:23:06,279 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:23:06,280 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:23:06,280 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:23:06,280 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:23:06,280 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:23:06,280 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:23:06,280 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:23:06,280 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:23:06,281 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:23:06,281 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:23:06,282 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:23:06,282 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:23:06,282 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:23:06,282 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:23:06,282 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:23:06,282 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:23:06,282 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:23:06,282 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:23:06,282 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:23:06,282 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:23:06,282 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:23:06,282 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:23:06,282 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:23:06,283 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:23:06,283 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:23:06,283 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:23:06,283 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:23:06,283 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:23:06,283 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:23:06,283 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:23:06,283 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:23:06,283 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:23:06,283 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:23:06,283 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:23:06,283 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:23:06,284 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:23:06,284 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:23:06,284 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:23:06,284 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 -> c6dc18f387244e600c9c46c5a67fb3c0c9875a9a14eb13d3a621343f4a214b0b [2025-03-04 10:23:06,521 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:23:06,529 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:23:06,531 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:23:06,532 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:23:06,532 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:23:06,534 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/pnr5.c [2025-03-04 10:23:07,679 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8a4379dc/b674ab9fe6084406bddce15ebae02474/FLAG3f4bd5cf4 [2025-03-04 10:23:07,916 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:23:07,916 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/pnr5.c [2025-03-04 10:23:07,923 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8a4379dc/b674ab9fe6084406bddce15ebae02474/FLAG3f4bd5cf4 [2025-03-04 10:23:08,244 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8a4379dc/b674ab9fe6084406bddce15ebae02474 [2025-03-04 10:23:08,246 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:23:08,247 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:23:08,248 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:23:08,248 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:23:08,251 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:23:08,251 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:23:08" (1/1) ... [2025-03-04 10:23:08,252 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43e77709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:23:08, skipping insertion in model container [2025-03-04 10:23:08,252 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:23:08" (1/1) ... [2025-03-04 10:23:08,262 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:23:08,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:23:08,372 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:23:08,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:23:08,397 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:23:08,398 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:23:08 WrapperNode [2025-03-04 10:23:08,398 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:23:08,398 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:23:08,398 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:23:08,398 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:23:08,402 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:23:08" (1/1) ... [2025-03-04 10:23:08,408 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:23:08" (1/1) ... [2025-03-04 10:23:08,429 INFO L138 Inliner]: procedures = 17, calls = 34, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2025-03-04 10:23:08,430 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:23:08,430 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:23:08,430 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:23:08,430 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:23:08,440 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:23:08" (1/1) ... [2025-03-04 10:23:08,440 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:23:08" (1/1) ... [2025-03-04 10:23:08,442 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:23:08" (1/1) ... [2025-03-04 10:23:08,457 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 7, 11]. 55 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0]. The 10 writes are split as follows [0, 0, 10]. [2025-03-04 10:23:08,457 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:23:08" (1/1) ... [2025-03-04 10:23:08,457 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:23:08" (1/1) ... [2025-03-04 10:23:08,464 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:23:08" (1/1) ... [2025-03-04 10:23:08,465 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:23:08" (1/1) ... [2025-03-04 10:23:08,465 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:23:08" (1/1) ... [2025-03-04 10:23:08,466 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:23:08" (1/1) ... [2025-03-04 10:23:08,467 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:23:08,471 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:23:08,471 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:23:08,471 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:23:08,472 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:23:08" (1/1) ... [2025-03-04 10:23:08,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:23:08,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:23:08,498 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:23:08,501 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:23:08,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:23:08,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:23:08,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:23:08,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 10:23:08,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:23:08,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:23:08,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 10:23:08,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 10:23:08,517 INFO L130 BoogieDeclarations]: Found specification of procedure ReadFromPort [2025-03-04 10:23:08,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ReadFromPort [2025-03-04 10:23:08,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:23:08,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:23:08,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:23:08,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:23:08,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 10:23:08,569 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:23:08,571 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:23:08,841 INFO L? ?]: Removed 66 outVars from TransFormulas that were not future-live. [2025-03-04 10:23:08,841 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:23:08,853 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:23:08,853 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:23:08,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:23:08 BoogieIcfgContainer [2025-03-04 10:23:08,853 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:23:08,856 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:23:08,856 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:23:08,859 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:23:08,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:23:08" (1/3) ... [2025-03-04 10:23:08,860 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@196e3883 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:23:08, skipping insertion in model container [2025-03-04 10:23:08,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:23:08" (2/3) ... [2025-03-04 10:23:08,861 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@196e3883 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:23:08, skipping insertion in model container [2025-03-04 10:23:08,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:23:08" (3/3) ... [2025-03-04 10:23:08,862 INFO L128 eAbstractionObserver]: Analyzing ICFG pnr5.c [2025-03-04 10:23:08,873 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:23:08,875 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pnr5.c that has 2 procedures, 128 locations, 1 initial locations, 2 loop locations, and 46 error locations. [2025-03-04 10:23:08,911 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:23:08,922 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;@32eda68e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:23:08,922 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2025-03-04 10:23:08,925 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 75 states have (on average 1.7733333333333334) internal successors, (133), 121 states have internal predecessors, (133), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 10:23:08,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 10:23:08,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:23:08,929 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:23:08,929 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 10:23:08,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:23:08,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1254461793, now seen corresponding path program 1 times [2025-03-04 10:23:08,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:23:08,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315384813] [2025-03-04 10:23:08,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:23:08,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:23:08,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:23:08,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:23:08,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:23:08,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:23:09,044 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:23:09,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:23:09,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315384813] [2025-03-04 10:23:09,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315384813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:23:09,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:23:09,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:23:09,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94968522] [2025-03-04 10:23:09,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:23:09,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 10:23:09,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:23:09,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 10:23:09,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 10:23:09,066 INFO L87 Difference]: Start difference. First operand has 128 states, 75 states have (on average 1.7733333333333334) internal successors, (133), 121 states have internal predecessors, (133), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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:23:09,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:23:09,086 INFO L93 Difference]: Finished difference Result 250 states and 277 transitions. [2025-03-04 10:23:09,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 10:23:09,088 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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:23:09,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:23:09,092 INFO L225 Difference]: With dead ends: 250 [2025-03-04 10:23:09,092 INFO L226 Difference]: Without dead ends: 122 [2025-03-04 10:23:09,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 10:23:09,095 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:23:09,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:23:09,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-04 10:23:09,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-03-04 10:23:09,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 70 states have (on average 1.7428571428571429) internal successors, (122), 115 states have internal predecessors, (122), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 10:23:09,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 132 transitions. [2025-03-04 10:23:09,123 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 132 transitions. Word has length 7 [2025-03-04 10:23:09,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:23:09,123 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 132 transitions. [2025-03-04 10:23:09,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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:23:09,124 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 132 transitions. [2025-03-04 10:23:09,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 10:23:09,124 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:23:09,124 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:23:09,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:23:09,124 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 10:23:09,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:23:09,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1254462754, now seen corresponding path program 1 times [2025-03-04 10:23:09,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:23:09,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243966293] [2025-03-04 10:23:09,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:23:09,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:23:09,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:23:09,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:23:09,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:23:09,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:23:09,297 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:23:09,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:23:09,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243966293] [2025-03-04 10:23:09,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243966293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:23:09,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:23:09,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:23:09,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094799670] [2025-03-04 10:23:09,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:23:09,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:23:09,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:23:09,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:23:09,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:23:09,299 INFO L87 Difference]: Start difference. First operand 122 states and 132 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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:23:09,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:23:09,357 INFO L93 Difference]: Finished difference Result 122 states and 132 transitions. [2025-03-04 10:23:09,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:23:09,357 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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:23:09,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:23:09,358 INFO L225 Difference]: With dead ends: 122 [2025-03-04 10:23:09,358 INFO L226 Difference]: Without dead ends: 121 [2025-03-04 10:23:09,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:23:09,359 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 240 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:23:09,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 124 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:23:09,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-04 10:23:09,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2025-03-04 10:23:09,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 70 states have (on average 1.7285714285714286) internal successors, (121), 114 states have internal predecessors, (121), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 10:23:09,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 131 transitions. [2025-03-04 10:23:09,366 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 131 transitions. Word has length 7 [2025-03-04 10:23:09,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:23:09,366 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 131 transitions. [2025-03-04 10:23:09,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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:23:09,366 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 131 transitions. [2025-03-04 10:23:09,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 10:23:09,366 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:23:09,366 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:23:09,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:23:09,367 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 10:23:09,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:23:09,367 INFO L85 PathProgramCache]: Analyzing trace with hash 233639804, now seen corresponding path program 1 times [2025-03-04 10:23:09,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:23:09,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452854362] [2025-03-04 10:23:09,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:23:09,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:23:09,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:23:09,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:23:09,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:23:09,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:23:09,546 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:23:09,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:23:09,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452854362] [2025-03-04 10:23:09,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452854362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:23:09,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:23:09,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:23:09,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007300296] [2025-03-04 10:23:09,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:23:09,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:23:09,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:23:09,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:23:09,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:23:09,550 INFO L87 Difference]: Start difference. First operand 121 states and 131 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 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:23:09,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:23:09,638 INFO L93 Difference]: Finished difference Result 121 states and 131 transitions. [2025-03-04 10:23:09,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:23:09,639 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 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:23:09,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:23:09,639 INFO L225 Difference]: With dead ends: 121 [2025-03-04 10:23:09,640 INFO L226 Difference]: Without dead ends: 120 [2025-03-04 10:23:09,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:23:09,640 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 349 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:23:09,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 123 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:23:09,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-04 10:23:09,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-03-04 10:23:09,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 70 states have (on average 1.7142857142857142) internal successors, (120), 113 states have internal predecessors, (120), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 10:23:09,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 130 transitions. [2025-03-04 10:23:09,650 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 130 transitions. Word has length 8 [2025-03-04 10:23:09,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:23:09,650 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 130 transitions. [2025-03-04 10:23:09,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 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:23:09,650 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 130 transitions. [2025-03-04 10:23:09,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 10:23:09,650 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:23:09,650 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:23:09,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:23:09,650 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 10:23:09,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:23:09,654 INFO L85 PathProgramCache]: Analyzing trace with hash -485434610, now seen corresponding path program 1 times [2025-03-04 10:23:09,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:23:09,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945238499] [2025-03-04 10:23:09,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:23:09,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:23:09,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:23:09,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:23:09,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:23:09,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:23:09,706 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:23:09,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:23:09,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945238499] [2025-03-04 10:23:09,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945238499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:23:09,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:23:09,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:23:09,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574828463] [2025-03-04 10:23:09,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:23:09,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:23:09,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:23:09,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:23:09,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:23:09,707 INFO L87 Difference]: Start difference. First operand 120 states and 130 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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:23:09,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:23:09,822 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2025-03-04 10:23:09,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:23:09,823 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2025-03-04 10:23:09,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:23:09,824 INFO L225 Difference]: With dead ends: 127 [2025-03-04 10:23:09,825 INFO L226 Difference]: Without dead ends: 125 [2025-03-04 10:23:09,826 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:23:09,826 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 1 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:23:09,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 287 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:23:09,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-04 10:23:09,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2025-03-04 10:23:09,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 75 states have (on average 1.6666666666666667) internal successors, (125), 118 states have internal predecessors, (125), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 10:23:09,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 135 transitions. [2025-03-04 10:23:09,837 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 135 transitions. Word has length 14 [2025-03-04 10:23:09,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:23:09,837 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 135 transitions. [2025-03-04 10:23:09,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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:23:09,837 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 135 transitions. [2025-03-04 10:23:09,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 10:23:09,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:23:09,838 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:23:09,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:23:09,839 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 10:23:09,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:23:09,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1864758384, now seen corresponding path program 1 times [2025-03-04 10:23:09,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:23:09,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668711913] [2025-03-04 10:23:09,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:23:09,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:23:09,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:23:09,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:23:09,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:23:09,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:23:09,881 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:23:09,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:23:09,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668711913] [2025-03-04 10:23:09,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668711913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:23:09,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:23:09,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:23:09,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975700598] [2025-03-04 10:23:09,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:23:09,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:23:09,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:23:09,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:23:09,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:23:09,884 INFO L87 Difference]: Start difference. First operand 125 states and 135 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:23:10,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:23:10,033 INFO L93 Difference]: Finished difference Result 224 states and 245 transitions. [2025-03-04 10:23:10,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:23:10,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-03-04 10:23:10,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:23:10,034 INFO L225 Difference]: With dead ends: 224 [2025-03-04 10:23:10,034 INFO L226 Difference]: Without dead ends: 184 [2025-03-04 10:23:10,035 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:23:10,035 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 53 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:23:10,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 126 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:23:10,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-03-04 10:23:10,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2025-03-04 10:23:10,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 128 states have (on average 1.4375) internal successors, (184), 171 states have internal predecessors, (184), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 10:23:10,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 204 transitions. [2025-03-04 10:23:10,054 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 204 transitions. Word has length 16 [2025-03-04 10:23:10,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:23:10,055 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 204 transitions. [2025-03-04 10:23:10,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:23:10,055 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 204 transitions. [2025-03-04 10:23:10,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 10:23:10,055 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:23:10,055 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:23:10,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:23:10,055 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 10:23:10,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:23:10,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1389009271, now seen corresponding path program 1 times [2025-03-04 10:23:10,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:23:10,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034884946] [2025-03-04 10:23:10,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:23:10,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:23:10,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:23:10,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:23:10,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:23:10,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:23:10,207 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:23:10,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:23:10,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034884946] [2025-03-04 10:23:10,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034884946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:23:10,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:23:10,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:23:10,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717878297] [2025-03-04 10:23:10,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:23:10,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:23:10,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:23:10,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:23:10,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:23:10,211 INFO L87 Difference]: Start difference. First operand 183 states and 204 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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:23:10,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:23:10,391 INFO L93 Difference]: Finished difference Result 197 states and 218 transitions. [2025-03-04 10:23:10,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:23:10,391 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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 19 [2025-03-04 10:23:10,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:23:10,393 INFO L225 Difference]: With dead ends: 197 [2025-03-04 10:23:10,393 INFO L226 Difference]: Without dead ends: 184 [2025-03-04 10:23:10,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:23:10,394 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 296 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:23:10,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 103 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:23:10,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-03-04 10:23:10,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2025-03-04 10:23:10,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 128 states have (on average 1.4296875) internal successors, (183), 171 states have internal predecessors, (183), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 10:23:10,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 203 transitions. [2025-03-04 10:23:10,408 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 203 transitions. Word has length 19 [2025-03-04 10:23:10,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:23:10,408 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 203 transitions. [2025-03-04 10:23:10,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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:23:10,408 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 203 transitions. [2025-03-04 10:23:10,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-04 10:23:10,409 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:23:10,409 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:23:10,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:23:10,409 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 10:23:10,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:23:10,410 INFO L85 PathProgramCache]: Analyzing trace with hash 561785408, now seen corresponding path program 1 times [2025-03-04 10:23:10,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:23:10,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318346227] [2025-03-04 10:23:10,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:23:10,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:23:10,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-04 10:23:10,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 10:23:10,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:23:10,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:23:10,485 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 10:23:10,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:23:10,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318346227] [2025-03-04 10:23:10,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318346227] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:23:10,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:23:10,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:23:10,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901139067] [2025-03-04 10:23:10,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:23:10,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:23:10,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:23:10,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:23:10,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:23:10,486 INFO L87 Difference]: Start difference. First operand 183 states and 203 transitions. Second operand has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:23:10,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:23:10,640 INFO L93 Difference]: Finished difference Result 188 states and 208 transitions. [2025-03-04 10:23:10,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:23:10,641 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 61 [2025-03-04 10:23:10,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:23:10,642 INFO L225 Difference]: With dead ends: 188 [2025-03-04 10:23:10,642 INFO L226 Difference]: Without dead ends: 186 [2025-03-04 10:23:10,642 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:23:10,642 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 26 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:23:10,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 207 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:23:10,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-03-04 10:23:10,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2025-03-04 10:23:10,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 131 states have (on average 1.4198473282442747) internal successors, (186), 174 states have internal predecessors, (186), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 10:23:10,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 206 transitions. [2025-03-04 10:23:10,649 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 206 transitions. Word has length 61 [2025-03-04 10:23:10,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:23:10,649 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 206 transitions. [2025-03-04 10:23:10,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:23:10,649 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 206 transitions. [2025-03-04 10:23:10,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-04 10:23:10,650 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:23:10,650 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:23:10,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:23:10,650 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 10:23:10,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:23:10,651 INFO L85 PathProgramCache]: Analyzing trace with hash -740081659, now seen corresponding path program 1 times [2025-03-04 10:23:10,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:23:10,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716467836] [2025-03-04 10:23:10,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:23:10,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:23:10,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 10:23:10,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 10:23:10,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:23:10,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:23:10,766 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-04 10:23:10,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:23:10,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716467836] [2025-03-04 10:23:10,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716467836] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:23:10,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612991950] [2025-03-04 10:23:10,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:23:10,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:23:10,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:23:10,770 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:23:10,771 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:23:10,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 10:23:10,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 10:23:10,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:23:10,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:23:10,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:23:10,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:23:10,937 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-04 10:23:10,937 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:23:10,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612991950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:23:10,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:23:10,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 10:23:10,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073317645] [2025-03-04 10:23:10,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:23:10,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:23:10,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:23:10,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:23:10,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:23:10,938 INFO L87 Difference]: Start difference. First operand 186 states and 206 transitions. Second operand has 5 states, 4 states have (on average 12.5) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 10:23:11,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:23:11,136 INFO L93 Difference]: Finished difference Result 186 states and 206 transitions. [2025-03-04 10:23:11,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:23:11,136 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.5) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 72 [2025-03-04 10:23:11,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:23:11,140 INFO L225 Difference]: With dead ends: 186 [2025-03-04 10:23:11,141 INFO L226 Difference]: Without dead ends: 165 [2025-03-04 10:23:11,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:23:11,141 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 78 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:23:11,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 194 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:23:11,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-03-04 10:23:11,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2025-03-04 10:23:11,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 131 states have (on average 1.2595419847328244) internal successors, (165), 153 states have internal predecessors, (165), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 10:23:11,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 185 transitions. [2025-03-04 10:23:11,149 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 185 transitions. Word has length 72 [2025-03-04 10:23:11,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:23:11,149 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 185 transitions. [2025-03-04 10:23:11,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.5) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 10:23:11,150 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 185 transitions. [2025-03-04 10:23:11,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-04 10:23:11,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:23:11,154 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:23:11,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 10:23:11,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:23:11,355 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 10:23:11,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:23:11,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1467694873, now seen corresponding path program 1 times [2025-03-04 10:23:11,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:23:11,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075167515] [2025-03-04 10:23:11,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:23:11,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:23:11,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-04 10:23:11,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 10:23:11,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:23:11,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:23:11,452 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-04 10:23:11,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:23:11,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075167515] [2025-03-04 10:23:11,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075167515] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:23:11,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069127021] [2025-03-04 10:23:11,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:23:11,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:23:11,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:23:11,455 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:23:11,456 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:23:11,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-04 10:23:11,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 10:23:11,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:23:11,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:23:11,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:23:11,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:23:11,571 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-04 10:23:11,572 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:23:11,672 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-04 10:23:11,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069127021] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:23:11,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:23:11,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-04 10:23:11,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291886563] [2025-03-04 10:23:11,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:23:11,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:23:11,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:23:11,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:23:11,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:23:11,674 INFO L87 Difference]: Start difference. First operand 165 states and 185 transitions. Second operand has 10 states, 9 states have (on average 14.666666666666666) internal successors, (132), 10 states have internal predecessors, (132), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2025-03-04 10:23:11,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:23:11,893 INFO L93 Difference]: Finished difference Result 239 states and 293 transitions. [2025-03-04 10:23:11,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:23:11,893 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 14.666666666666666) internal successors, (132), 10 states have internal predecessors, (132), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 73 [2025-03-04 10:23:11,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:23:11,894 INFO L225 Difference]: With dead ends: 239 [2025-03-04 10:23:11,896 INFO L226 Difference]: Without dead ends: 218 [2025-03-04 10:23:11,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 140 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:23:11,897 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 160 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:23:11,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 190 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:23:11,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-03-04 10:23:11,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2025-03-04 10:23:11,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 196 states have (on average 1.1224489795918366) internal successors, (220), 200 states have internal predecessors, (220), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 10:23:11,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 252 transitions. [2025-03-04 10:23:11,909 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 252 transitions. Word has length 73 [2025-03-04 10:23:11,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:23:11,910 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 252 transitions. [2025-03-04 10:23:11,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 14.666666666666666) internal successors, (132), 10 states have internal predecessors, (132), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2025-03-04 10:23:11,910 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 252 transitions. [2025-03-04 10:23:11,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-04 10:23:11,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:23:11,911 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:23:11,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 10:23:12,111 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,SelfDestructingSolverStorable8 [2025-03-04 10:23:12,111 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 10:23:12,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:23:12,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1593447650, now seen corresponding path program 1 times [2025-03-04 10:23:12,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:23:12,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60176240] [2025-03-04 10:23:12,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:23:12,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:23:12,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-04 10:23:12,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-04 10:23:12,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:23:12,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:23:12,198 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 10:23:12,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:23:12,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60176240] [2025-03-04 10:23:12,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60176240] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:23:12,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665293306] [2025-03-04 10:23:12,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:23:12,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:23:12,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:23:12,201 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:23:12,203 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:23:12,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-04 10:23:12,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-04 10:23:12,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:23:12,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:23:12,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:23:12,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:23:12,292 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 10:23:12,292 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:23:12,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665293306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:23:12,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:23:12,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 10:23:12,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089218529] [2025-03-04 10:23:12,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:23:12,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:23:12,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:23:12,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:23:12,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:23:12,294 INFO L87 Difference]: Start difference. First operand 218 states and 252 transitions. Second operand has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:23:12,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:23:12,401 INFO L93 Difference]: Finished difference Result 218 states and 252 transitions. [2025-03-04 10:23:12,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:23:12,401 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 75 [2025-03-04 10:23:12,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:23:12,402 INFO L225 Difference]: With dead ends: 218 [2025-03-04 10:23:12,402 INFO L226 Difference]: Without dead ends: 217 [2025-03-04 10:23:12,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 73 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:23:12,403 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 117 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:23:12,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 122 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:23:12,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-03-04 10:23:12,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2025-03-04 10:23:12,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 196 states have (on average 1.1173469387755102) internal successors, (219), 199 states have internal predecessors, (219), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 10:23:12,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 251 transitions. [2025-03-04 10:23:12,410 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 251 transitions. Word has length 75 [2025-03-04 10:23:12,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:23:12,410 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 251 transitions. [2025-03-04 10:23:12,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:23:12,411 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 251 transitions. [2025-03-04 10:23:12,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-04 10:23:12,411 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:23:12,411 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:23:12,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 10:23:12,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:23:12,612 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 10:23:12,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:23:12,613 INFO L85 PathProgramCache]: Analyzing trace with hash -2142730426, now seen corresponding path program 1 times [2025-03-04 10:23:12,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:23:12,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033846723] [2025-03-04 10:23:12,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:23:12,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:23:12,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-04 10:23:12,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-04 10:23:12,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:23:12,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:23:12,721 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 10:23:12,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:23:12,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033846723] [2025-03-04 10:23:12,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033846723] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:23:12,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129110902] [2025-03-04 10:23:12,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:23:12,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:23:12,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:23:12,723 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:23:12,725 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:23:12,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-04 10:23:12,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-04 10:23:12,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:23:12,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:23:12,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:23:12,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:23:12,821 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 10:23:12,821 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:23:12,866 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 10:23:12,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129110902] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:23:12,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:23:12,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 10:23:12,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135940098] [2025-03-04 10:23:12,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:23:12,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:23:12,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:23:12,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:23:12,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:23:12,867 INFO L87 Difference]: Start difference. First operand 217 states and 251 transitions. Second operand has 12 states, 11 states have (on average 6.636363636363637) internal successors, (73), 12 states have internal predecessors, (73), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:23:13,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:23:13,041 INFO L93 Difference]: Finished difference Result 233 states and 269 transitions. [2025-03-04 10:23:13,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:23:13,042 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.636363636363637) internal successors, (73), 12 states have internal predecessors, (73), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 76 [2025-03-04 10:23:13,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:23:13,043 INFO L225 Difference]: With dead ends: 233 [2025-03-04 10:23:13,044 INFO L226 Difference]: Without dead ends: 232 [2025-03-04 10:23:13,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:23:13,044 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 270 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:23:13,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 222 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:23:13,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-03-04 10:23:13,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2025-03-04 10:23:13,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 211 states have (on average 1.1090047393364928) internal successors, (234), 214 states have internal predecessors, (234), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 10:23:13,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 266 transitions. [2025-03-04 10:23:13,056 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 266 transitions. Word has length 76 [2025-03-04 10:23:13,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:23:13,057 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 266 transitions. [2025-03-04 10:23:13,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.636363636363637) internal successors, (73), 12 states have internal predecessors, (73), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:23:13,057 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 266 transitions. [2025-03-04 10:23:13,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-04 10:23:13,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:23:13,058 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:23:13,064 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:23:13,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:23:13,261 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 10:23:13,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:23:13,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1982695621, now seen corresponding path program 2 times [2025-03-04 10:23:13,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:23:13,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733698194] [2025-03-04 10:23:13,261 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:23:13,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:23:13,273 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 91 statements into 2 equivalence classes. [2025-03-04 10:23:13,276 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 91 statements. [2025-03-04 10:23:13,276 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:23:13,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:23:13,308 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-04 10:23:13,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:23:13,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733698194] [2025-03-04 10:23:13,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733698194] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:23:13,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982124169] [2025-03-04 10:23:13,309 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:23:13,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:23:13,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:23:13,311 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:23:13,311 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:23:13,354 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 91 statements into 2 equivalence classes. [2025-03-04 10:23:13,363 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 91 statements. [2025-03-04 10:23:13,363 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:23:13,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:23:13,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:23:13,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:23:13,473 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-04 10:23:13,473 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:23:13,574 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-04 10:23:13,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982124169] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:23:13,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:23:13,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2025-03-04 10:23:13,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288357642] [2025-03-04 10:23:13,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:23:13,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:23:13,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:23:13,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:23:13,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:23:13,575 INFO L87 Difference]: Start difference. First operand 232 states and 266 transitions. Second operand has 9 states, 8 states have (on average 14.0) internal successors, (112), 9 states have internal predecessors, (112), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 10:23:13,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:23:13,713 INFO L93 Difference]: Finished difference Result 232 states and 266 transitions. [2025-03-04 10:23:13,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:23:13,714 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 14.0) internal successors, (112), 9 states have internal predecessors, (112), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 91 [2025-03-04 10:23:13,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:23:13,715 INFO L225 Difference]: With dead ends: 232 [2025-03-04 10:23:13,715 INFO L226 Difference]: Without dead ends: 203 [2025-03-04 10:23:13,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 176 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:23:13,716 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 223 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:23:13,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 102 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:23:13,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-03-04 10:23:13,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 193. [2025-03-04 10:23:13,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 176 states have (on average 1.0909090909090908) internal successors, (192), 176 states have internal predecessors, (192), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 10:23:13,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 222 transitions. [2025-03-04 10:23:13,722 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 222 transitions. Word has length 91 [2025-03-04 10:23:13,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:23:13,722 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 222 transitions. [2025-03-04 10:23:13,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 14.0) internal successors, (112), 9 states have internal predecessors, (112), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 10:23:13,723 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 222 transitions. [2025-03-04 10:23:13,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-04 10:23:13,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:23:13,724 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:23:13,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 10:23:13,927 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,SelfDestructingSolverStorable11 [2025-03-04 10:23:13,927 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-03-04 10:23:13,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:23:13,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1922947613, now seen corresponding path program 1 times [2025-03-04 10:23:13,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:23:13,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681526381] [2025-03-04 10:23:13,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:23:13,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:23:13,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-04 10:23:13,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-04 10:23:13,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:23:13,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:23:14,017 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2025-03-04 10:23:14,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:23:14,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681526381] [2025-03-04 10:23:14,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681526381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:23:14,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:23:14,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:23:14,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278621704] [2025-03-04 10:23:14,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:23:14,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:23:14,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:23:14,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:23:14,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:23:14,019 INFO L87 Difference]: Start difference. First operand 193 states and 222 transitions. Second operand has 4 states, 3 states have (on average 24.666666666666668) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 10:23:14,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:23:14,074 INFO L93 Difference]: Finished difference Result 193 states and 222 transitions. [2025-03-04 10:23:14,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:23:14,074 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 24.666666666666668) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 174 [2025-03-04 10:23:14,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:23:14,075 INFO L225 Difference]: With dead ends: 193 [2025-03-04 10:23:14,075 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 10:23:14,075 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:23:14,076 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 31 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:23:14,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 85 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:23:14,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 10:23:14,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 10:23:14,076 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:23:14,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 10:23:14,076 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 174 [2025-03-04 10:23:14,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:23:14,076 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 10:23:14,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 24.666666666666668) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 10:23:14,076 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 10:23:14,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 10:23:14,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 46 remaining) [2025-03-04 10:23:14,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 46 remaining) [2025-03-04 10:23:14,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 46 remaining) [2025-03-04 10:23:14,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 46 remaining) [2025-03-04 10:23:14,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 46 remaining) [2025-03-04 10:23:14,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 46 remaining) [2025-03-04 10:23:14,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 46 remaining) [2025-03-04 10:23:14,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 46 remaining) [2025-03-04 10:23:14,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 46 remaining) [2025-03-04 10:23:14,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 46 remaining) [2025-03-04 10:23:14,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 46 remaining) [2025-03-04 10:23:14,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 46 remaining) [2025-03-04 10:23:14,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 46 remaining) [2025-03-04 10:23:14,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 46 remaining) [2025-03-04 10:23:14,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 46 remaining) [2025-03-04 10:23:14,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 46 remaining) [2025-03-04 10:23:14,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 46 remaining) [2025-03-04 10:23:14,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 46 remaining) [2025-03-04 10:23:14,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 46 remaining) [2025-03-04 10:23:14,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 46 remaining) [2025-03-04 10:23:14,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 46 remaining) [2025-03-04 10:23:14,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 46 remaining) [2025-03-04 10:23:14,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 46 remaining) [2025-03-04 10:23:14,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 46 remaining) [2025-03-04 10:23:14,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 46 remaining) [2025-03-04 10:23:14,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 46 remaining) [2025-03-04 10:23:14,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 46 remaining) [2025-03-04 10:23:14,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 46 remaining) [2025-03-04 10:23:14,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 46 remaining) [2025-03-04 10:23:14,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 46 remaining) [2025-03-04 10:23:14,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 46 remaining) [2025-03-04 10:23:14,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 46 remaining) [2025-03-04 10:23:14,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 46 remaining) [2025-03-04 10:23:14,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 46 remaining) [2025-03-04 10:23:14,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 46 remaining) [2025-03-04 10:23:14,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 46 remaining) [2025-03-04 10:23:14,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 46 remaining) [2025-03-04 10:23:14,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 46 remaining) [2025-03-04 10:23:14,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 46 remaining) [2025-03-04 10:23:14,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 46 remaining) [2025-03-04 10:23:14,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 46 remaining) [2025-03-04 10:23:14,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 46 remaining) [2025-03-04 10:23:14,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 46 remaining) [2025-03-04 10:23:14,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 46 remaining) [2025-03-04 10:23:14,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 46 remaining) [2025-03-04 10:23:14,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 46 remaining) [2025-03-04 10:23:14,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 10:23:14,088 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:23:14,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 10:23:14,404 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 10:23:14,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 10:23:14 BoogieIcfgContainer [2025-03-04 10:23:14,418 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 10:23:14,418 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 10:23:14,418 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 10:23:14,418 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 10:23:14,419 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:23:08" (3/4) ... [2025-03-04 10:23:14,420 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 10:23:14,424 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ReadFromPort [2025-03-04 10:23:14,430 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-03-04 10:23:14,430 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-04 10:23:14,431 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 10:23:14,431 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 10:23:14,431 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 10:23:14,496 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 10:23:14,498 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 10:23:14,498 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 10:23:14,499 INFO L158 Benchmark]: Toolchain (without parser) took 6251.55ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 77.0MB in the end (delta: 28.8MB). Peak memory consumption was 25.8MB. Max. memory is 16.1GB. [2025-03-04 10:23:14,499 INFO L158 Benchmark]: CDTParser took 0.80ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:23:14,499 INFO L158 Benchmark]: CACSL2BoogieTranslator took 150.03ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 93.7MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:23:14,499 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.35ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 92.2MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:23:14,500 INFO L158 Benchmark]: Boogie Preprocessor took 40.30ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 91.2MB in the end (delta: 987.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:23:14,500 INFO L158 Benchmark]: IcfgBuilder took 382.29ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 69.5MB in the end (delta: 21.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 10:23:14,500 INFO L158 Benchmark]: TraceAbstraction took 5561.80ms. Allocated memory is still 142.6MB. Free memory was 69.5MB in the beginning and 84.1MB in the end (delta: -14.6MB). Peak memory consumption was 44.4MB. Max. memory is 16.1GB. [2025-03-04 10:23:14,500 INFO L158 Benchmark]: Witness Printer took 79.94ms. Allocated memory is still 142.6MB. Free memory was 84.1MB in the beginning and 77.0MB in the end (delta: 7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:23:14,501 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.80ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 150.03ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 93.7MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.35ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 92.2MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.30ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 91.2MB in the end (delta: 987.8kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 382.29ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 69.5MB in the end (delta: 21.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5561.80ms. Allocated memory is still 142.6MB. Free memory was 69.5MB in the beginning and 84.1MB in the end (delta: -14.6MB). Peak memory consumption was 44.4MB. Max. memory is 16.1GB. * Witness Printer took 79.94ms. Allocated memory is still 142.6MB. Free memory was 84.1MB in the beginning and 77.0MB in the end (delta: 7.1MB). 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: 89]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 89]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 81]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 81]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 81]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 81]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 65]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 65]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 65]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 65]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: 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, 128 locations, 46 error locations. Started 1 CEGAR loops. OverallTime: 5.2s, OverallIterations: 13, TraceHistogramMax: 15, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1880 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1844 mSDsluCounter, 2024 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 993 mSDsCounter, 232 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1963 IncrementalHoareTripleChecker+Invalid, 2195 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 232 mSolverCounterUnsat, 1031 mSDtfsCounter, 1963 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 677 GetRequests, 615 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=232occurred in iteration=11, InterpolantAutomatonStates: 68, 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, 13 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1080 NumberOfCodeBlocks, 928 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1299 ConstructedInterpolants, 0 QuantifiedInterpolants, 2672 SizeOfPredicates, 2 NumberOfNonLiveVariables, 953 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 21 InterpolantComputations, 10 PerfectInterpolantSequences, 1074/1172 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 46 specifications checked. All of them hold - InvariantResult [Line: 89]: Location Invariant Derived location invariant: (((((((((SIZE >= 0) ? (SIZE % 5) : ((SIZE % 5) + 5)) == 0) && (1 <= i)) && (2 <= SIZE)) && (i <= 2147483646)) && (SIZE <= 99999)) && (MAX <= 100000)) || (((((((SIZE >= 0) ? (SIZE % 5) : ((SIZE % 5) + 5)) == 0) && (i == 0)) && (2 <= SIZE)) && (SIZE <= 99999)) && (MAX <= 100000))) - InvariantResult [Line: 36]: Location Invariant Derived location invariant: ((((((((SIZE >= 0) ? (SIZE % 5) : ((SIZE % 5) + 5)) == 0) && (2 <= SIZE)) && (2 <= i)) && (SIZE <= 99999)) && (MAX <= 100000)) || (((((((SIZE >= 0) ? (SIZE % 5) : ((SIZE % 5) + 5)) == 0) && (2 <= SIZE)) && (i == 1)) && (SIZE <= 99999)) && (MAX <= 100000))) RESULT: Ultimate proved your program to be correct! [2025-03-04 10:23:14,516 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