./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/realpath-2.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/realpath-2.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 4b52b87ac615113f99c41c6355599f8806a623b886ffd195b03cb3f162f5306d --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 05:54:28,182 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 05:54:28,226 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-09 05:54:28,229 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 05:54:28,229 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 05:54:28,250 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 05:54:28,251 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 05:54:28,252 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 05:54:28,252 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 05:54:28,252 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 05:54:28,253 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 05:54:28,253 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 05:54:28,253 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 05:54:28,254 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 05:54:28,254 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 05:54:28,254 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 05:54:28,254 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 05:54:28,254 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 05:54:28,254 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 05:54:28,255 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 05:54:28,255 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 05:54:28,255 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 05:54:28,255 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 05:54:28,255 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 05:54:28,255 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 05:54:28,255 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 05:54:28,255 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 05:54:28,255 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 05:54:28,255 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 05:54:28,255 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 05:54:28,255 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 05:54:28,255 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 05:54:28,256 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 05:54:28,256 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 05:54:28,256 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 05:54:28,256 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 05:54:28,256 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 05:54:28,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 05:54:28,257 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 05:54:28,257 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 05:54:28,257 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 05:54:28,257 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 05:54:28,257 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 -> 4b52b87ac615113f99c41c6355599f8806a623b886ffd195b03cb3f162f5306d [2025-03-09 05:54:28,474 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 05:54:28,479 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 05:54:28,481 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 05:54:28,482 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 05:54:28,482 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 05:54:28,483 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/realpath-2.i [2025-03-09 05:54:29,641 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d2cba593/96a8534b35c04945a387f6126a8dca9c/FLAG8216ce1a8 [2025-03-09 05:54:30,042 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 05:54:30,042 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/realpath-2.i [2025-03-09 05:54:30,069 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d2cba593/96a8534b35c04945a387f6126a8dca9c/FLAG8216ce1a8 [2025-03-09 05:54:30,082 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d2cba593/96a8534b35c04945a387f6126a8dca9c [2025-03-09 05:54:30,084 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 05:54:30,084 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 05:54:30,086 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 05:54:30,086 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 05:54:30,089 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 05:54:30,090 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:54:30" (1/1) ... [2025-03-09 05:54:30,091 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27c6f558 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:54:30, skipping insertion in model container [2025-03-09 05:54:30,092 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:54:30" (1/1) ... [2025-03-09 05:54:30,136 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 05:54:30,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 05:54:30,803 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 05:54:30,887 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 05:54:30,985 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-09 05:54:30,990 INFO L204 MainTranslator]: Completed translation [2025-03-09 05:54:30,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:54:30 WrapperNode [2025-03-09 05:54:30,991 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 05:54:30,992 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 05:54:30,992 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 05:54:30,992 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 05:54:30,996 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:54:30" (1/1) ... [2025-03-09 05:54:31,020 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:54:30" (1/1) ... [2025-03-09 05:54:31,059 INFO L138 Inliner]: procedures = 600, calls = 515, calls flagged for inlining = 18, calls inlined = 15, statements flattened = 838 [2025-03-09 05:54:31,060 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 05:54:31,060 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 05:54:31,060 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 05:54:31,060 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 05:54:31,067 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:54:30" (1/1) ... [2025-03-09 05:54:31,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:54:30" (1/1) ... [2025-03-09 05:54:31,079 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:54:30" (1/1) ... [2025-03-09 05:54:31,089 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-09 05:54:31,090 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:54:30" (1/1) ... [2025-03-09 05:54:31,091 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:54:30" (1/1) ... [2025-03-09 05:54:31,122 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:54:30" (1/1) ... [2025-03-09 05:54:31,125 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:54:30" (1/1) ... [2025-03-09 05:54:31,132 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:54:30" (1/1) ... [2025-03-09 05:54:31,139 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:54:30" (1/1) ... [2025-03-09 05:54:31,153 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 05:54:31,154 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 05:54:31,154 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 05:54:31,154 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 05:54:31,154 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:54:30" (1/1) ... [2025-03-09 05:54:31,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 05:54:31,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:54:31,193 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:54:31,199 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:54:31,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 05:54:31,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-03-09 05:54:31,213 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-03-09 05:54:31,213 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-03-09 05:54:31,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-09 05:54:31,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-09 05:54:31,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 05:54:31,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 05:54:31,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-09 05:54:31,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 05:54:31,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 05:54:31,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-03-09 05:54:31,214 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-03-09 05:54:31,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-03-09 05:54:31,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-03-09 05:54:31,214 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-09 05:54:31,214 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-09 05:54:31,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 05:54:31,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-09 05:54:31,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-09 05:54:31,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-09 05:54:31,521 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 05:54:31,522 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 05:54:32,885 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2025-03-09 05:54:32,886 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 05:54:32,902 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 05:54:32,902 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 05:54:32,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:54:32 BoogieIcfgContainer [2025-03-09 05:54:32,903 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 05:54:32,904 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 05:54:32,904 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 05:54:32,908 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 05:54:32,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 05:54:30" (1/3) ... [2025-03-09 05:54:32,908 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3576938b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:54:32, skipping insertion in model container [2025-03-09 05:54:32,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:54:30" (2/3) ... [2025-03-09 05:54:32,909 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3576938b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:54:32, skipping insertion in model container [2025-03-09 05:54:32,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:54:32" (3/3) ... [2025-03-09 05:54:32,909 INFO L128 eAbstractionObserver]: Analyzing ICFG realpath-2.i [2025-03-09 05:54:32,923 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 05:54:32,926 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG realpath-2.i that has 4 procedures, 167 locations, 1 initial locations, 13 loop locations, and 41 error locations. [2025-03-09 05:54:32,963 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 05:54:33,010 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;@1abd3265, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 05:54:33,010 INFO L334 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2025-03-09 05:54:33,013 INFO L276 IsEmpty]: Start isEmpty. Operand has 167 states, 115 states have (on average 1.6869565217391305) internal successors, (194), 156 states have internal predecessors, (194), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-09 05:54:33,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-09 05:54:33,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:33,017 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-09 05:54:33,018 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 38 more)] === [2025-03-09 05:54:33,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:33,022 INFO L85 PathProgramCache]: Analyzing trace with hash 7725759, now seen corresponding path program 1 times [2025-03-09 05:54:33,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:33,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497289545] [2025-03-09 05:54:33,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:33,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:33,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 05:54:33,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 05:54:33,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:33,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:33,602 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:54:33,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:33,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497289545] [2025-03-09 05:54:33,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497289545] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:54:33,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:54:33,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:54:33,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658427878] [2025-03-09 05:54:33,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:54:33,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:54:33,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:33,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:54:33,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:54:33,625 INFO L87 Difference]: Start difference. First operand has 167 states, 115 states have (on average 1.6869565217391305) internal successors, (194), 156 states have internal predecessors, (194), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) 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:54:33,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:33,673 INFO L93 Difference]: Finished difference Result 232 states and 293 transitions. [2025-03-09 05:54:33,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:54:33,676 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:54:33,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:33,681 INFO L225 Difference]: With dead ends: 232 [2025-03-09 05:54:33,681 INFO L226 Difference]: Without dead ends: 67 [2025-03-09 05:54:33,687 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:54:33,691 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 1 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 145 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:54:33,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 145 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:54:33,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-09 05:54:33,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-09 05:54:33,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 48 states have (on average 1.5) internal successors, (72), 61 states have internal predecessors, (72), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 05:54:33,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2025-03-09 05:54:33,724 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 4 [2025-03-09 05:54:33,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:33,726 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2025-03-09 05:54:33,726 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:54:33,726 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2025-03-09 05:54:33,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-09 05:54:33,727 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:33,727 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-09 05:54:33,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 05:54:33,728 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 38 more)] === [2025-03-09 05:54:33,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:33,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1769963784, now seen corresponding path program 1 times [2025-03-09 05:54:33,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:33,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436325986] [2025-03-09 05:54:33,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:33,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:33,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 05:54:33,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 05:54:33,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:33,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:34,011 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:54:34,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:34,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436325986] [2025-03-09 05:54:34,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436325986] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:54:34,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142970528] [2025-03-09 05:54:34,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:34,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:54:34,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:54:34,014 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:54:34,016 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:54:34,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 05:54:34,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 05:54:34,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:34,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:34,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 1083 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:54:34,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:54:34,414 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:54:34,414 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:54:34,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142970528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:54:34,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:54:34,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-09 05:54:34,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159058405] [2025-03-09 05:54:34,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:54:34,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 05:54:34,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:34,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 05:54:34,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:54:34,417 INFO L87 Difference]: Start difference. First operand 67 states and 78 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:54:34,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:34,441 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2025-03-09 05:54:34,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 05:54:34,442 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:54:34,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:34,442 INFO L225 Difference]: With dead ends: 67 [2025-03-09 05:54:34,443 INFO L226 Difference]: Without dead ends: 66 [2025-03-09 05:54:34,443 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:54:34,443 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 1 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:54:34,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 137 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:54:34,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-09 05:54:34,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-03-09 05:54:34,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 60 states have internal predecessors, (71), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 05:54:34,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2025-03-09 05:54:34,449 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 7 [2025-03-09 05:54:34,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:34,449 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 77 transitions. [2025-03-09 05:54:34,449 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:54:34,449 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2025-03-09 05:54:34,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 05:54:34,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:34,452 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-03-09 05:54:34,461 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:54:34,652 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:54:34,653 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 38 more)] === [2025-03-09 05:54:34,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:34,655 INFO L85 PathProgramCache]: Analyzing trace with hash 965697729, now seen corresponding path program 1 times [2025-03-09 05:54:34,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:34,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507310453] [2025-03-09 05:54:34,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:34,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:34,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 05:54:34,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 05:54:34,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:34,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:34,905 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:54:34,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:34,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507310453] [2025-03-09 05:54:34,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507310453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:54:34,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:54:34,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:54:34,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889124545] [2025-03-09 05:54:34,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:54:34,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:54:34,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:34,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:54:34,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:54:34,908 INFO L87 Difference]: Start difference. First operand 66 states and 77 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:54:34,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:34,923 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2025-03-09 05:54:34,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:54:34,924 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:54:34,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:34,925 INFO L225 Difference]: With dead ends: 66 [2025-03-09 05:54:34,925 INFO L226 Difference]: Without dead ends: 65 [2025-03-09 05:54:34,925 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:54:34,926 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 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:54:34,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:54:34,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-09 05:54:34,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2025-03-09 05:54:34,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 46 states have (on average 1.4782608695652173) internal successors, (68), 57 states have internal predecessors, (68), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 05:54:34,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2025-03-09 05:54:34,937 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 8 [2025-03-09 05:54:34,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:34,938 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2025-03-09 05:54:34,938 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:54:34,938 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2025-03-09 05:54:34,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-09 05:54:34,938 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:34,938 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:54:34,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 05:54:34,938 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 38 more)] === [2025-03-09 05:54:34,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:34,939 INFO L85 PathProgramCache]: Analyzing trace with hash 938484318, now seen corresponding path program 1 times [2025-03-09 05:54:34,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:34,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842867972] [2025-03-09 05:54:34,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:34,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:35,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 05:54:35,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 05:54:35,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:35,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:35,223 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:54:35,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:35,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842867972] [2025-03-09 05:54:35,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842867972] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:54:35,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323683740] [2025-03-09 05:54:35,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:35,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:54:35,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:54:35,226 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:54:35,227 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:54:35,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 05:54:35,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 05:54:35,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:35,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:35,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 1100 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 05:54:35,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:54:35,576 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:54:35,576 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:54:35,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323683740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:54:35,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:54:35,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-09 05:54:35,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233972077] [2025-03-09 05:54:35,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:54:35,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:54:35,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:35,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:54:35,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:54:35,580 INFO L87 Difference]: Start difference. First operand 63 states and 74 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:54:35,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:35,610 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2025-03-09 05:54:35,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:54:35,613 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:54:35,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:35,614 INFO L225 Difference]: With dead ends: 63 [2025-03-09 05:54:35,614 INFO L226 Difference]: Without dead ends: 61 [2025-03-09 05:54:35,614 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:54:35,615 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 46 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 80 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:54:35,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 80 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:54:35,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-09 05:54:35,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-03-09 05:54:35,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 46 states have (on average 1.434782608695652) internal successors, (66), 55 states have internal predecessors, (66), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 05:54:35,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2025-03-09 05:54:35,623 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 12 [2025-03-09 05:54:35,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:35,625 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2025-03-09 05:54:35,625 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:54:35,626 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2025-03-09 05:54:35,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-09 05:54:35,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:35,626 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:54:35,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 05:54:35,830 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:54:35,830 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 38 more)] === [2025-03-09 05:54:35,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:35,831 INFO L85 PathProgramCache]: Analyzing trace with hash -971757035, now seen corresponding path program 1 times [2025-03-09 05:54:35,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:35,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581915692] [2025-03-09 05:54:35,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:35,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:35,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 05:54:35,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 05:54:35,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:35,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:36,070 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:54:36,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:36,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581915692] [2025-03-09 05:54:36,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581915692] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:54:36,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51704423] [2025-03-09 05:54:36,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:36,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:54:36,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:54:36,074 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:54:36,077 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:54:36,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 05:54:36,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 05:54:36,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:36,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:36,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 1101 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:54:36,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:54:36,464 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:54:36,465 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:54:36,497 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:54:36,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51704423] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:54:36,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:54:36,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-09 05:54:36,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881525979] [2025-03-09 05:54:36,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:54:36,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 05:54:36,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:36,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 05:54:36,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:54:36,498 INFO L87 Difference]: Start difference. First operand 61 states and 72 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:54:36,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:36,527 INFO L93 Difference]: Finished difference Result 125 states and 149 transitions. [2025-03-09 05:54:36,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:54:36,528 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:54:36,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:36,528 INFO L225 Difference]: With dead ends: 125 [2025-03-09 05:54:36,528 INFO L226 Difference]: Without dead ends: 70 [2025-03-09 05:54:36,529 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:54:36,529 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 4 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:54:36,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 134 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:54:36,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-09 05:54:36,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-03-09 05:54:36,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 64 states have internal predecessors, (75), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 05:54:36,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2025-03-09 05:54:36,533 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 13 [2025-03-09 05:54:36,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:36,534 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2025-03-09 05:54:36,534 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:54:36,534 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2025-03-09 05:54:36,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-09 05:54:36,534 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:36,534 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:54:36,542 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:54:36,735 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:54:36,735 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 38 more)] === [2025-03-09 05:54:36,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:36,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1138452644, now seen corresponding path program 2 times [2025-03-09 05:54:36,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:36,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717076029] [2025-03-09 05:54:36,736 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 05:54:36,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:36,818 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-09 05:54:36,842 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 22 statements. [2025-03-09 05:54:36,843 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 05:54:36,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:37,078 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:54:37,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:37,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717076029] [2025-03-09 05:54:37,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717076029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:54:37,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:54:37,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 05:54:37,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49653829] [2025-03-09 05:54:37,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:54:37,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 05:54:37,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:37,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 05:54:37,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:54:37,079 INFO L87 Difference]: Start difference. First operand 70 states and 81 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:54:37,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:37,125 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2025-03-09 05:54:37,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 05:54:37,126 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:54:37,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:37,126 INFO L225 Difference]: With dead ends: 70 [2025-03-09 05:54:37,126 INFO L226 Difference]: Without dead ends: 68 [2025-03-09 05:54:37,127 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:54:37,127 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 45 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:54:37,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 187 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:54:37,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-09 05:54:37,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-03-09 05:54:37,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 55 states have (on average 1.3272727272727274) internal successors, (73), 62 states have internal predecessors, (73), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 05:54:37,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2025-03-09 05:54:37,133 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 79 transitions. Word has length 22 [2025-03-09 05:54:37,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:37,133 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 79 transitions. [2025-03-09 05:54:37,133 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:54:37,133 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2025-03-09 05:54:37,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-09 05:54:37,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:37,134 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:54:37,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 05:54:37,134 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 38 more)] === [2025-03-09 05:54:37,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:37,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1926229646, now seen corresponding path program 1 times [2025-03-09 05:54:37,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:37,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250705939] [2025-03-09 05:54:37,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:37,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:37,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 05:54:37,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 05:54:37,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:37,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:37,391 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:54:37,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:37,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250705939] [2025-03-09 05:54:37,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250705939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:54:37,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:54:37,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 05:54:37,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792549034] [2025-03-09 05:54:37,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:54:37,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:54:37,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:37,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:54:37,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:54:37,393 INFO L87 Difference]: Start difference. First operand 68 states and 79 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:54:37,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:37,414 INFO L93 Difference]: Finished difference Result 119 states and 142 transitions. [2025-03-09 05:54:37,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:54:37,414 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:54:37,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:37,415 INFO L225 Difference]: With dead ends: 119 [2025-03-09 05:54:37,415 INFO L226 Difference]: Without dead ends: 71 [2025-03-09 05:54:37,415 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:54:37,416 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 2 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 127 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:54:37,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 127 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:54:37,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-09 05:54:37,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-03-09 05:54:37,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 58 states have (on average 1.3103448275862069) internal successors, (76), 65 states have internal predecessors, (76), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 05:54:37,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2025-03-09 05:54:37,424 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 27 [2025-03-09 05:54:37,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:37,425 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2025-03-09 05:54:37,425 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:54:37,425 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2025-03-09 05:54:37,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-09 05:54:37,426 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:37,426 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] [2025-03-09 05:54:37,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 05:54:37,426 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 38 more)] === [2025-03-09 05:54:37,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:37,429 INFO L85 PathProgramCache]: Analyzing trace with hash 13813060, now seen corresponding path program 1 times [2025-03-09 05:54:37,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:37,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737027322] [2025-03-09 05:54:37,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:37,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:37,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 05:54:37,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 05:54:37,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:37,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:37,652 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:54:37,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:37,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737027322] [2025-03-09 05:54:37,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737027322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:54:37,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:54:37,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:54:37,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005270961] [2025-03-09 05:54:37,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:54:37,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:54:37,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:37,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:54:37,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:54:37,654 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (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:54:37,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:37,668 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2025-03-09 05:54:37,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:54:37,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (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 29 [2025-03-09 05:54:37,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:37,669 INFO L225 Difference]: With dead ends: 76 [2025-03-09 05:54:37,669 INFO L226 Difference]: Without dead ends: 74 [2025-03-09 05:54:37,669 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:54:37,670 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 1 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:54:37,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 128 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:54:37,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-09 05:54:37,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-03-09 05:54:37,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 68 states have internal predecessors, (79), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 05:54:37,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2025-03-09 05:54:37,674 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 29 [2025-03-09 05:54:37,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:37,674 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2025-03-09 05:54:37,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (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:54:37,675 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2025-03-09 05:54:37,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 05:54:37,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:37,675 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:54:37,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 05:54:37,675 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 38 more)] === [2025-03-09 05:54:37,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:37,676 INFO L85 PathProgramCache]: Analyzing trace with hash 755592213, now seen corresponding path program 1 times [2025-03-09 05:54:37,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:37,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712596609] [2025-03-09 05:54:37,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:37,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:37,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 05:54:37,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 05:54:37,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:37,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:37,938 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-09 05:54:37,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:37,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712596609] [2025-03-09 05:54:37,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712596609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:54:37,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:54:37,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:54:37,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176086634] [2025-03-09 05:54:37,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:54:37,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:54:37,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:37,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:54:37,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:54:37,941 INFO L87 Difference]: Start difference. First operand 74 states and 85 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (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:54:37,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:37,969 INFO L93 Difference]: Finished difference Result 87 states and 100 transitions. [2025-03-09 05:54:37,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:54:37,969 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (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:54:37,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:37,970 INFO L225 Difference]: With dead ends: 87 [2025-03-09 05:54:37,970 INFO L226 Difference]: Without dead ends: 85 [2025-03-09 05:54:37,970 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:54:37,970 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 3 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:54:37,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 124 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:54:37,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-09 05:54:37,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2025-03-09 05:54:37,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 70 states have (on average 1.3142857142857143) internal successors, (92), 77 states have internal predecessors, (92), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 05:54:37,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 98 transitions. [2025-03-09 05:54:37,978 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 98 transitions. Word has length 30 [2025-03-09 05:54:37,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:37,979 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 98 transitions. [2025-03-09 05:54:37,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (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:54:37,979 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 98 transitions. [2025-03-09 05:54:37,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 05:54:37,979 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:37,979 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:54:37,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 05:54:37,980 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 38 more)] === [2025-03-09 05:54:37,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:37,980 INFO L85 PathProgramCache]: Analyzing trace with hash 755592373, now seen corresponding path program 1 times [2025-03-09 05:54:37,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:37,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340903402] [2025-03-09 05:54:37,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:37,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:38,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 05:54:38,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 05:54:38,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:38,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:38,249 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 05:54:38,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:38,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340903402] [2025-03-09 05:54:38,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340903402] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:54:38,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193592412] [2025-03-09 05:54:38,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:38,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:54:38,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:54:38,252 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:54:38,254 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:54:38,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 05:54:38,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 05:54:38,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:38,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:38,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 1286 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 05:54:38,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:54:38,697 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 05:54:38,697 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:54:38,767 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 05:54:38,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193592412] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:54:38,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:54:38,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-03-09 05:54:38,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81503179] [2025-03-09 05:54:38,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:54:38,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 05:54:38,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:38,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 05:54:38,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-09 05:54:38,769 INFO L87 Difference]: Start difference. First operand 83 states and 98 transitions. Second operand has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 05:54:38,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:38,847 INFO L93 Difference]: Finished difference Result 168 states and 204 transitions. [2025-03-09 05:54:38,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 05:54:38,848 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2025-03-09 05:54:38,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:38,849 INFO L225 Difference]: With dead ends: 168 [2025-03-09 05:54:38,849 INFO L226 Difference]: Without dead ends: 100 [2025-03-09 05:54:38,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-09 05:54:38,850 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 5 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:54:38,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 292 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:54:38,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-09 05:54:38,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-03-09 05:54:38,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 88 states have (on average 1.2272727272727273) internal successors, (108), 94 states have internal predecessors, (108), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 05:54:38,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2025-03-09 05:54:38,856 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 30 [2025-03-09 05:54:38,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:38,856 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2025-03-09 05:54:38,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 05:54:38,856 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2025-03-09 05:54:38,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-09 05:54:38,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:38,859 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:54:38,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 05:54:39,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:54:39,060 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 38 more)] === [2025-03-09 05:54:39,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:39,061 INFO L85 PathProgramCache]: Analyzing trace with hash 639693428, now seen corresponding path program 1 times [2025-03-09 05:54:39,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:39,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495354991] [2025-03-09 05:54:39,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:39,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:39,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-09 05:54:39,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 05:54:39,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:39,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:39,276 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:54:39,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:39,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495354991] [2025-03-09 05:54:39,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495354991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:54:39,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:54:39,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:54:39,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48562133] [2025-03-09 05:54:39,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:54:39,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:54:39,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:39,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:54:39,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:54:39,278 INFO L87 Difference]: Start difference. First operand 100 states and 114 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:54:39,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:39,291 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2025-03-09 05:54:39,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:54:39,293 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:54:39,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:39,293 INFO L225 Difference]: With dead ends: 100 [2025-03-09 05:54:39,293 INFO L226 Difference]: Without dead ends: 99 [2025-03-09 05:54:39,293 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:54:39,294 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 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:54:39,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:54:39,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-09 05:54:39,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2025-03-09 05:54:39,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 84 states have (on average 1.2142857142857142) internal successors, (102), 89 states have internal predecessors, (102), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 05:54:39,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2025-03-09 05:54:39,299 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 49 [2025-03-09 05:54:39,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:39,299 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2025-03-09 05:54:39,299 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:54:39,299 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2025-03-09 05:54:39,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-09 05:54:39,299 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:39,300 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, 1, 1] [2025-03-09 05:54:39,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 05:54:39,300 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 38 more)] === [2025-03-09 05:54:39,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:39,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1563954739, now seen corresponding path program 1 times [2025-03-09 05:54:39,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:39,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281643313] [2025-03-09 05:54:39,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:39,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:39,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-09 05:54:39,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 05:54:39,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:39,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:39,536 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:54:39,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:39,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281643313] [2025-03-09 05:54:39,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281643313] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:54:39,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621076353] [2025-03-09 05:54:39,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:39,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:54:39,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:54:39,539 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:54:39,541 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:54:39,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-09 05:54:39,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 05:54:39,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:39,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:39,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 1364 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 05:54:39,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:54:39,949 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-09 05:54:39,951 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:54:39,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621076353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:54:39,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:54:39,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3] total 7 [2025-03-09 05:54:39,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713732524] [2025-03-09 05:54:39,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:54:39,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 05:54:39,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:39,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 05:54:39,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:54:39,953 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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:54:40,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:40,012 INFO L93 Difference]: Finished difference Result 124 states and 145 transitions. [2025-03-09 05:54:40,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 05:54:40,012 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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 50 [2025-03-09 05:54:40,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:40,013 INFO L225 Difference]: With dead ends: 124 [2025-03-09 05:54:40,013 INFO L226 Difference]: Without dead ends: 115 [2025-03-09 05:54:40,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:54:40,014 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 29 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:54:40,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 235 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:54:40,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-09 05:54:40,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 96. [2025-03-09 05:54:40,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 85 states have (on average 1.2117647058823529) internal successors, (103), 90 states have internal predecessors, (103), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 05:54:40,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 109 transitions. [2025-03-09 05:54:40,029 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 109 transitions. Word has length 50 [2025-03-09 05:54:40,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:40,029 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 109 transitions. [2025-03-09 05:54:40,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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:54:40,029 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 109 transitions. [2025-03-09 05:54:40,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-09 05:54:40,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:40,030 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] [2025-03-09 05:54:40,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-09 05:54:40,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-09 05:54:40,231 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 38 more)] === [2025-03-09 05:54:40,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:40,231 INFO L85 PathProgramCache]: Analyzing trace with hash -585295280, now seen corresponding path program 1 times [2025-03-09 05:54:40,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:40,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494565171] [2025-03-09 05:54:40,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:40,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:40,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-09 05:54:40,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-09 05:54:40,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:40,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:40,570 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:54:40,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:40,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494565171] [2025-03-09 05:54:40,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494565171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:54:40,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:54:40,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 05:54:40,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883766891] [2025-03-09 05:54:40,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:54:40,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 05:54:40,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:40,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 05:54:40,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:54:40,572 INFO L87 Difference]: Start difference. First operand 96 states and 109 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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:54:40,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:40,597 INFO L93 Difference]: Finished difference Result 130 states and 150 transitions. [2025-03-09 05:54:40,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 05:54:40,597 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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 52 [2025-03-09 05:54:40,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:40,598 INFO L225 Difference]: With dead ends: 130 [2025-03-09 05:54:40,598 INFO L226 Difference]: Without dead ends: 99 [2025-03-09 05:54:40,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:54:40,598 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:54:40,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 247 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:54:40,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-09 05:54:40,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-03-09 05:54:40,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 88 states have (on average 1.2045454545454546) internal successors, (106), 93 states have internal predecessors, (106), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 05:54:40,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2025-03-09 05:54:40,603 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 52 [2025-03-09 05:54:40,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:40,603 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2025-03-09 05:54:40,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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:54:40,604 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2025-03-09 05:54:40,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-09 05:54:40,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:40,604 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, 1] [2025-03-09 05:54:40,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 05:54:40,604 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting bb_verror_msgErr27ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 38 more)] === [2025-03-09 05:54:40,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:40,608 INFO L85 PathProgramCache]: Analyzing trace with hash 242134488, now seen corresponding path program 1 times [2025-03-09 05:54:40,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:40,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709963916] [2025-03-09 05:54:40,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:40,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:40,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-09 05:54:40,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-09 05:54:40,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:40,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:40,900 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:54:40,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:40,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709963916] [2025-03-09 05:54:40,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709963916] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:54:40,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:54:40,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 05:54:40,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107800965] [2025-03-09 05:54:40,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:54:40,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 05:54:40,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:40,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 05:54:40,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:54:40,901 INFO L87 Difference]: Start difference. First operand 99 states and 112 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:54:40,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:40,919 INFO L93 Difference]: Finished difference Result 102 states and 114 transitions. [2025-03-09 05:54:40,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 05:54:40,919 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2025-03-09 05:54:40,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:40,920 INFO L225 Difference]: With dead ends: 102 [2025-03-09 05:54:40,920 INFO L226 Difference]: Without dead ends: 99 [2025-03-09 05:54:40,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:54:40,920 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 17 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:54:40,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 231 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:54:40,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-09 05:54:40,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-03-09 05:54:40,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 88 states have (on average 1.1931818181818181) internal successors, (105), 93 states have internal predecessors, (105), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 05:54:40,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2025-03-09 05:54:40,926 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 56 [2025-03-09 05:54:40,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:40,926 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2025-03-09 05:54:40,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:54:40,926 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2025-03-09 05:54:40,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-09 05:54:40,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:40,927 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, 1] [2025-03-09 05:54:40,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 05:54:40,927 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting bb_verror_msgErr27ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 38 more)] === [2025-03-09 05:54:40,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:40,928 INFO L85 PathProgramCache]: Analyzing trace with hash 242135449, now seen corresponding path program 1 times [2025-03-09 05:54:40,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:40,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829677528] [2025-03-09 05:54:40,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:40,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:41,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-09 05:54:41,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-09 05:54:41,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:41,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:41,357 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:54:41,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:41,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829677528] [2025-03-09 05:54:41,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829677528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:54:41,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:54:41,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 05:54:41,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998108539] [2025-03-09 05:54:41,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:54:41,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 05:54:41,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:41,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 05:54:41,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:54:41,359 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:54:41,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:41,423 INFO L93 Difference]: Finished difference Result 133 states and 150 transitions. [2025-03-09 05:54:41,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:54:41,424 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2025-03-09 05:54:41,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:41,425 INFO L225 Difference]: With dead ends: 133 [2025-03-09 05:54:41,425 INFO L226 Difference]: Without dead ends: 98 [2025-03-09 05:54:41,425 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:54:41,425 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 47 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:54:41,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 216 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:54:41,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-09 05:54:41,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-03-09 05:54:41,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 87 states have (on average 1.1839080459770115) internal successors, (103), 92 states have internal predecessors, (103), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 05:54:41,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2025-03-09 05:54:41,431 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 56 [2025-03-09 05:54:41,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:41,431 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2025-03-09 05:54:41,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:54:41,432 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2025-03-09 05:54:41,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-09 05:54:41,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:41,432 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:54:41,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 05:54:41,432 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 38 more)] === [2025-03-09 05:54:41,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:41,433 INFO L85 PathProgramCache]: Analyzing trace with hash -402882326, now seen corresponding path program 1 times [2025-03-09 05:54:41,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:41,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313195846] [2025-03-09 05:54:41,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:41,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:41,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-09 05:54:41,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 05:54:41,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:41,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:41,641 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-09 05:54:41,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:41,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313195846] [2025-03-09 05:54:41,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313195846] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:54:41,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319191968] [2025-03-09 05:54:41,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:41,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:54:41,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:54:41,644 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:54:41,645 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:54:41,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-09 05:54:42,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 05:54:42,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:42,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:42,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 1455 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:54:42,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:54:42,129 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-09 05:54:42,129 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:54:42,152 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-09 05:54:42,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319191968] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:54:42,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:54:42,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-09 05:54:42,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844060596] [2025-03-09 05:54:42,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:54:42,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 05:54:42,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:42,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 05:54:42,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:54:42,155 INFO L87 Difference]: Start difference. First operand 98 states and 109 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:54:42,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:42,182 INFO L93 Difference]: Finished difference Result 171 states and 196 transitions. [2025-03-09 05:54:42,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:54:42,183 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:54:42,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:42,184 INFO L225 Difference]: With dead ends: 171 [2025-03-09 05:54:42,184 INFO L226 Difference]: Without dead ends: 116 [2025-03-09 05:54:42,184 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:54:42,185 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 4 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:54:42,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 183 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:54:42,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-09 05:54:42,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-03-09 05:54:42,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 105 states have (on average 1.1523809523809523) internal successors, (121), 110 states have internal predecessors, (121), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 05:54:42,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 127 transitions. [2025-03-09 05:54:42,192 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 127 transitions. Word has length 55 [2025-03-09 05:54:42,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:42,192 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 127 transitions. [2025-03-09 05:54:42,193 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:54:42,193 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 127 transitions. [2025-03-09 05:54:42,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-09 05:54:42,193 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:42,193 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 2, 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:54:42,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 05:54:42,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-09 05:54:42,394 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 38 more)] === [2025-03-09 05:54:42,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:42,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1034921237, now seen corresponding path program 1 times [2025-03-09 05:54:42,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:42,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302034497] [2025-03-09 05:54:42,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:42,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:42,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-09 05:54:42,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-09 05:54:42,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:42,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:42,651 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-03-09 05:54:42,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:42,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302034497] [2025-03-09 05:54:42,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302034497] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:54:42,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050605429] [2025-03-09 05:54:42,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:42,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:54:42,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:54:42,655 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:54:42,657 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:54:43,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-09 05:54:43,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-09 05:54:43,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:43,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:43,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 1506 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 05:54:43,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:54:43,253 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-09 05:54:43,253 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:54:43,333 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-09 05:54:43,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050605429] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:54:43,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:54:43,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-03-09 05:54:43,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613285965] [2025-03-09 05:54:43,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:54:43,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 05:54:43,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:43,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 05:54:43,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-09 05:54:43,335 INFO L87 Difference]: Start difference. First operand 116 states and 127 transitions. Second operand has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 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:54:43,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:43,425 INFO L93 Difference]: Finished difference Result 215 states and 247 transitions. [2025-03-09 05:54:43,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 05:54:43,425 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 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 66 [2025-03-09 05:54:43,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:43,426 INFO L225 Difference]: With dead ends: 215 [2025-03-09 05:54:43,426 INFO L226 Difference]: Without dead ends: 151 [2025-03-09 05:54:43,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-09 05:54:43,427 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 5 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:54:43,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 390 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:54:43,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-09 05:54:43,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2025-03-09 05:54:43,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 141 states have (on average 1.1063829787234043) internal successors, (156), 145 states have internal predecessors, (156), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 05:54:43,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 162 transitions. [2025-03-09 05:54:43,432 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 162 transitions. Word has length 66 [2025-03-09 05:54:43,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:43,433 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 162 transitions. [2025-03-09 05:54:43,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 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:54:43,433 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 162 transitions. [2025-03-09 05:54:43,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-09 05:54:43,433 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:43,433 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 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:54:43,443 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:54:43,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:54:43,634 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 38 more)] === [2025-03-09 05:54:43,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:43,634 INFO L85 PathProgramCache]: Analyzing trace with hash -410024370, now seen corresponding path program 1 times [2025-03-09 05:54:43,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:43,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551254775] [2025-03-09 05:54:43,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:43,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:43,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-09 05:54:43,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-09 05:54:43,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:43,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:43,867 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-09 05:54:43,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:43,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551254775] [2025-03-09 05:54:43,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551254775] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:54:43,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701933549] [2025-03-09 05:54:43,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:43,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:54:43,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:54:43,870 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:54:43,871 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:54:44,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-09 05:54:44,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-09 05:54:44,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:44,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:44,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 1645 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:54:44,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:54:44,463 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-09 05:54:44,464 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:54:44,483 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-09 05:54:44,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701933549] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:54:44,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:54:44,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-09 05:54:44,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781093973] [2025-03-09 05:54:44,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:54:44,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 05:54:44,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:44,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 05:54:44,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:54:44,485 INFO L87 Difference]: Start difference. First operand 151 states and 162 transitions. Second operand has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 7 states have internal predecessors, (40), 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:54:44,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:44,514 INFO L93 Difference]: Finished difference Result 161 states and 174 transitions. [2025-03-09 05:54:44,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:54:44,514 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 7 states have internal predecessors, (40), 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 85 [2025-03-09 05:54:44,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:44,515 INFO L225 Difference]: With dead ends: 161 [2025-03-09 05:54:44,515 INFO L226 Difference]: Without dead ends: 160 [2025-03-09 05:54:44,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 166 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:54:44,516 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:54:44,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 180 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:54:44,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-09 05:54:44,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2025-03-09 05:54:44,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 150 states have (on average 1.1) internal successors, (165), 154 states have internal predecessors, (165), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 05:54:44,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 171 transitions. [2025-03-09 05:54:44,526 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 171 transitions. Word has length 85 [2025-03-09 05:54:44,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:44,526 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 171 transitions. [2025-03-09 05:54:44,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 7 states have internal predecessors, (40), 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:54:44,526 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 171 transitions. [2025-03-09 05:54:44,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-09 05:54:44,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:44,527 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:54:44,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-09 05:54:44,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-09 05:54:44,728 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting bb_verror_msgErr27ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 38 more)] === [2025-03-09 05:54:44,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:44,729 INFO L85 PathProgramCache]: Analyzing trace with hash 871312625, now seen corresponding path program 1 times [2025-03-09 05:54:44,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:44,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447031738] [2025-03-09 05:54:44,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:44,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:44,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-09 05:54:45,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-09 05:54:45,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:45,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:49,655 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2025-03-09 05:54:49,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:49,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447031738] [2025-03-09 05:54:49,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447031738] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:54:49,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40112978] [2025-03-09 05:54:49,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:49,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:54:49,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:54:49,658 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:54:49,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 05:54:50,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-09 05:54:50,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-09 05:54:50,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:50,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:50,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 1786 conjuncts, 87 conjuncts are in the unsatisfiable core [2025-03-09 05:54:50,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:54:50,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-03-09 05:54:50,330 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 15 treesize of output 11 [2025-03-09 05:54:50,336 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 15 treesize of output 11 [2025-03-09 05:54:50,359 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-09 05:54:50,359 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:54:50,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 05:54:50,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 05:54:50,417 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 76 treesize of output 69 [2025-03-09 05:54:50,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 05:54:50,425 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 52 treesize of output 45 [2025-03-09 05:54:50,439 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-09 05:54:50,439 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 53 treesize of output 48 [2025-03-09 05:54:50,450 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-09 05:54:50,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 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:54:50,456 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 35 treesize of output 20 [2025-03-09 05:54:50,507 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-09 05:54:50,507 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 52 treesize of output 47 [2025-03-09 05:54:50,515 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 35 treesize of output 20 [2025-03-09 05:54:50,569 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-09 05:54:50,569 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 52 treesize of output 47 [2025-03-09 05:54:50,575 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 35 treesize of output 20 [2025-03-09 05:54:50,657 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-09 05:54:50,657 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 52 treesize of output 47 [2025-03-09 05:54:50,665 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 35 treesize of output 20 [2025-03-09 05:54:50,722 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-09 05:54:50,723 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 52 treesize of output 47 [2025-03-09 05:54:50,731 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 35 treesize of output 20 [2025-03-09 05:54:50,798 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-09 05:54:50,798 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 52 treesize of output 47 [2025-03-09 05:54:50,803 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 35 treesize of output 20 [2025-03-09 05:54:50,863 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-09 05:54:50,863 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 52 treesize of output 47 [2025-03-09 05:54:50,868 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 35 treesize of output 20 [2025-03-09 05:54:50,910 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-09 05:54:50,910 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 52 treesize of output 47 [2025-03-09 05:54:50,918 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 35 treesize of output 20 [2025-03-09 05:54:50,968 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-09 05:54:50,968 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 52 treesize of output 47 [2025-03-09 05:54:50,975 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 35 treesize of output 20 [2025-03-09 05:54:51,017 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-09 05:54:51,017 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 52 treesize of output 47 [2025-03-09 05:54:51,024 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 35 treesize of output 20 [2025-03-09 05:54:51,076 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-09 05:54:51,077 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 52 treesize of output 47 [2025-03-09 05:54:51,083 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 35 treesize of output 20 [2025-03-09 05:54:51,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 18 treesize of output 8 [2025-03-09 05:54:51,224 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:54:51,224 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:54:51,354 WARN L851 $PredicateComparison]: unable to prove that (or (= c_~logmode~0 0) (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_5373 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5373) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_5374 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5374) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 0)))) (< (+ |c_ULTIMATE.start_main_~i~3#1| 1) |c_ULTIMATE.start_main_~argc~0#1|)) is different from false [2025-03-09 05:54:51,402 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 ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (.cse3 (+ 8 |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_5374 (Array Int Int)) (v_ArrVal_5371 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_5371))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_5374)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_5373 (Array Int Int)) (v_ArrVal_5372 (Array Int Int)) (v_ArrVal_5371 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_5372) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_5371) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_5373) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 0)))))) is different from false [2025-03-09 05:54:51,918 WARN L851 $PredicateComparison]: unable to prove that (or (let ((.cse6 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6)) (.cse10 (+ 8 |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_5363 (Array Int Int)) (v_ArrVal_5373 (Array Int Int)) (v_ArrVal_5365 (Array Int Int)) (v_ArrVal_5364 (Array Int Int)) (v_ArrVal_5367 (Array Int Int)) (v_ArrVal_5366 (Array Int Int)) (v_ArrVal_5369 (Array Int Int)) (v_ArrVal_5368 (Array Int Int)) (v_ArrVal_5370 (Array Int Int)) (v_ArrVal_5372 (Array Int Int)) (v_ArrVal_5371 (Array Int Int))) (= (select (select (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5363))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse8 (store .cse9 .cse1 v_ArrVal_5365))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_5368))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse5 (store .cse7 .cse3 v_ArrVal_5369))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (store (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5364) .cse1 v_ArrVal_5366) .cse2 v_ArrVal_5367) .cse3 v_ArrVal_5370) .cse4 v_ArrVal_5372) (select (select (store .cse5 .cse4 v_ArrVal_5371) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6) v_ArrVal_5373))))))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10) 0)) (forall ((v_ArrVal_5363 (Array Int Int)) (v_ArrVal_5374 (Array Int Int)) (v_ArrVal_5365 (Array Int Int)) (v_ArrVal_5369 (Array Int Int)) (v_ArrVal_5368 (Array Int Int)) (v_ArrVal_5371 (Array Int Int))) (= (select (select (let ((.cse11 (let ((.cse12 (let ((.cse13 (let ((.cse14 (let ((.cse15 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5363))) (store .cse15 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6) v_ArrVal_5365)))) (store .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6) v_ArrVal_5368)))) (store .cse13 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6) v_ArrVal_5369)))) (store .cse12 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6) v_ArrVal_5371)))) (store .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6) v_ArrVal_5374)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10) 0))))) (= c_~logmode~0 0) (< (+ |c_ULTIMATE.start_main_~i~3#1| 1) |c_ULTIMATE.start_main_~argc~0#1|)) is different from false [2025-03-09 05:54:51,994 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 ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (.cse8 (+ 8 |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_5363 (Array Int Int)) (v_ArrVal_5374 (Array Int Int)) (v_ArrVal_5362 (Array Int Int)) (v_ArrVal_5365 (Array Int Int)) (v_ArrVal_5369 (Array Int Int)) (v_ArrVal_5368 (Array Int Int)) (v_ArrVal_5371 (Array Int Int))) (= (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse7 v_ArrVal_5362))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_5363)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_5365)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_5368)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_5369)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_5371)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_5374)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8) 0)) (forall ((v_ArrVal_5370 (Array Int Int)) (v_ArrVal_5361 (Array Int Int)) (v_ArrVal_5372 (Array Int Int)) (v_ArrVal_5371 (Array Int Int)) (v_ArrVal_5363 (Array Int Int)) (v_ArrVal_5362 (Array Int Int)) (v_ArrVal_5373 (Array Int Int)) (v_ArrVal_5365 (Array Int Int)) (v_ArrVal_5364 (Array Int Int)) (v_ArrVal_5367 (Array Int Int)) (v_ArrVal_5366 (Array Int Int)) (v_ArrVal_5369 (Array Int Int)) (v_ArrVal_5368 (Array Int Int))) (= (select (select (let ((.cse18 (store |c_#memory_$Pointer$.base| .cse7 v_ArrVal_5362))) (let ((.cse9 (select (select .cse18 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse17 (store .cse18 .cse9 v_ArrVal_5363))) (let ((.cse10 (select (select .cse17 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse16 (store .cse17 .cse10 v_ArrVal_5365))) (let ((.cse11 (select (select .cse16 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse15 (store .cse16 .cse11 v_ArrVal_5368))) (let ((.cse12 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse14 (store .cse15 .cse12 v_ArrVal_5369))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (store (store (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse7 v_ArrVal_5361) .cse9 v_ArrVal_5364) .cse10 v_ArrVal_5366) .cse11 v_ArrVal_5367) .cse12 v_ArrVal_5370) .cse13 v_ArrVal_5372) (select (select (store .cse14 .cse13 v_ArrVal_5371) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_5373))))))))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8) 0))))) (= c_~logmode~0 0) (< (+ |c_ULTIMATE.start_main_~i~3#1| 1) |c_ULTIMATE.start_main_~argc~0#1|)) is different from false [2025-03-09 05:55:14,851 WARN L851 $PredicateComparison]: unable to prove that (or (= c_~logmode~0 0) (let ((.cse10 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10)) (.cse18 (+ 8 |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_5370 (Array Int Int)) (v_ArrVal_5361 (Array Int Int)) (v_ArrVal_5372 (Array Int Int)) (v_ArrVal_5360 (Array Int Int)) (v_ArrVal_5371 (Array Int Int)) (v_ArrVal_5363 (Array Int Int)) (v_ArrVal_5362 (Array Int Int)) (v_ArrVal_5373 (Array Int Int)) (v_ArrVal_5365 (Array Int Int)) (v_ArrVal_5364 (Array Int Int)) (v_ArrVal_5356 (Array Int Int)) (v_ArrVal_5367 (Array Int Int)) (v_ArrVal_5355 (Array Int Int)) (v_ArrVal_5366 (Array Int Int)) (v_ArrVal_5358 (Array Int Int)) (v_ArrVal_5369 (Array Int Int)) (v_ArrVal_5357 (Array Int Int)) (v_ArrVal_5368 (Array Int Int)) (v_ArrVal_5359 (Array Int Int))) (= (select (select (let ((.cse17 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5356))) (let ((.cse1 (select (select .cse17 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse16 (store .cse17 .cse1 v_ArrVal_5358))) (let ((.cse2 (select (select .cse16 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse15 (store .cse16 .cse2 v_ArrVal_5360))) (let ((.cse3 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse14 (store .cse15 .cse3 v_ArrVal_5362))) (let ((.cse4 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse13 (store .cse14 .cse4 v_ArrVal_5363))) (let ((.cse5 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse12 (store .cse13 .cse5 v_ArrVal_5365))) (let ((.cse6 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse11 (store .cse12 .cse6 v_ArrVal_5368))) (let ((.cse7 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse9 (store .cse11 .cse7 v_ArrVal_5369))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (store (store (store (store (store (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5355) .cse1 v_ArrVal_5357) .cse2 v_ArrVal_5359) .cse3 v_ArrVal_5361) .cse4 v_ArrVal_5364) .cse5 v_ArrVal_5366) .cse6 v_ArrVal_5367) .cse7 v_ArrVal_5370) .cse8 v_ArrVal_5372) (select (select (store .cse9 .cse8 v_ArrVal_5371) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10) v_ArrVal_5373))))))))))))))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse18) 0)) (forall ((v_ArrVal_5363 (Array Int Int)) (v_ArrVal_5374 (Array Int Int)) (v_ArrVal_5362 (Array Int Int)) (v_ArrVal_5365 (Array Int Int)) (v_ArrVal_5356 (Array Int Int)) (v_ArrVal_5358 (Array Int Int)) (v_ArrVal_5369 (Array Int Int)) (v_ArrVal_5368 (Array Int Int)) (v_ArrVal_5360 (Array Int Int)) (v_ArrVal_5371 (Array Int Int))) (= (select (select (let ((.cse19 (let ((.cse20 (let ((.cse21 (let ((.cse22 (let ((.cse23 (let ((.cse24 (let ((.cse25 (let ((.cse26 (let ((.cse27 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5356))) (store .cse27 (select (select .cse27 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10) v_ArrVal_5358)))) (store .cse26 (select (select .cse26 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10) v_ArrVal_5360)))) (store .cse25 (select (select .cse25 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10) v_ArrVal_5362)))) (store .cse24 (select (select .cse24 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10) v_ArrVal_5363)))) (store .cse23 (select (select .cse23 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10) v_ArrVal_5365)))) (store .cse22 (select (select .cse22 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10) v_ArrVal_5368)))) (store .cse21 (select (select .cse21 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10) v_ArrVal_5369)))) (store .cse20 (select (select .cse20 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10) v_ArrVal_5371)))) (store .cse19 (select (select .cse19 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10) v_ArrVal_5374)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse18) 0))))) (< (+ |c_ULTIMATE.start_main_~i~3#1| 1) |c_ULTIMATE.start_main_~argc~0#1|)) is different from false [2025-03-09 05:55:16,534 INFO L349 Elim1Store]: treesize reduction 68, result has 58.8 percent of original size [2025-03-09 05:55:16,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 180287 treesize of output 41202 [2025-03-09 05:55:16,975 INFO L349 Elim1Store]: treesize reduction 34, result has 59.0 percent of original size [2025-03-09 05:55:16,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 49283 treesize of output 49264