./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/sync-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed 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/busybox-1.22.0/sync-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash f09af5b21dd53da868fbc34f2a3c1b34b966484053dddbaa298a91d068be7585 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 05:55:19,201 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 05:55:19,245 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-09 05:55:19,248 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 05:55:19,248 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 05:55:19,262 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 05:55:19,263 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 05:55:19,263 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 05:55:19,263 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 05:55:19,263 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 05:55:19,264 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 05:55:19,264 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 05:55:19,264 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 05:55:19,264 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 05:55:19,264 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 05:55:19,264 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 05:55:19,264 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 05:55:19,264 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 05:55:19,264 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 05:55:19,265 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 05:55:19,265 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 05:55:19,265 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 05:55:19,265 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 05:55:19,265 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 05:55:19,265 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 05:55:19,265 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 05:55:19,265 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 05:55:19,265 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 05:55:19,265 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 05:55:19,265 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 05:55:19,265 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 05:55:19,265 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 05:55:19,266 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 05:55:19,266 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 05:55:19,266 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 05:55:19,266 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 05:55:19,266 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 05:55:19,266 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 05:55:19,266 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 05:55:19,266 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 05:55:19,266 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 05:55:19,266 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 05:55:19,266 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f09af5b21dd53da868fbc34f2a3c1b34b966484053dddbaa298a91d068be7585 [2025-03-09 05:55:19,461 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 05:55:19,470 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 05:55:19,471 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 05:55:19,472 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 05:55:19,472 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 05:55:19,474 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/sync-1.i [2025-03-09 05:55:20,608 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/495656179/82a1537f6c144ed7a376af2bc49e91c6/FLAG2dc7139e5 [2025-03-09 05:55:20,987 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 05:55:20,987 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/sync-1.i [2025-03-09 05:55:21,014 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/495656179/82a1537f6c144ed7a376af2bc49e91c6/FLAG2dc7139e5 [2025-03-09 05:55:21,032 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/495656179/82a1537f6c144ed7a376af2bc49e91c6 [2025-03-09 05:55:21,034 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 05:55:21,036 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 05:55:21,037 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 05:55:21,037 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 05:55:21,039 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 05:55:21,040 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:55:21" (1/1) ... [2025-03-09 05:55:21,041 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64fe41d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:55:21, skipping insertion in model container [2025-03-09 05:55:21,042 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:55:21" (1/1) ... [2025-03-09 05:55:21,077 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 05:55:21,673 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 05:55:21,697 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 05:55:21,783 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 05:55:21,903 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-09 05:55:21,915 INFO L204 MainTranslator]: Completed translation [2025-03-09 05:55:21,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:55:21 WrapperNode [2025-03-09 05:55:21,918 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 05:55:21,919 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 05:55:21,919 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 05:55:21,919 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 05:55:21,923 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:55:21" (1/1) ... [2025-03-09 05:55:21,943 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:55:21" (1/1) ... [2025-03-09 05:55:21,994 INFO L138 Inliner]: procedures = 540, calls = 474, calls flagged for inlining = 16, calls inlined = 15, statements flattened = 716 [2025-03-09 05:55:21,995 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 05:55:21,995 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 05:55:21,995 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 05:55:21,995 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 05:55:22,006 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:55:21" (1/1) ... [2025-03-09 05:55:22,007 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:55:21" (1/1) ... [2025-03-09 05:55:22,015 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:55:21" (1/1) ... [2025-03-09 05:55:22,027 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-09 05:55:22,028 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:55:21" (1/1) ... [2025-03-09 05:55:22,028 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:55:21" (1/1) ... [2025-03-09 05:55:22,061 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:55:21" (1/1) ... [2025-03-09 05:55:22,063 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:55:21" (1/1) ... [2025-03-09 05:55:22,073 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:55:21" (1/1) ... [2025-03-09 05:55:22,075 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:55:21" (1/1) ... [2025-03-09 05:55:22,087 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 05:55:22,089 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 05:55:22,089 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 05:55:22,090 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 05:55:22,090 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:55:21" (1/1) ... [2025-03-09 05:55:22,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 05:55:22,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:55:22,118 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-09 05:55:22,120 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-09 05:55:22,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 05:55:22,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-03-09 05:55:22,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-09 05:55:22,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-09 05:55:22,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 05:55:22,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 05:55:22,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-09 05:55:22,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 05:55:22,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 05:55:22,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-03-09 05:55:22,140 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-03-09 05:55:22,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-03-09 05:55:22,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-03-09 05:55:22,140 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-09 05:55:22,140 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-09 05:55:22,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 05:55:22,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-09 05:55:22,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-09 05:55:22,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-09 05:55:22,382 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 05:55:22,384 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 05:55:22,958 INFO L? ?]: Removed 227 outVars from TransFormulas that were not future-live. [2025-03-09 05:55:22,958 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 05:55:22,973 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 05:55:22,974 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 05:55:22,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:55:22 BoogieIcfgContainer [2025-03-09 05:55:22,975 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 05:55:22,977 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 05:55:22,977 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 05:55:22,980 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 05:55:22,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 05:55:21" (1/3) ... [2025-03-09 05:55:22,981 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20f1dde0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:55:22, skipping insertion in model container [2025-03-09 05:55:22,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:55:21" (2/3) ... [2025-03-09 05:55:22,982 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20f1dde0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:55:22, skipping insertion in model container [2025-03-09 05:55:22,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:55:22" (3/3) ... [2025-03-09 05:55:22,982 INFO L128 eAbstractionObserver]: Analyzing ICFG sync-1.i [2025-03-09 05:55:22,992 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 05:55:22,993 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sync-1.i that has 3 procedures, 149 locations, 1 initial locations, 11 loop locations, and 40 error locations. [2025-03-09 05:55:23,035 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 05:55:23,046 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;@23026bd8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 05:55:23,046 INFO L334 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2025-03-09 05:55:23,049 INFO L276 IsEmpty]: Start isEmpty. Operand has 149 states, 101 states have (on average 1.693069306930693) internal successors, (171), 141 states have internal predecessors, (171), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 05:55:23,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-09 05:55:23,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:55:23,053 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-09 05:55:23,054 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-09 05:55:23,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:55:23,057 INFO L85 PathProgramCache]: Analyzing trace with hash 6833023, now seen corresponding path program 1 times [2025-03-09 05:55:23,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:55:23,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248988243] [2025-03-09 05:55:23,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:55:23,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:55:23,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 05:55:23,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 05:55:23,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:55:23,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:23,499 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-09 05:55:23,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:55:23,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248988243] [2025-03-09 05:55:23,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248988243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:55:23,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:55:23,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:55:23,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135070257] [2025-03-09 05:55:23,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:55:23,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:55:23,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:55:23,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:55:23,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:55:23,517 INFO L87 Difference]: Start difference. First operand has 149 states, 101 states have (on average 1.693069306930693) internal successors, (171), 141 states have internal predecessors, (171), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 05:55:23,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:55:23,554 INFO L93 Difference]: Finished difference Result 196 states and 237 transitions. [2025-03-09 05:55:23,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:55:23,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-09 05:55:23,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:55:23,560 INFO L225 Difference]: With dead ends: 196 [2025-03-09 05:55:23,561 INFO L226 Difference]: Without dead ends: 49 [2025-03-09 05:55:23,563 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-09 05:55:23,565 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 1 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:55:23,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 97 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:55:23,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-09 05:55:23,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-09 05:55:23,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 46 states have internal predecessors, (52), 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-09 05:55:23,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2025-03-09 05:55:23,587 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 4 [2025-03-09 05:55:23,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:55:23,587 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2025-03-09 05:55:23,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 05:55:23,588 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2025-03-09 05:55:23,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-09 05:55:23,588 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:55:23,588 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-09 05:55:23,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 05:55:23,589 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-09 05:55:23,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:55:23,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1699280315, now seen corresponding path program 1 times [2025-03-09 05:55:23,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:55:23,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843269227] [2025-03-09 05:55:23,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:55:23,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:55:23,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 05:55:23,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 05:55:23,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:55:23,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:23,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:55:23,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:55:23,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843269227] [2025-03-09 05:55:23,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843269227] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:55:23,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395288149] [2025-03-09 05:55:23,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:55:23,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:55:23,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:55:23,775 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-09 05:55:23,777 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-09 05:55:23,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 05:55:23,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 05:55:23,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:55:23,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:24,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 848 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:55:24,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:55:24,032 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:55:24,033 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:55:24,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395288149] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:55:24,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:55:24,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-09 05:55:24,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893337290] [2025-03-09 05:55:24,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:55:24,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 05:55:24,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:55:24,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 05:55:24,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:55:24,035 INFO L87 Difference]: Start difference. First operand 49 states and 54 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-09 05:55:24,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:55:24,060 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2025-03-09 05:55:24,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 05:55:24,061 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-09 05:55:24,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:55:24,061 INFO L225 Difference]: With dead ends: 49 [2025-03-09 05:55:24,062 INFO L226 Difference]: Without dead ends: 48 [2025-03-09 05:55:24,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:55:24,063 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 1 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:55:24,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 133 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:55:24,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-09 05:55:24,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-09 05:55:24,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 34 states have (on average 1.5) internal successors, (51), 45 states have internal predecessors, (51), 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-09 05:55:24,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2025-03-09 05:55:24,070 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 7 [2025-03-09 05:55:24,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:55:24,070 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2025-03-09 05:55:24,070 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-09 05:55:24,070 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2025-03-09 05:55:24,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 05:55:24,070 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:55:24,070 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-03-09 05:55:24,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 05:55:24,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:55:24,271 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-09 05:55:24,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:55:24,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1138082369, now seen corresponding path program 1 times [2025-03-09 05:55:24,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:55:24,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400556782] [2025-03-09 05:55:24,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:55:24,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:55:24,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 05:55:24,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 05:55:24,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:55:24,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:24,399 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 05:55:24,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:55:24,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400556782] [2025-03-09 05:55:24,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400556782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:55:24,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:55:24,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:55:24,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577716953] [2025-03-09 05:55:24,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:55:24,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:55:24,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:55:24,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:55:24,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:55:24,402 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 05:55:24,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:55:24,413 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2025-03-09 05:55:24,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:55:24,416 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-09 05:55:24,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:55:24,417 INFO L225 Difference]: With dead ends: 48 [2025-03-09 05:55:24,417 INFO L226 Difference]: Without dead ends: 47 [2025-03-09 05:55:24,417 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-09 05:55:24,419 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:55:24,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:55:24,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-09 05:55:24,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2025-03-09 05:55:24,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.5) internal successors, (48), 42 states have internal predecessors, (48), 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-09 05:55:24,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2025-03-09 05:55:24,426 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 8 [2025-03-09 05:55:24,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:55:24,426 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2025-03-09 05:55:24,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 05:55:24,427 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2025-03-09 05:55:24,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-09 05:55:24,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:55:24,427 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:55:24,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 05:55:24,427 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-09 05:55:24,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:55:24,428 INFO L85 PathProgramCache]: Analyzing trace with hash 133105379, now seen corresponding path program 1 times [2025-03-09 05:55:24,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:55:24,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129109249] [2025-03-09 05:55:24,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:55:24,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:55:24,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 05:55:24,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 05:55:24,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:55:24,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:24,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:55:24,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:55:24,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129109249] [2025-03-09 05:55:24,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129109249] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:55:24,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368789136] [2025-03-09 05:55:24,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:55:24,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:55:24,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:55:24,595 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-09 05:55:24,597 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-09 05:55:24,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 05:55:24,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 05:55:24,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:55:24,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:24,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 05:55:24,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:55:24,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 05:55:24,816 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:55:24,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368789136] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:55:24,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:55:24,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-09 05:55:24,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525870908] [2025-03-09 05:55:24,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:55:24,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:55:24,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:55:24,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:55:24,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:55:24,817 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-09 05:55:24,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:55:24,837 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2025-03-09 05:55:24,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:55:24,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 12 [2025-03-09 05:55:24,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:55:24,838 INFO L225 Difference]: With dead ends: 45 [2025-03-09 05:55:24,838 INFO L226 Difference]: Without dead ends: 43 [2025-03-09 05:55:24,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:55:24,839 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 34 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:55:24,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 46 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:55:24,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-09 05:55:24,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-09 05:55:24,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 32 states have (on average 1.4375) internal successors, (46), 40 states have internal predecessors, (46), 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-09 05:55:24,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2025-03-09 05:55:24,842 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 12 [2025-03-09 05:55:24,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:55:24,842 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2025-03-09 05:55:24,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-09 05:55:24,843 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2025-03-09 05:55:24,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-09 05:55:24,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:55:24,843 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:55:24,850 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-09 05:55:25,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-09 05:55:25,044 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-09 05:55:25,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:55:25,045 INFO L85 PathProgramCache]: Analyzing trace with hash -168700397, now seen corresponding path program 1 times [2025-03-09 05:55:25,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:55:25,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940378767] [2025-03-09 05:55:25,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:55:25,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:55:25,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 05:55:25,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 05:55:25,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:55:25,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:25,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:55:25,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:55:25,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940378767] [2025-03-09 05:55:25,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940378767] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:55:25,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673730346] [2025-03-09 05:55:25,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:55:25,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:55:25,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:55:25,183 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-09 05:55:25,185 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-09 05:55:25,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 05:55:25,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 05:55:25,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:55:25,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:25,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 866 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:55:25,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:55:25,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:55:25,401 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:55:25,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:55:25,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673730346] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:55:25,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:55:25,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-09 05:55:25,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832049132] [2025-03-09 05:55:25,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:55:25,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 05:55:25,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:55:25,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 05:55:25,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:55:25,428 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:55:25,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:55:25,461 INFO L93 Difference]: Finished difference Result 89 states and 101 transitions. [2025-03-09 05:55:25,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:55:25,462 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 13 [2025-03-09 05:55:25,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:55:25,462 INFO L225 Difference]: With dead ends: 89 [2025-03-09 05:55:25,462 INFO L226 Difference]: Without dead ends: 52 [2025-03-09 05:55:25,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:55:25,463 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 4 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:55:25,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 170 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:55:25,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-09 05:55:25,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-03-09 05:55:25,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 49 states have internal predecessors, (55), 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-09 05:55:25,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2025-03-09 05:55:25,472 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 13 [2025-03-09 05:55:25,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:55:25,473 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2025-03-09 05:55:25,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:55:25,473 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2025-03-09 05:55:25,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-09 05:55:25,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:55:25,474 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:55:25,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 05:55:25,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:55:25,674 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-09 05:55:25,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:55:25,675 INFO L85 PathProgramCache]: Analyzing trace with hash -23056937, now seen corresponding path program 2 times [2025-03-09 05:55:25,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:55:25,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743181009] [2025-03-09 05:55:25,675 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 05:55:25,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:55:25,694 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-09 05:55:25,710 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 22 statements. [2025-03-09 05:55:25,710 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 05:55:25,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:25,853 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 05:55:25,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:55:25,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743181009] [2025-03-09 05:55:25,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743181009] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:55:25,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:55:25,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 05:55:25,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892928019] [2025-03-09 05:55:25,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:55:25,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 05:55:25,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:55:25,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 05:55:25,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:55:25,856 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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-09 05:55:25,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:55:25,894 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2025-03-09 05:55:25,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 05:55:25,894 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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 22 [2025-03-09 05:55:25,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:55:25,895 INFO L225 Difference]: With dead ends: 52 [2025-03-09 05:55:25,895 INFO L226 Difference]: Without dead ends: 50 [2025-03-09 05:55:25,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:55:25,896 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 33 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:55:25,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 110 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:55:25,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-09 05:55:25,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-09 05:55:25,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 47 states have internal predecessors, (53), 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-09 05:55:25,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2025-03-09 05:55:25,899 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 22 [2025-03-09 05:55:25,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:55:25,900 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2025-03-09 05:55:25,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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-09 05:55:25,900 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2025-03-09 05:55:25,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-09 05:55:25,900 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:55:25,900 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:55:25,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 05:55:25,901 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-09 05:55:25,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:55:25,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1723860730, now seen corresponding path program 1 times [2025-03-09 05:55:25,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:55:25,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422608883] [2025-03-09 05:55:25,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:55:25,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:55:25,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 05:55:25,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 05:55:25,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:55:25,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:26,079 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 05:55:26,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:55:26,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422608883] [2025-03-09 05:55:26,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422608883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:55:26,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:55:26,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 05:55:26,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911850396] [2025-03-09 05:55:26,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:55:26,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:55:26,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:55:26,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:55:26,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:55:26,081 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-09 05:55:26,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:55:26,099 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2025-03-09 05:55:26,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:55:26,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 27 [2025-03-09 05:55:26,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:55:26,100 INFO L225 Difference]: With dead ends: 79 [2025-03-09 05:55:26,100 INFO L226 Difference]: Without dead ends: 53 [2025-03-09 05:55:26,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09 05:55:26,100 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 2 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:55:26,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 79 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:55:26,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-09 05:55:26,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-03-09 05:55:26,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 50 states have internal predecessors, (56), 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-09 05:55:26,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2025-03-09 05:55:26,107 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 27 [2025-03-09 05:55:26,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:55:26,108 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2025-03-09 05:55:26,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-09 05:55:26,108 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2025-03-09 05:55:26,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 05:55:26,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:55:26,109 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:55:26,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 05:55:26,109 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-09 05:55:26,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:55:26,110 INFO L85 PathProgramCache]: Analyzing trace with hash 289611180, now seen corresponding path program 1 times [2025-03-09 05:55:26,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:55:26,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533290884] [2025-03-09 05:55:26,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:55:26,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:55:26,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 05:55:26,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 05:55:26,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:55:26,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:26,283 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 05:55:26,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:55:26,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533290884] [2025-03-09 05:55:26,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533290884] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:55:26,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:55:26,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 05:55:26,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595540274] [2025-03-09 05:55:26,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:55:26,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:55:26,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:55:26,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:55:26,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:55:26,285 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-09 05:55:26,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:55:26,294 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2025-03-09 05:55:26,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:55:26,295 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 30 [2025-03-09 05:55:26,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:55:26,295 INFO L225 Difference]: With dead ends: 56 [2025-03-09 05:55:26,295 INFO L226 Difference]: Without dead ends: 53 [2025-03-09 05:55:26,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09 05:55:26,296 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 4 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:55:26,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 79 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:55:26,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-09 05:55:26,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-03-09 05:55:26,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 44 states have (on average 1.25) internal successors, (55), 50 states have internal predecessors, (55), 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-09 05:55:26,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2025-03-09 05:55:26,299 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 30 [2025-03-09 05:55:26,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:55:26,299 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2025-03-09 05:55:26,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-09 05:55:26,300 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2025-03-09 05:55:26,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 05:55:26,300 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:55:26,300 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:55:26,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 05:55:26,300 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-09 05:55:26,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:55:26,301 INFO L85 PathProgramCache]: Analyzing trace with hash 289612141, now seen corresponding path program 1 times [2025-03-09 05:55:26,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:55:26,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571446187] [2025-03-09 05:55:26,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:55:26,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:55:26,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 05:55:26,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 05:55:26,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:55:26,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:26,492 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:55:26,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:55:26,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571446187] [2025-03-09 05:55:26,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571446187] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:55:26,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507462222] [2025-03-09 05:55:26,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:55:26,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:55:26,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:55:26,494 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-09 05:55:26,505 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-09 05:55:26,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 05:55:26,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 05:55:26,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:55:26,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:26,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 1066 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 05:55:26,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:55:26,758 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:55:26,759 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:55:26,827 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:55:26,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507462222] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:55:26,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:55:26,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-09 05:55:26,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719312154] [2025-03-09 05:55:26,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:55:26,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 05:55:26,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:55:26,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 05:55:26,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 05:55:26,830 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:55:26,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:55:26,876 INFO L93 Difference]: Finished difference Result 109 states and 122 transitions. [2025-03-09 05:55:26,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 05:55:26,876 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2025-03-09 05:55:26,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:55:26,877 INFO L225 Difference]: With dead ends: 109 [2025-03-09 05:55:26,877 INFO L226 Difference]: Without dead ends: 71 [2025-03-09 05:55:26,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 05:55:26,878 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 4 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:55:26,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 158 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:55:26,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-09 05:55:26,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-03-09 05:55:26,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 62 states have (on average 1.1774193548387097) internal successors, (73), 68 states have internal predecessors, (73), 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-09 05:55:26,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2025-03-09 05:55:26,882 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 30 [2025-03-09 05:55:26,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:55:26,882 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2025-03-09 05:55:26,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:55:26,882 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2025-03-09 05:55:26,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-09 05:55:26,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:55:26,882 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:55:26,890 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-09 05:55:27,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:55:27,083 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-09 05:55:27,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:55:27,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1479592723, now seen corresponding path program 2 times [2025-03-09 05:55:27,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:55:27,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72010480] [2025-03-09 05:55:27,084 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 05:55:27,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:55:27,116 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-03-09 05:55:27,159 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 48 statements. [2025-03-09 05:55:27,160 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 05:55:27,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:27,326 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 05:55:27,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:55:27,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72010480] [2025-03-09 05:55:27,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72010480] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:55:27,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:55:27,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 05:55:27,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910002363] [2025-03-09 05:55:27,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:55:27,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 05:55:27,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:55:27,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 05:55:27,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:55:27,327 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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-09 05:55:27,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:55:27,388 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2025-03-09 05:55:27,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:55:27,389 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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 48 [2025-03-09 05:55:27,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:55:27,390 INFO L225 Difference]: With dead ends: 100 [2025-03-09 05:55:27,390 INFO L226 Difference]: Without dead ends: 82 [2025-03-09 05:55:27,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:55:27,391 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 46 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:55:27,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 119 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:55:27,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-09 05:55:27,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2025-03-09 05:55:27,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 71 states have (on average 1.1971830985915493) internal successors, (85), 77 states have internal predecessors, (85), 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-09 05:55:27,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2025-03-09 05:55:27,401 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 48 [2025-03-09 05:55:27,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:55:27,402 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2025-03-09 05:55:27,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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-09 05:55:27,402 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2025-03-09 05:55:27,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-09 05:55:27,403 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:55:27,404 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:55:27,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 05:55:27,404 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-09 05:55:27,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:55:27,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1153250000, now seen corresponding path program 1 times [2025-03-09 05:55:27,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:55:27,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693639071] [2025-03-09 05:55:27,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:55:27,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:55:27,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-09 05:55:27,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 05:55:27,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:55:27,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:27,573 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 05:55:27,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:55:27,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693639071] [2025-03-09 05:55:27,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693639071] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:55:27,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679852568] [2025-03-09 05:55:27,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:55:27,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:55:27,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:55:27,575 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-09 05:55:27,577 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-09 05:55:27,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-09 05:55:27,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 05:55:27,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:55:27,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:27,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 1165 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:55:27,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:55:27,841 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 05:55:27,842 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:55:27,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679852568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:55:27,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:55:27,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-09 05:55:27,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112566437] [2025-03-09 05:55:27,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:55:27,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 05:55:27,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:55:27,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 05:55:27,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:55:27,844 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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-09 05:55:27,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:55:27,864 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2025-03-09 05:55:27,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 05:55:27,865 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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 48 [2025-03-09 05:55:27,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:55:27,865 INFO L225 Difference]: With dead ends: 80 [2025-03-09 05:55:27,865 INFO L226 Difference]: Without dead ends: 79 [2025-03-09 05:55:27,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:55:27,866 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:55:27,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 74 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:55:27,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-09 05:55:27,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-09 05:55:27,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 71 states have (on average 1.1690140845070423) internal successors, (83), 76 states have internal predecessors, (83), 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-09 05:55:27,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2025-03-09 05:55:27,875 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 48 [2025-03-09 05:55:27,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:55:27,875 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2025-03-09 05:55:27,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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-09 05:55:27,875 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2025-03-09 05:55:27,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-09 05:55:27,875 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:55:27,876 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:55:27,884 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-09 05:55:28,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-09 05:55:28,076 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-09 05:55:28,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:55:28,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1391011492, now seen corresponding path program 1 times [2025-03-09 05:55:28,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:55:28,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853122977] [2025-03-09 05:55:28,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:55:28,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:55:28,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-09 05:55:28,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 05:55:28,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:55:28,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:28,233 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-09 05:55:28,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:55:28,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853122977] [2025-03-09 05:55:28,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853122977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:55:28,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:55:28,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:55:28,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593459370] [2025-03-09 05:55:28,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:55:28,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:55:28,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:55:28,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:55:28,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:55:28,235 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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-09 05:55:28,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:55:28,249 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2025-03-09 05:55:28,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:55:28,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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 49 [2025-03-09 05:55:28,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:55:28,250 INFO L225 Difference]: With dead ends: 79 [2025-03-09 05:55:28,250 INFO L226 Difference]: Without dead ends: 78 [2025-03-09 05:55:28,251 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-09 05:55:28,251 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:55:28,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:55:28,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-09 05:55:28,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2025-03-09 05:55:28,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 67 states have (on average 1.1492537313432836) internal successors, (77), 71 states have internal predecessors, (77), 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-09 05:55:28,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2025-03-09 05:55:28,256 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 49 [2025-03-09 05:55:28,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:55:28,256 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2025-03-09 05:55:28,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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-09 05:55:28,256 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2025-03-09 05:55:28,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-09 05:55:28,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:55:28,257 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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-09 05:55:28,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 05:55:28,257 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-09 05:55:28,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:55:28,258 INFO L85 PathProgramCache]: Analyzing trace with hash 645738319, now seen corresponding path program 1 times [2025-03-09 05:55:28,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:55:28,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897533963] [2025-03-09 05:55:28,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:55:28,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:55:28,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-09 05:55:28,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 05:55:28,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:55:28,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:28,462 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 05:55:28,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:55:28,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897533963] [2025-03-09 05:55:28,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897533963] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:55:28,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340818464] [2025-03-09 05:55:28,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:55:28,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:55:28,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:55:28,465 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:55:28,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 05:55:28,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-09 05:55:28,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 05:55:28,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:55:28,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:28,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 1253 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:55:28,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:55:28,791 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 05:55:28,791 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:55:28,811 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 05:55:28,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340818464] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:55:28,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:55:28,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-09 05:55:28,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811737990] [2025-03-09 05:55:28,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:55:28,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 05:55:28,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:55:28,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 05:55:28,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:55:28,813 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 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-09 05:55:28,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:55:28,843 INFO L93 Difference]: Finished difference Result 119 states and 133 transitions. [2025-03-09 05:55:28,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:55:28,844 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 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 55 [2025-03-09 05:55:28,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:55:28,844 INFO L225 Difference]: With dead ends: 119 [2025-03-09 05:55:28,844 INFO L226 Difference]: Without dead ends: 92 [2025-03-09 05:55:28,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:55:28,845 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 4 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:55:28,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 147 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:55:28,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-09 05:55:28,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-03-09 05:55:28,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 85 states have (on average 1.1176470588235294) internal successors, (95), 89 states have internal predecessors, (95), 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-09 05:55:28,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2025-03-09 05:55:28,854 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 55 [2025-03-09 05:55:28,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:55:28,854 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2025-03-09 05:55:28,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 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-09 05:55:28,855 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2025-03-09 05:55:28,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-09 05:55:28,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:55:28,855 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:55:28,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-09 05:55:29,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:55:29,056 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-09 05:55:29,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:55:29,056 INFO L85 PathProgramCache]: Analyzing trace with hash 720403621, now seen corresponding path program 2 times [2025-03-09 05:55:29,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:55:29,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357593869] [2025-03-09 05:55:29,057 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 05:55:29,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:55:29,087 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 64 statements into 2 equivalence classes. [2025-03-09 05:55:29,147 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 64 of 64 statements. [2025-03-09 05:55:29,147 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 05:55:29,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:29,336 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 05:55:29,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:55:29,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357593869] [2025-03-09 05:55:29,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357593869] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:55:29,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474342335] [2025-03-09 05:55:29,336 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 05:55:29,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:55:29,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:55:29,338 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:55:29,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 05:55:29,515 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 64 statements into 2 equivalence classes. [2025-03-09 05:55:29,659 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 64 of 64 statements. [2025-03-09 05:55:29,659 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 05:55:29,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:29,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 1322 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 05:55:29,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:55:29,698 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 05:55:29,699 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:55:29,756 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 05:55:29,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474342335] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:55:29,756 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:55:29,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-09 05:55:29,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190093240] [2025-03-09 05:55:29,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:55:29,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 05:55:29,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:55:29,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 05:55:29,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 05:55:29,757 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 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-09 05:55:29,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:55:29,813 INFO L93 Difference]: Finished difference Result 164 states and 184 transitions. [2025-03-09 05:55:29,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 05:55:29,814 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 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 64 [2025-03-09 05:55:29,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:55:29,815 INFO L225 Difference]: With dead ends: 164 [2025-03-09 05:55:29,815 INFO L226 Difference]: Without dead ends: 128 [2025-03-09 05:55:29,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 05:55:29,816 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 4 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:55:29,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 255 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:55:29,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-09 05:55:29,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2025-03-09 05:55:29,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 121 states have (on average 1.0826446280991735) internal successors, (131), 125 states have internal predecessors, (131), 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-09 05:55:29,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 133 transitions. [2025-03-09 05:55:29,826 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 133 transitions. Word has length 64 [2025-03-09 05:55:29,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:55:29,826 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 133 transitions. [2025-03-09 05:55:29,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 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-09 05:55:29,827 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 133 transitions. [2025-03-09 05:55:29,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-09 05:55:29,828 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:55:29,828 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:55:29,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-09 05:55:30,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:55:30,029 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-03-09 05:55:30,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:55:30,029 INFO L85 PathProgramCache]: Analyzing trace with hash -471419931, now seen corresponding path program 3 times [2025-03-09 05:55:30,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:55:30,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421731899] [2025-03-09 05:55:30,030 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 05:55:30,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:55:30,068 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 82 statements into 12 equivalence classes. [2025-03-09 05:55:30,896 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) and asserted 82 of 82 statements. [2025-03-09 05:55:30,896 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-03-09 05:55:30,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:34,014 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2025-03-09 05:55:34,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:55:34,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421731899] [2025-03-09 05:55:34,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421731899] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:55:34,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319714223] [2025-03-09 05:55:34,015 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 05:55:34,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:55:34,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:55:34,017 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:55:34,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 05:55:34,231 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 82 statements into 12 equivalence classes. [2025-03-09 05:56:23,843 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) and asserted 82 of 82 statements. [2025-03-09 05:56:23,843 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-03-09 05:56:23,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:56:23,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 1460 conjuncts, 98 conjuncts are in the unsatisfiable core [2025-03-09 05:56:23,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:56:23,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2025-03-09 05:56:23,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-09 05:56:23,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-09 05:56:23,997 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-09 05:56:23,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-09 05:56:24,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 05:56:24,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 05:56:24,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 60 [2025-03-09 05:56:24,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 05:56:24,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 41 [2025-03-09 05:56:24,107 INFO L349 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2025-03-09 05:56:24,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 69 [2025-03-09 05:56:24,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 05:56:24,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 18 [2025-03-09 05:56:24,139 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-09 05:56:24,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-03-09 05:56:24,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 05:56:24,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 05:56:24,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 54 [2025-03-09 05:56:24,181 INFO L349 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2025-03-09 05:56:24,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 67 [2025-03-09 05:56:24,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-09 05:56:24,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 05:56:24,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2025-03-09 05:56:24,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 18 [2025-03-09 05:56:24,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2025-03-09 05:56:24,302 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-09 05:56:24,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-03-09 05:56:24,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 18 [2025-03-09 05:56:24,370 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-09 05:56:24,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-03-09 05:56:24,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 18 [2025-03-09 05:56:24,430 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-09 05:56:24,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-03-09 05:56:24,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 18 [2025-03-09 05:56:24,494 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-09 05:56:24,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-03-09 05:56:24,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 18 [2025-03-09 05:56:24,561 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-09 05:56:24,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-03-09 05:56:24,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 18 [2025-03-09 05:56:24,621 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-09 05:56:24,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-03-09 05:56:24,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 18 [2025-03-09 05:56:24,683 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-09 05:56:24,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-03-09 05:56:24,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 18 [2025-03-09 05:56:24,742 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-09 05:56:24,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-03-09 05:56:24,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 18 [2025-03-09 05:56:24,801 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-09 05:56:24,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-03-09 05:56:24,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 18 [2025-03-09 05:56:24,859 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-09 05:56:24,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-03-09 05:56:24,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 18 [2025-03-09 05:56:24,987 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-03-09 05:56:24,987 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:56:25,092 WARN L851 $PredicateComparison]: unable to prove that (or (= c_~logmode~0 0) (< (+ |c_ULTIMATE.start_main_~i~3#1| 1) |c_ULTIMATE.start_main_~argc~0#1|) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (.cse1 (+ 8 |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1712 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1712) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1713 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1713) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 0))))) is different from false [2025-03-09 05:56:25,219 WARN L851 $PredicateComparison]: unable to prove that (or (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (.cse4 (+ 8 |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1711 (Array Int Int)) (v_ArrVal_1709 (Array Int Int))) (= (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1709))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1711)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1713)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) 0)) (forall ((v_ArrVal_1712 (Array Int Int)) (v_ArrVal_1711 (Array Int Int)) (v_ArrVal_1710 (Array Int Int)) (v_ArrVal_1709 (Array Int Int)) (v_ArrVal_1708 (Array Int Int))) (= (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1709))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (store (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_1708) .cse5 v_ArrVal_1710) (select (select (store .cse6 .cse5 v_ArrVal_1711) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1712))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) 0))))) (= c_~logmode~0 0) (< (+ |c_ULTIMATE.start_main_~i~3#1| 1) |c_ULTIMATE.start_main_~argc~0#1|)) is different from false