./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-numeric/Ackermann01-1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-numeric/Ackermann01-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 380ed529f726f53285b49ce40e57404dbe066b029b8c3af7ce337366515780a5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:32:45,440 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:32:45,498 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-04 10:32:45,501 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:32:45,501 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:32:45,522 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:32:45,523 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:32:45,523 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:32:45,523 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:32:45,524 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:32:45,524 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:32:45,525 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:32:45,525 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:32:45,525 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:32:45,525 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:32:45,526 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:32:45,526 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:32:45,526 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:32:45,526 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:32:45,526 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:32:45,526 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:32:45,526 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:32:45,526 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:32:45,526 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:32:45,526 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:32:45,526 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:32:45,527 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:32:45,527 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:32:45,527 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:32:45,527 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:32:45,527 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:32:45,527 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:32:45,528 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:32:45,528 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:32:45,528 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:32:45,528 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:32:45,528 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:32:45,528 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:32:45,528 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:32:45,528 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:32:45,528 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:32:45,528 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:32:45,528 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 380ed529f726f53285b49ce40e57404dbe066b029b8c3af7ce337366515780a5 [2025-03-04 10:32:45,740 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:32:45,749 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:32:45,751 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:32:45,752 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:32:45,752 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:32:45,752 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-numeric/Ackermann01-1.c [2025-03-04 10:32:46,860 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/533a3a92e/0db45667fd8a4846bd061191aaf94b0e/FLAG8a82f134c [2025-03-04 10:32:47,081 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:32:47,081 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/Ackermann01-1.c [2025-03-04 10:32:47,086 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/533a3a92e/0db45667fd8a4846bd061191aaf94b0e/FLAG8a82f134c [2025-03-04 10:32:47,431 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/533a3a92e/0db45667fd8a4846bd061191aaf94b0e [2025-03-04 10:32:47,433 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:32:47,434 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:32:47,435 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:32:47,435 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:32:47,437 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:32:47,438 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:32:47" (1/1) ... [2025-03-04 10:32:47,438 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63afb2ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:47, skipping insertion in model container [2025-03-04 10:32:47,438 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:32:47" (1/1) ... [2025-03-04 10:32:47,449 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:32:47,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:32:47,550 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:32:47,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:32:47,569 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:32:47,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:47 WrapperNode [2025-03-04 10:32:47,570 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:32:47,570 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:32:47,570 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:32:47,570 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:32:47,574 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:47" (1/1) ... [2025-03-04 10:32:47,579 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:47" (1/1) ... [2025-03-04 10:32:47,588 INFO L138 Inliner]: procedures = 13, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 34 [2025-03-04 10:32:47,589 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:32:47,590 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:32:47,590 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:32:47,590 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:32:47,594 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:47" (1/1) ... [2025-03-04 10:32:47,595 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:47" (1/1) ... [2025-03-04 10:32:47,596 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:47" (1/1) ... [2025-03-04 10:32:47,605 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 10:32:47,605 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:47" (1/1) ... [2025-03-04 10:32:47,605 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:47" (1/1) ... [2025-03-04 10:32:47,607 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:47" (1/1) ... [2025-03-04 10:32:47,608 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:47" (1/1) ... [2025-03-04 10:32:47,608 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:47" (1/1) ... [2025-03-04 10:32:47,608 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:47" (1/1) ... [2025-03-04 10:32:47,609 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:32:47,610 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:32:47,610 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:32:47,610 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:32:47,610 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:47" (1/1) ... [2025-03-04 10:32:47,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:32:47,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:47,634 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 10:32:47,636 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 10:32:47,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:32:47,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:32:47,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:32:47,650 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2025-03-04 10:32:47,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2025-03-04 10:32:47,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:32:47,686 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:32:47,688 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:32:47,773 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L23: havoc #t~ret5;havoc #t~ret6; [2025-03-04 10:32:47,773 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L21: havoc #t~ret4; [2025-03-04 10:32:47,780 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-03-04 10:32:47,780 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:32:47,786 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:32:47,786 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:32:47,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:32:47 BoogieIcfgContainer [2025-03-04 10:32:47,787 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:32:47,788 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:32:47,788 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:32:47,791 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:32:47,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:32:47" (1/3) ... [2025-03-04 10:32:47,792 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64ae8b39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:32:47, skipping insertion in model container [2025-03-04 10:32:47,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:47" (2/3) ... [2025-03-04 10:32:47,792 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64ae8b39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:32:47, skipping insertion in model container [2025-03-04 10:32:47,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:32:47" (3/3) ... [2025-03-04 10:32:47,795 INFO L128 eAbstractionObserver]: Analyzing ICFG Ackermann01-1.c [2025-03-04 10:32:47,805 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:32:47,807 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Ackermann01-1.c that has 2 procedures, 39 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-03-04 10:32:47,845 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:32:47,856 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;@371c9032, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:32:47,856 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-04 10:32:47,859 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 25 states have (on average 1.52) internal successors, (38), 33 states have internal predecessors, (38), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 10:32:47,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 10:32:47,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:47,865 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:47,865 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ackermannErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:32:47,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:47,870 INFO L85 PathProgramCache]: Analyzing trace with hash -489113992, now seen corresponding path program 1 times [2025-03-04 10:32:47,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:47,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345091961] [2025-03-04 10:32:47,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:47,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:47,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:32:47,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:32:47,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:47,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:48,014 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 10:32:48,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:48,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345091961] [2025-03-04 10:32:48,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345091961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:32:48,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:32:48,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:32:48,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555790862] [2025-03-04 10:32:48,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:32:48,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:32:48,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:48,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:32:48,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:32:48,033 INFO L87 Difference]: Start difference. First operand has 39 states, 25 states have (on average 1.52) internal successors, (38), 33 states have internal predecessors, (38), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) 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 10:32:48,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:48,171 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2025-03-04 10:32:48,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:32:48,173 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 10:32:48,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:48,179 INFO L225 Difference]: With dead ends: 71 [2025-03-04 10:32:48,179 INFO L226 Difference]: Without dead ends: 59 [2025-03-04 10:32:48,182 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 10:32:48,184 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 36 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:48,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 119 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:32:48,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-04 10:32:48,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 51. [2025-03-04 10:32:48,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 42 states have internal predecessors, (52), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 10:32:48,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2025-03-04 10:32:48,220 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 65 transitions. Word has length 8 [2025-03-04 10:32:48,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:48,220 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 65 transitions. [2025-03-04 10:32:48,220 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 10:32:48,221 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2025-03-04 10:32:48,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 10:32:48,221 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:48,221 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:48,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:32:48,221 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ackermannErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:32:48,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:48,222 INFO L85 PathProgramCache]: Analyzing trace with hash 2017335443, now seen corresponding path program 1 times [2025-03-04 10:32:48,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:48,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525854540] [2025-03-04 10:32:48,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:48,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:48,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:32:48,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:32:48,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:48,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:48,279 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 10:32:48,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:48,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525854540] [2025-03-04 10:32:48,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525854540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:32:48,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:32:48,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:32:48,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677395205] [2025-03-04 10:32:48,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:32:48,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:32:48,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:48,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:32:48,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:32:48,282 INFO L87 Difference]: Start difference. First operand 51 states and 65 transitions. Second operand has 5 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 10:32:48,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:48,358 INFO L93 Difference]: Finished difference Result 82 states and 103 transitions. [2025-03-04 10:32:48,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:32:48,358 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 9 [2025-03-04 10:32:48,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:48,359 INFO L225 Difference]: With dead ends: 82 [2025-03-04 10:32:48,359 INFO L226 Difference]: Without dead ends: 80 [2025-03-04 10:32:48,359 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 10:32:48,360 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 34 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:48,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 100 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:32:48,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-04 10:32:48,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 70. [2025-03-04 10:32:48,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 49 states have (on average 1.489795918367347) internal successors, (73), 57 states have internal predecessors, (73), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 10:32:48,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 92 transitions. [2025-03-04 10:32:48,375 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 92 transitions. Word has length 9 [2025-03-04 10:32:48,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:48,375 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 92 transitions. [2025-03-04 10:32:48,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 10:32:48,375 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 92 transitions. [2025-03-04 10:32:48,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 10:32:48,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:48,375 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:48,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:32:48,376 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ackermannErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:32:48,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:48,376 INFO L85 PathProgramCache]: Analyzing trace with hash 2017336276, now seen corresponding path program 1 times [2025-03-04 10:32:48,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:48,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008281124] [2025-03-04 10:32:48,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:48,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:48,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:32:48,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:32:48,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:48,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:48,423 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 10:32:48,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:48,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008281124] [2025-03-04 10:32:48,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008281124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:32:48,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:32:48,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:32:48,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406796210] [2025-03-04 10:32:48,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:32:48,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:32:48,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:48,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:32:48,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:32:48,426 INFO L87 Difference]: Start difference. First operand 70 states and 92 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 10:32:48,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:48,480 INFO L93 Difference]: Finished difference Result 118 states and 152 transitions. [2025-03-04 10:32:48,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:32:48,481 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 9 [2025-03-04 10:32:48,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:48,482 INFO L225 Difference]: With dead ends: 118 [2025-03-04 10:32:48,482 INFO L226 Difference]: Without dead ends: 108 [2025-03-04 10:32:48,482 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 10:32:48,482 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 33 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:48,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 101 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:32:48,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-04 10:32:48,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 102. [2025-03-04 10:32:48,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 74 states have (on average 1.445945945945946) internal successors, (107), 83 states have internal predecessors, (107), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 10:32:48,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 136 transitions. [2025-03-04 10:32:48,493 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 136 transitions. Word has length 9 [2025-03-04 10:32:48,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:48,493 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 136 transitions. [2025-03-04 10:32:48,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 10:32:48,493 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 136 transitions. [2025-03-04 10:32:48,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 10:32:48,493 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:48,493 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:48,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:32:48,494 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ackermannErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:32:48,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:48,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1887084879, now seen corresponding path program 1 times [2025-03-04 10:32:48,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:48,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991443529] [2025-03-04 10:32:48,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:48,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:48,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:32:48,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:32:48,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:48,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:48,554 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 10:32:48,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:48,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991443529] [2025-03-04 10:32:48,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991443529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:32:48,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:32:48,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:32:48,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323590055] [2025-03-04 10:32:48,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:32:48,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:32:48,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:48,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:32:48,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:32:48,555 INFO L87 Difference]: Start difference. First operand 102 states and 136 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 10:32:48,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:48,598 INFO L93 Difference]: Finished difference Result 110 states and 153 transitions. [2025-03-04 10:32:48,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:32:48,599 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 10 [2025-03-04 10:32:48,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:48,600 INFO L225 Difference]: With dead ends: 110 [2025-03-04 10:32:48,600 INFO L226 Difference]: Without dead ends: 108 [2025-03-04 10:32:48,600 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 10:32:48,600 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 35 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:48,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 54 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:32:48,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-04 10:32:48,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 100. [2025-03-04 10:32:48,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 74 states have (on average 1.3108108108108107) internal successors, (97), 81 states have internal predecessors, (97), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 10:32:48,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 126 transitions. [2025-03-04 10:32:48,622 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 126 transitions. Word has length 10 [2025-03-04 10:32:48,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:48,622 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 126 transitions. [2025-03-04 10:32:48,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 10:32:48,623 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 126 transitions. [2025-03-04 10:32:48,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 10:32:48,623 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:48,623 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:48,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:32:48,623 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ackermannErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:32:48,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:48,624 INFO L85 PathProgramCache]: Analyzing trace with hash -224957691, now seen corresponding path program 1 times [2025-03-04 10:32:48,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:48,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119755526] [2025-03-04 10:32:48,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:48,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:48,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:32:48,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:32:48,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:48,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:48,669 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:48,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:48,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119755526] [2025-03-04 10:32:48,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119755526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:32:48,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:32:48,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:32:48,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285886383] [2025-03-04 10:32:48,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:32:48,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:32:48,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:48,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:32:48,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:32:48,670 INFO L87 Difference]: Start difference. First operand 100 states and 126 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:48,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:48,707 INFO L93 Difference]: Finished difference Result 170 states and 225 transitions. [2025-03-04 10:32:48,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:32:48,708 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-04 10:32:48,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:48,709 INFO L225 Difference]: With dead ends: 170 [2025-03-04 10:32:48,709 INFO L226 Difference]: Without dead ends: 99 [2025-03-04 10:32:48,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:32:48,710 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 25 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:48,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 89 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:32:48,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-04 10:32:48,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2025-03-04 10:32:48,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 71 states have (on average 1.295774647887324) internal successors, (92), 78 states have internal predecessors, (92), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 10:32:48,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 119 transitions. [2025-03-04 10:32:48,718 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 119 transitions. Word has length 15 [2025-03-04 10:32:48,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:48,718 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 119 transitions. [2025-03-04 10:32:48,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:48,718 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 119 transitions. [2025-03-04 10:32:48,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 10:32:48,718 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:48,718 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:48,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:32:48,719 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ackermannErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:32:48,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:48,719 INFO L85 PathProgramCache]: Analyzing trace with hash -224957667, now seen corresponding path program 1 times [2025-03-04 10:32:48,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:48,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725643729] [2025-03-04 10:32:48,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:48,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:48,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:32:48,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:32:48,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:48,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:48,776 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 10:32:48,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:48,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725643729] [2025-03-04 10:32:48,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725643729] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:48,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61966774] [2025-03-04 10:32:48,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:48,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:48,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:48,780 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 10:32:48,781 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 10:32:48,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:32:48,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:32:48,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:48,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:48,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:32:48,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:48,853 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 10:32:48,853 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:48,916 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 10:32:48,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61966774] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:32:48,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:32:48,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-04 10:32:48,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564018162] [2025-03-04 10:32:48,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:32:48,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:32:48,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:48,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:32:48,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:32:48,918 INFO L87 Difference]: Start difference. First operand 96 states and 119 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 8 states have internal predecessors, (24), 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 10:32:49,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:49,125 INFO L93 Difference]: Finished difference Result 276 states and 359 transitions. [2025-03-04 10:32:49,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:32:49,126 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 8 states have internal predecessors, (24), 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 15 [2025-03-04 10:32:49,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:49,128 INFO L225 Difference]: With dead ends: 276 [2025-03-04 10:32:49,128 INFO L226 Difference]: Without dead ends: 274 [2025-03-04 10:32:49,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 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 10:32:49,129 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 171 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:49,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 219 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:32:49,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-03-04 10:32:49,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 236. [2025-03-04 10:32:49,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 182 states have (on average 1.2637362637362637) internal successors, (230), 189 states have internal predecessors, (230), 36 states have call successors, (36), 13 states have call predecessors, (36), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 10:32:49,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 299 transitions. [2025-03-04 10:32:49,158 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 299 transitions. Word has length 15 [2025-03-04 10:32:49,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:49,158 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 299 transitions. [2025-03-04 10:32:49,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 8 states have internal predecessors, (24), 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 10:32:49,159 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 299 transitions. [2025-03-04 10:32:49,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 10:32:49,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:49,159 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:49,165 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 10:32:49,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 10:32:49,363 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ackermannErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:32:49,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:49,364 INFO L85 PathProgramCache]: Analyzing trace with hash 2020160200, now seen corresponding path program 1 times [2025-03-04 10:32:49,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:49,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928417569] [2025-03-04 10:32:49,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:49,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:49,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:32:49,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:32:49,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:49,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:49,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:49,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:49,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928417569] [2025-03-04 10:32:49,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928417569] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:49,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379197435] [2025-03-04 10:32:49,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:49,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:49,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:49,453 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 10:32:49,454 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 10:32:49,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:32:49,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:32:49,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:49,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:49,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:32:49,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:49,514 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:49,515 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:32:49,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379197435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:32:49,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:32:49,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-04 10:32:49,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220276749] [2025-03-04 10:32:49,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:32:49,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:32:49,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:49,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:32:49,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:32:49,517 INFO L87 Difference]: Start difference. First operand 236 states and 299 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:49,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:49,589 INFO L93 Difference]: Finished difference Result 328 states and 437 transitions. [2025-03-04 10:32:49,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:32:49,590 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-04 10:32:49,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:49,592 INFO L225 Difference]: With dead ends: 328 [2025-03-04 10:32:49,592 INFO L226 Difference]: Without dead ends: 327 [2025-03-04 10:32:49,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:32:49,593 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 37 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:49,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 90 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:32:49,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2025-03-04 10:32:49,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 293. [2025-03-04 10:32:49,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 227 states have (on average 1.2599118942731278) internal successors, (286), 234 states have internal predecessors, (286), 45 states have call successors, (45), 16 states have call predecessors, (45), 15 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-04 10:32:49,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 373 transitions. [2025-03-04 10:32:49,624 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 373 transitions. Word has length 16 [2025-03-04 10:32:49,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:49,624 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 373 transitions. [2025-03-04 10:32:49,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:49,624 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 373 transitions. [2025-03-04 10:32:49,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 10:32:49,624 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:49,624 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:49,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 10:32:49,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-04 10:32:49,829 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:32:49,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:49,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1511600730, now seen corresponding path program 1 times [2025-03-04 10:32:49,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:49,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630538247] [2025-03-04 10:32:49,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:49,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:49,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:32:49,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:32:49,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:49,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:49,887 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:49,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:49,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630538247] [2025-03-04 10:32:49,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630538247] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:49,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025681741] [2025-03-04 10:32:49,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:49,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:49,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:49,891 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 10:32:49,892 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 10:32:49,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:32:49,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:32:49,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:49,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:49,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:32:49,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:49,944 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:49,944 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:49,995 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:49,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025681741] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:32:49,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:32:49,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-04 10:32:49,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504698247] [2025-03-04 10:32:49,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:32:49,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:32:49,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:49,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:32:49,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:32:49,996 INFO L87 Difference]: Start difference. First operand 293 states and 373 transitions. Second operand has 12 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 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 10:32:50,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:50,178 INFO L93 Difference]: Finished difference Result 577 states and 766 transitions. [2025-03-04 10:32:50,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:32:50,179 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 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 19 [2025-03-04 10:32:50,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:50,182 INFO L225 Difference]: With dead ends: 577 [2025-03-04 10:32:50,182 INFO L226 Difference]: Without dead ends: 576 [2025-03-04 10:32:50,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 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 10:32:50,184 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 169 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:50,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 183 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:32:50,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2025-03-04 10:32:50,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 521. [2025-03-04 10:32:50,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 407 states have (on average 1.203931203931204) internal successors, (490), 414 states have internal predecessors, (490), 81 states have call successors, (81), 28 states have call predecessors, (81), 27 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-04 10:32:50,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 649 transitions. [2025-03-04 10:32:50,221 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 649 transitions. Word has length 19 [2025-03-04 10:32:50,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:50,221 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 649 transitions. [2025-03-04 10:32:50,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 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 10:32:50,221 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 649 transitions. [2025-03-04 10:32:50,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 10:32:50,221 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:50,221 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:50,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 10:32:50,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:50,422 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ackermannErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:32:50,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:50,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1980210359, now seen corresponding path program 1 times [2025-03-04 10:32:50,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:50,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876549119] [2025-03-04 10:32:50,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:50,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:50,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 10:32:50,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:32:50,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:50,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:50,508 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:32:50,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:50,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876549119] [2025-03-04 10:32:50,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876549119] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:50,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784723014] [2025-03-04 10:32:50,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:50,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:50,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:50,510 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 10:32:50,512 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 10:32:50,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 10:32:50,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:32:50,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:50,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:50,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:32:50,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:50,595 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:32:50,595 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:50,676 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:32:50,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784723014] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:32:50,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:32:50,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-03-04 10:32:50,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667303381] [2025-03-04 10:32:50,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:32:50,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:32:50,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:50,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:32:50,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:32:50,678 INFO L87 Difference]: Start difference. First operand 521 states and 649 transitions. Second operand has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:32:51,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:51,093 INFO L93 Difference]: Finished difference Result 1306 states and 1818 transitions. [2025-03-04 10:32:51,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 10:32:51,094 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2025-03-04 10:32:51,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:51,099 INFO L225 Difference]: With dead ends: 1306 [2025-03-04 10:32:51,099 INFO L226 Difference]: Without dead ends: 915 [2025-03-04 10:32:51,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=689, Unknown=0, NotChecked=0, Total=870 [2025-03-04 10:32:51,103 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 163 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:51,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 105 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:32:51,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2025-03-04 10:32:51,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 715. [2025-03-04 10:32:51,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 560 states have (on average 1.1982142857142857) internal successors, (671), 581 states have internal predecessors, (671), 103 states have call successors, (103), 47 states have call predecessors, (103), 46 states have return successors, (106), 86 states have call predecessors, (106), 78 states have call successors, (106) [2025-03-04 10:32:51,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 880 transitions. [2025-03-04 10:32:51,163 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 880 transitions. Word has length 24 [2025-03-04 10:32:51,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:51,163 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 880 transitions. [2025-03-04 10:32:51,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:32:51,164 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 880 transitions. [2025-03-04 10:32:51,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 10:32:51,165 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:51,165 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:51,171 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 10:32:51,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:51,366 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:32:51,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:51,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1184768225, now seen corresponding path program 1 times [2025-03-04 10:32:51,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:51,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336447492] [2025-03-04 10:32:51,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:51,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:51,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 10:32:51,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:32:51,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:51,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:51,434 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 10:32:51,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:51,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336447492] [2025-03-04 10:32:51,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336447492] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:51,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265650786] [2025-03-04 10:32:51,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:51,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:51,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:51,440 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 10:32:51,442 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 10:32:51,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 10:32:51,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:32:51,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:51,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:51,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:32:51,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:51,499 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:32:51,499 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:32:51,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265650786] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:32:51,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:32:51,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2025-03-04 10:32:51,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404710017] [2025-03-04 10:32:51,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:32:51,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:32:51,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:51,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:32:51,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:32:51,500 INFO L87 Difference]: Start difference. First operand 715 states and 880 transitions. Second operand has 5 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:32:51,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:51,601 INFO L93 Difference]: Finished difference Result 762 states and 976 transitions. [2025-03-04 10:32:51,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:32:51,601 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2025-03-04 10:32:51,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:51,607 INFO L225 Difference]: With dead ends: 762 [2025-03-04 10:32:51,607 INFO L226 Difference]: Without dead ends: 761 [2025-03-04 10:32:51,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:32:51,608 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 29 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:51,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 110 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:32:51,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2025-03-04 10:32:51,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 686. [2025-03-04 10:32:51,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 534 states have (on average 1.1779026217228465) internal successors, (629), 556 states have internal predecessors, (629), 101 states have call successors, (101), 43 states have call predecessors, (101), 46 states have return successors, (106), 86 states have call predecessors, (106), 78 states have call successors, (106) [2025-03-04 10:32:51,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 836 transitions. [2025-03-04 10:32:51,672 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 836 transitions. Word has length 28 [2025-03-04 10:32:51,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:51,672 INFO L471 AbstractCegarLoop]: Abstraction has 686 states and 836 transitions. [2025-03-04 10:32:51,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:32:51,673 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 836 transitions. [2025-03-04 10:32:51,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-04 10:32:51,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:51,675 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:51,681 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 10:32:51,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-04 10:32:51,879 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ackermannErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:32:51,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:51,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1930986427, now seen corresponding path program 1 times [2025-03-04 10:32:51,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:51,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655714783] [2025-03-04 10:32:51,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:51,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:51,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 10:32:51,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:32:51,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:51,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:51,967 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:32:51,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:51,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655714783] [2025-03-04 10:32:51,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655714783] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:51,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268861431] [2025-03-04 10:32:51,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:51,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:51,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:51,970 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 10:32:51,972 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 10:32:51,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 10:32:52,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:32:52,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:52,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:52,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:32:52,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:52,046 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:32:52,046 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:52,219 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:32:52,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268861431] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:52,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:32:52,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 8] total 17 [2025-03-04 10:32:52,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011933578] [2025-03-04 10:32:52,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:32:52,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:32:52,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:52,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:32:52,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:32:52,221 INFO L87 Difference]: Start difference. First operand 686 states and 836 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:32:52,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:52,440 INFO L93 Difference]: Finished difference Result 793 states and 1000 transitions. [2025-03-04 10:32:52,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 10:32:52,440 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2025-03-04 10:32:52,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:52,444 INFO L225 Difference]: With dead ends: 793 [2025-03-04 10:32:52,444 INFO L226 Difference]: Without dead ends: 792 [2025-03-04 10:32:52,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2025-03-04 10:32:52,445 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 45 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:52,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 159 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:32:52,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2025-03-04 10:32:52,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 685. [2025-03-04 10:32:52,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 534 states have (on average 1.1704119850187267) internal successors, (625), 555 states have internal predecessors, (625), 101 states have call successors, (101), 43 states have call predecessors, (101), 46 states have return successors, (106), 86 states have call predecessors, (106), 78 states have call successors, (106) [2025-03-04 10:32:52,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 832 transitions. [2025-03-04 10:32:52,496 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 832 transitions. Word has length 33 [2025-03-04 10:32:52,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:52,496 INFO L471 AbstractCegarLoop]: Abstraction has 685 states and 832 transitions. [2025-03-04 10:32:52,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:32:52,497 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 832 transitions. [2025-03-04 10:32:52,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-04 10:32:52,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:52,497 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:52,503 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 10:32:52,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:52,698 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ackermannErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:32:52,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:52,698 INFO L85 PathProgramCache]: Analyzing trace with hash 268962918, now seen corresponding path program 1 times [2025-03-04 10:32:52,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:52,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255053627] [2025-03-04 10:32:52,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:52,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:52,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 10:32:52,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 10:32:52,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:52,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:52,803 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:32:52,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:52,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255053627] [2025-03-04 10:32:52,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255053627] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:52,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822534208] [2025-03-04 10:32:52,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:52,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:52,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:52,806 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 10:32:52,808 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 10:32:52,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 10:32:52,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 10:32:52,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:52,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:52,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:32:52,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:52,879 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:32:52,879 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:53,028 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:32:53,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822534208] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:32:53,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:32:53,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-03-04 10:32:53,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890408284] [2025-03-04 10:32:53,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:32:53,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 10:32:53,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:53,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 10:32:53,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:32:53,030 INFO L87 Difference]: Start difference. First operand 685 states and 832 transitions. Second operand has 18 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 14 states have internal predecessors, (43), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:32:53,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:53,436 INFO L93 Difference]: Finished difference Result 1135 states and 1689 transitions. [2025-03-04 10:32:53,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 10:32:53,436 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 14 states have internal predecessors, (43), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) Word has length 34 [2025-03-04 10:32:53,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:53,441 INFO L225 Difference]: With dead ends: 1135 [2025-03-04 10:32:53,441 INFO L226 Difference]: Without dead ends: 1134 [2025-03-04 10:32:53,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=672, Unknown=0, NotChecked=0, Total=812 [2025-03-04 10:32:53,442 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 100 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:53,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 236 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:32:53,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1134 states. [2025-03-04 10:32:53,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1134 to 945. [2025-03-04 10:32:53,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 705 states have (on average 1.1602836879432623) internal successors, (818), 740 states have internal predecessors, (818), 150 states have call successors, (150), 50 states have call predecessors, (150), 86 states have return successors, (301), 154 states have call predecessors, (301), 126 states have call successors, (301) [2025-03-04 10:32:53,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1269 transitions. [2025-03-04 10:32:53,519 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1269 transitions. Word has length 34 [2025-03-04 10:32:53,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:53,519 INFO L471 AbstractCegarLoop]: Abstraction has 945 states and 1269 transitions. [2025-03-04 10:32:53,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 14 states have internal predecessors, (43), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:32:53,519 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1269 transitions. [2025-03-04 10:32:53,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-04 10:32:53,520 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:53,520 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:53,526 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 10:32:53,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:53,724 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:32:53,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:53,724 INFO L85 PathProgramCache]: Analyzing trace with hash -54654743, now seen corresponding path program 1 times [2025-03-04 10:32:53,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:53,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539633024] [2025-03-04 10:32:53,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:53,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:53,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 10:32:53,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 10:32:53,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:53,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:53,803 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:32:53,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:53,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539633024] [2025-03-04 10:32:53,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539633024] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:53,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127985342] [2025-03-04 10:32:53,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:53,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:53,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:53,806 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 10:32:53,807 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 10:32:53,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 10:32:53,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 10:32:53,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:53,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:53,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:32:53,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:53,880 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:32:53,880 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:54,028 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:32:54,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127985342] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:32:54,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:32:54,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2025-03-04 10:32:54,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284867658] [2025-03-04 10:32:54,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:32:54,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 10:32:54,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:54,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 10:32:54,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:32:54,029 INFO L87 Difference]: Start difference. First operand 945 states and 1269 transitions. Second operand has 18 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 6 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:32:54,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:54,401 INFO L93 Difference]: Finished difference Result 1154 states and 1562 transitions. [2025-03-04 10:32:54,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 10:32:54,401 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 6 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2025-03-04 10:32:54,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:54,406 INFO L225 Difference]: With dead ends: 1154 [2025-03-04 10:32:54,406 INFO L226 Difference]: Without dead ends: 1153 [2025-03-04 10:32:54,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=189, Invalid=741, Unknown=0, NotChecked=0, Total=930 [2025-03-04 10:32:54,407 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 188 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:54,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 215 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:32:54,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2025-03-04 10:32:54,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 986. [2025-03-04 10:32:54,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 986 states, 739 states have (on average 1.1610284167794316) internal successors, (858), 771 states have internal predecessors, (858), 157 states have call successors, (157), 56 states have call predecessors, (157), 86 states have return successors, (301), 158 states have call predecessors, (301), 126 states have call successors, (301) [2025-03-04 10:32:54,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1316 transitions. [2025-03-04 10:32:54,490 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 1316 transitions. Word has length 35 [2025-03-04 10:32:54,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:54,490 INFO L471 AbstractCegarLoop]: Abstraction has 986 states and 1316 transitions. [2025-03-04 10:32:54,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 6 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:32:54,491 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1316 transitions. [2025-03-04 10:32:54,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-04 10:32:54,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:54,491 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:54,497 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 10:32:54,698 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,SelfDestructingSolverStorable12 [2025-03-04 10:32:54,699 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:32:54,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:54,699 INFO L85 PathProgramCache]: Analyzing trace with hash 776149949, now seen corresponding path program 1 times [2025-03-04 10:32:54,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:54,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217643484] [2025-03-04 10:32:54,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:54,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:54,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 10:32:54,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 10:32:54,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:54,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:54,777 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:32:54,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:54,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217643484] [2025-03-04 10:32:54,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217643484] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:54,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148913648] [2025-03-04 10:32:54,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:54,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:54,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:54,779 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 10:32:54,780 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 10:32:54,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 10:32:54,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 10:32:54,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:54,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:54,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:32:54,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:54,843 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:32:54,843 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:54,984 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:32:54,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148913648] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:54,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:32:54,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 8] total 17 [2025-03-04 10:32:54,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735850908] [2025-03-04 10:32:54,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:32:54,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:32:54,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:54,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:32:54,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:32:54,985 INFO L87 Difference]: Start difference. First operand 986 states and 1316 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:32:55,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:55,207 INFO L93 Difference]: Finished difference Result 1136 states and 1594 transitions. [2025-03-04 10:32:55,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 10:32:55,208 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2025-03-04 10:32:55,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:55,212 INFO L225 Difference]: With dead ends: 1136 [2025-03-04 10:32:55,212 INFO L226 Difference]: Without dead ends: 1135 [2025-03-04 10:32:55,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2025-03-04 10:32:55,214 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 49 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:55,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 183 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:32:55,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1135 states. [2025-03-04 10:32:55,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1135 to 994. [2025-03-04 10:32:55,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 747 states have (on average 1.1552878179384203) internal successors, (863), 775 states have internal predecessors, (863), 161 states have call successors, (161), 56 states have call predecessors, (161), 82 states have return successors, (241), 162 states have call predecessors, (241), 130 states have call successors, (241) [2025-03-04 10:32:55,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1265 transitions. [2025-03-04 10:32:55,283 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1265 transitions. Word has length 36 [2025-03-04 10:32:55,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:55,283 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1265 transitions. [2025-03-04 10:32:55,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:32:55,283 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1265 transitions. [2025-03-04 10:32:55,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-04 10:32:55,284 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:55,284 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:55,290 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 10:32:55,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 10:32:55,485 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:32:55,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:55,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1235994774, now seen corresponding path program 2 times [2025-03-04 10:32:55,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:55,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374562541] [2025-03-04 10:32:55,485 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:32:55,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:55,489 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-03-04 10:32:55,493 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 10:32:55,493 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:32:55,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:55,613 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:55,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:55,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374562541] [2025-03-04 10:32:55,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374562541] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:55,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187230297] [2025-03-04 10:32:55,613 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:32:55,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:55,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:55,615 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 10:32:55,617 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 10:32:55,636 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-03-04 10:32:55,645 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 10:32:55,645 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:32:55,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:55,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:32:55,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:55,683 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:55,683 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:55,811 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:55,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187230297] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:32:55,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:32:55,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2025-03-04 10:32:55,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632582126] [2025-03-04 10:32:55,811 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:32:55,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 10:32:55,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:55,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 10:32:55,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2025-03-04 10:32:55,812 INFO L87 Difference]: Start difference. First operand 994 states and 1265 transitions. Second operand has 24 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 14 states have internal predecessors, (73), 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 10:32:56,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:56,249 INFO L93 Difference]: Finished difference Result 1989 states and 2570 transitions. [2025-03-04 10:32:56,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 10:32:56,250 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 14 states have internal predecessors, (73), 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 43 [2025-03-04 10:32:56,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:56,257 INFO L225 Difference]: With dead ends: 1989 [2025-03-04 10:32:56,257 INFO L226 Difference]: Without dead ends: 1988 [2025-03-04 10:32:56,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=311, Invalid=811, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 10:32:56,260 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 515 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:56,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 305 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:32:56,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1988 states. [2025-03-04 10:32:56,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1988 to 1709. [2025-03-04 10:32:56,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1709 states, 1282 states have (on average 1.1365054602184088) internal successors, (1457), 1336 states have internal predecessors, (1457), 269 states have call successors, (269), 90 states have call predecessors, (269), 154 states have return successors, (409), 282 states have call predecessors, (409), 226 states have call successors, (409) [2025-03-04 10:32:56,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1709 states to 1709 states and 2135 transitions. [2025-03-04 10:32:56,380 INFO L78 Accepts]: Start accepts. Automaton has 1709 states and 2135 transitions. Word has length 43 [2025-03-04 10:32:56,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:56,380 INFO L471 AbstractCegarLoop]: Abstraction has 1709 states and 2135 transitions. [2025-03-04 10:32:56,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 14 states have internal predecessors, (73), 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 10:32:56,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1709 states and 2135 transitions. [2025-03-04 10:32:56,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 10:32:56,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:56,381 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:56,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 10:32:56,584 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,SelfDestructingSolverStorable14 [2025-03-04 10:32:56,584 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:32:56,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:56,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1489943149, now seen corresponding path program 2 times [2025-03-04 10:32:56,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:56,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009949718] [2025-03-04 10:32:56,585 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:32:56,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:56,587 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-03-04 10:32:56,590 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 10:32:56,590 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:32:56,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:56,671 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:32:56,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:56,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009949718] [2025-03-04 10:32:56,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009949718] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:56,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438431512] [2025-03-04 10:32:56,672 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:32:56,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:56,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:56,673 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 10:32:56,675 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 10:32:56,694 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-03-04 10:32:56,704 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 10:32:56,705 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:32:56,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:56,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 10:32:56,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:56,747 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 24 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:32:56,747 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:56,925 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:32:56,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438431512] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:32:56,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:32:56,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2025-03-04 10:32:56,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875142138] [2025-03-04 10:32:56,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:32:56,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 10:32:56,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:56,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 10:32:56,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:32:56,927 INFO L87 Difference]: Start difference. First operand 1709 states and 2135 transitions. Second operand has 22 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 16 states have internal predecessors, (61), 5 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:32:57,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:57,735 INFO L93 Difference]: Finished difference Result 3697 states and 5359 transitions. [2025-03-04 10:32:57,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-04 10:32:57,736 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 16 states have internal predecessors, (61), 5 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) Word has length 44 [2025-03-04 10:32:57,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:57,745 INFO L225 Difference]: With dead ends: 3697 [2025-03-04 10:32:57,746 INFO L226 Difference]: Without dead ends: 2573 [2025-03-04 10:32:57,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=501, Invalid=2049, Unknown=0, NotChecked=0, Total=2550 [2025-03-04 10:32:57,753 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 181 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:57,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 321 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:32:57,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2573 states. [2025-03-04 10:32:57,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2573 to 1888. [2025-03-04 10:32:57,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1888 states, 1419 states have (on average 1.1310782241014798) internal successors, (1605), 1479 states have internal predecessors, (1605), 293 states have call successors, (293), 104 states have call predecessors, (293), 172 states have return successors, (443), 304 states have call predecessors, (443), 245 states have call successors, (443) [2025-03-04 10:32:57,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1888 states to 1888 states and 2341 transitions. [2025-03-04 10:32:57,981 INFO L78 Accepts]: Start accepts. Automaton has 1888 states and 2341 transitions. Word has length 44 [2025-03-04 10:32:57,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:57,982 INFO L471 AbstractCegarLoop]: Abstraction has 1888 states and 2341 transitions. [2025-03-04 10:32:57,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 16 states have internal predecessors, (61), 5 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:32:57,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1888 states and 2341 transitions. [2025-03-04 10:32:57,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 10:32:57,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:57,984 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:57,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 10:32:58,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 10:32:58,188 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ackermannErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:32:58,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:58,189 INFO L85 PathProgramCache]: Analyzing trace with hash -460172098, now seen corresponding path program 1 times [2025-03-04 10:32:58,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:58,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029964519] [2025-03-04 10:32:58,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:58,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:58,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 10:32:58,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 10:32:58,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:58,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:58,269 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 53 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-04 10:32:58,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:58,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029964519] [2025-03-04 10:32:58,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029964519] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:58,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022935504] [2025-03-04 10:32:58,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:58,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:58,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:58,271 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:32:58,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 10:32:58,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 10:32:58,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 10:32:58,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:58,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:58,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:32:58,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:58,329 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 53 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 10:32:58,330 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:58,414 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 54 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 10:32:58,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022935504] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:32:58,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:32:58,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 11 [2025-03-04 10:32:58,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268667623] [2025-03-04 10:32:58,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:32:58,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:32:58,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:58,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:32:58,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:32:58,415 INFO L87 Difference]: Start difference. First operand 1888 states and 2341 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 9 states have internal predecessors, (46), 5 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:32:58,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:58,663 INFO L93 Difference]: Finished difference Result 2110 states and 2763 transitions. [2025-03-04 10:32:58,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:32:58,664 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 9 states have internal predecessors, (46), 5 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2025-03-04 10:32:58,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:58,669 INFO L225 Difference]: With dead ends: 2110 [2025-03-04 10:32:58,669 INFO L226 Difference]: Without dead ends: 2010 [2025-03-04 10:32:58,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 97 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:32:58,670 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 69 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:58,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 129 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:32:58,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2010 states. [2025-03-04 10:32:58,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2010 to 1894. [2025-03-04 10:32:58,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1894 states, 1425 states have (on average 1.1298245614035087) internal successors, (1610), 1483 states have internal predecessors, (1610), 293 states have call successors, (293), 106 states have call predecessors, (293), 172 states have return successors, (443), 304 states have call predecessors, (443), 245 states have call successors, (443) [2025-03-04 10:32:58,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1894 states and 2346 transitions. [2025-03-04 10:32:58,803 INFO L78 Accepts]: Start accepts. Automaton has 1894 states and 2346 transitions. Word has length 51 [2025-03-04 10:32:58,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:58,803 INFO L471 AbstractCegarLoop]: Abstraction has 1894 states and 2346 transitions. [2025-03-04 10:32:58,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 9 states have internal predecessors, (46), 5 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:32:58,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 2346 transitions. [2025-03-04 10:32:58,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 10:32:58,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:58,804 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:58,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 10:32:59,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 10:32:59,009 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:32:59,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:59,009 INFO L85 PathProgramCache]: Analyzing trace with hash -682664631, now seen corresponding path program 2 times [2025-03-04 10:32:59,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:59,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060888858] [2025-03-04 10:32:59,009 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:32:59,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:59,012 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-03-04 10:32:59,019 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 10:32:59,019 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:32:59,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:59,141 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 3 proven. 71 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:32:59,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:59,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060888858] [2025-03-04 10:32:59,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060888858] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:59,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812612838] [2025-03-04 10:32:59,142 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:32:59,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:59,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:59,144 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:32:59,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 10:32:59,168 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-03-04 10:32:59,178 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 10:32:59,178 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:32:59,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:59,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:32:59,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:59,230 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 3 proven. 71 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:32:59,230 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:59,422 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 5 proven. 69 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:32:59,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812612838] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:32:59,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:32:59,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-03-04 10:32:59,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128731832] [2025-03-04 10:32:59,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:32:59,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 10:32:59,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:59,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 10:32:59,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=534, Unknown=0, NotChecked=0, Total=650 [2025-03-04 10:32:59,424 INFO L87 Difference]: Start difference. First operand 1894 states and 2346 transitions. Second operand has 26 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 18 states have internal predecessors, (71), 10 states have call successors, (12), 9 states have call predecessors, (12), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:33:00,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:00,105 INFO L93 Difference]: Finished difference Result 2409 states and 3101 transitions. [2025-03-04 10:33:00,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-04 10:33:00,105 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 18 states have internal predecessors, (71), 10 states have call successors, (12), 9 states have call predecessors, (12), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 51 [2025-03-04 10:33:00,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:00,113 INFO L225 Difference]: With dead ends: 2409 [2025-03-04 10:33:00,113 INFO L226 Difference]: Without dead ends: 2408 [2025-03-04 10:33:00,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=513, Invalid=1937, Unknown=0, NotChecked=0, Total=2450 [2025-03-04 10:33:00,114 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 369 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:00,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 306 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:33:00,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2408 states. [2025-03-04 10:33:00,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2408 to 1937. [2025-03-04 10:33:00,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1937 states, 1459 states have (on average 1.1309115832762167) internal successors, (1650), 1515 states have internal predecessors, (1650), 302 states have call successors, (302), 111 states have call predecessors, (302), 172 states have return successors, (443), 310 states have call predecessors, (443), 245 states have call successors, (443) [2025-03-04 10:33:00,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1937 states to 1937 states and 2395 transitions. [2025-03-04 10:33:00,263 INFO L78 Accepts]: Start accepts. Automaton has 1937 states and 2395 transitions. Word has length 51 [2025-03-04 10:33:00,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:00,263 INFO L471 AbstractCegarLoop]: Abstraction has 1937 states and 2395 transitions. [2025-03-04 10:33:00,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 18 states have internal predecessors, (71), 10 states have call successors, (12), 9 states have call predecessors, (12), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:33:00,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1937 states and 2395 transitions. [2025-03-04 10:33:00,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-04 10:33:00,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:00,265 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:00,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 10:33:00,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 10:33:00,469 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ackermannErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:33:00,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:00,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1951011931, now seen corresponding path program 1 times [2025-03-04 10:33:00,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:00,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769721710] [2025-03-04 10:33:00,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:00,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:00,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 10:33:00,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 10:33:00,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:00,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:00,587 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 18 proven. 19 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 10:33:00,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:00,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769721710] [2025-03-04 10:33:00,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769721710] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:00,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865964530] [2025-03-04 10:33:00,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:00,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:00,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:00,593 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:33:00,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 10:33:00,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 10:33:00,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 10:33:00,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:00,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:00,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:33:00,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:00,662 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 14 proven. 18 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-04 10:33:00,663 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:01,036 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 18 proven. 19 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 10:33:01,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865964530] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:01,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:01,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 13] total 25 [2025-03-04 10:33:01,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882230347] [2025-03-04 10:33:01,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:01,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 10:33:01,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:01,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 10:33:01,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2025-03-04 10:33:01,039 INFO L87 Difference]: Start difference. First operand 1937 states and 2395 transitions. Second operand has 26 states, 25 states have (on average 2.16) internal successors, (54), 20 states have internal predecessors, (54), 5 states have call successors, (7), 3 states have call predecessors, (7), 8 states have return successors, (9), 8 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-04 10:33:02,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:02,647 INFO L93 Difference]: Finished difference Result 4673 states and 8176 transitions. [2025-03-04 10:33:02,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2025-03-04 10:33:02,647 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.16) internal successors, (54), 20 states have internal predecessors, (54), 5 states have call successors, (7), 3 states have call predecessors, (7), 8 states have return successors, (9), 8 states have call predecessors, (9), 3 states have call successors, (9) Word has length 53 [2025-03-04 10:33:02,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:02,665 INFO L225 Difference]: With dead ends: 4673 [2025-03-04 10:33:02,665 INFO L226 Difference]: Without dead ends: 4672 [2025-03-04 10:33:02,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2489 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1475, Invalid=7081, Unknown=0, NotChecked=0, Total=8556 [2025-03-04 10:33:02,669 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 158 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 312 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 312 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:02,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 246 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [312 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:33:02,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4672 states. [2025-03-04 10:33:02,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4672 to 3296. [2025-03-04 10:33:02,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3296 states, 2306 states have (on average 1.1019080659150042) internal successors, (2541), 2372 states have internal predecessors, (2541), 581 states have call successors, (581), 125 states have call predecessors, (581), 405 states have return successors, (2934), 798 states have call predecessors, (2934), 522 states have call successors, (2934) [2025-03-04 10:33:03,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3296 states to 3296 states and 6056 transitions. [2025-03-04 10:33:03,029 INFO L78 Accepts]: Start accepts. Automaton has 3296 states and 6056 transitions. Word has length 53 [2025-03-04 10:33:03,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:03,029 INFO L471 AbstractCegarLoop]: Abstraction has 3296 states and 6056 transitions. [2025-03-04 10:33:03,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.16) internal successors, (54), 20 states have internal predecessors, (54), 5 states have call successors, (7), 3 states have call predecessors, (7), 8 states have return successors, (9), 8 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-04 10:33:03,030 INFO L276 IsEmpty]: Start isEmpty. Operand 3296 states and 6056 transitions. [2025-03-04 10:33:03,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-04 10:33:03,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:03,033 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:03,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-04 10:33:03,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:03,233 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ackermannErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:33:03,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:03,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1491656896, now seen corresponding path program 1 times [2025-03-04 10:33:03,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:03,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684741485] [2025-03-04 10:33:03,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:03,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:03,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 10:33:03,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 10:33:03,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:03,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:03,342 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:33:03,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:03,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684741485] [2025-03-04 10:33:03,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684741485] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:03,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476875292] [2025-03-04 10:33:03,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:03,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:03,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:03,344 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:33:03,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 10:33:03,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 10:33:03,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 10:33:03,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:03,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:03,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 10:33:03,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:03,432 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:33:03,433 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:03,566 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:33:03,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476875292] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:03,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:03,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2025-03-04 10:33:03,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349944066] [2025-03-04 10:33:03,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:03,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 10:33:03,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:03,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 10:33:03,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2025-03-04 10:33:03,567 INFO L87 Difference]: Start difference. First operand 3296 states and 6056 transitions. Second operand has 24 states, 23 states have (on average 3.652173913043478) internal successors, (84), 14 states have internal predecessors, (84), 10 states have call successors, (16), 10 states have call predecessors, (16), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:04,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:04,731 INFO L93 Difference]: Finished difference Result 8935 states and 16870 transitions. [2025-03-04 10:33:04,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 10:33:04,731 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.652173913043478) internal successors, (84), 14 states have internal predecessors, (84), 10 states have call successors, (16), 10 states have call predecessors, (16), 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 10:33:04,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:04,770 INFO L225 Difference]: With dead ends: 8935 [2025-03-04 10:33:04,770 INFO L226 Difference]: Without dead ends: 8933 [2025-03-04 10:33:04,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=311, Invalid=811, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 10:33:04,776 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 600 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:04,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 335 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:33:04,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8933 states. [2025-03-04 10:33:05,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8933 to 8720. [2025-03-04 10:33:05,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8720 states, 6122 states have (on average 1.0991506043776544) internal successors, (6729), 6296 states have internal predecessors, (6729), 1535 states have call successors, (1535), 341 states have call predecessors, (1535), 1059 states have return successors, (7710), 2082 states have call predecessors, (7710), 1368 states have call successors, (7710) [2025-03-04 10:33:05,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8720 states to 8720 states and 15974 transitions. [2025-03-04 10:33:05,860 INFO L78 Accepts]: Start accepts. Automaton has 8720 states and 15974 transitions. Word has length 57 [2025-03-04 10:33:05,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:05,860 INFO L471 AbstractCegarLoop]: Abstraction has 8720 states and 15974 transitions. [2025-03-04 10:33:05,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.652173913043478) internal successors, (84), 14 states have internal predecessors, (84), 10 states have call successors, (16), 10 states have call predecessors, (16), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:05,860 INFO L276 IsEmpty]: Start isEmpty. Operand 8720 states and 15974 transitions. [2025-03-04 10:33:05,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 10:33:05,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:05,862 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:05,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 10:33:06,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:06,062 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:33:06,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:06,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1977419150, now seen corresponding path program 1 times [2025-03-04 10:33:06,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:06,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868854561] [2025-03-04 10:33:06,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:06,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:06,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 10:33:06,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 10:33:06,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:06,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:06,174 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 33 proven. 9 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 10:33:06,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:06,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868854561] [2025-03-04 10:33:06,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868854561] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:06,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749224482] [2025-03-04 10:33:06,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:06,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:06,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:06,176 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:33:06,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 10:33:06,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 10:33:06,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 10:33:06,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:06,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:06,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:33:06,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:06,232 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-04 10:33:06,232 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:06,543 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 40 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 10:33:06,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749224482] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:06,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:06,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 13] total 25 [2025-03-04 10:33:06,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473969345] [2025-03-04 10:33:06,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:06,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 10:33:06,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:06,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 10:33:06,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=562, Unknown=0, NotChecked=0, Total=650 [2025-03-04 10:33:06,544 INFO L87 Difference]: Start difference. First operand 8720 states and 15974 transitions. Second operand has 26 states, 25 states have (on average 2.32) internal successors, (58), 20 states have internal predecessors, (58), 5 states have call successors, (7), 3 states have call predecessors, (7), 8 states have return successors, (9), 8 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-04 10:33:10,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:10,685 INFO L93 Difference]: Finished difference Result 37045 states and 112394 transitions. [2025-03-04 10:33:10,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2025-03-04 10:33:10,685 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.32) internal successors, (58), 20 states have internal predecessors, (58), 5 states have call successors, (7), 3 states have call predecessors, (7), 8 states have return successors, (9), 8 states have call predecessors, (9), 3 states have call successors, (9) Word has length 55 [2025-03-04 10:33:10,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:10,913 INFO L225 Difference]: With dead ends: 37045 [2025-03-04 10:33:10,914 INFO L226 Difference]: Without dead ends: 28996 [2025-03-04 10:33:11,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2427 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1752, Invalid=7560, Unknown=0, NotChecked=0, Total=9312 [2025-03-04 10:33:11,041 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 219 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 1065 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 1319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 1065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:11,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 406 Invalid, 1319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 1065 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 10:33:11,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28996 states. [2025-03-04 10:33:14,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28996 to 20092. [2025-03-04 10:33:14,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20092 states, 13074 states have (on average 1.0577482025393912) internal successors, (13829), 13284 states have internal predecessors, (13829), 4021 states have call successors, (4021), 427 states have call predecessors, (4021), 2993 states have return successors, (45035), 6380 states have call predecessors, (45035), 3840 states have call successors, (45035) [2025-03-04 10:33:14,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20092 states to 20092 states and 62885 transitions. [2025-03-04 10:33:14,777 INFO L78 Accepts]: Start accepts. Automaton has 20092 states and 62885 transitions. Word has length 55 [2025-03-04 10:33:14,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:14,778 INFO L471 AbstractCegarLoop]: Abstraction has 20092 states and 62885 transitions. [2025-03-04 10:33:14,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.32) internal successors, (58), 20 states have internal predecessors, (58), 5 states have call successors, (7), 3 states have call predecessors, (7), 8 states have return successors, (9), 8 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-04 10:33:14,778 INFO L276 IsEmpty]: Start isEmpty. Operand 20092 states and 62885 transitions. [2025-03-04 10:33:14,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-04 10:33:14,780 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:14,780 INFO L218 NwaCegarLoop]: trace histogram [8, 6, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:14,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-04 10:33:14,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:14,985 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:33:14,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:14,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1779584020, now seen corresponding path program 2 times [2025-03-04 10:33:14,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:14,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377861857] [2025-03-04 10:33:14,985 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:33:14,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:14,988 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 72 statements into 2 equivalence classes. [2025-03-04 10:33:14,992 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 10:33:14,992 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:33:14,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:15,148 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 67 proven. 19 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-04 10:33:15,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:15,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377861857] [2025-03-04 10:33:15,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377861857] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:15,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802017529] [2025-03-04 10:33:15,148 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:33:15,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:15,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:15,150 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:33:15,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 10:33:15,181 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 72 statements into 2 equivalence classes. [2025-03-04 10:33:15,195 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 10:33:15,195 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:33:15,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:15,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 10:33:15,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:15,235 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 59 proven. 22 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-04 10:33:15,235 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:15,802 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 78 proven. 8 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-04 10:33:15,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802017529] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:15,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:15,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 16] total 31 [2025-03-04 10:33:15,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706988101] [2025-03-04 10:33:15,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:15,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-04 10:33:15,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:15,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-04 10:33:15,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=872, Unknown=0, NotChecked=0, Total=992 [2025-03-04 10:33:15,804 INFO L87 Difference]: Start difference. First operand 20092 states and 62885 transitions. Second operand has 32 states, 31 states have (on average 2.3870967741935485) internal successors, (74), 22 states have internal predecessors, (74), 7 states have call successors, (9), 5 states have call predecessors, (9), 8 states have return successors, (11), 10 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-04 10:33:18,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:18,522 INFO L93 Difference]: Finished difference Result 34821 states and 105928 transitions. [2025-03-04 10:33:18,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-03-04 10:33:18,522 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.3870967741935485) internal successors, (74), 22 states have internal predecessors, (74), 7 states have call successors, (9), 5 states have call predecessors, (9), 8 states have return successors, (11), 10 states have call predecessors, (11), 3 states have call successors, (11) Word has length 72 [2025-03-04 10:33:18,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:18,591 INFO L225 Difference]: With dead ends: 34821 [2025-03-04 10:33:18,591 INFO L226 Difference]: Without dead ends: 15389 [2025-03-04 10:33:18,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1430 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1108, Invalid=5212, Unknown=0, NotChecked=0, Total=6320 [2025-03-04 10:33:18,816 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 156 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 1126 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 1258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 1126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:18,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 571 Invalid, 1258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 1126 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:33:18,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15389 states. [2025-03-04 10:33:20,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15389 to 12581. [2025-03-04 10:33:20,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12581 states, 8648 states have (on average 1.0882284921369103) internal successors, (9411), 9009 states have internal predecessors, (9411), 2410 states have call successors, (2410), 459 states have call predecessors, (2410), 1519 states have return successors, (6313), 3112 states have call predecessors, (6313), 2233 states have call successors, (6313) [2025-03-04 10:33:20,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12581 states to 12581 states and 18134 transitions. [2025-03-04 10:33:20,144 INFO L78 Accepts]: Start accepts. Automaton has 12581 states and 18134 transitions. Word has length 72 [2025-03-04 10:33:20,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:20,145 INFO L471 AbstractCegarLoop]: Abstraction has 12581 states and 18134 transitions. [2025-03-04 10:33:20,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.3870967741935485) internal successors, (74), 22 states have internal predecessors, (74), 7 states have call successors, (9), 5 states have call predecessors, (9), 8 states have return successors, (11), 10 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-04 10:33:20,145 INFO L276 IsEmpty]: Start isEmpty. Operand 12581 states and 18134 transitions. [2025-03-04 10:33:20,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-04 10:33:20,149 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:20,149 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:20,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-04 10:33:20,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:20,356 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:33:20,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:20,357 INFO L85 PathProgramCache]: Analyzing trace with hash 173863337, now seen corresponding path program 3 times [2025-03-04 10:33:20,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:20,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672190828] [2025-03-04 10:33:20,357 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:33:20,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:20,361 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 67 statements into 7 equivalence classes. [2025-03-04 10:33:20,367 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 59 of 67 statements. [2025-03-04 10:33:20,367 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-04 10:33:20,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:20,402 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-04 10:33:20,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:20,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672190828] [2025-03-04 10:33:20,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672190828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:33:20,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:33:20,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:33:20,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728944246] [2025-03-04 10:33:20,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:33:20,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:33:20,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:20,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:33:20,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:33:20,405 INFO L87 Difference]: Start difference. First operand 12581 states and 18134 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:33:22,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:22,245 INFO L93 Difference]: Finished difference Result 12681 states and 19705 transitions. [2025-03-04 10:33:22,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:33:22,246 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2025-03-04 10:33:22,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:22,292 INFO L225 Difference]: With dead ends: 12681 [2025-03-04 10:33:22,293 INFO L226 Difference]: Without dead ends: 10670 [2025-03-04 10:33:22,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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 10:33:22,307 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 23 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:22,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 52 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:33:22,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10670 states. [2025-03-04 10:33:23,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10670 to 10486. [2025-03-04 10:33:23,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10486 states, 6985 states have (on average 1.0564065855404439) internal successors, (7379), 7108 states have internal predecessors, (7379), 2240 states have call successors, (2240), 331 states have call predecessors, (2240), 1258 states have return successors, (5982), 3046 states have call predecessors, (5982), 2233 states have call successors, (5982) [2025-03-04 10:33:23,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10486 states to 10486 states and 15601 transitions. [2025-03-04 10:33:23,802 INFO L78 Accepts]: Start accepts. Automaton has 10486 states and 15601 transitions. Word has length 67 [2025-03-04 10:33:23,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:23,802 INFO L471 AbstractCegarLoop]: Abstraction has 10486 states and 15601 transitions. [2025-03-04 10:33:23,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:33:23,803 INFO L276 IsEmpty]: Start isEmpty. Operand 10486 states and 15601 transitions. [2025-03-04 10:33:23,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-04 10:33:23,805 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:23,805 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 6, 6, 6, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:23,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 10:33:23,805 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:33:23,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:23,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1635289475, now seen corresponding path program 3 times [2025-03-04 10:33:23,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:23,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179873829] [2025-03-04 10:33:23,806 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:33:23,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:23,810 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 68 statements into 8 equivalence classes. [2025-03-04 10:33:23,818 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 10:33:23,818 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-04 10:33:23,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:24,017 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 41 proven. 46 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-04 10:33:24,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:24,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179873829] [2025-03-04 10:33:24,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179873829] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:24,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896964288] [2025-03-04 10:33:24,018 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:33:24,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:24,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:24,020 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:33:24,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 10:33:24,064 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 68 statements into 8 equivalence classes. [2025-03-04 10:33:24,080 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 10:33:24,081 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-04 10:33:24,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:24,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 10:33:24,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:24,259 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 60 proven. 79 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:33:24,259 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:24,580 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 64 proven. 75 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:33:24,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896964288] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:24,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:24,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 16] total 42 [2025-03-04 10:33:24,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494930962] [2025-03-04 10:33:24,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:24,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-04 10:33:24,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:24,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-04 10:33:24,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1530, Unknown=0, NotChecked=0, Total=1722 [2025-03-04 10:33:24,582 INFO L87 Difference]: Start difference. First operand 10486 states and 15601 transitions. Second operand has 42 states, 42 states have (on average 3.142857142857143) internal successors, (132), 29 states have internal predecessors, (132), 16 states have call successors, (18), 13 states have call predecessors, (18), 6 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 10:33:26,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:26,689 INFO L93 Difference]: Finished difference Result 20433 states and 35844 transitions. [2025-03-04 10:33:26,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-04 10:33:26,690 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 3.142857142857143) internal successors, (132), 29 states have internal predecessors, (132), 16 states have call successors, (18), 13 states have call predecessors, (18), 6 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) Word has length 68 [2025-03-04 10:33:26,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:26,734 INFO L225 Difference]: With dead ends: 20433 [2025-03-04 10:33:26,734 INFO L226 Difference]: Without dead ends: 10519 [2025-03-04 10:33:26,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1023 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=952, Invalid=4598, Unknown=0, NotChecked=0, Total=5550 [2025-03-04 10:33:26,781 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 351 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:26,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 190 Invalid, 973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:33:26,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10519 states. [2025-03-04 10:33:28,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10519 to 10235. [2025-03-04 10:33:28,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10235 states, 6682 states have (on average 1.0428015564202335) internal successors, (6968), 6813 states have internal predecessors, (6968), 2128 states have call successors, (2128), 279 states have call predecessors, (2128), 1423 states have return successors, (5603), 3142 states have call predecessors, (5603), 2122 states have call successors, (5603) [2025-03-04 10:33:28,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10235 states to 10235 states and 14699 transitions. [2025-03-04 10:33:28,045 INFO L78 Accepts]: Start accepts. Automaton has 10235 states and 14699 transitions. Word has length 68 [2025-03-04 10:33:28,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:28,046 INFO L471 AbstractCegarLoop]: Abstraction has 10235 states and 14699 transitions. [2025-03-04 10:33:28,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 3.142857142857143) internal successors, (132), 29 states have internal predecessors, (132), 16 states have call successors, (18), 13 states have call predecessors, (18), 6 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 10:33:28,046 INFO L276 IsEmpty]: Start isEmpty. Operand 10235 states and 14699 transitions. [2025-03-04 10:33:28,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-04 10:33:28,048 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:28,048 INFO L218 NwaCegarLoop]: trace histogram [9, 7, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:28,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-04 10:33:28,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:28,250 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ackermannErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:33:28,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:28,250 INFO L85 PathProgramCache]: Analyzing trace with hash -694576220, now seen corresponding path program 2 times [2025-03-04 10:33:28,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:28,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186670111] [2025-03-04 10:33:28,250 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:33:28,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:28,253 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 81 statements into 2 equivalence classes. [2025-03-04 10:33:28,257 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 81 of 81 statements. [2025-03-04 10:33:28,257 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:33:28,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:28,308 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 78 proven. 31 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-04 10:33:28,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:28,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186670111] [2025-03-04 10:33:28,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186670111] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:28,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085088581] [2025-03-04 10:33:28,308 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:33:28,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:28,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:28,310 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:33:28,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-04 10:33:28,351 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 81 statements into 2 equivalence classes. [2025-03-04 10:33:28,367 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 81 of 81 statements. [2025-03-04 10:33:28,367 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:33:28,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:28,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:33:28,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:28,406 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 85 proven. 15 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-03-04 10:33:28,406 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:28,657 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 85 proven. 26 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-04 10:33:28,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085088581] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:28,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:28,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 8] total 11 [2025-03-04 10:33:28,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774551983] [2025-03-04 10:33:28,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:28,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:33:28,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:28,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:33:28,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:33:28,660 INFO L87 Difference]: Start difference. First operand 10235 states and 14699 transitions. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 10 states have call successors, (12), 2 states have call predecessors, (12), 6 states have return successors, (12), 5 states have call predecessors, (12), 9 states have call successors, (12) [2025-03-04 10:33:30,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:30,179 INFO L93 Difference]: Finished difference Result 22118 states and 33837 transitions. [2025-03-04 10:33:30,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:33:30,180 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 10 states have call successors, (12), 2 states have call predecessors, (12), 6 states have return successors, (12), 5 states have call predecessors, (12), 9 states have call successors, (12) Word has length 81 [2025-03-04 10:33:30,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:30,216 INFO L225 Difference]: With dead ends: 22118 [2025-03-04 10:33:30,216 INFO L226 Difference]: Without dead ends: 12286 [2025-03-04 10:33:30,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 159 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:33:30,244 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 38 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:30,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 98 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:33:30,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12286 states. [2025-03-04 10:33:31,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12286 to 10000. [2025-03-04 10:33:31,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10000 states, 6542 states have (on average 1.043717517578722) internal successors, (6828), 6673 states have internal predecessors, (6828), 2078 states have call successors, (2078), 279 states have call predecessors, (2078), 1378 states have return successors, (5412), 3047 states have call predecessors, (5412), 2045 states have call successors, (5412) [2025-03-04 10:33:31,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10000 states to 10000 states and 14318 transitions. [2025-03-04 10:33:31,397 INFO L78 Accepts]: Start accepts. Automaton has 10000 states and 14318 transitions. Word has length 81 [2025-03-04 10:33:31,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:31,398 INFO L471 AbstractCegarLoop]: Abstraction has 10000 states and 14318 transitions. [2025-03-04 10:33:31,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 10 states have call successors, (12), 2 states have call predecessors, (12), 6 states have return successors, (12), 5 states have call predecessors, (12), 9 states have call successors, (12) [2025-03-04 10:33:31,398 INFO L276 IsEmpty]: Start isEmpty. Operand 10000 states and 14318 transitions. [2025-03-04 10:33:31,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-04 10:33:31,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:31,400 INFO L218 NwaCegarLoop]: trace histogram [11, 9, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:31,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-04 10:33:31,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:31,604 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ackermannErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:33:31,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:31,604 INFO L85 PathProgramCache]: Analyzing trace with hash -456104179, now seen corresponding path program 3 times [2025-03-04 10:33:31,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:31,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355394842] [2025-03-04 10:33:31,604 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:33:31,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:31,608 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 100 statements into 7 equivalence classes. [2025-03-04 10:33:31,615 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 86 of 100 statements. [2025-03-04 10:33:31,615 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-04 10:33:31,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:31,687 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 127 proven. 43 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-04 10:33:31,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:31,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355394842] [2025-03-04 10:33:31,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355394842] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:31,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180266606] [2025-03-04 10:33:31,687 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:33:31,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:31,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:31,689 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:33:31,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-04 10:33:31,728 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 100 statements into 7 equivalence classes. [2025-03-04 10:33:31,746 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 86 of 100 statements. [2025-03-04 10:33:31,747 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-04 10:33:31,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:31,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:33:31,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:31,797 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 153 proven. 26 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2025-03-04 10:33:31,797 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:32,353 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 123 proven. 57 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-03-04 10:33:32,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180266606] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:32,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:32,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 15 [2025-03-04 10:33:32,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131162957] [2025-03-04 10:33:32,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:32,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 10:33:32,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:32,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 10:33:32,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:33:32,355 INFO L87 Difference]: Start difference. First operand 10000 states and 14318 transitions. Second operand has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 15 states have internal predecessors, (73), 7 states have call successors, (11), 2 states have call predecessors, (11), 7 states have return successors, (13), 4 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-04 10:33:33,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:33,693 INFO L93 Difference]: Finished difference Result 20552 states and 34945 transitions. [2025-03-04 10:33:33,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:33:33,694 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 15 states have internal predecessors, (73), 7 states have call successors, (11), 2 states have call predecessors, (11), 7 states have return successors, (13), 4 states have call predecessors, (13), 7 states have call successors, (13) Word has length 100 [2025-03-04 10:33:33,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:33,760 INFO L225 Difference]: With dead ends: 20552 [2025-03-04 10:33:33,760 INFO L226 Difference]: Without dead ends: 11109 [2025-03-04 10:33:33,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 195 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2025-03-04 10:33:33,818 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 80 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:33,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 124 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:33:33,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11109 states. [2025-03-04 10:33:34,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11109 to 6185. [2025-03-04 10:33:34,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6185 states, 4146 states have (on average 1.0381090207428847) internal successors, (4304), 4258 states have internal predecessors, (4304), 1225 states have call successors, (1225), 214 states have call predecessors, (1225), 812 states have return successors, (2059), 1712 states have call predecessors, (2059), 1203 states have call successors, (2059) [2025-03-04 10:33:34,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6185 states to 6185 states and 7588 transitions. [2025-03-04 10:33:34,679 INFO L78 Accepts]: Start accepts. Automaton has 6185 states and 7588 transitions. Word has length 100 [2025-03-04 10:33:34,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:34,680 INFO L471 AbstractCegarLoop]: Abstraction has 6185 states and 7588 transitions. [2025-03-04 10:33:34,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 15 states have internal predecessors, (73), 7 states have call successors, (11), 2 states have call predecessors, (11), 7 states have return successors, (13), 4 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-04 10:33:34,680 INFO L276 IsEmpty]: Start isEmpty. Operand 6185 states and 7588 transitions. [2025-03-04 10:33:34,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-04 10:33:34,682 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:34,682 INFO L218 NwaCegarLoop]: trace histogram [11, 9, 7, 7, 7, 6, 6, 6, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:34,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-04 10:33:34,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-04 10:33:34,883 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:33:34,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:34,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1844069156, now seen corresponding path program 3 times [2025-03-04 10:33:34,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:34,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594942854] [2025-03-04 10:33:34,884 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:33:34,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:34,887 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 96 statements into 10 equivalence classes. [2025-03-04 10:33:34,903 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 10:33:34,903 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-03-04 10:33:34,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:35,228 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 139 proven. 91 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-04 10:33:35,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:35,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594942854] [2025-03-04 10:33:35,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594942854] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:35,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87255816] [2025-03-04 10:33:35,229 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:33:35,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:35,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:35,231 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:33:35,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-04 10:33:35,279 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 96 statements into 10 equivalence classes. [2025-03-04 10:33:35,301 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 10:33:35,301 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-03-04 10:33:35,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:35,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 10:33:35,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:35,361 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 131 proven. 94 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-04 10:33:35,361 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:36,039 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 151 proven. 79 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-04 10:33:36,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87255816] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:36,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:36,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 22] total 43 [2025-03-04 10:33:36,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007823881] [2025-03-04 10:33:36,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:36,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-04 10:33:36,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:36,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-04 10:33:36,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=1663, Unknown=0, NotChecked=0, Total=1892 [2025-03-04 10:33:36,041 INFO L87 Difference]: Start difference. First operand 6185 states and 7588 transitions. Second operand has 44 states, 43 states have (on average 2.697674418604651) internal successors, (116), 28 states have internal predecessors, (116), 13 states have call successors, (15), 11 states have call predecessors, (15), 8 states have return successors, (11), 10 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-04 10:33:37,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:37,604 INFO L93 Difference]: Finished difference Result 11662 states and 14984 transitions. [2025-03-04 10:33:37,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-04 10:33:37,608 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.697674418604651) internal successors, (116), 28 states have internal predecessors, (116), 13 states have call successors, (15), 11 states have call predecessors, (15), 8 states have return successors, (11), 10 states have call predecessors, (11), 3 states have call successors, (11) Word has length 96 [2025-03-04 10:33:37,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:37,636 INFO L225 Difference]: With dead ends: 11662 [2025-03-04 10:33:37,637 INFO L226 Difference]: Without dead ends: 6110 [2025-03-04 10:33:37,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1529 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1344, Invalid=5628, Unknown=0, NotChecked=0, Total=6972 [2025-03-04 10:33:37,656 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 174 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:37,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 406 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:33:37,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6110 states. [2025-03-04 10:33:38,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6110 to 6028. [2025-03-04 10:33:38,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6028 states, 4059 states have (on average 1.0344912540034492) internal successors, (4199), 4171 states have internal predecessors, (4199), 1172 states have call successors, (1172), 214 states have call predecessors, (1172), 795 states have return successors, (1953), 1642 states have call predecessors, (1953), 1150 states have call successors, (1953) [2025-03-04 10:33:38,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6028 states to 6028 states and 7324 transitions. [2025-03-04 10:33:38,462 INFO L78 Accepts]: Start accepts. Automaton has 6028 states and 7324 transitions. Word has length 96 [2025-03-04 10:33:38,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:38,462 INFO L471 AbstractCegarLoop]: Abstraction has 6028 states and 7324 transitions. [2025-03-04 10:33:38,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.697674418604651) internal successors, (116), 28 states have internal predecessors, (116), 13 states have call successors, (15), 11 states have call predecessors, (15), 8 states have return successors, (11), 10 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-04 10:33:38,462 INFO L276 IsEmpty]: Start isEmpty. Operand 6028 states and 7324 transitions. [2025-03-04 10:33:38,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-04 10:33:38,466 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:38,466 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:38,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-03-04 10:33:38,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-04 10:33:38,667 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:33:38,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:38,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1997819510, now seen corresponding path program 3 times [2025-03-04 10:33:38,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:38,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414598915] [2025-03-04 10:33:38,668 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:33:38,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:38,671 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 91 statements into 11 equivalence classes. [2025-03-04 10:33:38,680 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 10:33:38,680 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 10:33:38,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:38,946 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:38,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:38,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414598915] [2025-03-04 10:33:38,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414598915] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:38,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851652181] [2025-03-04 10:33:38,946 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:33:38,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:38,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:38,948 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:33:38,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-04 10:33:38,997 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 91 statements into 11 equivalence classes. [2025-03-04 10:33:39,017 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 10:33:39,017 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 10:33:39,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:39,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 10:33:39,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:39,097 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:39,098 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:39,564 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:39,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851652181] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:39,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:39,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2025-03-04 10:33:39,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648908556] [2025-03-04 10:33:39,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:39,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-04 10:33:39,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:39,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-04 10:33:39,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=556, Invalid=1700, Unknown=0, NotChecked=0, Total=2256 [2025-03-04 10:33:39,566 INFO L87 Difference]: Start difference. First operand 6028 states and 7324 transitions. Second operand has 48 states, 45 states have (on average 3.488888888888889) internal successors, (157), 26 states have internal predecessors, (157), 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 10:33:41,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:41,423 INFO L93 Difference]: Finished difference Result 10945 states and 13321 transitions. [2025-03-04 10:33:41,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-04 10:33:41,424 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 45 states have (on average 3.488888888888889) internal successors, (157), 26 states have internal predecessors, (157), 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 91 [2025-03-04 10:33:41,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:41,463 INFO L225 Difference]: With dead ends: 10945 [2025-03-04 10:33:41,463 INFO L226 Difference]: Without dead ends: 10944 [2025-03-04 10:33:41,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1337, Invalid=3493, Unknown=0, NotChecked=0, Total=4830 [2025-03-04 10:33:41,470 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 815 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 838 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:41,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [838 Valid, 624 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:33:41,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10944 states. [2025-03-04 10:33:42,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10944 to 10900. [2025-03-04 10:33:42,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10900 states, 7275 states have (on average 1.0357388316151204) internal successors, (7535), 7495 states have internal predecessors, (7535), 2120 states have call successors, (2120), 334 states have call predecessors, (2120), 1503 states have return successors, (3609), 3070 states have call predecessors, (3609), 2098 states have call successors, (3609) [2025-03-04 10:33:42,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10900 states to 10900 states and 13264 transitions. [2025-03-04 10:33:42,873 INFO L78 Accepts]: Start accepts. Automaton has 10900 states and 13264 transitions. Word has length 91 [2025-03-04 10:33:42,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:42,873 INFO L471 AbstractCegarLoop]: Abstraction has 10900 states and 13264 transitions. [2025-03-04 10:33:42,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 45 states have (on average 3.488888888888889) internal successors, (157), 26 states have internal predecessors, (157), 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 10:33:42,873 INFO L276 IsEmpty]: Start isEmpty. Operand 10900 states and 13264 transitions. [2025-03-04 10:33:42,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-04 10:33:42,875 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:42,875 INFO L218 NwaCegarLoop]: trace histogram [10, 8, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:42,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-03-04 10:33:43,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-04 10:33:43,077 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ackermannErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:33:43,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:43,077 INFO L85 PathProgramCache]: Analyzing trace with hash 2745563, now seen corresponding path program 4 times [2025-03-04 10:33:43,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:43,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967218730] [2025-03-04 10:33:43,078 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:33:43,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:43,084 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 91 statements into 2 equivalence classes. [2025-03-04 10:33:43,091 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 10:33:43,092 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:33:43,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:43,356 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 43 proven. 71 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-03-04 10:33:43,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:43,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967218730] [2025-03-04 10:33:43,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967218730] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:43,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235936608] [2025-03-04 10:33:43,357 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:33:43,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:43,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:43,359 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:33:43,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-04 10:33:43,412 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 91 statements into 2 equivalence classes. [2025-03-04 10:33:43,430 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 10:33:43,430 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:33:43,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:43,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 10:33:43,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:43,474 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 34 proven. 71 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-04 10:33:43,474 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:44,739 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 42 proven. 93 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-03-04 10:33:44,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235936608] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:44,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:44,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 23] total 40 [2025-03-04 10:33:44,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546636960] [2025-03-04 10:33:44,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:44,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-04 10:33:44,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:44,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-04 10:33:44,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1444, Unknown=0, NotChecked=0, Total=1640 [2025-03-04 10:33:44,741 INFO L87 Difference]: Start difference. First operand 10900 states and 13264 transitions. Second operand has 41 states, 40 states have (on average 1.875) internal successors, (75), 31 states have internal predecessors, (75), 9 states have call successors, (11), 3 states have call predecessors, (11), 13 states have return successors, (16), 16 states have call predecessors, (16), 7 states have call successors, (16) [2025-03-04 10:33:51,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:51,123 INFO L93 Difference]: Finished difference Result 40082 states and 58409 transitions. [2025-03-04 10:33:51,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2025-03-04 10:33:51,123 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.875) internal successors, (75), 31 states have internal predecessors, (75), 9 states have call successors, (11), 3 states have call predecessors, (11), 13 states have return successors, (16), 16 states have call predecessors, (16), 7 states have call successors, (16) Word has length 91 [2025-03-04 10:33:51,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:51,267 INFO L225 Difference]: With dead ends: 40082 [2025-03-04 10:33:51,267 INFO L226 Difference]: Without dead ends: 38981 [2025-03-04 10:33:51,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8910 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=4423, Invalid=22637, Unknown=0, NotChecked=0, Total=27060 [2025-03-04 10:33:51,290 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 341 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 377 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 1010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 377 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:51,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 344 Invalid, 1010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [377 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:33:51,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38981 states. [2025-03-04 10:33:54,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38981 to 18407. [2025-03-04 10:33:54,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18407 states, 11855 states have (on average 1.023281315900464) internal successors, (12131), 12065 states have internal predecessors, (12131), 3710 states have call successors, (3710), 395 states have call predecessors, (3710), 2840 states have return successors, (7522), 5946 states have call predecessors, (7522), 3679 states have call successors, (7522) [2025-03-04 10:33:54,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18407 states to 18407 states and 23363 transitions. [2025-03-04 10:33:54,480 INFO L78 Accepts]: Start accepts. Automaton has 18407 states and 23363 transitions. Word has length 91 [2025-03-04 10:33:54,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:54,480 INFO L471 AbstractCegarLoop]: Abstraction has 18407 states and 23363 transitions. [2025-03-04 10:33:54,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.875) internal successors, (75), 31 states have internal predecessors, (75), 9 states have call successors, (11), 3 states have call predecessors, (11), 13 states have return successors, (16), 16 states have call predecessors, (16), 7 states have call successors, (16) [2025-03-04 10:33:54,480 INFO L276 IsEmpty]: Start isEmpty. Operand 18407 states and 23363 transitions. [2025-03-04 10:33:54,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-04 10:33:54,493 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:54,493 INFO L218 NwaCegarLoop]: trace histogram [18, 16, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:54,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-03-04 10:33:54,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:54,693 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ackermannErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:33:54,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:54,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1870843355, now seen corresponding path program 5 times [2025-03-04 10:33:54,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:54,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82819510] [2025-03-04 10:33:54,694 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:33:54,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:54,699 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 167 statements into 13 equivalence classes. [2025-03-04 10:33:54,715 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) and asserted 167 of 167 statements. [2025-03-04 10:33:54,715 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2025-03-04 10:33:54,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:55,348 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 134 proven. 297 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2025-03-04 10:33:55,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:55,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82819510] [2025-03-04 10:33:55,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82819510] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:55,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674826415] [2025-03-04 10:33:55,349 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:33:55,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:55,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:55,350 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:33:55,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-04 10:33:55,422 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 167 statements into 13 equivalence classes. [2025-03-04 10:33:55,458 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) and asserted 167 of 167 statements. [2025-03-04 10:33:55,459 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2025-03-04 10:33:55,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:55,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-04 10:33:55,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:55,544 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 98 proven. 285 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2025-03-04 10:33:55,544 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:34:03,106 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 114 proven. 409 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2025-03-04 10:34:03,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674826415] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:34:03,106 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:34:03,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 43] total 72 [2025-03-04 10:34:03,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341669865] [2025-03-04 10:34:03,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:34:03,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2025-03-04 10:34:03,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:34:03,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2025-03-04 10:34:03,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=610, Invalid=4646, Unknown=0, NotChecked=0, Total=5256 [2025-03-04 10:34:03,108 INFO L87 Difference]: Start difference. First operand 18407 states and 23363 transitions. Second operand has 73 states, 72 states have (on average 1.6527777777777777) internal successors, (119), 55 states have internal predecessors, (119), 17 states have call successors, (19), 3 states have call predecessors, (19), 25 states have return successors, (32), 32 states have call predecessors, (32), 15 states have call successors, (32)