./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive/recHanoi03-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 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/recursive/recHanoi03-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6256a35b65d93a8e45ad38c9510c3be689a890aeee58265a5723be13a7385a72 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 11:28:35,798 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 11:28:35,851 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 11:28:35,854 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 11:28:35,855 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 11:28:35,869 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 11:28:35,870 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 11:28:35,870 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 11:28:35,871 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 11:28:35,871 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 11:28:35,872 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 11:28:35,872 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 11:28:35,872 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 11:28:35,872 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 11:28:35,872 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 11:28:35,872 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 11:28:35,873 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 11:28:35,873 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 11:28:35,873 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 11:28:35,873 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 11:28:35,873 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 11:28:35,873 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 11:28:35,873 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 11:28:35,873 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 11:28:35,873 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 11:28:35,873 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 11:28:35,874 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 11:28:35,874 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 11:28:35,874 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 11:28:35,874 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 11:28:35,874 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 11:28:35,874 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 11:28:35,875 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 11:28:35,875 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 11:28:35,875 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:28:35,875 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 11:28:35,875 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 11:28:35,875 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 11:28:35,875 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 11:28:35,875 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 11:28:35,875 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 11:28:35,875 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 11:28:35,875 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 11:28:35,875 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 11:28:35,875 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 11:28:35,875 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 -> 6256a35b65d93a8e45ad38c9510c3be689a890aeee58265a5723be13a7385a72 [2025-03-04 11:28:36,091 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 11:28:36,096 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 11:28:36,100 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 11:28:36,101 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 11:28:36,101 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 11:28:36,102 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/recHanoi03-2.c [2025-03-04 11:28:37,177 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cc90ba79/f399881b01a64746947583ca9b765b4e/FLAG9c24b605a [2025-03-04 11:28:37,341 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 11:28:37,341 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/recHanoi03-2.c [2025-03-04 11:28:37,348 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cc90ba79/f399881b01a64746947583ca9b765b4e/FLAG9c24b605a [2025-03-04 11:28:37,724 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cc90ba79/f399881b01a64746947583ca9b765b4e [2025-03-04 11:28:37,726 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 11:28:37,727 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 11:28:37,728 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 11:28:37,728 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 11:28:37,731 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 11:28:37,731 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:28:37" (1/1) ... [2025-03-04 11:28:37,732 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76530039 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:37, skipping insertion in model container [2025-03-04 11:28:37,732 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:28:37" (1/1) ... [2025-03-04 11:28:37,742 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 11:28:37,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:28:37,826 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 11:28:37,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:28:37,841 INFO L204 MainTranslator]: Completed translation [2025-03-04 11:28:37,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:37 WrapperNode [2025-03-04 11:28:37,841 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 11:28:37,842 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 11:28:37,842 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 11:28:37,842 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 11:28:37,846 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:37" (1/1) ... [2025-03-04 11:28:37,849 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:37" (1/1) ... [2025-03-04 11:28:37,857 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 27 [2025-03-04 11:28:37,857 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 11:28:37,857 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 11:28:37,857 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 11:28:37,857 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 11:28:37,861 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:37" (1/1) ... [2025-03-04 11:28:37,862 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:37" (1/1) ... [2025-03-04 11:28:37,862 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:37" (1/1) ... [2025-03-04 11:28:37,867 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 11:28:37,867 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:37" (1/1) ... [2025-03-04 11:28:37,868 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:37" (1/1) ... [2025-03-04 11:28:37,869 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:37" (1/1) ... [2025-03-04 11:28:37,869 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:37" (1/1) ... [2025-03-04 11:28:37,869 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:37" (1/1) ... [2025-03-04 11:28:37,870 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:37" (1/1) ... [2025-03-04 11:28:37,870 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 11:28:37,871 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 11:28:37,871 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 11:28:37,871 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 11:28:37,872 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:37" (1/1) ... [2025-03-04 11:28:37,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:28:37,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:37,892 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-04 11:28:37,894 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-04 11:28:37,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 11:28:37,910 INFO L130 BoogieDeclarations]: Found specification of procedure hanoi [2025-03-04 11:28:37,910 INFO L138 BoogieDeclarations]: Found implementation of procedure hanoi [2025-03-04 11:28:37,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 11:28:37,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 11:28:37,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 11:28:37,951 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 11:28:37,952 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 11:28:37,999 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L22: havoc #t~ret4; [2025-03-04 11:28:38,027 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-04 11:28:38,028 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 11:28:38,034 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 11:28:38,034 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 11:28:38,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:28:38 BoogieIcfgContainer [2025-03-04 11:28:38,035 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 11:28:38,036 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 11:28:38,036 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 11:28:38,039 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 11:28:38,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 11:28:37" (1/3) ... [2025-03-04 11:28:38,040 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77838742 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:28:38, skipping insertion in model container [2025-03-04 11:28:38,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:37" (2/3) ... [2025-03-04 11:28:38,040 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77838742 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:28:38, skipping insertion in model container [2025-03-04 11:28:38,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:28:38" (3/3) ... [2025-03-04 11:28:38,042 INFO L128 eAbstractionObserver]: Analyzing ICFG recHanoi03-2.c [2025-03-04 11:28:38,051 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 11:28:38,052 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recHanoi03-2.c that has 2 procedures, 29 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2025-03-04 11:28:38,091 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 11:28:38,101 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;@3366c73, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 11:28:38,102 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 11:28:38,105 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 25 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:28:38,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 11:28:38,108 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:38,108 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:38,109 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:38,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:38,114 INFO L85 PathProgramCache]: Analyzing trace with hash 77369545, now seen corresponding path program 1 times [2025-03-04 11:28:38,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:38,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631438670] [2025-03-04 11:28:38,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:38,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:38,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 11:28:38,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 11:28:38,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:38,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:38,288 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-04 11:28:38,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:38,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631438670] [2025-03-04 11:28:38,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631438670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:28:38,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:28:38,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:28:38,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729861563] [2025-03-04 11:28:38,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:28:38,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:28:38,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:38,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:28:38,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:28:38,308 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 25 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:28:38,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:38,396 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2025-03-04 11:28:38,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:28:38,398 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 11:28:38,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:38,402 INFO L225 Difference]: With dead ends: 52 [2025-03-04 11:28:38,402 INFO L226 Difference]: Without dead ends: 37 [2025-03-04 11:28:38,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:28:38,406 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 29 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:38,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 81 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:28:38,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-04 11:28:38,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2025-03-04 11:28:38,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.5) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:28:38,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2025-03-04 11:28:38,430 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 7 [2025-03-04 11:28:38,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:38,431 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2025-03-04 11:28:38,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:28:38,431 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2025-03-04 11:28:38,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 11:28:38,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:38,431 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:38,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 11:28:38,431 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:38,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:38,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1896511420, now seen corresponding path program 1 times [2025-03-04 11:28:38,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:38,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877729977] [2025-03-04 11:28:38,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:38,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:38,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 11:28:38,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 11:28:38,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:38,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:38,478 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-04 11:28:38,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:38,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877729977] [2025-03-04 11:28:38,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877729977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:28:38,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:28:38,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:28:38,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175112971] [2025-03-04 11:28:38,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:28:38,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:28:38,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:38,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:28:38,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:28:38,480 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:28:38,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:38,517 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2025-03-04 11:28:38,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:28:38,517 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-04 11:28:38,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:38,518 INFO L225 Difference]: With dead ends: 34 [2025-03-04 11:28:38,519 INFO L226 Difference]: Without dead ends: 33 [2025-03-04 11:28:38,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:28:38,519 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 27 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:38,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 37 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:28:38,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-04 11:28:38,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2025-03-04 11:28:38,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 26 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:28:38,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2025-03-04 11:28:38,526 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 8 [2025-03-04 11:28:38,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:38,526 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2025-03-04 11:28:38,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:28:38,526 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2025-03-04 11:28:38,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 11:28:38,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:38,526 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:38,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 11:28:38,527 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:38,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:38,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1934561071, now seen corresponding path program 1 times [2025-03-04 11:28:38,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:38,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071438820] [2025-03-04 11:28:38,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:38,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:38,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 11:28:38,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 11:28:38,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:38,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:38,640 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:38,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:38,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071438820] [2025-03-04 11:28:38,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071438820] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:38,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587734519] [2025-03-04 11:28:38,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:38,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:38,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:38,644 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-04 11:28:38,647 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-04 11:28:38,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 11:28:38,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 11:28:38,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:38,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:38,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 11:28:38,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:38,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:38,724 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:38,800 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:38,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587734519] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:38,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:38,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-04 11:28:38,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980424559] [2025-03-04 11:28:38,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:38,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 11:28:38,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:38,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 11:28:38,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:28:38,802 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 12 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:28:38,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:38,917 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2025-03-04 11:28:38,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 11:28:38,918 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-04 11:28:38,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:38,919 INFO L225 Difference]: With dead ends: 92 [2025-03-04 11:28:38,919 INFO L226 Difference]: Without dead ends: 91 [2025-03-04 11:28:38,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-03-04 11:28:38,919 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 151 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:38,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 146 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:28:38,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-04 11:28:38,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 67. [2025-03-04 11:28:38,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.4615384615384615) internal successors, (76), 56 states have internal predecessors, (76), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:28:38,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 87 transitions. [2025-03-04 11:28:38,929 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 87 transitions. Word has length 12 [2025-03-04 11:28:38,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:38,929 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 87 transitions. [2025-03-04 11:28:38,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:28:38,929 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 87 transitions. [2025-03-04 11:28:38,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 11:28:38,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:38,930 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:38,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 11:28:39,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:39,134 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:39,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:39,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1656507467, now seen corresponding path program 1 times [2025-03-04 11:28:39,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:39,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498213284] [2025-03-04 11:28:39,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:39,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:39,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 11:28:39,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 11:28:39,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:39,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:39,183 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 11:28:39,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:39,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498213284] [2025-03-04 11:28:39,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498213284] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:28:39,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:28:39,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:28:39,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63964577] [2025-03-04 11:28:39,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:28:39,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:28:39,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:39,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:28:39,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:28:39,184 INFO L87 Difference]: Start difference. First operand 67 states and 87 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:28:39,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:39,207 INFO L93 Difference]: Finished difference Result 104 states and 140 transitions. [2025-03-04 11:28:39,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:28:39,208 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-03-04 11:28:39,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:39,210 INFO L225 Difference]: With dead ends: 104 [2025-03-04 11:28:39,210 INFO L226 Difference]: Without dead ends: 93 [2025-03-04 11:28:39,210 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-04 11:28:39,211 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 3 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:39,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 46 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:28:39,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-04 11:28:39,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-04 11:28:39,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 75 states have (on average 1.3066666666666666) internal successors, (98), 78 states have internal predecessors, (98), 6 states have call successors, (6), 5 states have call predecessors, (6), 7 states have return successors, (9), 9 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-04 11:28:39,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 113 transitions. [2025-03-04 11:28:39,224 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 113 transitions. Word has length 15 [2025-03-04 11:28:39,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:39,224 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 113 transitions. [2025-03-04 11:28:39,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:28:39,224 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 113 transitions. [2025-03-04 11:28:39,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 11:28:39,226 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:39,226 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1] [2025-03-04 11:28:39,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 11:28:39,226 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:39,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:39,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1181735625, now seen corresponding path program 2 times [2025-03-04 11:28:39,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:39,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161924101] [2025-03-04 11:28:39,227 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:28:39,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:39,234 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-04 11:28:39,244 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 11:28:39,246 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:28:39,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:39,413 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:39,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:39,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161924101] [2025-03-04 11:28:39,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161924101] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:39,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721160328] [2025-03-04 11:28:39,414 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:28:39,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:39,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:39,416 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-04 11:28:39,417 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-04 11:28:39,442 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-04 11:28:39,450 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 11:28:39,450 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:28:39,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:39,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 11:28:39,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:39,506 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:39,506 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:39,671 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:39,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721160328] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:39,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:39,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2025-03-04 11:28:39,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224258399] [2025-03-04 11:28:39,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:39,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 11:28:39,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:39,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 11:28:39,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2025-03-04 11:28:39,673 INFO L87 Difference]: Start difference. First operand 93 states and 113 transitions. Second operand has 24 states, 21 states have (on average 2.0) internal successors, (42), 14 states have internal predecessors, (42), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:28:39,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:39,951 INFO L93 Difference]: Finished difference Result 248 states and 263 transitions. [2025-03-04 11:28:39,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 11:28:39,951 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 2.0) internal successors, (42), 14 states have internal predecessors, (42), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-04 11:28:39,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:39,953 INFO L225 Difference]: With dead ends: 248 [2025-03-04 11:28:39,953 INFO L226 Difference]: Without dead ends: 247 [2025-03-04 11:28:39,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=311, Invalid=811, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 11:28:39,954 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 476 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:39,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 266 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:28:39,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-03-04 11:28:39,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 207. [2025-03-04 11:28:39,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 171 states have (on average 1.3099415204678362) internal successors, (224), 174 states have internal predecessors, (224), 12 states have call successors, (12), 11 states have call predecessors, (12), 19 states have return successors, (21), 21 states have call predecessors, (21), 11 states have call successors, (21) [2025-03-04 11:28:39,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 257 transitions. [2025-03-04 11:28:39,968 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 257 transitions. Word has length 27 [2025-03-04 11:28:39,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:39,969 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 257 transitions. [2025-03-04 11:28:39,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 2.0) internal successors, (42), 14 states have internal predecessors, (42), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:28:39,969 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 257 transitions. [2025-03-04 11:28:39,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 11:28:39,969 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:39,969 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:39,975 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-04 11:28:40,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:40,174 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:40,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:40,175 INFO L85 PathProgramCache]: Analyzing trace with hash -854576000, now seen corresponding path program 1 times [2025-03-04 11:28:40,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:40,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936635154] [2025-03-04 11:28:40,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:40,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:40,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 11:28:40,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 11:28:40,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:40,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:40,224 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 11:28:40,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:40,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936635154] [2025-03-04 11:28:40,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936635154] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:40,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232999497] [2025-03-04 11:28:40,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:40,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:40,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:40,227 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-04 11:28:40,229 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-04 11:28:40,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 11:28:40,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 11:28:40,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:40,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:40,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:28:40,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:40,276 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 11:28:40,276 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:28:40,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232999497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:28:40,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:28:40,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 11:28:40,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714301870] [2025-03-04 11:28:40,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:28:40,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:28:40,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:40,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:28:40,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:28:40,278 INFO L87 Difference]: Start difference. First operand 207 states and 257 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:28:40,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:40,303 INFO L93 Difference]: Finished difference Result 207 states and 257 transitions. [2025-03-04 11:28:40,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:28:40,303 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2025-03-04 11:28:40,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:40,304 INFO L225 Difference]: With dead ends: 207 [2025-03-04 11:28:40,304 INFO L226 Difference]: Without dead ends: 205 [2025-03-04 11:28:40,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:28:40,305 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 3 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:40,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 41 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:28:40,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-04 11:28:40,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2025-03-04 11:28:40,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 171 states have (on average 1.1812865497076024) internal successors, (202), 172 states have internal predecessors, (202), 12 states have call successors, (12), 11 states have call predecessors, (12), 19 states have return successors, (21), 21 states have call predecessors, (21), 11 states have call successors, (21) [2025-03-04 11:28:40,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 235 transitions. [2025-03-04 11:28:40,328 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 235 transitions. Word has length 27 [2025-03-04 11:28:40,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:40,328 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 235 transitions. [2025-03-04 11:28:40,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:28:40,329 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 235 transitions. [2025-03-04 11:28:40,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 11:28:40,329 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:40,329 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:40,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 11:28:40,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:40,530 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:40,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:40,530 INFO L85 PathProgramCache]: Analyzing trace with hash -722052249, now seen corresponding path program 1 times [2025-03-04 11:28:40,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:40,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293987955] [2025-03-04 11:28:40,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:40,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:40,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 11:28:40,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 11:28:40,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:40,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:40,581 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 11:28:40,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:40,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293987955] [2025-03-04 11:28:40,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293987955] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:40,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370497852] [2025-03-04 11:28:40,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:40,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:40,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:40,584 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-04 11:28:40,585 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-04 11:28:40,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 11:28:40,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 11:28:40,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:40,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:40,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:28:40,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:40,642 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 11:28:40,643 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:40,719 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 11:28:40,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370497852] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:40,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:40,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 11:28:40,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304368015] [2025-03-04 11:28:40,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:40,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 11:28:40,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:40,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 11:28:40,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:28:40,721 INFO L87 Difference]: Start difference. First operand 205 states and 235 transitions. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 11:28:40,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:40,778 INFO L93 Difference]: Finished difference Result 409 states and 494 transitions. [2025-03-04 11:28:40,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 11:28:40,779 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) Word has length 28 [2025-03-04 11:28:40,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:40,781 INFO L225 Difference]: With dead ends: 409 [2025-03-04 11:28:40,781 INFO L226 Difference]: Without dead ends: 344 [2025-03-04 11:28:40,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:28:40,782 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 4 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:40,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 79 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:28:40,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2025-03-04 11:28:40,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2025-03-04 11:28:40,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 290 states have (on average 1.0586206896551724) internal successors, (307), 287 states have internal predecessors, (307), 12 states have call successors, (12), 11 states have call predecessors, (12), 40 states have return successors, (45), 45 states have call predecessors, (45), 11 states have call successors, (45) [2025-03-04 11:28:40,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 364 transitions. [2025-03-04 11:28:40,810 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 364 transitions. Word has length 28 [2025-03-04 11:28:40,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:40,810 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 364 transitions. [2025-03-04 11:28:40,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 11:28:40,810 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 364 transitions. [2025-03-04 11:28:40,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-04 11:28:40,811 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:40,812 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 1, 1, 1, 1, 1] [2025-03-04 11:28:40,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 11:28:41,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:41,012 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:41,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:41,013 INFO L85 PathProgramCache]: Analyzing trace with hash 439609801, now seen corresponding path program 3 times [2025-03-04 11:28:41,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:41,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71369076] [2025-03-04 11:28:41,013 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:28:41,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:41,019 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 57 statements into 11 equivalence classes. [2025-03-04 11:28:41,029 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 11:28:41,030 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 11:28:41,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:41,379 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:41,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:41,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71369076] [2025-03-04 11:28:41,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71369076] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:41,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235153910] [2025-03-04 11:28:41,380 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:28:41,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:41,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:41,382 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-04 11:28:41,383 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-04 11:28:41,401 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 57 statements into 11 equivalence classes. [2025-03-04 11:28:41,415 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 11:28:41,415 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 11:28:41,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:41,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 11:28:41,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:41,504 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:41,505 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:41,979 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:41,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235153910] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:41,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:41,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2025-03-04 11:28:41,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400907805] [2025-03-04 11:28:41,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:41,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-04 11:28:41,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:41,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-04 11:28:41,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=556, Invalid=1700, Unknown=0, NotChecked=0, Total=2256 [2025-03-04 11:28:41,982 INFO L87 Difference]: Start difference. First operand 344 states and 364 transitions. Second operand has 48 states, 45 states have (on average 2.0) internal successors, (90), 26 states have internal predecessors, (90), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:28:42,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:42,677 INFO L93 Difference]: Finished difference Result 823 states and 856 transitions. [2025-03-04 11:28:42,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-04 11:28:42,677 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 45 states have (on average 2.0) internal successors, (90), 26 states have internal predecessors, (90), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-03-04 11:28:42,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:42,682 INFO L225 Difference]: With dead ends: 823 [2025-03-04 11:28:42,682 INFO L226 Difference]: Without dead ends: 822 [2025-03-04 11:28:42,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1337, Invalid=3493, Unknown=0, NotChecked=0, Total=4830 [2025-03-04 11:28:42,686 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 943 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 944 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:42,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [944 Valid, 494 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:28:42,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2025-03-04 11:28:42,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 800. [2025-03-04 11:28:42,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 674 states have (on average 1.0608308605341246) internal successors, (715), 671 states have internal predecessors, (715), 24 states have call successors, (24), 23 states have call predecessors, (24), 100 states have return successors, (105), 105 states have call predecessors, (105), 23 states have call successors, (105) [2025-03-04 11:28:42,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 844 transitions. [2025-03-04 11:28:42,742 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 844 transitions. Word has length 57 [2025-03-04 11:28:42,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:42,742 INFO L471 AbstractCegarLoop]: Abstraction has 800 states and 844 transitions. [2025-03-04 11:28:42,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 45 states have (on average 2.0) internal successors, (90), 26 states have internal predecessors, (90), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:28:42,742 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 844 transitions. [2025-03-04 11:28:42,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-04 11:28:42,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:42,747 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:42,753 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-04 11:28:42,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:42,948 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:42,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:42,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1414418492, now seen corresponding path program 2 times [2025-03-04 11:28:42,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:42,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165929258] [2025-03-04 11:28:42,949 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:28:42,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:42,954 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 64 statements into 2 equivalence classes. [2025-03-04 11:28:42,962 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 11:28:42,963 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:28:42,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:43,096 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 11:28:43,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:43,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165929258] [2025-03-04 11:28:43,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165929258] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:43,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116837084] [2025-03-04 11:28:43,097 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:28:43,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:43,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:43,102 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-04 11:28:43,104 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-04 11:28:43,123 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 64 statements into 2 equivalence classes. [2025-03-04 11:28:43,134 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 11:28:43,135 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:28:43,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:43,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 11:28:43,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:43,180 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 11:28:43,180 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:43,662 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 11:28:43,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116837084] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:43,662 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:43,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-03-04 11:28:43,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012465267] [2025-03-04 11:28:43,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:43,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 11:28:43,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:43,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 11:28:43,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-03-04 11:28:43,664 INFO L87 Difference]: Start difference. First operand 800 states and 844 transitions. Second operand has 24 states, 23 states have (on average 3.130434782608696) internal successors, (72), 24 states have internal predecessors, (72), 1 states have call successors, (2), 1 states have call predecessors, (2), 11 states have return successors, (11), 11 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 11:28:43,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:43,767 INFO L93 Difference]: Finished difference Result 1743 states and 1924 transitions. [2025-03-04 11:28:43,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 11:28:43,768 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.130434782608696) internal successors, (72), 24 states have internal predecessors, (72), 1 states have call successors, (2), 1 states have call predecessors, (2), 11 states have return successors, (11), 11 states have call predecessors, (11), 1 states have call successors, (11) Word has length 64 [2025-03-04 11:28:43,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:43,774 INFO L225 Difference]: With dead ends: 1743 [2025-03-04 11:28:43,774 INFO L226 Difference]: Without dead ends: 1439 [2025-03-04 11:28:43,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-03-04 11:28:43,777 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 4 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:43,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 121 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:28:43,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2025-03-04 11:28:43,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 1439. [2025-03-04 11:28:43,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1439 states, 1226 states have (on average 1.0285481239804242) internal successors, (1261), 1217 states have internal predecessors, (1261), 24 states have call successors, (24), 23 states have call predecessors, (24), 187 states have return successors, (198), 198 states have call predecessors, (198), 23 states have call successors, (198) [2025-03-04 11:28:43,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1439 states and 1483 transitions. [2025-03-04 11:28:43,851 INFO L78 Accepts]: Start accepts. Automaton has 1439 states and 1483 transitions. Word has length 64 [2025-03-04 11:28:43,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:43,852 INFO L471 AbstractCegarLoop]: Abstraction has 1439 states and 1483 transitions. [2025-03-04 11:28:43,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.130434782608696) internal successors, (72), 24 states have internal predecessors, (72), 1 states have call successors, (2), 1 states have call predecessors, (2), 11 states have return successors, (11), 11 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 11:28:43,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 1483 transitions. [2025-03-04 11:28:43,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-04 11:28:43,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:43,854 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 1, 1, 1, 1, 1] [2025-03-04 11:28:43,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 11:28:44,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:44,055 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:44,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:44,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1126217783, now seen corresponding path program 4 times [2025-03-04 11:28:44,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:44,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251892948] [2025-03-04 11:28:44,056 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 11:28:44,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:44,061 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 117 statements into 2 equivalence classes. [2025-03-04 11:28:44,081 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 117 of 117 statements. [2025-03-04 11:28:44,082 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 11:28:44,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:45,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:45,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:45,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251892948] [2025-03-04 11:28:45,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251892948] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:45,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587997587] [2025-03-04 11:28:45,042 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 11:28:45,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:45,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:45,044 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-04 11:28:45,045 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-04 11:28:45,068 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 117 statements into 2 equivalence classes. [2025-03-04 11:28:45,087 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 117 of 117 statements. [2025-03-04 11:28:45,087 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 11:28:45,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:45,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-04 11:28:45,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:45,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:45,225 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:46,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:46,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587997587] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:46,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:46,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2025-03-04 11:28:46,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497388913] [2025-03-04 11:28:46,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:46,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2025-03-04 11:28:46,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:46,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-03-04 11:28:46,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2260, Invalid=6860, Unknown=0, NotChecked=0, Total=9120 [2025-03-04 11:28:46,666 INFO L87 Difference]: Start difference. First operand 1439 states and 1483 transitions. Second operand has 96 states, 93 states have (on average 2.0) internal successors, (186), 50 states have internal predecessors, (186), 46 states have call successors, (46), 46 states have call predecessors, (46), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:28:48,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:48,674 INFO L93 Difference]: Finished difference Result 3406 states and 3475 transitions. [2025-03-04 11:28:48,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-03-04 11:28:48,674 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 93 states have (on average 2.0) internal successors, (186), 50 states have internal predecessors, (186), 46 states have call successors, (46), 46 states have call predecessors, (46), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2025-03-04 11:28:48,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:48,704 INFO L225 Difference]: With dead ends: 3406 [2025-03-04 11:28:48,704 INFO L226 Difference]: Without dead ends: 3405 [2025-03-04 11:28:48,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4140 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=5549, Invalid=14473, Unknown=0, NotChecked=0, Total=20022 [2025-03-04 11:28:48,709 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 2907 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 293 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2908 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 293 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:48,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2908 Valid, 1000 Invalid, 967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [293 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 11:28:48,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3405 states. [2025-03-04 11:28:48,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3405 to 3359. [2025-03-04 11:28:48,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3359 states, 2858 states have (on average 1.0290412876137158) internal successors, (2941), 2849 states have internal predecessors, (2941), 48 states have call successors, (48), 47 states have call predecessors, (48), 451 states have return successors, (462), 462 states have call predecessors, (462), 47 states have call successors, (462) [2025-03-04 11:28:48,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3359 states to 3359 states and 3451 transitions. [2025-03-04 11:28:48,805 INFO L78 Accepts]: Start accepts. Automaton has 3359 states and 3451 transitions. Word has length 117 [2025-03-04 11:28:48,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:48,805 INFO L471 AbstractCegarLoop]: Abstraction has 3359 states and 3451 transitions. [2025-03-04 11:28:48,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 93 states have (on average 2.0) internal successors, (186), 50 states have internal predecessors, (186), 46 states have call successors, (46), 46 states have call predecessors, (46), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:28:48,805 INFO L276 IsEmpty]: Start isEmpty. Operand 3359 states and 3451 transitions. [2025-03-04 11:28:48,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-04 11:28:48,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:48,808 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:48,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 11:28:49,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:49,010 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:49,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:49,010 INFO L85 PathProgramCache]: Analyzing trace with hash -579282660, now seen corresponding path program 3 times [2025-03-04 11:28:49,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:49,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558378463] [2025-03-04 11:28:49,010 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:28:49,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:49,015 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 136 statements into 12 equivalence classes. [2025-03-04 11:28:49,030 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 131 of 136 statements. [2025-03-04 11:28:49,030 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 11:28:49,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:49,478 INFO L134 CoverageAnalysis]: Checked inductivity of 662 backedges. 0 proven. 365 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-03-04 11:28:49,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:49,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558378463] [2025-03-04 11:28:49,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558378463] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:49,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956197001] [2025-03-04 11:28:49,478 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:28:49,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:49,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:49,480 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:49,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 11:28:49,507 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 136 statements into 12 equivalence classes. [2025-03-04 11:28:49,530 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 131 of 136 statements. [2025-03-04 11:28:49,531 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 11:28:49,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:49,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 11:28:49,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:49,640 INFO L134 CoverageAnalysis]: Checked inductivity of 662 backedges. 0 proven. 365 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-03-04 11:28:49,640 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:53,303 INFO L134 CoverageAnalysis]: Checked inductivity of 662 backedges. 0 proven. 365 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-03-04 11:28:53,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956197001] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:53,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:53,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 47 [2025-03-04 11:28:53,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983494768] [2025-03-04 11:28:53,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:53,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-04 11:28:53,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:53,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-04 11:28:53,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=1657, Unknown=0, NotChecked=0, Total=2256 [2025-03-04 11:28:53,305 INFO L87 Difference]: Start difference. First operand 3359 states and 3451 transitions. Second operand has 48 states, 47 states have (on average 3.0638297872340425) internal successors, (144), 48 states have internal predecessors, (144), 1 states have call successors, (2), 1 states have call predecessors, (2), 23 states have return successors, (24), 23 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-04 11:28:53,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:53,531 INFO L93 Difference]: Finished difference Result 7260 states and 7915 transitions. [2025-03-04 11:28:53,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-04 11:28:53,536 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 3.0638297872340425) internal successors, (144), 48 states have internal predecessors, (144), 1 states have call successors, (2), 1 states have call predecessors, (2), 23 states have return successors, (24), 23 states have call predecessors, (24), 1 states have call successors, (24) Word has length 136 [2025-03-04 11:28:53,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:53,552 INFO L225 Difference]: With dead ends: 7260 [2025-03-04 11:28:53,552 INFO L226 Difference]: Without dead ends: 5897 [2025-03-04 11:28:53,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 698 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=599, Invalid=1657, Unknown=0, NotChecked=0, Total=2256 [2025-03-04 11:28:53,557 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 4 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:53,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 169 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:28:53,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5897 states. [2025-03-04 11:28:53,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5897 to 5897. [2025-03-04 11:28:53,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5897 states, 5042 states have (on average 1.014081713605712) internal successors, (5113), 5021 states have internal predecessors, (5113), 48 states have call successors, (48), 47 states have call predecessors, (48), 805 states have return successors, (828), 828 states have call predecessors, (828), 47 states have call successors, (828) [2025-03-04 11:28:53,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5897 states to 5897 states and 5989 transitions. [2025-03-04 11:28:53,721 INFO L78 Accepts]: Start accepts. Automaton has 5897 states and 5989 transitions. Word has length 136 [2025-03-04 11:28:53,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:53,722 INFO L471 AbstractCegarLoop]: Abstraction has 5897 states and 5989 transitions. [2025-03-04 11:28:53,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 3.0638297872340425) internal successors, (144), 48 states have internal predecessors, (144), 1 states have call successors, (2), 1 states have call predecessors, (2), 23 states have return successors, (24), 23 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-04 11:28:53,722 INFO L276 IsEmpty]: Start isEmpty. Operand 5897 states and 5989 transitions. [2025-03-04 11:28:53,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-03-04 11:28:53,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:53,729 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 46, 46, 46, 1, 1, 1, 1, 1] [2025-03-04 11:28:53,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 11:28:53,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 11:28:53,929 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:53,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:53,930 INFO L85 PathProgramCache]: Analyzing trace with hash -855440439, now seen corresponding path program 5 times [2025-03-04 11:28:53,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:53,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678933356] [2025-03-04 11:28:53,930 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 11:28:53,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:53,937 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 237 statements into 47 equivalence classes. [2025-03-04 11:28:54,036 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 237 of 237 statements. [2025-03-04 11:28:54,036 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-03-04 11:28:54,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:56,996 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 5313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:56,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:56,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678933356] [2025-03-04 11:28:56,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678933356] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:56,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738210377] [2025-03-04 11:28:56,996 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 11:28:56,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:56,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:56,998 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:57,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 11:28:57,076 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 237 statements into 47 equivalence classes. [2025-03-04 11:28:57,181 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 237 of 237 statements. [2025-03-04 11:28:57,182 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-03-04 11:28:57,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:57,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-03-04 11:28:57,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:57,411 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 5313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:57,411 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:02,375 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 5313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:29:02,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738210377] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:02,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:02,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2025-03-04 11:29:02,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093987123] [2025-03-04 11:29:02,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:02,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 192 states [2025-03-04 11:29:02,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:02,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2025-03-04 11:29:02,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9124, Invalid=27548, Unknown=0, NotChecked=0, Total=36672 [2025-03-04 11:29:02,385 INFO L87 Difference]: Start difference. First operand 5897 states and 5989 transitions. Second operand has 192 states, 189 states have (on average 2.0) internal successors, (378), 98 states have internal predecessors, (378), 94 states have call successors, (94), 94 states have call predecessors, (94), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:29:11,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:11,298 INFO L93 Difference]: Finished difference Result 13864 states and 14005 transitions. [2025-03-04 11:29:11,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2025-03-04 11:29:11,298 INFO L78 Accepts]: Start accepts. Automaton has has 192 states, 189 states have (on average 2.0) internal successors, (378), 98 states have internal predecessors, (378), 94 states have call successors, (94), 94 states have call predecessors, (94), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 237 [2025-03-04 11:29:11,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:11,334 INFO L225 Difference]: With dead ends: 13864 [2025-03-04 11:29:11,335 INFO L226 Difference]: Without dead ends: 13863 [2025-03-04 11:29:11,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 662 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 284 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17484 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=22613, Invalid=58897, Unknown=0, NotChecked=0, Total=81510 [2025-03-04 11:29:11,344 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 6344 mSDsluCounter, 1997 mSDsCounter, 0 mSdLazyCounter, 1388 mSolverCounterSat, 630 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6345 SdHoareTripleChecker+Valid, 2139 SdHoareTripleChecker+Invalid, 2018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 630 IncrementalHoareTripleChecker+Valid, 1388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:11,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6345 Valid, 2139 Invalid, 2018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [630 Valid, 1388 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 11:29:11,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13863 states. [2025-03-04 11:29:11,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13863 to 13769. [2025-03-04 11:29:11,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13769 states, 11762 states have (on average 1.0141982656010882) internal successors, (11929), 11741 states have internal predecessors, (11929), 96 states have call successors, (96), 95 states have call predecessors, (96), 1909 states have return successors, (1932), 1932 states have call predecessors, (1932), 95 states have call successors, (1932) [2025-03-04 11:29:11,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13769 states to 13769 states and 13957 transitions. [2025-03-04 11:29:11,711 INFO L78 Accepts]: Start accepts. Automaton has 13769 states and 13957 transitions. Word has length 237 [2025-03-04 11:29:11,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:11,711 INFO L471 AbstractCegarLoop]: Abstraction has 13769 states and 13957 transitions. [2025-03-04 11:29:11,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 192 states, 189 states have (on average 2.0) internal successors, (378), 98 states have internal predecessors, (378), 94 states have call successors, (94), 94 states have call predecessors, (94), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:29:11,716 INFO L276 IsEmpty]: Start isEmpty. Operand 13769 states and 13957 transitions. [2025-03-04 11:29:11,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2025-03-04 11:29:11,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:11,724 INFO L218 NwaCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 22, 1, 1, 1, 1, 1, 1] [2025-03-04 11:29:11,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 11:29:11,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:11,925 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:29:11,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:11,926 INFO L85 PathProgramCache]: Analyzing trace with hash 2125832924, now seen corresponding path program 4 times [2025-03-04 11:29:11,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:11,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262232793] [2025-03-04 11:29:11,926 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 11:29:11,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:11,932 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 280 statements into 2 equivalence classes. [2025-03-04 11:29:11,944 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 280 of 280 statements. [2025-03-04 11:29:11,945 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 11:29:11,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:13,080 INFO L134 CoverageAnalysis]: Checked inductivity of 3038 backedges. 0 proven. 1727 refuted. 0 times theorem prover too weak. 1311 trivial. 0 not checked. [2025-03-04 11:29:13,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:13,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262232793] [2025-03-04 11:29:13,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262232793] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:13,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877706522] [2025-03-04 11:29:13,080 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 11:29:13,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:13,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:13,082 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:29:13,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 11:29:13,154 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 280 statements into 2 equivalence classes. [2025-03-04 11:29:13,185 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 280 of 280 statements. [2025-03-04 11:29:13,185 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 11:29:13,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:13,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-04 11:29:13,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:13,319 INFO L134 CoverageAnalysis]: Checked inductivity of 3038 backedges. 0 proven. 1727 refuted. 0 times theorem prover too weak. 1311 trivial. 0 not checked. [2025-03-04 11:29:13,319 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:49,529 INFO L134 CoverageAnalysis]: Checked inductivity of 3038 backedges. 0 proven. 1727 refuted. 0 times theorem prover too weak. 1311 trivial. 0 not checked. [2025-03-04 11:29:49,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877706522] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:49,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:49,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 63 [2025-03-04 11:29:49,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200755737] [2025-03-04 11:29:49,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:49,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2025-03-04 11:29:49,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:49,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2025-03-04 11:29:49,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1055, Invalid=2977, Unknown=0, NotChecked=0, Total=4032 [2025-03-04 11:29:49,531 INFO L87 Difference]: Start difference. First operand 13769 states and 13957 transitions. Second operand has 64 states, 63 states have (on average 3.0952380952380953) internal successors, (195), 64 states have internal predecessors, (195), 1 states have call successors, (2), 1 states have call predecessors, (2), 31 states have return successors, (31), 31 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-04 11:29:49,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:49,933 INFO L93 Difference]: Finished difference Result 19058 states and 20005 transitions. [2025-03-04 11:29:49,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-03-04 11:29:49,934 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 3.0952380952380953) internal successors, (195), 64 states have internal predecessors, (195), 1 states have call successors, (2), 1 states have call predecessors, (2), 31 states have return successors, (31), 31 states have call predecessors, (31), 1 states have call successors, (31) Word has length 280 [2025-03-04 11:29:49,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:49,977 INFO L225 Difference]: With dead ends: 19058 [2025-03-04 11:29:49,978 INFO L226 Difference]: Without dead ends: 17589 [2025-03-04 11:29:49,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 605 GetRequests, 511 SyntacticMatches, 32 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2583 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1055, Invalid=2977, Unknown=0, NotChecked=0, Total=4032 [2025-03-04 11:29:49,988 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 2 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:49,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 178 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:29:49,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17589 states. [2025-03-04 11:29:50,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17589 to 17589. [2025-03-04 11:29:50,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17589 states, 15042 states have (on average 1.0105704028719584) internal successors, (15201), 15013 states have internal predecessors, (15201), 96 states have call successors, (96), 95 states have call predecessors, (96), 2449 states have return successors, (2480), 2480 states have call predecessors, (2480), 95 states have call successors, (2480) [2025-03-04 11:29:50,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17589 states to 17589 states and 17777 transitions. [2025-03-04 11:29:50,409 INFO L78 Accepts]: Start accepts. Automaton has 17589 states and 17777 transitions. Word has length 280 [2025-03-04 11:29:50,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:50,409 INFO L471 AbstractCegarLoop]: Abstraction has 17589 states and 17777 transitions. [2025-03-04 11:29:50,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 63 states have (on average 3.0952380952380953) internal successors, (195), 64 states have internal predecessors, (195), 1 states have call successors, (2), 1 states have call predecessors, (2), 31 states have return successors, (31), 31 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-04 11:29:50,409 INFO L276 IsEmpty]: Start isEmpty. Operand 17589 states and 17777 transitions. [2025-03-04 11:29:50,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2025-03-04 11:29:50,421 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:50,421 INFO L218 NwaCegarLoop]: trace histogram [32, 31, 31, 31, 31, 31, 31, 31, 31, 30, 30, 30, 1, 1, 1, 1, 1, 1] [2025-03-04 11:29:50,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 11:29:50,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 11:29:50,623 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:29:50,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:50,623 INFO L85 PathProgramCache]: Analyzing trace with hash -804566692, now seen corresponding path program 5 times [2025-03-04 11:29:50,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:50,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168153915] [2025-03-04 11:29:50,623 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 11:29:50,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:50,644 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 376 statements into 32 equivalence classes. [2025-03-04 11:29:50,739 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) and asserted 376 of 376 statements. [2025-03-04 11:29:50,740 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2025-03-04 11:29:50,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:52,020 INFO L134 CoverageAnalysis]: Checked inductivity of 5582 backedges. 3295 proven. 406 refuted. 0 times theorem prover too weak. 1881 trivial. 0 not checked. [2025-03-04 11:29:52,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:52,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168153915] [2025-03-04 11:29:52,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168153915] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:52,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927915021] [2025-03-04 11:29:52,020 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 11:29:52,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:52,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:52,030 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:29:52,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 11:29:52,533 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 376 statements into 32 equivalence classes. [2025-03-04 11:29:52,617 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) and asserted 376 of 376 statements. [2025-03-04 11:29:52,617 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2025-03-04 11:29:52,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:52,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 651 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-03-04 11:29:52,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:52,889 INFO L134 CoverageAnalysis]: Checked inductivity of 5582 backedges. 3195 proven. 152 refuted. 0 times theorem prover too weak. 2235 trivial. 0 not checked. [2025-03-04 11:29:52,889 INFO L312 TraceCheckSpWp]: Computing backward predicates...