./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-multidimensional/init-non-constant-3-u.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-multidimensional/init-non-constant-3-u.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash df76811034b688387cfe28dd1eb6de91c21580662ac8ddb8163b41c1d6179172 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:39:48,575 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:39:48,622 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 14:39:48,625 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:39:48,626 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:39:48,639 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:39:48,639 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:39:48,639 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:39:48,640 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:39:48,640 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:39:48,640 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:39:48,640 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:39:48,640 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:39:48,640 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:39:48,640 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:39:48,640 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:39:48,641 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 14:39:48,641 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:39:48,641 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:39:48,641 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:39:48,641 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:39:48,641 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 14:39:48,641 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:39:48,641 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 14:39:48,641 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 14:39:48,641 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:39:48,641 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:39:48,641 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 14:39:48,642 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:39:48,642 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:39:48,642 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:39:48,642 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:39:48,642 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:39:48,642 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:39:48,642 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:39:48,642 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:39:48,642 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:39:48,642 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 14:39:48,642 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 14:39:48,642 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:39:48,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:39:48,643 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:39:48,643 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:39:48,643 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:39:48,643 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:39:48,643 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> df76811034b688387cfe28dd1eb6de91c21580662ac8ddb8163b41c1d6179172 [2025-03-17 14:39:48,865 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:39:48,872 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:39:48,876 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:39:48,877 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:39:48,877 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:39:48,878 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-multidimensional/init-non-constant-3-u.c [2025-03-17 14:39:50,076 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bd24cf14/091580e252cb419fa472f3057b7cabf9/FLAGd1c68ec77 [2025-03-17 14:39:50,283 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:39:50,283 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/init-non-constant-3-u.c [2025-03-17 14:39:50,290 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bd24cf14/091580e252cb419fa472f3057b7cabf9/FLAGd1c68ec77 [2025-03-17 14:39:50,305 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bd24cf14/091580e252cb419fa472f3057b7cabf9 [2025-03-17 14:39:50,307 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:39:50,308 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:39:50,310 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:39:50,310 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:39:50,313 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:39:50,314 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:39:50" (1/1) ... [2025-03-17 14:39:50,314 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a984bf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:39:50, skipping insertion in model container [2025-03-17 14:39:50,316 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:39:50" (1/1) ... [2025-03-17 14:39:50,326 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:39:50,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:39:50,452 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:39:50,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:39:50,482 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:39:50,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:39:50 WrapperNode [2025-03-17 14:39:50,483 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:39:50,484 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:39:50,484 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:39:50,484 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:39:50,488 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:39:50" (1/1) ... [2025-03-17 14:39:50,494 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:39:50" (1/1) ... [2025-03-17 14:39:50,508 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 78 [2025-03-17 14:39:50,509 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:39:50,510 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:39:50,511 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:39:50,511 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:39:50,516 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:39:50" (1/1) ... [2025-03-17 14:39:50,517 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:39:50" (1/1) ... [2025-03-17 14:39:50,521 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:39:50" (1/1) ... [2025-03-17 14:39:50,538 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [2, 2]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-17 14:39:50,538 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:39:50" (1/1) ... [2025-03-17 14:39:50,538 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:39:50" (1/1) ... [2025-03-17 14:39:50,544 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:39:50" (1/1) ... [2025-03-17 14:39:50,545 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:39:50" (1/1) ... [2025-03-17 14:39:50,546 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:39:50" (1/1) ... [2025-03-17 14:39:50,549 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:39:50" (1/1) ... [2025-03-17 14:39:50,551 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:39:50,552 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:39:50,552 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:39:50,552 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:39:50,553 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:39:50" (1/1) ... [2025-03-17 14:39:50,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:39:50,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:39:50,582 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-17 14:39:50,587 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-17 14:39:50,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:39:50,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:39:50,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 14:39:50,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 14:39:50,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 14:39:50,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 14:39:50,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:39:50,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:39:50,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 14:39:50,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 14:39:50,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 14:39:50,667 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:39:50,669 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:39:50,888 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L18: call ULTIMATE.dealloc(main_~#A~0#1.base, main_~#A~0#1.offset);havoc main_~#A~0#1.base, main_~#A~0#1.offset; [2025-03-17 14:39:50,896 INFO L? ?]: Removed 49 outVars from TransFormulas that were not future-live. [2025-03-17 14:39:50,896 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:39:50,908 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:39:50,909 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:39:50,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:39:50 BoogieIcfgContainer [2025-03-17 14:39:50,910 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:39:50,911 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:39:50,911 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:39:50,914 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:39:50,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:39:50" (1/3) ... [2025-03-17 14:39:50,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51876a0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:39:50, skipping insertion in model container [2025-03-17 14:39:50,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:39:50" (2/3) ... [2025-03-17 14:39:50,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51876a0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:39:50, skipping insertion in model container [2025-03-17 14:39:50,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:39:50" (3/3) ... [2025-03-17 14:39:50,918 INFO L128 eAbstractionObserver]: Analyzing ICFG init-non-constant-3-u.c [2025-03-17 14:39:50,929 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:39:50,930 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG init-non-constant-3-u.c that has 1 procedures, 52 locations, 1 initial locations, 6 loop locations, and 20 error locations. [2025-03-17 14:39:50,969 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:39:50,979 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;@2650f755, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:39:50,979 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-03-17 14:39:50,981 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 51 states have internal predecessors, (58), 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-17 14:39:50,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 14:39:50,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:39:50,985 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 14:39:50,986 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-17 14:39:50,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:39:50,989 INFO L85 PathProgramCache]: Analyzing trace with hash 2707948, now seen corresponding path program 1 times [2025-03-17 14:39:50,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:39:50,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140054597] [2025-03-17 14:39:50,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:50,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:39:51,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 14:39:51,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 14:39:51,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:51,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:51,159 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-17 14:39:51,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:39:51,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140054597] [2025-03-17 14:39:51,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140054597] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:39:51,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:39:51,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:39:51,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101164255] [2025-03-17 14:39:51,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:39:51,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:39:51,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:39:51,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:39:51,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:39:51,181 INFO L87 Difference]: Start difference. First operand has 52 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 51 states have internal predecessors, (58), 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 4 states, 4 states have (on average 1.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-17 14:39:51,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:39:51,318 INFO L93 Difference]: Finished difference Result 129 states and 158 transitions. [2025-03-17 14:39:51,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:39:51,320 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.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-17 14:39:51,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:39:51,324 INFO L225 Difference]: With dead ends: 129 [2025-03-17 14:39:51,324 INFO L226 Difference]: Without dead ends: 75 [2025-03-17 14:39:51,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:39:51,329 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 87 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:39:51,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 45 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:39:51,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-17 14:39:51,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2025-03-17 14:39:51,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 51 states have (on average 1.7647058823529411) internal successors, (90), 70 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-17 14:39:51,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 90 transitions. [2025-03-17 14:39:51,355 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 90 transitions. Word has length 4 [2025-03-17 14:39:51,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:39:51,355 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 90 transitions. [2025-03-17 14:39:51,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.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-17 14:39:51,356 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2025-03-17 14:39:51,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 14:39:51,356 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:39:51,357 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 14:39:51,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:39:51,358 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-17 14:39:51,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:39:51,359 INFO L85 PathProgramCache]: Analyzing trace with hash 83946006, now seen corresponding path program 1 times [2025-03-17 14:39:51,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:39:51,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809611088] [2025-03-17 14:39:51,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:51,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:39:51,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:39:51,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:39:51,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:51,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:51,424 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-17 14:39:51,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:39:51,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809611088] [2025-03-17 14:39:51,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809611088] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:39:51,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:39:51,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:39:51,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641589495] [2025-03-17 14:39:51,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:39:51,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:39:51,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:39:51,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:39:51,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:39:51,427 INFO L87 Difference]: Start difference. First operand 71 states and 90 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) 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-17 14:39:51,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:39:51,566 INFO L93 Difference]: Finished difference Result 141 states and 179 transitions. [2025-03-17 14:39:51,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:39:51,567 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) 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-17 14:39:51,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:39:51,570 INFO L225 Difference]: With dead ends: 141 [2025-03-17 14:39:51,570 INFO L226 Difference]: Without dead ends: 133 [2025-03-17 14:39:51,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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-17 14:39:51,571 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 87 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:39:51,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 62 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:39:51,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-03-17 14:39:51,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 121. [2025-03-17 14:39:51,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 101 states have (on average 1.693069306930693) internal successors, (171), 120 states have internal predecessors, (171), 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-17 14:39:51,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 171 transitions. [2025-03-17 14:39:51,589 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 171 transitions. Word has length 5 [2025-03-17 14:39:51,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:39:51,589 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 171 transitions. [2025-03-17 14:39:51,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) 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-17 14:39:51,589 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 171 transitions. [2025-03-17 14:39:51,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 14:39:51,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:39:51,590 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:39:51,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:39:51,590 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-17 14:39:51,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:39:51,593 INFO L85 PathProgramCache]: Analyzing trace with hash -932266252, now seen corresponding path program 1 times [2025-03-17 14:39:51,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:39:51,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389420507] [2025-03-17 14:39:51,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:51,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:39:51,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 14:39:51,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 14:39:51,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:51,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:51,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:39:51,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:39:51,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389420507] [2025-03-17 14:39:51,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389420507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:39:51,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:39:51,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:39:51,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691872989] [2025-03-17 14:39:51,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:39:51,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:39:51,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:39:51,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:39:51,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:39:51,708 INFO L87 Difference]: Start difference. First operand 121 states and 171 transitions. Second operand has 5 states, 4 states have (on average 1.75) 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-17 14:39:51,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:39:51,887 INFO L93 Difference]: Finished difference Result 157 states and 197 transitions. [2025-03-17 14:39:51,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:39:51,888 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) 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-17 14:39:51,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:39:51,889 INFO L225 Difference]: With dead ends: 157 [2025-03-17 14:39:51,890 INFO L226 Difference]: Without dead ends: 149 [2025-03-17 14:39:51,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:39:51,890 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 84 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 14:39:51,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 63 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 14:39:51,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-03-17 14:39:51,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 137. [2025-03-17 14:39:51,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 117 states have (on average 1.6153846153846154) internal successors, (189), 136 states have internal predecessors, (189), 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-17 14:39:51,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 189 transitions. [2025-03-17 14:39:51,905 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 189 transitions. Word has length 7 [2025-03-17 14:39:51,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:39:51,905 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 189 transitions. [2025-03-17 14:39:51,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) 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-17 14:39:51,906 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 189 transitions. [2025-03-17 14:39:51,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 14:39:51,906 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:39:51,906 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:39:51,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:39:51,906 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-17 14:39:51,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:39:51,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1757494521, now seen corresponding path program 1 times [2025-03-17 14:39:51,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:39:51,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848520715] [2025-03-17 14:39:51,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:51,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:39:51,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 14:39:51,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 14:39:51,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:51,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:51,947 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:39:51,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:39:51,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848520715] [2025-03-17 14:39:51,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848520715] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:39:51,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:39:51,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:39:51,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750046375] [2025-03-17 14:39:51,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:39:51,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:39:51,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:39:51,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:39:51,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:39:51,961 INFO L87 Difference]: Start difference. First operand 137 states and 189 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-17 14:39:52,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:39:52,032 INFO L93 Difference]: Finished difference Result 309 states and 444 transitions. [2025-03-17 14:39:52,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:39:52,032 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2025-03-17 14:39:52,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:39:52,033 INFO L225 Difference]: With dead ends: 309 [2025-03-17 14:39:52,033 INFO L226 Difference]: Without dead ends: 189 [2025-03-17 14:39:52,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:39:52,034 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 70 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:39:52,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 61 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:39:52,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-03-17 14:39:52,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 185. [2025-03-17 14:39:52,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 165 states have (on average 1.5696969696969696) internal successors, (259), 184 states have internal predecessors, (259), 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-17 14:39:52,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 259 transitions. [2025-03-17 14:39:52,052 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 259 transitions. Word has length 9 [2025-03-17 14:39:52,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:39:52,052 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 259 transitions. [2025-03-17 14:39:52,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-17 14:39:52,053 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 259 transitions. [2025-03-17 14:39:52,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 14:39:52,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:39:52,053 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:39:52,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 14:39:52,053 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-17 14:39:52,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:39:52,054 INFO L85 PathProgramCache]: Analyzing trace with hash -770668619, now seen corresponding path program 1 times [2025-03-17 14:39:52,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:39:52,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370274254] [2025-03-17 14:39:52,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:52,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:39:52,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 14:39:52,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 14:39:52,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:52,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:52,187 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-17 14:39:52,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:39:52,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370274254] [2025-03-17 14:39:52,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370274254] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:39:52,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877370139] [2025-03-17 14:39:52,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:52,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:39:52,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:39:52,190 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-17 14:39:52,191 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-17 14:39:52,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 14:39:52,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 14:39:52,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:52,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:52,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:39:52,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:39:52,360 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-17 14:39:52,360 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:39:52,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877370139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:39:52,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:39:52,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 8 [2025-03-17 14:39:52,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649164071] [2025-03-17 14:39:52,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:39:52,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:39:52,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:39:52,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:39:52,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:39:52,361 INFO L87 Difference]: Start difference. First operand 185 states and 259 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:39:52,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:39:52,474 INFO L93 Difference]: Finished difference Result 185 states and 259 transitions. [2025-03-17 14:39:52,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:39:52,475 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-17 14:39:52,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:39:52,476 INFO L225 Difference]: With dead ends: 185 [2025-03-17 14:39:52,476 INFO L226 Difference]: Without dead ends: 175 [2025-03-17 14:39:52,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:39:52,476 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 40 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:39:52,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 7 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:39:52,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-17 14:39:52,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2025-03-17 14:39:52,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 165 states have (on average 1.3272727272727274) internal successors, (219), 174 states have internal predecessors, (219), 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-17 14:39:52,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 219 transitions. [2025-03-17 14:39:52,496 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 219 transitions. Word has length 14 [2025-03-17 14:39:52,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:39:52,496 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 219 transitions. [2025-03-17 14:39:52,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:39:52,496 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 219 transitions. [2025-03-17 14:39:52,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 14:39:52,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:39:52,496 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:39:52,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 14:39:52,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:39:52,697 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-17 14:39:52,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:39:52,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1879076602, now seen corresponding path program 1 times [2025-03-17 14:39:52,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:39:52,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399375150] [2025-03-17 14:39:52,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:52,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:39:52,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:39:52,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:39:52,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:52,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:52,785 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-17 14:39:52,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:39:52,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399375150] [2025-03-17 14:39:52,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399375150] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:39:52,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812981528] [2025-03-17 14:39:52,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:52,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:39:52,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:39:52,788 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-17 14:39:52,789 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-17 14:39:52,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:39:52,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:39:52,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:52,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:52,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:39:52,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:39:52,918 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-17 14:39:52,918 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:39:52,980 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-17 14:39:52,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812981528] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:39:52,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:39:52,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-03-17 14:39:52,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272145496] [2025-03-17 14:39:52,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:39:52,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 14:39:52,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:39:52,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 14:39:52,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-17 14:39:52,981 INFO L87 Difference]: Start difference. First operand 175 states and 219 transitions. Second operand has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 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-17 14:39:53,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:39:53,421 INFO L93 Difference]: Finished difference Result 367 states and 462 transitions. [2025-03-17 14:39:53,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 14:39:53,421 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 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 15 [2025-03-17 14:39:53,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:39:53,423 INFO L225 Difference]: With dead ends: 367 [2025-03-17 14:39:53,423 INFO L226 Difference]: Without dead ends: 357 [2025-03-17 14:39:53,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=214, Invalid=386, Unknown=0, NotChecked=0, Total=600 [2025-03-17 14:39:53,424 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 386 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 14:39:53,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 57 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 14:39:53,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-03-17 14:39:53,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 347. [2025-03-17 14:39:53,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 337 states have (on average 1.2700296735905046) internal successors, (428), 346 states have internal predecessors, (428), 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-17 14:39:53,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 428 transitions. [2025-03-17 14:39:53,437 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 428 transitions. Word has length 15 [2025-03-17 14:39:53,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:39:53,438 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 428 transitions. [2025-03-17 14:39:53,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 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-17 14:39:53,438 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 428 transitions. [2025-03-17 14:39:53,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-17 14:39:53,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:39:53,439 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 14:39:53,450 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-17 14:39:53,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-17 14:39:53,643 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-17 14:39:53,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:39:53,643 INFO L85 PathProgramCache]: Analyzing trace with hash -252472452, now seen corresponding path program 1 times [2025-03-17 14:39:53,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:39:53,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372746920] [2025-03-17 14:39:53,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:53,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:39:53,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 14:39:53,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 14:39:53,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:53,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:53,698 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:39:53,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:39:53,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372746920] [2025-03-17 14:39:53,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372746920] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:39:53,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96470960] [2025-03-17 14:39:53,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:53,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:39:53,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:39:53,701 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:39:53,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 14:39:53,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 14:39:53,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 14:39:53,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:53,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:53,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:39:53,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:39:53,789 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 14:39:53,791 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:39:53,822 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 14:39:53,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96470960] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:39:53,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:39:53,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2025-03-17 14:39:53,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184505898] [2025-03-17 14:39:53,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:39:53,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 14:39:53,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:39:53,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 14:39:53,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:39:53,824 INFO L87 Difference]: Start difference. First operand 347 states and 428 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 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-17 14:39:53,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:39:53,939 INFO L93 Difference]: Finished difference Result 855 states and 1100 transitions. [2025-03-17 14:39:53,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:39:53,940 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 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 28 [2025-03-17 14:39:53,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:39:53,942 INFO L225 Difference]: With dead ends: 855 [2025-03-17 14:39:53,942 INFO L226 Difference]: Without dead ends: 539 [2025-03-17 14:39:53,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:39:53,945 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 220 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:39:53,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 90 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:39:53,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-03-17 14:39:53,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 533. [2025-03-17 14:39:53,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 523 states have (on average 1.2504780114722753) internal successors, (654), 532 states have internal predecessors, (654), 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-17 14:39:53,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 654 transitions. [2025-03-17 14:39:53,978 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 654 transitions. Word has length 28 [2025-03-17 14:39:53,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:39:53,978 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 654 transitions. [2025-03-17 14:39:53,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 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-17 14:39:53,979 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 654 transitions. [2025-03-17 14:39:53,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-17 14:39:53,981 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:39:53,982 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1] [2025-03-17 14:39:53,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 14:39:54,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:39:54,182 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-17 14:39:54,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:39:54,183 INFO L85 PathProgramCache]: Analyzing trace with hash 154523384, now seen corresponding path program 1 times [2025-03-17 14:39:54,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:39:54,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835206351] [2025-03-17 14:39:54,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:54,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:39:54,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 14:39:54,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 14:39:54,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:54,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:54,225 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 14:39:54,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:39:54,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835206351] [2025-03-17 14:39:54,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835206351] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:39:54,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660929734] [2025-03-17 14:39:54,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:54,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:39:54,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:39:54,228 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:39:54,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 14:39:54,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 14:39:54,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 14:39:54,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:54,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:54,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:39:54,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:39:54,326 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:39:54,326 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:39:54,376 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:39:54,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660929734] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:39:54,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:39:54,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 5, 5] total 11 [2025-03-17 14:39:54,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180747755] [2025-03-17 14:39:54,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:39:54,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 14:39:54,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:39:54,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 14:39:54,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:39:54,381 INFO L87 Difference]: Start difference. First operand 533 states and 654 transitions. Second operand has 12 states, 11 states have (on average 7.0) internal successors, (77), 12 states have internal predecessors, (77), 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-17 14:39:54,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:39:54,499 INFO L93 Difference]: Finished difference Result 653 states and 814 transitions. [2025-03-17 14:39:54,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 14:39:54,499 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.0) internal successors, (77), 12 states have internal predecessors, (77), 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 31 [2025-03-17 14:39:54,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:39:54,501 INFO L225 Difference]: With dead ends: 653 [2025-03-17 14:39:54,501 INFO L226 Difference]: Without dead ends: 651 [2025-03-17 14:39:54,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=177, Unknown=0, NotChecked=0, Total=306 [2025-03-17 14:39:54,502 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 275 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:39:54,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 92 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:39:54,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2025-03-17 14:39:54,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 531. [2025-03-17 14:39:54,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 523 states have (on average 1.2007648183556405) internal successors, (628), 530 states have internal predecessors, (628), 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-17 14:39:54,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 628 transitions. [2025-03-17 14:39:54,517 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 628 transitions. Word has length 31 [2025-03-17 14:39:54,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:39:54,518 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 628 transitions. [2025-03-17 14:39:54,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.0) internal successors, (77), 12 states have internal predecessors, (77), 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-17 14:39:54,518 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 628 transitions. [2025-03-17 14:39:54,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-17 14:39:54,519 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:39:54,519 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 14:39:54,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 14:39:54,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:39:54,720 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-17 14:39:54,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:39:54,720 INFO L85 PathProgramCache]: Analyzing trace with hash -915350408, now seen corresponding path program 1 times [2025-03-17 14:39:54,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:39:54,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459566219] [2025-03-17 14:39:54,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:54,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:39:54,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-17 14:39:54,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-17 14:39:54,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:54,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:54,847 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 80 proven. 46 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-17 14:39:54,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:39:54,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459566219] [2025-03-17 14:39:54,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459566219] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:39:54,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277075400] [2025-03-17 14:39:54,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:54,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:39:54,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:39:54,849 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:39:54,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 14:39:54,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-17 14:39:54,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-17 14:39:54,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:54,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:54,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 14:39:54,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:39:55,013 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 80 proven. 46 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-17 14:39:55,013 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:39:55,093 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 80 proven. 46 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-17 14:39:55,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277075400] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:39:55,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:39:55,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2025-03-17 14:39:55,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930432188] [2025-03-17 14:39:55,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:39:55,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 14:39:55,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:39:55,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 14:39:55,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=195, Unknown=0, NotChecked=0, Total=342 [2025-03-17 14:39:55,095 INFO L87 Difference]: Start difference. First operand 531 states and 628 transitions. Second operand has 19 states, 19 states have (on average 5.526315789473684) internal successors, (105), 18 states have internal predecessors, (105), 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-17 14:39:55,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:39:55,332 INFO L93 Difference]: Finished difference Result 1720 states and 2098 transitions. [2025-03-17 14:39:55,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 14:39:55,333 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.526315789473684) internal successors, (105), 18 states have internal predecessors, (105), 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 54 [2025-03-17 14:39:55,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:39:55,336 INFO L225 Difference]: With dead ends: 1720 [2025-03-17 14:39:55,336 INFO L226 Difference]: Without dead ends: 1221 [2025-03-17 14:39:55,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=222, Invalid=330, Unknown=0, NotChecked=0, Total=552 [2025-03-17 14:39:55,339 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 336 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:39:55,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 169 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:39:55,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2025-03-17 14:39:55,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 1203. [2025-03-17 14:39:55,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1203 states, 1195 states have (on average 1.1882845188284519) internal successors, (1420), 1202 states have internal predecessors, (1420), 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-17 14:39:55,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1420 transitions. [2025-03-17 14:39:55,376 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1420 transitions. Word has length 54 [2025-03-17 14:39:55,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:39:55,376 INFO L471 AbstractCegarLoop]: Abstraction has 1203 states and 1420 transitions. [2025-03-17 14:39:55,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.526315789473684) internal successors, (105), 18 states have internal predecessors, (105), 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-17 14:39:55,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1420 transitions. [2025-03-17 14:39:55,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-17 14:39:55,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:39:55,382 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 14:39:55,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 14:39:55,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:39:55,583 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-17 14:39:55,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:39:55,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1803296296, now seen corresponding path program 2 times [2025-03-17 14:39:55,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:39:55,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079223859] [2025-03-17 14:39:55,584 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:39:55,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:39:55,612 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 96 statements into 2 equivalence classes. [2025-03-17 14:39:55,614 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 96 statements. [2025-03-17 14:39:55,614 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:39:55,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:55,642 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2025-03-17 14:39:55,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:39:55,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079223859] [2025-03-17 14:39:55,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079223859] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:39:55,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792284782] [2025-03-17 14:39:55,643 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:39:55,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:39:55,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:39:55,645 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:39:55,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 14:39:55,677 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 96 statements into 2 equivalence classes. [2025-03-17 14:39:55,682 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 96 statements. [2025-03-17 14:39:55,683 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:39:55,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:55,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:39:55,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:39:55,941 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 153 proven. 48 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2025-03-17 14:39:55,942 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:39:56,078 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2025-03-17 14:39:56,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792284782] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:39:56,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:39:56,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-17 14:39:56,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625312604] [2025-03-17 14:39:56,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:39:56,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 14:39:56,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:39:56,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 14:39:56,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:39:56,080 INFO L87 Difference]: Start difference. First operand 1203 states and 1420 transitions. Second operand has 11 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 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-17 14:39:56,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:39:56,392 INFO L93 Difference]: Finished difference Result 1972 states and 2281 transitions. [2025-03-17 14:39:56,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 14:39:56,392 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 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 96 [2025-03-17 14:39:56,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:39:56,398 INFO L225 Difference]: With dead ends: 1972 [2025-03-17 14:39:56,398 INFO L226 Difference]: Without dead ends: 1966 [2025-03-17 14:39:56,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2025-03-17 14:39:56,399 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 118 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 14:39:56,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 29 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 14:39:56,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1966 states. [2025-03-17 14:39:56,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1966 to 1626. [2025-03-17 14:39:56,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1626 states, 1618 states have (on average 1.1279357231149567) internal successors, (1825), 1625 states have internal predecessors, (1825), 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-17 14:39:56,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 1626 states and 1825 transitions. [2025-03-17 14:39:56,446 INFO L78 Accepts]: Start accepts. Automaton has 1626 states and 1825 transitions. Word has length 96 [2025-03-17 14:39:56,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:39:56,447 INFO L471 AbstractCegarLoop]: Abstraction has 1626 states and 1825 transitions. [2025-03-17 14:39:56,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 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-17 14:39:56,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1626 states and 1825 transitions. [2025-03-17 14:39:56,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-17 14:39:56,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:39:56,449 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-17 14:39:56,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 14:39:56,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:39:56,651 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-17 14:39:56,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:39:56,651 INFO L85 PathProgramCache]: Analyzing trace with hash 972808026, now seen corresponding path program 1 times [2025-03-17 14:39:56,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:39:56,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095046658] [2025-03-17 14:39:56,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:56,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:39:56,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-17 14:39:56,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-17 14:39:56,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:56,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:56,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1442 backedges. 759 proven. 1 refuted. 0 times theorem prover too weak. 682 trivial. 0 not checked. [2025-03-17 14:39:56,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:39:56,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095046658] [2025-03-17 14:39:56,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095046658] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:39:56,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740163774] [2025-03-17 14:39:56,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:56,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:39:56,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:39:56,826 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:39:56,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 14:39:56,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-17 14:39:56,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-17 14:39:56,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:56,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:56,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 14:39:56,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:39:57,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1442 backedges. 756 proven. 325 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2025-03-17 14:39:57,171 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:39:57,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1442 backedges. 756 proven. 325 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2025-03-17 14:39:57,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740163774] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:39:57,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:39:57,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 13, 13] total 27 [2025-03-17 14:39:57,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043210280] [2025-03-17 14:39:57,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:39:57,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-17 14:39:57,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:39:57,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-17 14:39:57,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=446, Unknown=0, NotChecked=0, Total=756 [2025-03-17 14:39:57,409 INFO L87 Difference]: Start difference. First operand 1626 states and 1825 transitions. Second operand has 28 states, 28 states have (on average 6.321428571428571) internal successors, (177), 27 states have internal predecessors, (177), 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-17 14:39:59,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:39:59,101 INFO L93 Difference]: Finished difference Result 6753 states and 7833 transitions. [2025-03-17 14:39:59,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2025-03-17 14:39:59,101 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 6.321428571428571) internal successors, (177), 27 states have internal predecessors, (177), 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 158 [2025-03-17 14:39:59,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:39:59,115 INFO L225 Difference]: With dead ends: 6753 [2025-03-17 14:39:59,115 INFO L226 Difference]: Without dead ends: 5132 [2025-03-17 14:39:59,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2116 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2483, Invalid=4489, Unknown=0, NotChecked=0, Total=6972 [2025-03-17 14:39:59,120 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 3692 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 249 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3692 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 249 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 14:39:59,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3692 Valid, 91 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [249 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 14:39:59,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5132 states. [2025-03-17 14:39:59,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5132 to 3815. [2025-03-17 14:39:59,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3815 states, 3807 states have (on average 1.10795902285264) internal successors, (4218), 3814 states have internal predecessors, (4218), 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-17 14:39:59,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3815 states to 3815 states and 4218 transitions. [2025-03-17 14:39:59,274 INFO L78 Accepts]: Start accepts. Automaton has 3815 states and 4218 transitions. Word has length 158 [2025-03-17 14:39:59,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:39:59,275 INFO L471 AbstractCegarLoop]: Abstraction has 3815 states and 4218 transitions. [2025-03-17 14:39:59,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.321428571428571) internal successors, (177), 27 states have internal predecessors, (177), 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-17 14:39:59,275 INFO L276 IsEmpty]: Start isEmpty. Operand 3815 states and 4218 transitions. [2025-03-17 14:39:59,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2025-03-17 14:39:59,283 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:39:59,284 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 66, 66, 66, 66, 66, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2025-03-17 14:39:59,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 14:39:59,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:39:59,485 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-17 14:39:59,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:39:59,486 INFO L85 PathProgramCache]: Analyzing trace with hash -164076361, now seen corresponding path program 2 times [2025-03-17 14:39:59,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:39:59,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374990135] [2025-03-17 14:39:59,486 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:39:59,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:39:59,515 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 484 statements into 2 equivalence classes. [2025-03-17 14:39:59,518 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 484 statements. [2025-03-17 14:39:59,519 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:39:59,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:59,542 INFO L134 CoverageAnalysis]: Checked inductivity of 15434 backedges. 0 proven. 7077 refuted. 0 times theorem prover too weak. 8357 trivial. 0 not checked. [2025-03-17 14:39:59,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:39:59,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374990135] [2025-03-17 14:39:59,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374990135] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:39:59,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457159158] [2025-03-17 14:39:59,543 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:39:59,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:39:59,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:39:59,545 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:39:59,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 14:39:59,622 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 484 statements into 2 equivalence classes. [2025-03-17 14:39:59,627 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 484 statements. [2025-03-17 14:39:59,628 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:39:59,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:59,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:39:59,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:40:00,225 INFO L134 CoverageAnalysis]: Checked inductivity of 15434 backedges. 6876 proven. 201 refuted. 0 times theorem prover too weak. 8357 trivial. 0 not checked. [2025-03-17 14:40:00,225 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:40:00,607 INFO L134 CoverageAnalysis]: Checked inductivity of 15434 backedges. 0 proven. 7077 refuted. 0 times theorem prover too weak. 8357 trivial. 0 not checked. [2025-03-17 14:40:00,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457159158] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:40:00,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:40:00,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2025-03-17 14:40:00,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899574861] [2025-03-17 14:40:00,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:40:00,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 14:40:00,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:40:00,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 14:40:00,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:40:00,608 INFO L87 Difference]: Start difference. First operand 3815 states and 4218 transitions. Second operand has 10 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 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-17 14:40:00,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:40:00,725 INFO L93 Difference]: Finished difference Result 4226 states and 4721 transitions. [2025-03-17 14:40:00,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:40:00,726 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 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 484 [2025-03-17 14:40:00,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:40:00,734 INFO L225 Difference]: With dead ends: 4226 [2025-03-17 14:40:00,735 INFO L226 Difference]: Without dead ends: 2995 [2025-03-17 14:40:00,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 973 GetRequests, 961 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-03-17 14:40:00,737 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 65 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:40:00,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 7 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:40:00,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2995 states. [2025-03-17 14:40:00,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2995 to 2213. [2025-03-17 14:40:00,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2213 states, 2211 states have (on average 1.0587969244685662) internal successors, (2341), 2212 states have internal predecessors, (2341), 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-17 14:40:00,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2213 states to 2213 states and 2341 transitions. [2025-03-17 14:40:00,814 INFO L78 Accepts]: Start accepts. Automaton has 2213 states and 2341 transitions. Word has length 484 [2025-03-17 14:40:00,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:40:00,815 INFO L471 AbstractCegarLoop]: Abstraction has 2213 states and 2341 transitions. [2025-03-17 14:40:00,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 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-17 14:40:00,816 INFO L276 IsEmpty]: Start isEmpty. Operand 2213 states and 2341 transitions. [2025-03-17 14:40:00,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 649 [2025-03-17 14:40:00,824 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:40:00,824 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 89, 88, 88, 88, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1] [2025-03-17 14:40:00,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-17 14:40:01,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-17 14:40:01,025 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-17 14:40:01,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:40:01,026 INFO L85 PathProgramCache]: Analyzing trace with hash -741598507, now seen corresponding path program 1 times [2025-03-17 14:40:01,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:40:01,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095745001] [2025-03-17 14:40:01,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:40:01,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:40:01,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 648 statements into 1 equivalence classes. [2025-03-17 14:40:01,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 648 of 648 statements. [2025-03-17 14:40:01,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:40:01,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:40:02,802 INFO L134 CoverageAnalysis]: Checked inductivity of 27636 backedges. 10418 proven. 1639 refuted. 0 times theorem prover too weak. 15579 trivial. 0 not checked. [2025-03-17 14:40:02,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:40:02,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095745001] [2025-03-17 14:40:02,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095745001] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:40:02,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465470381] [2025-03-17 14:40:02,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:40:02,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:40:02,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:40:02,808 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:40:02,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 14:40:02,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 648 statements into 1 equivalence classes. [2025-03-17 14:40:03,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 648 of 648 statements. [2025-03-17 14:40:03,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:40:03,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:40:03,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 1250 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-17 14:40:03,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:40:03,561 INFO L134 CoverageAnalysis]: Checked inductivity of 27636 backedges. 10418 proven. 1639 refuted. 0 times theorem prover too weak. 15579 trivial. 0 not checked. [2025-03-17 14:40:03,562 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:40:04,305 INFO L134 CoverageAnalysis]: Checked inductivity of 27636 backedges. 10418 proven. 1639 refuted. 0 times theorem prover too weak. 15579 trivial. 0 not checked. [2025-03-17 14:40:04,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465470381] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:40:04,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:40:04,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 72 [2025-03-17 14:40:04,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542056230] [2025-03-17 14:40:04,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:40:04,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2025-03-17 14:40:04,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:40:04,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2025-03-17 14:40:04,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2307, Invalid=2949, Unknown=0, NotChecked=0, Total=5256 [2025-03-17 14:40:04,310 INFO L87 Difference]: Start difference. First operand 2213 states and 2341 transitions. Second operand has 73 states, 73 states have (on average 6.684931506849315) internal successors, (488), 72 states have internal predecessors, (488), 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-17 14:40:05,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:40:05,838 INFO L93 Difference]: Finished difference Result 6572 states and 7235 transitions. [2025-03-17 14:40:05,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-03-17 14:40:05,839 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 6.684931506849315) internal successors, (488), 72 states have internal predecessors, (488), 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 648 [2025-03-17 14:40:05,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:40:05,849 INFO L225 Difference]: With dead ends: 6572 [2025-03-17 14:40:05,849 INFO L226 Difference]: Without dead ends: 4517 [2025-03-17 14:40:05,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1342 GetRequests, 1248 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3217 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=3480, Invalid=5640, Unknown=0, NotChecked=0, Total=9120 [2025-03-17 14:40:05,853 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 1712 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1712 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 14:40:05,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1712 Valid, 433 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 14:40:05,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4517 states. [2025-03-17 14:40:05,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4517 to 4517. [2025-03-17 14:40:05,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4517 states, 4515 states have (on average 1.0553709856035438) internal successors, (4765), 4516 states have internal predecessors, (4765), 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-17 14:40:05,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4517 states to 4517 states and 4765 transitions. [2025-03-17 14:40:05,981 INFO L78 Accepts]: Start accepts. Automaton has 4517 states and 4765 transitions. Word has length 648 [2025-03-17 14:40:05,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:40:05,982 INFO L471 AbstractCegarLoop]: Abstraction has 4517 states and 4765 transitions. [2025-03-17 14:40:05,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 6.684931506849315) internal successors, (488), 72 states have internal predecessors, (488), 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-17 14:40:05,982 INFO L276 IsEmpty]: Start isEmpty. Operand 4517 states and 4765 transitions. [2025-03-17 14:40:06,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1321 [2025-03-17 14:40:06,014 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:40:06,015 INFO L218 NwaCegarLoop]: trace histogram [185, 185, 185, 185, 184, 184, 184, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1] [2025-03-17 14:40:06,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-17 14:40:06,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-17 14:40:06,219 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-17 14:40:06,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:40:06,220 INFO L85 PathProgramCache]: Analyzing trace with hash 565554389, now seen corresponding path program 2 times [2025-03-17 14:40:06,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:40:06,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949250042] [2025-03-17 14:40:06,220 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:40:06,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:40:06,289 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1320 statements into 2 equivalence classes. [2025-03-17 14:40:06,291 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 1320 statements. [2025-03-17 14:40:06,291 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:40:06,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:40:06,325 INFO L134 CoverageAnalysis]: Checked inductivity of 119556 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 118626 trivial. 0 not checked. [2025-03-17 14:40:06,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:40:06,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949250042] [2025-03-17 14:40:06,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949250042] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:40:06,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331651221] [2025-03-17 14:40:06,326 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:40:06,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:40:06,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:40:06,328 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:40:06,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 14:40:06,517 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1320 statements into 2 equivalence classes. [2025-03-17 14:40:06,524 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 1320 statements. [2025-03-17 14:40:06,524 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:40:06,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:40:06,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:40:06,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:40:07,486 INFO L134 CoverageAnalysis]: Checked inductivity of 119556 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 118626 trivial. 0 not checked. [2025-03-17 14:40:07,487 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:40:08,510 INFO L134 CoverageAnalysis]: Checked inductivity of 119556 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 118626 trivial. 0 not checked. [2025-03-17 14:40:08,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331651221] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:40:08,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:40:08,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2025-03-17 14:40:08,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783747703] [2025-03-17 14:40:08,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:40:08,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 14:40:08,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:40:08,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 14:40:08,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:40:08,514 INFO L87 Difference]: Start difference. First operand 4517 states and 4765 transitions. Second operand has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 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-17 14:40:08,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:40:08,709 INFO L93 Difference]: Finished difference Result 4544 states and 4792 transitions. [2025-03-17 14:40:08,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:40:08,710 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 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 1320 [2025-03-17 14:40:08,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:40:08,736 INFO L225 Difference]: With dead ends: 4544 [2025-03-17 14:40:08,736 INFO L226 Difference]: Without dead ends: 4542 [2025-03-17 14:40:08,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2646 GetRequests, 2633 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2025-03-17 14:40:08,738 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 159 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:40:08,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 13 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:40:08,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4542 states. [2025-03-17 14:40:08,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4542 to 4091. [2025-03-17 14:40:08,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4091 states, 4089 states have (on average 1.0269014428955734) internal successors, (4199), 4090 states have internal predecessors, (4199), 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-17 14:40:08,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4091 states to 4091 states and 4199 transitions. [2025-03-17 14:40:08,854 INFO L78 Accepts]: Start accepts. Automaton has 4091 states and 4199 transitions. Word has length 1320 [2025-03-17 14:40:08,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:40:08,856 INFO L471 AbstractCegarLoop]: Abstraction has 4091 states and 4199 transitions. [2025-03-17 14:40:08,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 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-17 14:40:08,857 INFO L276 IsEmpty]: Start isEmpty. Operand 4091 states and 4199 transitions. [2025-03-17 14:40:08,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1654 [2025-03-17 14:40:08,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:40:08,871 INFO L218 NwaCegarLoop]: trace histogram [232, 232, 232, 232, 231, 231, 231, 6, 5, 5, 5, 3, 2, 2, 2, 1, 1] [2025-03-17 14:40:08,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-17 14:40:09,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-17 14:40:09,071 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-17 14:40:09,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:40:09,072 INFO L85 PathProgramCache]: Analyzing trace with hash 2044730179, now seen corresponding path program 3 times [2025-03-17 14:40:09,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:40:09,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817110364] [2025-03-17 14:40:09,072 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:40:09,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:40:09,149 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1653 statements into 187 equivalence classes. [2025-03-17 14:40:09,150 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 8 of 1653 statements. [2025-03-17 14:40:09,151 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 14:40:09,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:40:09,187 INFO L134 CoverageAnalysis]: Checked inductivity of 188333 backedges. 0 proven. 62414 refuted. 0 times theorem prover too weak. 125919 trivial. 0 not checked. [2025-03-17 14:40:09,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:40:09,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817110364] [2025-03-17 14:40:09,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817110364] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:40:09,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563510559] [2025-03-17 14:40:09,187 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:40:09,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:40:09,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:40:09,189 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:40:09,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-17 14:40:09,430 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1653 statements into 187 equivalence classes. [2025-03-17 14:40:09,436 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 8 of 1653 statements. [2025-03-17 14:40:09,436 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 14:40:09,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:40:09,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:40:09,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:40:10,976 INFO L134 CoverageAnalysis]: Checked inductivity of 188333 backedges. 61490 proven. 924 refuted. 0 times theorem prover too weak. 125919 trivial. 0 not checked. [2025-03-17 14:40:10,976 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:40:12,147 INFO L134 CoverageAnalysis]: Checked inductivity of 188333 backedges. 0 proven. 62414 refuted. 0 times theorem prover too weak. 125919 trivial. 0 not checked. [2025-03-17 14:40:12,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563510559] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:40:12,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:40:12,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-17 14:40:12,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223580975] [2025-03-17 14:40:12,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:40:12,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 14:40:12,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:40:12,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 14:40:12,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:40:12,149 INFO L87 Difference]: Start difference. First operand 4091 states and 4199 transitions. Second operand has 13 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 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-17 14:40:12,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:40:12,384 INFO L93 Difference]: Finished difference Result 4091 states and 4199 transitions. [2025-03-17 14:40:12,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 14:40:12,385 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 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 1653 [2025-03-17 14:40:12,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:40:12,387 INFO L225 Difference]: With dead ends: 4091 [2025-03-17 14:40:12,387 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 14:40:12,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3314 GetRequests, 3297 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2025-03-17 14:40:12,390 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 79 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:40:12,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 3 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:40:12,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 14:40:12,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 14:40:12,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:40:12,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 14:40:12,392 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1653 [2025-03-17 14:40:12,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:40:12,392 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 14:40:12,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 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-17 14:40:12,392 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 14:40:12,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 14:40:12,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 20 remaining) [2025-03-17 14:40:12,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 20 remaining) [2025-03-17 14:40:12,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 20 remaining) [2025-03-17 14:40:12,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 20 remaining) [2025-03-17 14:40:12,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 20 remaining) [2025-03-17 14:40:12,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 20 remaining) [2025-03-17 14:40:12,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 20 remaining) [2025-03-17 14:40:12,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 20 remaining) [2025-03-17 14:40:12,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 20 remaining) [2025-03-17 14:40:12,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 20 remaining) [2025-03-17 14:40:12,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 20 remaining) [2025-03-17 14:40:12,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 20 remaining) [2025-03-17 14:40:12,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 20 remaining) [2025-03-17 14:40:12,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 20 remaining) [2025-03-17 14:40:12,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 20 remaining) [2025-03-17 14:40:12,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 20 remaining) [2025-03-17 14:40:12,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 20 remaining) [2025-03-17 14:40:12,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 20 remaining) [2025-03-17 14:40:12,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 20 remaining) [2025-03-17 14:40:12,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 20 remaining) [2025-03-17 14:40:12,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-17 14:40:12,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-17 14:40:12,602 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:40:12,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 14:40:26,535 WARN L286 SmtUtils]: Spent 13.91s on a formula simplification. DAG size of input: 706 DAG size of output: 429 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-03-17 14:40:37,660 WARN L286 SmtUtils]: Spent 11.12s on a formula simplification. DAG size of input: 956 DAG size of output: 527 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-03-17 14:40:40,617 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 14:40:40,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:40:40 BoogieIcfgContainer [2025-03-17 14:40:40,627 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 14:40:40,628 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 14:40:40,628 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 14:40:40,628 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 14:40:40,629 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:39:50" (3/4) ... [2025-03-17 14:40:40,631 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 14:40:40,640 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-17 14:40:40,641 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 14:40:40,641 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 14:40:40,641 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 14:40:40,698 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 14:40:40,699 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 14:40:40,699 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 14:40:40,699 INFO L158 Benchmark]: Toolchain (without parser) took 50391.34ms. Allocated memory was 167.8MB in the beginning and 721.4MB in the end (delta: 553.6MB). Free memory was 123.9MB in the beginning and 371.2MB in the end (delta: -247.2MB). Peak memory consumption was 304.4MB. Max. memory is 16.1GB. [2025-03-17 14:40:40,699 INFO L158 Benchmark]: CDTParser took 1.33ms. Allocated memory is still 201.3MB. Free memory is still 120.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:40:40,700 INFO L158 Benchmark]: CACSL2BoogieTranslator took 173.26ms. Allocated memory is still 167.8MB. Free memory was 123.9MB in the beginning and 112.9MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:40:40,700 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.70ms. Allocated memory is still 167.8MB. Free memory was 112.9MB in the beginning and 111.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:40:40,700 INFO L158 Benchmark]: Boogie Preprocessor took 40.95ms. Allocated memory is still 167.8MB. Free memory was 111.6MB in the beginning and 110.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:40:40,700 INFO L158 Benchmark]: IcfgBuilder took 358.19ms. Allocated memory is still 167.8MB. Free memory was 110.2MB in the beginning and 95.8MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 14:40:40,700 INFO L158 Benchmark]: TraceAbstraction took 49716.09ms. Allocated memory was 167.8MB in the beginning and 721.4MB in the end (delta: 553.6MB). Free memory was 94.9MB in the beginning and 375.6MB in the end (delta: -280.7MB). Peak memory consumption was 399.5MB. Max. memory is 16.1GB. [2025-03-17 14:40:40,701 INFO L158 Benchmark]: Witness Printer took 70.81ms. Allocated memory is still 721.4MB. Free memory was 375.6MB in the beginning and 371.2MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:40:40,703 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.33ms. Allocated memory is still 201.3MB. Free memory is still 120.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 173.26ms. Allocated memory is still 167.8MB. Free memory was 123.9MB in the beginning and 112.9MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.70ms. Allocated memory is still 167.8MB. Free memory was 112.9MB in the beginning and 111.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.95ms. Allocated memory is still 167.8MB. Free memory was 111.6MB in the beginning and 110.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 358.19ms. Allocated memory is still 167.8MB. Free memory was 110.2MB in the beginning and 95.8MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 49716.09ms. Allocated memory was 167.8MB in the beginning and 721.4MB in the end (delta: 553.6MB). Free memory was 94.9MB in the beginning and 375.6MB in the end (delta: -280.7MB). Peak memory consumption was 399.5MB. Max. memory is 16.1GB. * Witness Printer took 70.81ms. Allocated memory is still 721.4MB. Free memory was 375.6MB in the beginning and 371.2MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 52 locations, 58 edges, 20 error locations. Started 1 CEGAR loops. OverallTime: 21.6s, OverallIterations: 15, TraceHistogramMax: 232, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7410 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7410 mSDsluCounter, 1222 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 994 mSDsCounter, 715 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3366 IncrementalHoareTripleChecker+Invalid, 4081 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 715 mSolverCounterUnsat, 228 mSDtfsCounter, 3366 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9168 GetRequests, 8846 SyntacticMatches, 0 SemanticMatches, 322 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5906 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4517occurred in iteration=13, InterpolantAutomatonStates: 229, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 15 MinimizatonAttempts, 3076 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 11.1s InterpolantComputationTime, 9027 NumberOfCodeBlocks, 1981 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 13478 ConstructedInterpolants, 0 QuantifiedInterpolants, 47163 SizeOfPredicates, 12 NumberOfNonLiveVariables, 2268 ConjunctsInSsa, 83 ConjunctsInUnsatCore, 36 InterpolantComputations, 5 PerfectInterpolantSequences, 910283/1059466 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 20 specifications checked. All of them hold - InvariantResult [Line: 47]: Location Invariant Derived location invariant: (((((0 <= j) && ((((long long) i + j) + n) <= 2147483648)) && (0 <= i)) && (((long long) i + 1) <= n)) && (n == 1000)) - InvariantResult [Line: 44]: Location Invariant Derived location invariant: (((0 <= i) && (i <= 2147481649)) && (n == 1000)) - InvariantResult [Line: 27]: Location Invariant Derived location invariant: (((((i <= 999) && (0 <= j)) && (((long long) i + j) <= 2147482648)) && (0 <= i)) && (n == 1000)) - InvariantResult [Line: 49]: Location Invariant Derived location invariant: (((((((i <= 999) && (0 <= j)) && (k == 0)) && (0 <= i)) && (j <= 999)) && (n == 1000)) || (((((((((((long long) i + j) + k) <= 2147483647) && (k <= 2147483643)) && (0 <= j)) && (0 <= i)) && (((long long) i + 1) <= n)) && (1 <= k)) && (j <= 999)) && (n == 1000))) - InvariantResult [Line: 29]: Location Invariant Derived location invariant: ((((((((((((long long) i + j) + k) <= 2147483647) && (k <= 2147483643)) && (i <= 999)) && (0 <= j)) && (0 <= i)) && (1 <= k)) && (j <= 999)) && (n == 1000)) || ((((((i <= 999) && (0 <= j)) && (k == 0)) && (0 <= i)) && (j <= 999)) && (n == 1000))) - InvariantResult [Line: 24]: Location Invariant Derived location invariant: (((0 <= i) && (i <= 2147481649)) && (n == 1000)) RESULT: Ultimate proved your program to be correct! [2025-03-17 14:40:40,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE