./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-dietlibc/strtoull.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/termination-dietlibc/strtoull.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 a24f374d1420975a1e7754ddde980f0b5d764d7e3a740acbfbc8098c38afffcd --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:53:04,671 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:53:04,726 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-09 01:53:04,729 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:53:04,729 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:53:04,745 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:53:04,746 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:53:04,746 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:53:04,746 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:53:04,746 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:53:04,747 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:53:04,747 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:53:04,747 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:53:04,747 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:53:04,748 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:53:04,748 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:53:04,748 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 01:53:04,748 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:53:04,748 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:53:04,748 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 01:53:04,749 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:53:04,749 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 01:53:04,749 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 01:53:04,749 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:53:04,749 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 01:53:04,749 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:53:04,749 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:53:04,749 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:53:04,749 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:53:04,749 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:53:04,750 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:53:04,750 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:53:04,750 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:53:04,750 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:53:04,750 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 01:53:04,750 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 01:53:04,750 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:53:04,751 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:53:04,751 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:53:04,751 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:53:04,751 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:53:04,751 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:53:04,751 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 -> a24f374d1420975a1e7754ddde980f0b5d764d7e3a740acbfbc8098c38afffcd [2025-03-09 01:53:04,968 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:53:04,978 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:53:04,982 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:53:04,982 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:53:04,983 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:53:04,983 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-dietlibc/strtoull.i [2025-03-09 01:53:06,115 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87840b8ad/38a984c587b14753af7f376d55d674a5/FLAG7795412d2 [2025-03-09 01:53:06,415 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:53:06,416 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-dietlibc/strtoull.i [2025-03-09 01:53:06,429 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87840b8ad/38a984c587b14753af7f376d55d674a5/FLAG7795412d2 [2025-03-09 01:53:06,693 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87840b8ad/38a984c587b14753af7f376d55d674a5 [2025-03-09 01:53:06,695 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:53:06,696 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:53:06,697 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:53:06,697 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:53:06,700 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:53:06,701 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:53:06" (1/1) ... [2025-03-09 01:53:06,701 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@736f61e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:53:06, skipping insertion in model container [2025-03-09 01:53:06,701 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:53:06" (1/1) ... [2025-03-09 01:53:06,728 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:53:06,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:53:06,923 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:53:06,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:53:06,985 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:53:06,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:53:06 WrapperNode [2025-03-09 01:53:06,985 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:53:06,986 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:53:06,986 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:53:06,986 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:53:06,990 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:53:06" (1/1) ... [2025-03-09 01:53:06,998 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:53:06" (1/1) ... [2025-03-09 01:53:07,013 INFO L138 Inliner]: procedures = 116, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 182 [2025-03-09 01:53:07,014 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:53:07,014 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:53:07,014 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:53:07,014 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:53:07,025 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:53:06" (1/1) ... [2025-03-09 01:53:07,025 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:53:06" (1/1) ... [2025-03-09 01:53:07,027 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:53:06" (1/1) ... [2025-03-09 01:53:07,039 INFO L175 MemorySlicer]: Split 13 memory accesses to 2 slices as follows [2, 11]. 85 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1, 0]. The 3 writes are split as follows [1, 2]. [2025-03-09 01:53:07,039 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:53:06" (1/1) ... [2025-03-09 01:53:07,039 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:53:06" (1/1) ... [2025-03-09 01:53:07,045 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:53:06" (1/1) ... [2025-03-09 01:53:07,046 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:53:06" (1/1) ... [2025-03-09 01:53:07,047 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:53:06" (1/1) ... [2025-03-09 01:53:07,047 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:53:06" (1/1) ... [2025-03-09 01:53:07,049 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:53:07,049 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:53:07,049 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:53:07,049 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:53:07,050 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:53:06" (1/1) ... [2025-03-09 01:53:07,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:53:07,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:53:07,075 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 01:53:07,076 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 01:53:07,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:53:07,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:53:07,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:53:07,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:53:07,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 01:53:07,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-09 01:53:07,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-09 01:53:07,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 01:53:07,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-09 01:53:07,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-09 01:53:07,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:53:07,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:53:07,172 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:53:07,174 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:53:07,461 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L548: havoc strtoull_#t~ite20#1; [2025-03-09 01:53:07,462 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L561: havoc main_#t~ret26#1;call ULTIMATE.dealloc(main_#t~malloc22#1.base, main_#t~malloc22#1.offset);havoc main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call ULTIMATE.dealloc(main_~#end~0#1.base, main_~#end~0#1.offset);havoc main_~#end~0#1.base, main_~#end~0#1.offset; [2025-03-09 01:53:07,490 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2025-03-09 01:53:07,490 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:53:07,497 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:53:07,497 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:53:07,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:53:07 BoogieIcfgContainer [2025-03-09 01:53:07,497 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:53:07,499 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:53:07,499 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:53:07,502 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:53:07,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:53:06" (1/3) ... [2025-03-09 01:53:07,502 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@502d3026 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:53:07, skipping insertion in model container [2025-03-09 01:53:07,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:53:06" (2/3) ... [2025-03-09 01:53:07,503 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@502d3026 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:53:07, skipping insertion in model container [2025-03-09 01:53:07,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:53:07" (3/3) ... [2025-03-09 01:53:07,504 INFO L128 eAbstractionObserver]: Analyzing ICFG strtoull.i [2025-03-09 01:53:07,516 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:53:07,517 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG strtoull.i that has 1 procedures, 88 locations, 1 initial locations, 3 loop locations, and 26 error locations. [2025-03-09 01:53:07,558 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:53:07,565 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;@4da9eb41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:53:07,566 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-03-09 01:53:07,569 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 61 states have (on average 1.8032786885245902) internal successors, (110), 87 states have internal predecessors, (110), 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 01:53:07,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-09 01:53:07,572 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:53:07,573 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-09 01:53:07,574 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-03-09 01:53:07,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:53:07,578 INFO L85 PathProgramCache]: Analyzing trace with hash 4770490, now seen corresponding path program 1 times [2025-03-09 01:53:07,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:53:07,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885240695] [2025-03-09 01:53:07,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:53:07,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:53:07,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 01:53:07,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 01:53:07,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:53:07,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:53:07,728 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 01:53:07,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:53:07,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885240695] [2025-03-09 01:53:07,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885240695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:53:07,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:53:07,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:53:07,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814568434] [2025-03-09 01:53:07,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:53:07,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:53:07,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:53:07,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:53:07,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:53:07,750 INFO L87 Difference]: Start difference. First operand has 88 states, 61 states have (on average 1.8032786885245902) internal successors, (110), 87 states have internal predecessors, (110), 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) 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 01:53:07,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:53:07,797 INFO L93 Difference]: Finished difference Result 153 states and 205 transitions. [2025-03-09 01:53:07,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:53:07,800 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 01:53:07,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:53:07,806 INFO L225 Difference]: With dead ends: 153 [2025-03-09 01:53:07,806 INFO L226 Difference]: Without dead ends: 71 [2025-03-09 01:53:07,808 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 01:53:07,812 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 10 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:53:07,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 165 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:53:07,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-09 01:53:07,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-03-09 01:53:07,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 57 states have (on average 1.5263157894736843) internal successors, (87), 70 states have internal predecessors, (87), 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 01:53:07,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 87 transitions. [2025-03-09 01:53:07,847 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 87 transitions. Word has length 4 [2025-03-09 01:53:07,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:53:07,848 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 87 transitions. [2025-03-09 01:53:07,848 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 01:53:07,848 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 87 transitions. [2025-03-09 01:53:07,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-09 01:53:07,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:53:07,849 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 01:53:07,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:53:07,850 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-03-09 01:53:07,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:53:07,852 INFO L85 PathProgramCache]: Analyzing trace with hash 147885274, now seen corresponding path program 1 times [2025-03-09 01:53:07,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:53:07,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880506046] [2025-03-09 01:53:07,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:53:07,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:53:07,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:53:07,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:53:07,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:53:07,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:53:07,895 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 01:53:07,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:53:07,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880506046] [2025-03-09 01:53:07,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880506046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:53:07,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:53:07,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:53:07,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612439999] [2025-03-09 01:53:07,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:53:07,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:53:07,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:53:07,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:53:07,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:53:07,898 INFO L87 Difference]: Start difference. First operand 71 states and 87 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 01:53:07,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:53:07,929 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2025-03-09 01:53:07,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:53:07,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2025-03-09 01:53:07,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:53:07,930 INFO L225 Difference]: With dead ends: 71 [2025-03-09 01:53:07,931 INFO L226 Difference]: Without dead ends: 69 [2025-03-09 01:53:07,931 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 01:53:07,931 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 9 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:53:07,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 150 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:53:07,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-09 01:53:07,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-03-09 01:53:07,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 57 states have (on average 1.4912280701754386) internal successors, (85), 68 states have internal predecessors, (85), 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 01:53:07,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 85 transitions. [2025-03-09 01:53:07,943 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 85 transitions. Word has length 5 [2025-03-09 01:53:07,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:53:07,944 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 85 transitions. [2025-03-09 01:53:07,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 01:53:07,944 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2025-03-09 01:53:07,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-09 01:53:07,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:53:07,944 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:53:07,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:53:07,945 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-03-09 01:53:07,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:53:07,946 INFO L85 PathProgramCache]: Analyzing trace with hash 383830197, now seen corresponding path program 1 times [2025-03-09 01:53:07,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:53:07,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920102699] [2025-03-09 01:53:07,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:53:07,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:53:07,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 01:53:07,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 01:53:07,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:53:07,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:53:08,030 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 01:53:08,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:53:08,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920102699] [2025-03-09 01:53:08,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920102699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:53:08,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:53:08,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:53:08,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937719815] [2025-03-09 01:53:08,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:53:08,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:53:08,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:53:08,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:53:08,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:53:08,032 INFO L87 Difference]: Start difference. First operand 69 states and 85 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 01:53:08,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:53:08,064 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2025-03-09 01:53:08,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:53:08,064 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 01:53:08,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:53:08,065 INFO L225 Difference]: With dead ends: 76 [2025-03-09 01:53:08,065 INFO L226 Difference]: Without dead ends: 74 [2025-03-09 01:53:08,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:53:08,066 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 1 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:53:08,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 237 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:53:08,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-09 01:53:08,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-03-09 01:53:08,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 62 states have (on average 1.467741935483871) internal successors, (91), 73 states have internal predecessors, (91), 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 01:53:08,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2025-03-09 01:53:08,077 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 7 [2025-03-09 01:53:08,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:53:08,077 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2025-03-09 01:53:08,077 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 01:53:08,078 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2025-03-09 01:53:08,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-09 01:53:08,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:53:08,078 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 01:53:08,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:53:08,078 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-03-09 01:53:08,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:53:08,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1215252400, now seen corresponding path program 1 times [2025-03-09 01:53:08,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:53:08,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112991499] [2025-03-09 01:53:08,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:53:08,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:53:08,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:53:08,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:53:08,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:53:08,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:53:08,220 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:53:08,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:53:08,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112991499] [2025-03-09 01:53:08,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112991499] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:53:08,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914422179] [2025-03-09 01:53:08,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:53:08,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:53:08,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:53:08,223 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 01:53:08,245 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 01:53:08,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:53:08,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:53:08,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:53:08,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:53:08,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:53:08,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:53:08,363 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:53:08,364 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:53:08,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914422179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:53:08,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:53:08,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-09 01:53:08,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450227743] [2025-03-09 01:53:08,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:53:08,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:53:08,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:53:08,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:53:08,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:53:08,366 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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 01:53:08,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:53:08,403 INFO L93 Difference]: Finished difference Result 74 states and 91 transitions. [2025-03-09 01:53:08,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:53:08,404 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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 12 [2025-03-09 01:53:08,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:53:08,405 INFO L225 Difference]: With dead ends: 74 [2025-03-09 01:53:08,405 INFO L226 Difference]: Without dead ends: 73 [2025-03-09 01:53:08,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:53:08,406 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 1 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:53:08,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 317 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:53:08,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-09 01:53:08,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-03-09 01:53:08,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 62 states have (on average 1.4516129032258065) internal successors, (90), 72 states have internal predecessors, (90), 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 01:53:08,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 90 transitions. [2025-03-09 01:53:08,414 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 90 transitions. Word has length 12 [2025-03-09 01:53:08,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:53:08,414 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 90 transitions. [2025-03-09 01:53:08,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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 01:53:08,414 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2025-03-09 01:53:08,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-09 01:53:08,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:53:08,415 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-09 01:53:08,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 01:53:08,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:53:08,615 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-03-09 01:53:08,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:53:08,616 INFO L85 PathProgramCache]: Analyzing trace with hash 981881340, now seen corresponding path program 1 times [2025-03-09 01:53:08,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:53:08,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855868564] [2025-03-09 01:53:08,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:53:08,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:53:08,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:53:08,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:53:08,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:53:08,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:53:08,697 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:53:08,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:53:08,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855868564] [2025-03-09 01:53:08,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855868564] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:53:08,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907139781] [2025-03-09 01:53:08,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:53:08,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:53:08,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:53:08,699 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 01:53:08,702 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 01:53:08,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:53:08,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:53:08,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:53:08,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:53:08,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:53:08,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:53:08,770 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:53:08,770 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:53:08,809 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:53:08,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907139781] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:53:08,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:53:08,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-09 01:53:08,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39275204] [2025-03-09 01:53:08,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:53:08,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 01:53:08,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:53:08,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 01:53:08,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:53:08,811 INFO L87 Difference]: Start difference. First operand 73 states and 90 transitions. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 states have internal predecessors, (30), 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 01:53:08,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:53:08,855 INFO L93 Difference]: Finished difference Result 89 states and 111 transitions. [2025-03-09 01:53:08,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:53:08,855 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 states have internal predecessors, (30), 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 13 [2025-03-09 01:53:08,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:53:08,855 INFO L225 Difference]: With dead ends: 89 [2025-03-09 01:53:08,855 INFO L226 Difference]: Without dead ends: 88 [2025-03-09 01:53:08,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:53:08,856 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:53:08,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 549 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:53:08,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-09 01:53:08,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-03-09 01:53:08,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 77 states have (on average 1.4025974025974026) internal successors, (108), 87 states have internal predecessors, (108), 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 01:53:08,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 108 transitions. [2025-03-09 01:53:08,860 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 108 transitions. Word has length 13 [2025-03-09 01:53:08,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:53:08,860 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 108 transitions. [2025-03-09 01:53:08,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 states have internal predecessors, (30), 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 01:53:08,861 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 108 transitions. [2025-03-09 01:53:08,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-09 01:53:08,861 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:53:08,861 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:53:08,868 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 01:53:09,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:53:09,062 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-03-09 01:53:09,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:53:09,064 INFO L85 PathProgramCache]: Analyzing trace with hash 278262277, now seen corresponding path program 1 times [2025-03-09 01:53:09,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:53:09,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241631113] [2025-03-09 01:53:09,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:53:09,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:53:09,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 01:53:09,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:53:09,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:53:09,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:53:09,160 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 01:53:09,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:53:09,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241631113] [2025-03-09 01:53:09,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241631113] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:53:09,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:53:09,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:53:09,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308431626] [2025-03-09 01:53:09,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:53:09,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:53:09,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:53:09,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:53:09,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:53:09,163 INFO L87 Difference]: Start difference. First operand 88 states and 108 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 01:53:09,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:53:09,253 INFO L93 Difference]: Finished difference Result 171 states and 217 transitions. [2025-03-09 01:53:09,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:53:09,254 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 18 [2025-03-09 01:53:09,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:53:09,255 INFO L225 Difference]: With dead ends: 171 [2025-03-09 01:53:09,255 INFO L226 Difference]: Without dead ends: 128 [2025-03-09 01:53:09,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:53:09,255 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 91 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:53:09,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 163 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:53:09,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-09 01:53:09,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 121. [2025-03-09 01:53:09,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 110 states have (on average 1.4) internal successors, (154), 120 states have internal predecessors, (154), 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 01:53:09,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 154 transitions. [2025-03-09 01:53:09,264 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 154 transitions. Word has length 18 [2025-03-09 01:53:09,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:53:09,265 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 154 transitions. [2025-03-09 01:53:09,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 01:53:09,265 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 154 transitions. [2025-03-09 01:53:09,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-09 01:53:09,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:53:09,265 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:53:09,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:53:09,266 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-03-09 01:53:09,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:53:09,267 INFO L85 PathProgramCache]: Analyzing trace with hash 278292068, now seen corresponding path program 1 times [2025-03-09 01:53:09,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:53:09,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861974994] [2025-03-09 01:53:09,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:53:09,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:53:09,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 01:53:09,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:53:09,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:53:09,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:53:09,465 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 01:53:09,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:53:09,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861974994] [2025-03-09 01:53:09,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861974994] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:53:09,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:53:09,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:53:09,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569548551] [2025-03-09 01:53:09,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:53:09,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:53:09,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:53:09,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:53:09,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:53:09,467 INFO L87 Difference]: Start difference. First operand 121 states and 154 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 01:53:09,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:53:09,563 INFO L93 Difference]: Finished difference Result 297 states and 383 transitions. [2025-03-09 01:53:09,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:53:09,564 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 18 [2025-03-09 01:53:09,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:53:09,565 INFO L225 Difference]: With dead ends: 297 [2025-03-09 01:53:09,565 INFO L226 Difference]: Without dead ends: 213 [2025-03-09 01:53:09,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:53:09,567 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 62 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:53:09,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 549 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:53:09,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-03-09 01:53:09,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 128. [2025-03-09 01:53:09,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 117 states have (on average 1.3846153846153846) internal successors, (162), 127 states have internal predecessors, (162), 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 01:53:09,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 162 transitions. [2025-03-09 01:53:09,579 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 162 transitions. Word has length 18 [2025-03-09 01:53:09,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:53:09,579 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 162 transitions. [2025-03-09 01:53:09,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 01:53:09,579 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 162 transitions. [2025-03-09 01:53:09,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-09 01:53:09,579 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:53:09,579 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:53:09,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 01:53:09,579 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-03-09 01:53:09,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:53:09,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1537092096, now seen corresponding path program 1 times [2025-03-09 01:53:09,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:53:09,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300347062] [2025-03-09 01:53:09,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:53:09,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:53:09,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 01:53:09,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:53:09,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:53:09,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:53:09,744 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 01:53:09,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:53:09,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300347062] [2025-03-09 01:53:09,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300347062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:53:09,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:53:09,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:53:09,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936300342] [2025-03-09 01:53:09,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:53:09,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:53:09,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:53:09,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:53:09,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:53:09,746 INFO L87 Difference]: Start difference. First operand 128 states and 162 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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 01:53:09,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:53:09,847 INFO L93 Difference]: Finished difference Result 297 states and 382 transitions. [2025-03-09 01:53:09,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:53:09,848 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-09 01:53:09,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:53:09,849 INFO L225 Difference]: With dead ends: 297 [2025-03-09 01:53:09,849 INFO L226 Difference]: Without dead ends: 213 [2025-03-09 01:53:09,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:53:09,850 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 61 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:53:09,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 313 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:53:09,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-03-09 01:53:09,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 129. [2025-03-09 01:53:09,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 118 states have (on average 1.38135593220339) internal successors, (163), 128 states have internal predecessors, (163), 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 01:53:09,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 163 transitions. [2025-03-09 01:53:09,856 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 163 transitions. Word has length 19 [2025-03-09 01:53:09,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:53:09,856 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 163 transitions. [2025-03-09 01:53:09,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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 01:53:09,856 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 163 transitions. [2025-03-09 01:53:09,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-09 01:53:09,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:53:09,856 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:53:09,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 01:53:09,857 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-03-09 01:53:09,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:53:09,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1508462945, now seen corresponding path program 1 times [2025-03-09 01:53:09,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:53:09,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007081742] [2025-03-09 01:53:09,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:53:09,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:53:09,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 01:53:09,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:53:09,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:53:09,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:53:09,873 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 01:53:09,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 01:53:09,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:53:09,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:53:09,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:53:09,895 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 01:53:09,895 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 01:53:09,896 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 26 remaining) [2025-03-09 01:53:09,897 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 26 remaining) [2025-03-09 01:53:09,898 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 26 remaining) [2025-03-09 01:53:09,898 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 26 remaining) [2025-03-09 01:53:09,898 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 26 remaining) [2025-03-09 01:53:09,898 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 26 remaining) [2025-03-09 01:53:09,898 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 26 remaining) [2025-03-09 01:53:09,898 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 26 remaining) [2025-03-09 01:53:09,898 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 26 remaining) [2025-03-09 01:53:09,898 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 26 remaining) [2025-03-09 01:53:09,898 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 26 remaining) [2025-03-09 01:53:09,898 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 26 remaining) [2025-03-09 01:53:09,898 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 26 remaining) [2025-03-09 01:53:09,898 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 26 remaining) [2025-03-09 01:53:09,898 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 26 remaining) [2025-03-09 01:53:09,898 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 26 remaining) [2025-03-09 01:53:09,899 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 26 remaining) [2025-03-09 01:53:09,899 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 26 remaining) [2025-03-09 01:53:09,899 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 26 remaining) [2025-03-09 01:53:09,899 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 26 remaining) [2025-03-09 01:53:09,899 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 26 remaining) [2025-03-09 01:53:09,899 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 26 remaining) [2025-03-09 01:53:09,899 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 26 remaining) [2025-03-09 01:53:09,899 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 26 remaining) [2025-03-09 01:53:09,899 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 26 remaining) [2025-03-09 01:53:09,900 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 26 remaining) [2025-03-09 01:53:09,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 01:53:09,902 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:53:09,926 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 01:53:09,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 01:53:09 BoogieIcfgContainer [2025-03-09 01:53:09,931 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 01:53:09,931 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 01:53:09,931 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 01:53:09,931 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 01:53:09,932 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:53:07" (3/4) ... [2025-03-09 01:53:09,932 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-09 01:53:09,976 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 10. [2025-03-09 01:53:10,010 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 01:53:10,011 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 01:53:10,011 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 01:53:10,011 INFO L158 Benchmark]: Toolchain (without parser) took 3315.38ms. Allocated memory is still 167.8MB. Free memory was 129.0MB in the beginning and 129.4MB in the end (delta: -377.3kB). Peak memory consumption was 92.7MB. Max. memory is 16.1GB. [2025-03-09 01:53:10,011 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 192.9MB. Free memory is still 118.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:53:10,012 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.54ms. Allocated memory is still 167.8MB. Free memory was 129.0MB in the beginning and 111.6MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 01:53:10,012 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.67ms. Allocated memory is still 167.8MB. Free memory was 111.6MB in the beginning and 109.3MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:53:10,012 INFO L158 Benchmark]: Boogie Preprocessor took 34.75ms. Allocated memory is still 167.8MB. Free memory was 109.3MB in the beginning and 107.2MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:53:10,012 INFO L158 Benchmark]: IcfgBuilder took 448.08ms. Allocated memory is still 167.8MB. Free memory was 106.9MB in the beginning and 84.8MB in the end (delta: 22.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 01:53:10,012 INFO L158 Benchmark]: TraceAbstraction took 2431.99ms. Allocated memory is still 167.8MB. Free memory was 84.2MB in the beginning and 42.9MB in the end (delta: 41.3MB). Peak memory consumption was 42.4MB. Max. memory is 16.1GB. [2025-03-09 01:53:10,012 INFO L158 Benchmark]: Witness Printer took 79.57ms. Allocated memory is still 167.8MB. Free memory was 42.9MB in the beginning and 129.4MB in the end (delta: -86.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:53:10,013 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 192.9MB. Free memory is still 118.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 288.54ms. Allocated memory is still 167.8MB. Free memory was 129.0MB in the beginning and 111.6MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.67ms. Allocated memory is still 167.8MB. Free memory was 111.6MB in the beginning and 109.3MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.75ms. Allocated memory is still 167.8MB. Free memory was 109.3MB in the beginning and 107.2MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 448.08ms. Allocated memory is still 167.8MB. Free memory was 106.9MB in the beginning and 84.8MB in the end (delta: 22.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2431.99ms. Allocated memory is still 167.8MB. Free memory was 84.2MB in the beginning and 42.9MB in the end (delta: 41.3MB). Peak memory consumption was 42.4MB. Max. memory is 16.1GB. * Witness Printer took 79.57ms. Allocated memory is still 167.8MB. Free memory was 42.9MB in the beginning and 129.4MB in the end (delta: -86.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 519]: integer overflow possible integer overflow possible We found a FailurePath: [L551] int in_len = __VERIFIER_nondet_int(); [L552] COND FALSE !(in_len < 1) [L553] char* in = __builtin_alloca (in_len); [L554] int i=0; VAL [i=0, in={3:0}, in_len=1] [L554] EXPR in_len-1 VAL [i=0, in={3:0}, in_len=1] [L554] COND FALSE !(i