./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test1-2.i --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/uthash-2.0.2/uthash_BER_nondet_test1-2.i -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 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 19:03:00,702 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 19:03:00,758 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 19:03:00,766 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 19:03:00,769 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 19:03:00,790 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 19:03:00,791 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 19:03:00,791 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 19:03:00,791 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 19:03:00,792 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 19:03:00,792 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 19:03:00,792 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 19:03:00,793 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 19:03:00,793 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 19:03:00,793 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 19:03:00,793 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 19:03:00,793 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 19:03:00,793 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 19:03:00,793 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 19:03:00,794 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 19:03:00,794 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 19:03:00,794 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 19:03:00,794 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 19:03:00,794 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 19:03:00,794 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 19:03:00,794 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 19:03:00,794 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 19:03:00,794 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 19:03:00,794 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 19:03:00,794 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 19:03:00,795 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 19:03:00,795 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 19:03:00,795 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 19:03:00,795 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 19:03:00,795 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 19:03:00,795 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 19:03:00,796 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 19:03:00,796 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 19:03:00,796 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 19:03:00,796 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 19:03:00,796 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 19:03:00,796 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 19:03:00,796 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 19:03:00,796 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 19:03:00,796 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 19:03:00,796 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 -> 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 [2025-03-17 19:03:01,016 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 19:03:01,025 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 19:03:01,026 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 19:03:01,027 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 19:03:01,028 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 19:03:01,030 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test1-2.i [2025-03-17 19:03:02,201 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96c3e4aeb/9fdc2814b050410583244161563dac69/FLAGe688a4043 [2025-03-17 19:03:02,515 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 19:03:02,516 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test1-2.i [2025-03-17 19:03:02,531 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96c3e4aeb/9fdc2814b050410583244161563dac69/FLAGe688a4043 [2025-03-17 19:03:02,769 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96c3e4aeb/9fdc2814b050410583244161563dac69 [2025-03-17 19:03:02,772 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 19:03:02,773 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 19:03:02,774 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 19:03:02,774 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 19:03:02,777 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 19:03:02,778 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:03:02" (1/1) ... [2025-03-17 19:03:02,778 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67a07ced and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:03:02, skipping insertion in model container [2025-03-17 19:03:02,779 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:03:02" (1/1) ... [2025-03-17 19:03:02,805 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 19:03:03,135 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:03:03,145 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 19:03:03,210 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:03:03,238 INFO L204 MainTranslator]: Completed translation [2025-03-17 19:03:03,238 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:03:03 WrapperNode [2025-03-17 19:03:03,238 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 19:03:03,239 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 19:03:03,239 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 19:03:03,239 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 19:03:03,243 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:03:03" (1/1) ... [2025-03-17 19:03:03,259 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:03:03" (1/1) ... [2025-03-17 19:03:03,301 INFO L138 Inliner]: procedures = 176, calls = 221, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 938 [2025-03-17 19:03:03,301 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 19:03:03,302 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 19:03:03,302 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 19:03:03,302 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 19:03:03,309 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:03:03" (1/1) ... [2025-03-17 19:03:03,309 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:03:03" (1/1) ... [2025-03-17 19:03:03,317 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:03:03" (1/1) ... [2025-03-17 19:03:03,360 INFO L175 MemorySlicer]: Split 206 memory accesses to 2 slices as follows [2, 204]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 50 writes are split as follows [0, 50]. [2025-03-17 19:03:03,360 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:03:03" (1/1) ... [2025-03-17 19:03:03,360 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:03:03" (1/1) ... [2025-03-17 19:03:03,381 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:03:03" (1/1) ... [2025-03-17 19:03:03,383 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:03:03" (1/1) ... [2025-03-17 19:03:03,384 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:03:03" (1/1) ... [2025-03-17 19:03:03,387 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:03:03" (1/1) ... [2025-03-17 19:03:03,396 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 19:03:03,397 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 19:03:03,397 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 19:03:03,397 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 19:03:03,397 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:03:03" (1/1) ... [2025-03-17 19:03:03,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 19:03:03,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:03:03,425 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 19:03:03,429 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 19:03:03,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 19:03:03,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 19:03:03,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 19:03:03,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 19:03:03,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-17 19:03:03,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-17 19:03:03,443 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-17 19:03:03,443 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-17 19:03:03,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 19:03:03,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 19:03:03,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 19:03:03,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 19:03:03,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 19:03:03,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 19:03:03,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 19:03:03,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 19:03:03,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 19:03:03,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 19:03:03,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 19:03:03,572 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 19:03:03,573 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 19:03:04,370 INFO L? ?]: Removed 227 outVars from TransFormulas that were not future-live. [2025-03-17 19:03:04,371 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 19:03:04,429 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 19:03:04,431 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-17 19:03:04,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:03:04 BoogieIcfgContainer [2025-03-17 19:03:04,431 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 19:03:04,433 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 19:03:04,433 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 19:03:04,436 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 19:03:04,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 07:03:02" (1/3) ... [2025-03-17 19:03:04,437 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66313174 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:03:04, skipping insertion in model container [2025-03-17 19:03:04,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:03:03" (2/3) ... [2025-03-17 19:03:04,437 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66313174 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:03:04, skipping insertion in model container [2025-03-17 19:03:04,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:03:04" (3/3) ... [2025-03-17 19:03:04,438 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_BER_nondet_test1-2.i [2025-03-17 19:03:04,447 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 19:03:04,448 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_nondet_test1-2.i that has 3 procedures, 252 locations, 1 initial locations, 24 loop locations, and 6 error locations. [2025-03-17 19:03:04,491 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 19:03:04,499 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;@3c6efcd9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 19:03:04,499 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-17 19:03:04,502 INFO L276 IsEmpty]: Start isEmpty. Operand has 248 states, 237 states have (on average 1.620253164556962) internal successors, (384), 243 states have internal predecessors, (384), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 19:03:04,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 19:03:04,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:03:04,505 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 19:03:04,506 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:03:04,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:03:04,509 INFO L85 PathProgramCache]: Analyzing trace with hash 13331437, now seen corresponding path program 1 times [2025-03-17 19:03:04,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:03:04,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646136145] [2025-03-17 19:03:04,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:03:04,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:03:04,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:03:04,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:03:04,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:03:04,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:03:04,624 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 19:03:04,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:03:04,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646136145] [2025-03-17 19:03:04,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646136145] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:03:04,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:03:04,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:03:04,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542301961] [2025-03-17 19:03:04,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:03:04,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:03:04,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:03:04,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:03:04,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:03:04,651 INFO L87 Difference]: Start difference. First operand has 248 states, 237 states have (on average 1.620253164556962) internal successors, (384), 243 states have internal predecessors, (384), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 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 19:03:04,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:03:04,771 INFO L93 Difference]: Finished difference Result 689 states and 1092 transitions. [2025-03-17 19:03:04,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:03:04,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 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 19:03:04,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:03:04,780 INFO L225 Difference]: With dead ends: 689 [2025-03-17 19:03:04,780 INFO L226 Difference]: Without dead ends: 404 [2025-03-17 19:03:04,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:03:04,784 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 275 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:03:04,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 679 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:03:04,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2025-03-17 19:03:04,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 210. [2025-03-17 19:03:04,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 200 states have (on average 1.46) internal successors, (292), 205 states have internal predecessors, (292), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 19:03:04,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 298 transitions. [2025-03-17 19:03:04,817 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 298 transitions. Word has length 4 [2025-03-17 19:03:04,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:03:04,818 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 298 transitions. [2025-03-17 19:03:04,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 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 19:03:04,818 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 298 transitions. [2025-03-17 19:03:04,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 19:03:04,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:03:04,818 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 19:03:04,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 19:03:04,818 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:03:04,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:03:04,819 INFO L85 PathProgramCache]: Analyzing trace with hash 423679579, now seen corresponding path program 1 times [2025-03-17 19:03:04,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:03:04,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665290694] [2025-03-17 19:03:04,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:03:04,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:03:04,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:03:04,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:03:04,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:03:04,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:03:04,997 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 19:03:04,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:03:04,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665290694] [2025-03-17 19:03:04,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665290694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:03:04,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:03:04,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:03:04,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703223657] [2025-03-17 19:03:04,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:03:04,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:03:04,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:03:05,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:03:05,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:03:05,000 INFO L87 Difference]: Start difference. First operand 210 states and 298 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 19:03:05,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:03:05,089 INFO L93 Difference]: Finished difference Result 215 states and 304 transitions. [2025-03-17 19:03:05,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:03:05,089 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 19:03:05,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:03:05,091 INFO L225 Difference]: With dead ends: 215 [2025-03-17 19:03:05,091 INFO L226 Difference]: Without dead ends: 214 [2025-03-17 19:03:05,092 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 19:03:05,092 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 1 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:03:05,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 803 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:03:05,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-03-17 19:03:05,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2025-03-17 19:03:05,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 203 states have (on average 1.4532019704433496) internal successors, (295), 208 states have internal predecessors, (295), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 19:03:05,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 301 transitions. [2025-03-17 19:03:05,105 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 301 transitions. Word has length 5 [2025-03-17 19:03:05,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:03:05,105 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 301 transitions. [2025-03-17 19:03:05,105 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 19:03:05,105 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 301 transitions. [2025-03-17 19:03:05,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 19:03:05,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:03:05,106 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 19:03:05,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 19:03:05,106 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:03:05,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:03:05,107 INFO L85 PathProgramCache]: Analyzing trace with hash 249165437, now seen corresponding path program 1 times [2025-03-17 19:03:05,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:03:05,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457524062] [2025-03-17 19:03:05,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:03:05,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:03:05,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:03:05,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:03:05,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:03:05,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:03:05,229 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 19:03:05,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:03:05,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457524062] [2025-03-17 19:03:05,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457524062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:03:05,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:03:05,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:03:05,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959205557] [2025-03-17 19:03:05,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:03:05,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:03:05,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:03:05,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:03:05,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:03:05,231 INFO L87 Difference]: Start difference. First operand 213 states and 301 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 19:03:05,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:03:05,275 INFO L93 Difference]: Finished difference Result 215 states and 303 transitions. [2025-03-17 19:03:05,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:03:05,275 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2025-03-17 19:03:05,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:03:05,276 INFO L225 Difference]: With dead ends: 215 [2025-03-17 19:03:05,277 INFO L226 Difference]: Without dead ends: 214 [2025-03-17 19:03:05,277 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 19:03:05,278 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 0 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 19:03:05,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 541 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 19:03:05,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-03-17 19:03:05,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2025-03-17 19:03:05,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 204 states have (on average 1.4509803921568627) internal successors, (296), 209 states have internal predecessors, (296), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 19:03:05,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 302 transitions. [2025-03-17 19:03:05,292 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 302 transitions. Word has length 6 [2025-03-17 19:03:05,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:03:05,292 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 302 transitions. [2025-03-17 19:03:05,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 19:03:05,292 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 302 transitions. [2025-03-17 19:03:05,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-17 19:03:05,294 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:03:05,294 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:03:05,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 19:03:05,294 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:03:05,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:03:05,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1948952662, now seen corresponding path program 1 times [2025-03-17 19:03:05,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:03:05,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979502838] [2025-03-17 19:03:05,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:03:05,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:03:05,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-17 19:03:05,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-17 19:03:05,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:03:05,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:03:05,521 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 19:03:05,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:03:05,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979502838] [2025-03-17 19:03:05,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979502838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:03:05,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:03:05,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 19:03:05,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682974512] [2025-03-17 19:03:05,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:03:05,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:03:05,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:03:05,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:03:05,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:03:05,523 INFO L87 Difference]: Start difference. First operand 214 states and 302 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 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 19:03:05,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:03:05,649 INFO L93 Difference]: Finished difference Result 425 states and 601 transitions. [2025-03-17 19:03:05,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:03:05,649 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 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 77 [2025-03-17 19:03:05,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:03:05,651 INFO L225 Difference]: With dead ends: 425 [2025-03-17 19:03:05,651 INFO L226 Difference]: Without dead ends: 217 [2025-03-17 19:03:05,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:03:05,654 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 106 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:03:05,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 660 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:03:05,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-03-17 19:03:05,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 214. [2025-03-17 19:03:05,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 204 states have (on average 1.4166666666666667) internal successors, (289), 209 states have internal predecessors, (289), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 19:03:05,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 295 transitions. [2025-03-17 19:03:05,668 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 295 transitions. Word has length 77 [2025-03-17 19:03:05,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:03:05,669 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 295 transitions. [2025-03-17 19:03:05,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 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 19:03:05,669 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 295 transitions. [2025-03-17 19:03:05,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-17 19:03:05,672 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:03:05,672 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:03:05,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 19:03:05,672 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:03:05,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:03:05,673 INFO L85 PathProgramCache]: Analyzing trace with hash 960070915, now seen corresponding path program 1 times [2025-03-17 19:03:05,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:03:05,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104684204] [2025-03-17 19:03:05,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:03:05,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:03:05,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-17 19:03:05,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-17 19:03:05,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:03:05,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:03:05,807 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 19:03:05,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:03:05,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104684204] [2025-03-17 19:03:05,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104684204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:03:05,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:03:05,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:03:05,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941198955] [2025-03-17 19:03:05,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:03:05,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:03:05,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:03:05,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:03:05,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:03:05,809 INFO L87 Difference]: Start difference. First operand 214 states and 295 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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 19:03:05,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:03:05,877 INFO L93 Difference]: Finished difference Result 428 states and 593 transitions. [2025-03-17 19:03:05,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:03:05,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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 77 [2025-03-17 19:03:05,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:03:05,880 INFO L225 Difference]: With dead ends: 428 [2025-03-17 19:03:05,880 INFO L226 Difference]: Without dead ends: 220 [2025-03-17 19:03:05,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:03:05,881 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 2 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:03:05,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 502 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:03:05,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-03-17 19:03:05,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2025-03-17 19:03:05,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 210 states have (on average 1.4047619047619047) internal successors, (295), 215 states have internal predecessors, (295), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 19:03:05,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 301 transitions. [2025-03-17 19:03:05,892 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 301 transitions. Word has length 77 [2025-03-17 19:03:05,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:03:05,892 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 301 transitions. [2025-03-17 19:03:05,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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 19:03:05,892 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 301 transitions. [2025-03-17 19:03:05,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-17 19:03:05,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:03:05,895 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:03:05,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 19:03:05,895 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:03:05,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:03:05,897 INFO L85 PathProgramCache]: Analyzing trace with hash 190900900, now seen corresponding path program 1 times [2025-03-17 19:03:05,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:03:05,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942176917] [2025-03-17 19:03:05,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:03:05,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:03:05,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-17 19:03:05,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-17 19:03:05,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:03:05,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:03:06,034 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 19:03:06,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:03:06,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942176917] [2025-03-17 19:03:06,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942176917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:03:06,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:03:06,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:03:06,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827546738] [2025-03-17 19:03:06,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:03:06,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:03:06,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:03:06,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:03:06,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:03:06,036 INFO L87 Difference]: Start difference. First operand 220 states and 301 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 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 19:03:06,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:03:06,142 INFO L93 Difference]: Finished difference Result 565 states and 787 transitions. [2025-03-17 19:03:06,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:03:06,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 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 77 [2025-03-17 19:03:06,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:03:06,144 INFO L225 Difference]: With dead ends: 565 [2025-03-17 19:03:06,144 INFO L226 Difference]: Without dead ends: 351 [2025-03-17 19:03:06,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:03:06,145 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 134 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:03:06,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 526 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:03:06,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-03-17 19:03:06,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2025-03-17 19:03:06,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 341 states have (on average 1.4222873900293256) internal successors, (485), 346 states have internal predecessors, (485), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 19:03:06,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 491 transitions. [2025-03-17 19:03:06,159 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 491 transitions. Word has length 77 [2025-03-17 19:03:06,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:03:06,159 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 491 transitions. [2025-03-17 19:03:06,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 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 19:03:06,159 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 491 transitions. [2025-03-17 19:03:06,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-17 19:03:06,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:03:06,163 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:03:06,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 19:03:06,164 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:03:06,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:03:06,164 INFO L85 PathProgramCache]: Analyzing trace with hash 527057762, now seen corresponding path program 1 times [2025-03-17 19:03:06,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:03:06,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636049839] [2025-03-17 19:03:06,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:03:06,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:03:06,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 19:03:06,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 19:03:06,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:03:06,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:03:06,358 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:03:06,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:03:06,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636049839] [2025-03-17 19:03:06,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636049839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:03:06,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:03:06,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:03:06,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589815328] [2025-03-17 19:03:06,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:03:06,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:03:06,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:03:06,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:03:06,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:03:06,361 INFO L87 Difference]: Start difference. First operand 351 states and 491 transitions. Second operand has 4 states, 3 states have (on average 28.333333333333332) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:03:06,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:03:06,409 INFO L93 Difference]: Finished difference Result 351 states and 491 transitions. [2025-03-17 19:03:06,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:03:06,410 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 28.333333333333332) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 92 [2025-03-17 19:03:06,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:03:06,412 INFO L225 Difference]: With dead ends: 351 [2025-03-17 19:03:06,412 INFO L226 Difference]: Without dead ends: 350 [2025-03-17 19:03:06,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:03:06,413 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 190 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 19:03:06,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 531 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 19:03:06,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2025-03-17 19:03:06,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2025-03-17 19:03:06,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 341 states have (on average 1.4193548387096775) internal successors, (484), 345 states have internal predecessors, (484), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 19:03:06,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 490 transitions. [2025-03-17 19:03:06,423 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 490 transitions. Word has length 92 [2025-03-17 19:03:06,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:03:06,425 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 490 transitions. [2025-03-17 19:03:06,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 28.333333333333332) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:03:06,425 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 490 transitions. [2025-03-17 19:03:06,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-17 19:03:06,426 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:03:06,426 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:03:06,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 19:03:06,426 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:03:06,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:03:06,427 INFO L85 PathProgramCache]: Analyzing trace with hash -841078516, now seen corresponding path program 1 times [2025-03-17 19:03:06,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:03:06,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911537938] [2025-03-17 19:03:06,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:03:06,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:03:06,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 19:03:06,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 19:03:06,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:03:06,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:03:06,626 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:03:06,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:03:06,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911537938] [2025-03-17 19:03:06,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911537938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:03:06,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:03:06,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:03:06,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701104091] [2025-03-17 19:03:06,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:03:06,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:03:06,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:03:06,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:03:06,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:03:06,628 INFO L87 Difference]: Start difference. First operand 350 states and 490 transitions. Second operand has 4 states, 3 states have (on average 28.666666666666668) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:03:06,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:03:06,707 INFO L93 Difference]: Finished difference Result 414 states and 574 transitions. [2025-03-17 19:03:06,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:03:06,707 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 28.666666666666668) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 93 [2025-03-17 19:03:06,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:03:06,709 INFO L225 Difference]: With dead ends: 414 [2025-03-17 19:03:06,709 INFO L226 Difference]: Without dead ends: 413 [2025-03-17 19:03:06,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:03:06,710 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 184 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:03:06,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 782 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:03:06,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-03-17 19:03:06,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2025-03-17 19:03:06,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 401 states have (on average 1.399002493765586) internal successors, (561), 405 states have internal predecessors, (561), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 19:03:06,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 573 transitions. [2025-03-17 19:03:06,721 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 573 transitions. Word has length 93 [2025-03-17 19:03:06,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:03:06,721 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 573 transitions. [2025-03-17 19:03:06,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 28.666666666666668) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:03:06,722 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 573 transitions. [2025-03-17 19:03:06,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-17 19:03:06,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:03:06,722 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:03:06,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 19:03:06,723 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:03:06,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:03:06,723 INFO L85 PathProgramCache]: Analyzing trace with hash 269179359, now seen corresponding path program 1 times [2025-03-17 19:03:06,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:03:06,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323171310] [2025-03-17 19:03:06,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:03:06,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:03:06,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 19:03:06,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 19:03:06,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:03:06,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:03:06,913 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:03:06,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:03:06,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323171310] [2025-03-17 19:03:06,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323171310] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:03:06,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284785851] [2025-03-17 19:03:06,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:03:06,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:03:06,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:03:06,916 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 19:03:06,918 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 19:03:07,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 19:03:07,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 19:03:07,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:03:07,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:03:07,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 19:03:07,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:03:07,245 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:03:07,246 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:03:07,380 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:03:07,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284785851] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:03:07,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:03:07,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-17 19:03:07,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705916584] [2025-03-17 19:03:07,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:03:07,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 19:03:07,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:03:07,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 19:03:07,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-17 19:03:07,382 INFO L87 Difference]: Start difference. First operand 413 states and 573 transitions. Second operand has 8 states, 8 states have (on average 21.625) internal successors, (173), 8 states have internal predecessors, (173), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 19:03:07,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:03:07,530 INFO L93 Difference]: Finished difference Result 623 states and 865 transitions. [2025-03-17 19:03:07,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 19:03:07,530 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.625) internal successors, (173), 8 states have internal predecessors, (173), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 96 [2025-03-17 19:03:07,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:03:07,533 INFO L225 Difference]: With dead ends: 623 [2025-03-17 19:03:07,533 INFO L226 Difference]: Without dead ends: 617 [2025-03-17 19:03:07,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-17 19:03:07,537 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 1098 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1105 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:03:07,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1105 Valid, 1116 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:03:07,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2025-03-17 19:03:07,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 615. [2025-03-17 19:03:07,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 600 states have (on average 1.3983333333333334) internal successors, (839), 604 states have internal predecessors, (839), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 19:03:07,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 857 transitions. [2025-03-17 19:03:07,556 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 857 transitions. Word has length 96 [2025-03-17 19:03:07,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:03:07,557 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 857 transitions. [2025-03-17 19:03:07,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.625) internal successors, (173), 8 states have internal predecessors, (173), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 19:03:07,557 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 857 transitions. [2025-03-17 19:03:07,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-17 19:03:07,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:03:07,558 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:03:07,566 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 19:03:07,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:03:07,759 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:03:07,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:03:07,759 INFO L85 PathProgramCache]: Analyzing trace with hash -234969431, now seen corresponding path program 1 times [2025-03-17 19:03:07,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:03:07,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175115898] [2025-03-17 19:03:07,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:03:07,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:03:07,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-17 19:03:07,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-17 19:03:07,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:03:07,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:03:08,198 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:03:08,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:03:08,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175115898] [2025-03-17 19:03:08,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175115898] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:03:08,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863485040] [2025-03-17 19:03:08,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:03:08,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:03:08,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:03:08,201 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 19:03:08,203 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 19:03:08,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-17 19:03:08,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-17 19:03:08,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:03:08,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:03:08,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 19:03:08,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:03:08,599 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:03:08,599 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:03:08,722 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:03:08,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863485040] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:03:08,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:03:08,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-17 19:03:08,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712160646] [2025-03-17 19:03:08,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:03:08,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 19:03:08,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:03:08,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 19:03:08,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2025-03-17 19:03:08,723 INFO L87 Difference]: Start difference. First operand 615 states and 857 transitions. Second operand has 13 states, 12 states have (on average 15.416666666666666) internal successors, (185), 13 states have internal predecessors, (185), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 19:03:08,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:03:08,961 INFO L93 Difference]: Finished difference Result 825 states and 1153 transitions. [2025-03-17 19:03:08,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 19:03:08,961 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 15.416666666666666) internal successors, (185), 13 states have internal predecessors, (185), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 97 [2025-03-17 19:03:08,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:03:08,964 INFO L225 Difference]: With dead ends: 825 [2025-03-17 19:03:08,964 INFO L226 Difference]: Without dead ends: 824 [2025-03-17 19:03:08,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2025-03-17 19:03:08,965 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 790 mSDsluCounter, 2265 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 2603 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 19:03:08,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 2603 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 19:03:08,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2025-03-17 19:03:08,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 819. [2025-03-17 19:03:08,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 801 states have (on average 1.3970037453183521) internal successors, (1119), 805 states have internal predecessors, (1119), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 19:03:08,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1143 transitions. [2025-03-17 19:03:08,983 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1143 transitions. Word has length 97 [2025-03-17 19:03:08,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:03:08,983 INFO L471 AbstractCegarLoop]: Abstraction has 819 states and 1143 transitions. [2025-03-17 19:03:08,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 15.416666666666666) internal successors, (185), 13 states have internal predecessors, (185), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 19:03:08,983 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1143 transitions. [2025-03-17 19:03:08,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-17 19:03:08,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:03:08,984 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:03:08,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 19:03:09,184 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,SelfDestructingSolverStorable9 [2025-03-17 19:03:09,185 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:03:09,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:03:09,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1305882607, now seen corresponding path program 1 times [2025-03-17 19:03:09,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:03:09,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109509565] [2025-03-17 19:03:09,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:03:09,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:03:09,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 19:03:09,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 19:03:09,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:03:09,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:03:09,587 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:03:09,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:03:09,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109509565] [2025-03-17 19:03:09,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109509565] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:03:09,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870934993] [2025-03-17 19:03:09,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:03:09,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:03:09,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:03:09,590 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 19:03:09,592 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 19:03:09,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 19:03:09,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 19:03:09,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:03:09,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:03:09,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 19:03:09,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:03:09,959 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:03:09,960 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:03:10,091 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:03:10,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870934993] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:03:10,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:03:10,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-17 19:03:10,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527969359] [2025-03-17 19:03:10,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:03:10,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 19:03:10,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:03:10,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 19:03:10,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2025-03-17 19:03:10,093 INFO L87 Difference]: Start difference. First operand 819 states and 1143 transitions. Second operand has 13 states, 12 states have (on average 15.666666666666666) internal successors, (188), 13 states have internal predecessors, (188), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 19:03:10,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:03:10,310 INFO L93 Difference]: Finished difference Result 825 states and 1150 transitions. [2025-03-17 19:03:10,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 19:03:10,311 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 15.666666666666666) internal successors, (188), 13 states have internal predecessors, (188), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 98 [2025-03-17 19:03:10,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:03:10,314 INFO L225 Difference]: With dead ends: 825 [2025-03-17 19:03:10,314 INFO L226 Difference]: Without dead ends: 824 [2025-03-17 19:03:10,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2025-03-17 19:03:10,315 INFO L435 NwaCegarLoop]: 300 mSDtfsCounter, 786 mSDsluCounter, 1867 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 2167 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 19:03:10,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [791 Valid, 2167 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 19:03:10,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2025-03-17 19:03:10,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 820. [2025-03-17 19:03:10,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 820 states, 802 states have (on average 1.3940149625935163) internal successors, (1118), 806 states have internal predecessors, (1118), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 19:03:10,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1142 transitions. [2025-03-17 19:03:10,338 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1142 transitions. Word has length 98 [2025-03-17 19:03:10,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:03:10,338 INFO L471 AbstractCegarLoop]: Abstraction has 820 states and 1142 transitions. [2025-03-17 19:03:10,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 15.666666666666666) internal successors, (188), 13 states have internal predecessors, (188), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 19:03:10,338 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1142 transitions. [2025-03-17 19:03:10,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-03-17 19:03:10,340 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:03:10,341 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:03:10,348 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 19:03:10,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:03:10,541 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:03:10,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:03:10,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1715527436, now seen corresponding path program 1 times [2025-03-17 19:03:10,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:03:10,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801585765] [2025-03-17 19:03:10,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:03:10,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:03:10,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-03-17 19:03:10,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-03-17 19:03:10,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:03:10,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:03:10,823 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-17 19:03:10,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:03:10,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801585765] [2025-03-17 19:03:10,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801585765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:03:10,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:03:10,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:03:10,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171971470] [2025-03-17 19:03:10,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:03:10,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:03:10,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:03:10,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:03:10,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:03:10,825 INFO L87 Difference]: Start difference. First operand 820 states and 1142 transitions. Second operand has 4 states, 3 states have (on average 55.333333333333336) internal successors, (166), 4 states have internal predecessors, (166), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:03:10,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:03:10,871 INFO L93 Difference]: Finished difference Result 820 states and 1142 transitions. [2025-03-17 19:03:10,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:03:10,872 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 55.333333333333336) internal successors, (166), 4 states have internal predecessors, (166), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 247 [2025-03-17 19:03:10,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:03:10,875 INFO L225 Difference]: With dead ends: 820 [2025-03-17 19:03:10,875 INFO L226 Difference]: Without dead ends: 819 [2025-03-17 19:03:10,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:03:10,876 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 194 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 19:03:10,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 533 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 19:03:10,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2025-03-17 19:03:10,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 819. [2025-03-17 19:03:10,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 802 states have (on average 1.3915211970074812) internal successors, (1116), 805 states have internal predecessors, (1116), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 19:03:10,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1140 transitions. [2025-03-17 19:03:10,895 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1140 transitions. Word has length 247 [2025-03-17 19:03:10,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:03:10,896 INFO L471 AbstractCegarLoop]: Abstraction has 819 states and 1140 transitions. [2025-03-17 19:03:10,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 55.333333333333336) internal successors, (166), 4 states have internal predecessors, (166), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:03:10,896 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1140 transitions. [2025-03-17 19:03:10,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-03-17 19:03:10,900 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:03:10,901 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:03:10,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 19:03:10,901 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:03:10,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:03:10,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1462035423, now seen corresponding path program 1 times [2025-03-17 19:03:10,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:03:10,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076594305] [2025-03-17 19:03:10,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:03:10,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:03:10,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-17 19:03:11,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-17 19:03:11,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:03:11,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:03:11,409 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 230 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:03:11,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:03:11,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076594305] [2025-03-17 19:03:11,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076594305] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:03:11,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418701766] [2025-03-17 19:03:11,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:03:11,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:03:11,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:03:11,412 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 19:03:11,414 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 19:03:11,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-17 19:03:11,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-17 19:03:11,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:03:11,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:03:11,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 1303 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 19:03:11,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:03:12,010 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 230 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:03:12,011 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:03:12,275 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 230 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:03:12,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418701766] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:03:12,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:03:12,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2025-03-17 19:03:12,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569121067] [2025-03-17 19:03:12,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:03:12,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 19:03:12,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:03:12,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 19:03:12,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-03-17 19:03:12,277 INFO L87 Difference]: Start difference. First operand 819 states and 1140 transitions. Second operand has 16 states, 16 states have (on average 30.0625) internal successors, (481), 16 states have internal predecessors, (481), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 19:03:12,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:03:12,596 INFO L93 Difference]: Finished difference Result 1427 states and 1991 transitions. [2025-03-17 19:03:12,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 19:03:12,597 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 30.0625) internal successors, (481), 16 states have internal predecessors, (481), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 250 [2025-03-17 19:03:12,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:03:12,602 INFO L225 Difference]: With dead ends: 1427 [2025-03-17 19:03:12,602 INFO L226 Difference]: Without dead ends: 1422 [2025-03-17 19:03:12,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 493 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-03-17 19:03:12,604 INFO L435 NwaCegarLoop]: 378 mSDtfsCounter, 2831 mSDsluCounter, 2386 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2850 SdHoareTripleChecker+Valid, 2764 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 19:03:12,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2850 Valid, 2764 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 19:03:12,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2025-03-17 19:03:12,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 1418. [2025-03-17 19:03:12,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1418 states, 1392 states have (on average 1.3936781609195403) internal successors, (1940), 1395 states have internal predecessors, (1940), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 19:03:12,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 1982 transitions. [2025-03-17 19:03:12,635 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 1982 transitions. Word has length 250 [2025-03-17 19:03:12,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:03:12,635 INFO L471 AbstractCegarLoop]: Abstraction has 1418 states and 1982 transitions. [2025-03-17 19:03:12,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 30.0625) internal successors, (481), 16 states have internal predecessors, (481), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 19:03:12,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 1982 transitions. [2025-03-17 19:03:12,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-03-17 19:03:12,640 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:03:12,640 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:03:12,649 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 19:03:12,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:03:12,845 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:03:12,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:03:12,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1104981735, now seen corresponding path program 1 times [2025-03-17 19:03:12,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:03:12,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677372005] [2025-03-17 19:03:12,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:03:12,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:03:12,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-03-17 19:03:13,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-03-17 19:03:13,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:03:13,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:03:14,773 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 0 proven. 472 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:03:14,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:03:14,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677372005] [2025-03-17 19:03:14,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677372005] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:03:14,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870324335] [2025-03-17 19:03:14,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:03:14,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:03:14,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:03:14,776 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 19:03:14,778 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 19:03:15,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-03-17 19:03:15,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-03-17 19:03:15,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:03:15,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:03:15,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 1711 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-17 19:03:15,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:03:15,698 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 0 proven. 472 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:03:15,699 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:03:16,089 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 0 proven. 472 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:03:16,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870324335] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:03:16,089 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:03:16,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2025-03-17 19:03:16,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720593320] [2025-03-17 19:03:16,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:03:16,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-17 19:03:16,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:03:16,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-17 19:03:16,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=498, Unknown=0, NotChecked=0, Total=756 [2025-03-17 19:03:16,092 INFO L87 Difference]: Start difference. First operand 1418 states and 1982 transitions. Second operand has 28 states, 27 states have (on average 24.296296296296298) internal successors, (656), 28 states have internal predecessors, (656), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 19:03:16,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:03:16,691 INFO L93 Difference]: Finished difference Result 2035 states and 2855 transitions. [2025-03-17 19:03:16,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-17 19:03:16,692 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 24.296296296296298) internal successors, (656), 28 states have internal predecessors, (656), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 328 [2025-03-17 19:03:16,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:03:16,699 INFO L225 Difference]: With dead ends: 2035 [2025-03-17 19:03:16,700 INFO L226 Difference]: Without dead ends: 2034 [2025-03-17 19:03:16,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 670 GetRequests, 639 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=338, Invalid=718, Unknown=0, NotChecked=0, Total=1056 [2025-03-17 19:03:16,702 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 3173 mSDsluCounter, 4886 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3196 SdHoareTripleChecker+Valid, 5301 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 19:03:16,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3196 Valid, 5301 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 19:03:16,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2034 states. [2025-03-17 19:03:16,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2034 to 2024. [2025-03-17 19:03:16,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2024 states, 1989 states have (on average 1.3936651583710407) internal successors, (2772), 1992 states have internal predecessors, (2772), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 19:03:16,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2024 states to 2024 states and 2832 transitions. [2025-03-17 19:03:16,748 INFO L78 Accepts]: Start accepts. Automaton has 2024 states and 2832 transitions. Word has length 328 [2025-03-17 19:03:16,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:03:16,749 INFO L471 AbstractCegarLoop]: Abstraction has 2024 states and 2832 transitions. [2025-03-17 19:03:16,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 24.296296296296298) internal successors, (656), 28 states have internal predecessors, (656), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 19:03:16,749 INFO L276 IsEmpty]: Start isEmpty. Operand 2024 states and 2832 transitions. [2025-03-17 19:03:16,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-03-17 19:03:16,753 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:03:16,753 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:03:16,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 19:03:16,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-17 19:03:16,954 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:03:16,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:03:16,955 INFO L85 PathProgramCache]: Analyzing trace with hash 105304959, now seen corresponding path program 1 times [2025-03-17 19:03:16,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:03:16,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007587254] [2025-03-17 19:03:16,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:03:16,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:03:17,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-03-17 19:03:17,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-03-17 19:03:17,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:03:17,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:03:18,532 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 476 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:03:18,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:03:18,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007587254] [2025-03-17 19:03:18,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007587254] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:03:18,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594073225] [2025-03-17 19:03:18,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:03:18,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:03:18,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:03:18,535 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 19:03:18,536 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 19:03:18,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-03-17 19:03:19,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-03-17 19:03:19,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:03:19,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:03:19,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 1712 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-17 19:03:19,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:03:19,409 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 476 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:03:19,409 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:03:19,766 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 476 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:03:19,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594073225] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:03:19,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:03:19,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2025-03-17 19:03:19,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457628667] [2025-03-17 19:03:19,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:03:19,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-17 19:03:19,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:03:19,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-17 19:03:19,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=498, Unknown=0, NotChecked=0, Total=756 [2025-03-17 19:03:19,770 INFO L87 Difference]: Start difference. First operand 2024 states and 2832 transitions. Second operand has 28 states, 27 states have (on average 24.40740740740741) internal successors, (659), 28 states have internal predecessors, (659), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 19:03:20,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:03:20,299 INFO L93 Difference]: Finished difference Result 2035 states and 2849 transitions. [2025-03-17 19:03:20,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 19:03:20,299 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 24.40740740740741) internal successors, (659), 28 states have internal predecessors, (659), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 329 [2025-03-17 19:03:20,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:03:20,306 INFO L225 Difference]: With dead ends: 2035 [2025-03-17 19:03:20,306 INFO L226 Difference]: Without dead ends: 2034 [2025-03-17 19:03:20,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 672 GetRequests, 641 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=338, Invalid=718, Unknown=0, NotChecked=0, Total=1056 [2025-03-17 19:03:20,307 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 3295 mSDsluCounter, 3434 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3318 SdHoareTripleChecker+Valid, 3733 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 19:03:20,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3318 Valid, 3733 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 19:03:20,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2034 states. [2025-03-17 19:03:20,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2034 to 2025. [2025-03-17 19:03:20,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2025 states, 1990 states have (on average 1.3909547738693466) internal successors, (2768), 1993 states have internal predecessors, (2768), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 19:03:20,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2025 states to 2025 states and 2828 transitions. [2025-03-17 19:03:20,358 INFO L78 Accepts]: Start accepts. Automaton has 2025 states and 2828 transitions. Word has length 329 [2025-03-17 19:03:20,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:03:20,359 INFO L471 AbstractCegarLoop]: Abstraction has 2025 states and 2828 transitions. [2025-03-17 19:03:20,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 24.40740740740741) internal successors, (659), 28 states have internal predecessors, (659), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 19:03:20,359 INFO L276 IsEmpty]: Start isEmpty. Operand 2025 states and 2828 transitions. [2025-03-17 19:03:20,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 559 [2025-03-17 19:03:20,367 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:03:20,367 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:03:20,379 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 19:03:20,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-17 19:03:20,568 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:03:20,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:03:20,569 INFO L85 PathProgramCache]: Analyzing trace with hash 879654879, now seen corresponding path program 2 times [2025-03-17 19:03:20,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:03:20,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866392045] [2025-03-17 19:03:20,569 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:03:20,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:03:20,726 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 558 statements into 2 equivalence classes. [2025-03-17 19:03:20,876 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 558 of 558 statements. [2025-03-17 19:03:20,878 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:03:20,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:03:21,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1616 backedges. 0 proven. 1612 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:03:21,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:03:21,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866392045] [2025-03-17 19:03:21,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866392045] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:03:21,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915343291] [2025-03-17 19:03:21,929 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:03:21,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:03:21,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:03:21,931 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 19:03:21,932 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 19:03:22,341 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 558 statements into 2 equivalence classes. [2025-03-17 19:03:22,602 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 558 of 558 statements. [2025-03-17 19:03:22,602 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:03:22,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:03:22,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 2807 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 19:03:22,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:03:22,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1616 backedges. 0 proven. 1612 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:03:22,966 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:03:23,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1616 backedges. 0 proven. 1612 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:03:23,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915343291] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:03:23,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:03:23,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 21 [2025-03-17 19:03:23,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595368786] [2025-03-17 19:03:23,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:03:23,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 19:03:23,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:03:23,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 19:03:23,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2025-03-17 19:03:23,404 INFO L87 Difference]: Start difference. First operand 2025 states and 2828 transitions. Second operand has 21 states, 21 states have (on average 34.04761904761905) internal successors, (715), 21 states have internal predecessors, (715), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 19:03:23,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:03:23,731 INFO L93 Difference]: Finished difference Result 2030 states and 2833 transitions. [2025-03-17 19:03:23,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 19:03:23,731 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 34.04761904761905) internal successors, (715), 21 states have internal predecessors, (715), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 558 [2025-03-17 19:03:23,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:03:23,737 INFO L225 Difference]: With dead ends: 2030 [2025-03-17 19:03:23,737 INFO L226 Difference]: Without dead ends: 2025 [2025-03-17 19:03:23,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1131 GetRequests, 1101 SyntacticMatches, 11 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2025-03-17 19:03:23,738 INFO L435 NwaCegarLoop]: 300 mSDtfsCounter, 3640 mSDsluCounter, 2868 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3666 SdHoareTripleChecker+Valid, 3168 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 19:03:23,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3666 Valid, 3168 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 19:03:23,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2025 states. [2025-03-17 19:03:23,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2025 to 2025. [2025-03-17 19:03:23,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2025 states, 1990 states have (on average 1.3894472361809045) internal successors, (2765), 1993 states have internal predecessors, (2765), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 19:03:23,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2025 states to 2025 states and 2825 transitions. [2025-03-17 19:03:23,770 INFO L78 Accepts]: Start accepts. Automaton has 2025 states and 2825 transitions. Word has length 558 [2025-03-17 19:03:23,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:03:23,770 INFO L471 AbstractCegarLoop]: Abstraction has 2025 states and 2825 transitions. [2025-03-17 19:03:23,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 34.04761904761905) internal successors, (715), 21 states have internal predecessors, (715), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 19:03:23,771 INFO L276 IsEmpty]: Start isEmpty. Operand 2025 states and 2825 transitions. [2025-03-17 19:03:23,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 790 [2025-03-17 19:03:23,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:03:23,783 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:03:23,794 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 19:03:23,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:03:23,984 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:03:23,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:03:23,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1991689071, now seen corresponding path program 3 times [2025-03-17 19:03:23,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:03:23,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518625290] [2025-03-17 19:03:23,985 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:03:23,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:03:24,152 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 789 statements into 12 equivalence classes. [2025-03-17 19:03:24,222 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 81 of 789 statements. [2025-03-17 19:03:24,225 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 19:03:24,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:03:24,423 INFO L134 CoverageAnalysis]: Checked inductivity of 3461 backedges. 638 proven. 0 refuted. 0 times theorem prover too weak. 2823 trivial. 0 not checked. [2025-03-17 19:03:24,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:03:24,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518625290] [2025-03-17 19:03:24,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518625290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:03:24,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:03:24,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 19:03:24,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995632973] [2025-03-17 19:03:24,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:03:24,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 19:03:24,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:03:24,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 19:03:24,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 19:03:24,424 INFO L87 Difference]: Start difference. First operand 2025 states and 2825 transitions. Second operand has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:03:24,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:03:24,857 INFO L93 Difference]: Finished difference Result 4360 states and 6035 transitions. [2025-03-17 19:03:24,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 19:03:24,858 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 789 [2025-03-17 19:03:24,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:03:24,864 INFO L225 Difference]: With dead ends: 4360 [2025-03-17 19:03:24,864 INFO L226 Difference]: Without dead ends: 2425 [2025-03-17 19:03:24,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 19:03:24,867 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 13 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 19:03:24,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 787 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 19:03:24,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2425 states. [2025-03-17 19:03:24,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2425 to 2385. [2025-03-17 19:03:24,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2385 states, 2350 states have (on average 1.3595744680851063) internal successors, (3195), 2353 states have internal predecessors, (3195), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 19:03:24,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2385 states to 2385 states and 3255 transitions. [2025-03-17 19:03:24,907 INFO L78 Accepts]: Start accepts. Automaton has 2385 states and 3255 transitions. Word has length 789 [2025-03-17 19:03:24,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:03:24,907 INFO L471 AbstractCegarLoop]: Abstraction has 2385 states and 3255 transitions. [2025-03-17 19:03:24,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:03:24,907 INFO L276 IsEmpty]: Start isEmpty. Operand 2385 states and 3255 transitions. [2025-03-17 19:03:24,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 800 [2025-03-17 19:03:24,913 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:03:24,914 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:03:24,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 19:03:24,914 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:03:24,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:03:24,915 INFO L85 PathProgramCache]: Analyzing trace with hash -946088149, now seen corresponding path program 1 times [2025-03-17 19:03:24,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:03:24,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852710897] [2025-03-17 19:03:24,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:03:24,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:03:25,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 799 statements into 1 equivalence classes. [2025-03-17 19:03:25,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 799 of 799 statements. [2025-03-17 19:03:25,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:03:25,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:03:25,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3506 backedges. 334 proven. 0 refuted. 0 times theorem prover too weak. 3172 trivial. 0 not checked. [2025-03-17 19:03:25,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:03:25,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852710897] [2025-03-17 19:03:25,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852710897] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:03:25,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:03:25,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 19:03:25,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566075081] [2025-03-17 19:03:25,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:03:25,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 19:03:25,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:03:25,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 19:03:25,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 19:03:25,998 INFO L87 Difference]: Start difference. First operand 2385 states and 3255 transitions. Second operand has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 7 states have internal predecessors, (130), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:03:26,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:03:26,367 INFO L93 Difference]: Finished difference Result 4754 states and 6516 transitions. [2025-03-17 19:03:26,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 19:03:26,367 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 7 states have internal predecessors, (130), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 799 [2025-03-17 19:03:26,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:03:26,373 INFO L225 Difference]: With dead ends: 4754 [2025-03-17 19:03:26,373 INFO L226 Difference]: Without dead ends: 2505 [2025-03-17 19:03:26,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 19:03:26,376 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 14 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 19:03:26,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 946 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 19:03:26,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2505 states. [2025-03-17 19:03:26,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2505 to 2475. [2025-03-17 19:03:26,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2475 states, 2440 states have (on average 1.3627049180327868) internal successors, (3325), 2443 states have internal predecessors, (3325), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 19:03:26,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2475 states to 2475 states and 3385 transitions. [2025-03-17 19:03:26,430 INFO L78 Accepts]: Start accepts. Automaton has 2475 states and 3385 transitions. Word has length 799 [2025-03-17 19:03:26,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:03:26,431 INFO L471 AbstractCegarLoop]: Abstraction has 2475 states and 3385 transitions. [2025-03-17 19:03:26,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 7 states have internal predecessors, (130), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:03:26,431 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 3385 transitions. [2025-03-17 19:03:26,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 810 [2025-03-17 19:03:26,441 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:03:26,441 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:03:26,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 19:03:26,442 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:03:26,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:03:26,442 INFO L85 PathProgramCache]: Analyzing trace with hash 165533621, now seen corresponding path program 1 times [2025-03-17 19:03:26,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:03:26,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047300651] [2025-03-17 19:03:26,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:03:26,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:03:26,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 809 statements into 1 equivalence classes. [2025-03-17 19:03:26,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 809 of 809 statements. [2025-03-17 19:03:26,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:03:26,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:03:27,589 INFO L134 CoverageAnalysis]: Checked inductivity of 3551 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 3226 trivial. 0 not checked. [2025-03-17 19:03:27,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:03:27,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047300651] [2025-03-17 19:03:27,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047300651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:03:27,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:03:27,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 19:03:27,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013271324] [2025-03-17 19:03:27,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:03:27,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 19:03:27,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:03:27,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 19:03:27,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 19:03:27,592 INFO L87 Difference]: Start difference. First operand 2475 states and 3385 transitions. Second operand has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:03:27,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:03:27,824 INFO L93 Difference]: Finished difference Result 4842 states and 6634 transitions. [2025-03-17 19:03:27,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 19:03:27,825 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 809 [2025-03-17 19:03:27,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:03:27,832 INFO L225 Difference]: With dead ends: 4842 [2025-03-17 19:03:27,832 INFO L226 Difference]: Without dead ends: 2505 [2025-03-17 19:03:27,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 19:03:27,835 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 8 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 19:03:27,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 703 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 19:03:27,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2505 states. [2025-03-17 19:03:27,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2505 to 2505. [2025-03-17 19:03:27,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2505 states, 2470 states have (on average 1.3582995951417005) internal successors, (3355), 2473 states have internal predecessors, (3355), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 19:03:27,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2505 states to 2505 states and 3415 transitions. [2025-03-17 19:03:27,879 INFO L78 Accepts]: Start accepts. Automaton has 2505 states and 3415 transitions. Word has length 809 [2025-03-17 19:03:27,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:03:27,880 INFO L471 AbstractCegarLoop]: Abstraction has 2505 states and 3415 transitions. [2025-03-17 19:03:27,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:03:27,880 INFO L276 IsEmpty]: Start isEmpty. Operand 2505 states and 3415 transitions. [2025-03-17 19:03:27,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 810 [2025-03-17 19:03:27,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:03:27,887 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:03:27,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 19:03:27,887 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:03:27,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:03:27,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1654219645, now seen corresponding path program 1 times [2025-03-17 19:03:27,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:03:27,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571069757] [2025-03-17 19:03:27,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:03:27,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:03:28,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 809 statements into 1 equivalence classes. [2025-03-17 19:03:28,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 809 of 809 statements. [2025-03-17 19:03:28,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:03:28,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:03:29,580 INFO L134 CoverageAnalysis]: Checked inductivity of 3551 backedges. 361 proven. 0 refuted. 0 times theorem prover too weak. 3190 trivial. 0 not checked. [2025-03-17 19:03:29,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:03:29,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571069757] [2025-03-17 19:03:29,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571069757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:03:29,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:03:29,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 19:03:29,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106126909] [2025-03-17 19:03:29,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:03:29,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 19:03:29,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:03:29,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 19:03:29,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 19:03:29,583 INFO L87 Difference]: Start difference. First operand 2505 states and 3415 transitions. Second operand has 9 states, 9 states have (on average 14.88888888888889) internal successors, (134), 9 states have internal predecessors, (134), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:03:30,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:03:30,199 INFO L93 Difference]: Finished difference Result 5007 states and 6846 transitions. [2025-03-17 19:03:30,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 19:03:30,200 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.88888888888889) internal successors, (134), 9 states have internal predecessors, (134), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 809 [2025-03-17 19:03:30,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:03:30,207 INFO L225 Difference]: With dead ends: 5007 [2025-03-17 19:03:30,207 INFO L226 Difference]: Without dead ends: 2645 [2025-03-17 19:03:30,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-17 19:03:30,209 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 31 mSDsluCounter, 1098 mSDsCounter, 0 mSdLazyCounter, 1051 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 1354 SdHoareTripleChecker+Invalid, 1054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 19:03:30,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 1354 Invalid, 1054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1051 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 19:03:30,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2645 states. [2025-03-17 19:03:30,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2645 to 2585. [2025-03-17 19:03:30,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2585 states, 2550 states have (on average 1.3549019607843138) internal successors, (3455), 2553 states have internal predecessors, (3455), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 19:03:30,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2585 states to 2585 states and 3515 transitions. [2025-03-17 19:03:30,254 INFO L78 Accepts]: Start accepts. Automaton has 2585 states and 3515 transitions. Word has length 809 [2025-03-17 19:03:30,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:03:30,254 INFO L471 AbstractCegarLoop]: Abstraction has 2585 states and 3515 transitions. [2025-03-17 19:03:30,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.88888888888889) internal successors, (134), 9 states have internal predecessors, (134), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:03:30,255 INFO L276 IsEmpty]: Start isEmpty. Operand 2585 states and 3515 transitions. [2025-03-17 19:03:30,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 820 [2025-03-17 19:03:30,261 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:03:30,261 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:03:30,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 19:03:30,261 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:03:30,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:03:30,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1006047053, now seen corresponding path program 1 times [2025-03-17 19:03:30,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:03:30,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412292687] [2025-03-17 19:03:30,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:03:30,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:03:30,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 819 statements into 1 equivalence classes.