./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label29.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem03_label29.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 372b0f8557f493ed9d29c5f8057b8dc54ad330866696fd4878e863a88379edbf --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:56:20,406 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:56:20,476 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 22:56:20,486 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:56:20,486 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:56:20,513 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:56:20,514 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:56:20,514 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:56:20,514 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:56:20,515 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:56:20,515 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:56:20,515 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:56:20,516 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:56:20,516 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:56:20,516 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:56:20,517 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:56:20,517 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:56:20,517 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:56:20,517 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 22:56:20,517 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:56:20,517 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:56:20,518 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:56:20,518 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:56:20,518 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:56:20,518 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:56:20,518 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:56:20,518 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:56:20,518 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:56:20,518 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:56:20,519 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:56:20,519 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:56:20,519 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:56:20,519 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:56:20,519 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:56:20,519 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:56:20,519 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:56:20,519 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:56:20,519 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:56:20,519 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:56:20,519 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:56:20,519 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:56:20,519 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:56:20,519 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 22:56:20,519 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 22:56:20,520 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:56:20,520 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:56:20,520 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:56:20,520 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:56:20,520 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-jdk21/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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 372b0f8557f493ed9d29c5f8057b8dc54ad330866696fd4878e863a88379edbf [2025-01-08 22:56:20,819 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:56:20,826 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:56:20,829 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:56:20,830 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:56:20,831 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:56:20,832 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label29.c [2025-01-08 22:56:22,184 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/41ae85b09/aea5887b1229448094871cc010f35558/FLAGc2bbf125b [2025-01-08 22:56:22,557 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:56:22,558 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label29.c [2025-01-08 22:56:22,577 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/41ae85b09/aea5887b1229448094871cc010f35558/FLAGc2bbf125b [2025-01-08 22:56:22,592 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/41ae85b09/aea5887b1229448094871cc010f35558 [2025-01-08 22:56:22,594 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:56:22,595 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:56:22,597 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:56:22,597 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:56:22,601 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:56:22,602 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:56:22" (1/1) ... [2025-01-08 22:56:22,603 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6832c9c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:56:22, skipping insertion in model container [2025-01-08 22:56:22,603 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:56:22" (1/1) ... [2025-01-08 22:56:22,668 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:56:23,155 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label29.c[58258,58271] [2025-01-08 22:56:23,193 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:56:23,203 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:56:23,385 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label29.c[58258,58271] [2025-01-08 22:56:23,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:56:23,417 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:56:23,419 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:56:23 WrapperNode [2025-01-08 22:56:23,420 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:56:23,421 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:56:23,421 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:56:23,421 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:56:23,427 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:56:23" (1/1) ... [2025-01-08 22:56:23,464 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:56:23" (1/1) ... [2025-01-08 22:56:23,582 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1769 [2025-01-08 22:56:23,583 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:56:23,584 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:56:23,584 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:56:23,584 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:56:23,592 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:56:23" (1/1) ... [2025-01-08 22:56:23,593 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:56:23" (1/1) ... [2025-01-08 22:56:23,617 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:56:23" (1/1) ... [2025-01-08 22:56:23,657 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-01-08 22:56:23,661 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:56:23" (1/1) ... [2025-01-08 22:56:23,661 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:56:23" (1/1) ... [2025-01-08 22:56:23,698 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:56:23" (1/1) ... [2025-01-08 22:56:23,702 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:56:23" (1/1) ... [2025-01-08 22:56:23,710 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:56:23" (1/1) ... [2025-01-08 22:56:23,718 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:56:23" (1/1) ... [2025-01-08 22:56:23,726 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:56:23" (1/1) ... [2025-01-08 22:56:23,741 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:56:23,742 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:56:23,742 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:56:23,742 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:56:23,744 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:56:23" (1/1) ... [2025-01-08 22:56:23,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:56:23,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:56:23,773 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-08 22:56:23,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-08 22:56:23,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:56:23,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 22:56:23,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:56:23,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:56:23,871 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:56:23,873 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:56:25,768 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2025-01-08 22:56:25,768 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:56:25,787 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:56:25,790 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 22:56:25,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:56:25 BoogieIcfgContainer [2025-01-08 22:56:25,791 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:56:25,793 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:56:25,793 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:56:25,797 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:56:25,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:56:22" (1/3) ... [2025-01-08 22:56:25,798 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a4909d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:56:25, skipping insertion in model container [2025-01-08 22:56:25,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:56:23" (2/3) ... [2025-01-08 22:56:25,799 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a4909d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:56:25, skipping insertion in model container [2025-01-08 22:56:25,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:56:25" (3/3) ... [2025-01-08 22:56:25,801 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem03_label29.c [2025-01-08 22:56:25,815 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:56:25,818 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem03_label29.c that has 1 procedures, 302 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 22:56:25,889 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:56:25,902 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;@37e8a891, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:56:25,903 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:56:25,910 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:56:25,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-01-08 22:56:25,926 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:56:25,927 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:56:25,927 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:56:25,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:56:25,934 INFO L85 PathProgramCache]: Analyzing trace with hash 2099146410, now seen corresponding path program 1 times [2025-01-08 22:56:25,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:56:25,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627479639] [2025-01-08 22:56:25,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:56:25,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:56:26,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-08 22:56:26,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-08 22:56:26,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:56:26,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:26,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:56:26,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:56:26,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627479639] [2025-01-08 22:56:26,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627479639] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:56:26,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:56:26,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:56:26,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155134441] [2025-01-08 22:56:26,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:56:26,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:56:26,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:56:26,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:56:26,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:56:26,977 INFO L87 Difference]: Start difference. First operand has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:56:28,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:56:28,074 INFO L93 Difference]: Finished difference Result 864 states and 1511 transitions. [2025-01-08 22:56:28,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:56:28,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 178 [2025-01-08 22:56:28,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:56:28,087 INFO L225 Difference]: With dead ends: 864 [2025-01-08 22:56:28,087 INFO L226 Difference]: Without dead ends: 468 [2025-01-08 22:56:28,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:56:28,093 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 100 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:56:28,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 165 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-08 22:56:28,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-01-08 22:56:28,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 454. [2025-01-08 22:56:28,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 453 states have (on average 1.6269315673289184) internal successors, (737), 453 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:56:28,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 737 transitions. [2025-01-08 22:56:28,150 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 737 transitions. Word has length 178 [2025-01-08 22:56:28,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:56:28,151 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 737 transitions. [2025-01-08 22:56:28,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:56:28,152 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 737 transitions. [2025-01-08 22:56:28,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-01-08 22:56:28,155 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:56:28,155 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:56:28,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 22:56:28,156 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:56:28,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:56:28,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1212341579, now seen corresponding path program 1 times [2025-01-08 22:56:28,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:56:28,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024235113] [2025-01-08 22:56:28,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:56:28,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:56:28,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-08 22:56:28,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-08 22:56:28,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:56:28,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:28,471 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:56:28,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:56:28,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024235113] [2025-01-08 22:56:28,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024235113] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:56:28,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:56:28,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:56:28,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226061535] [2025-01-08 22:56:28,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:56:28,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:56:28,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:56:28,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:56:28,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:56:28,476 INFO L87 Difference]: Start difference. First operand 454 states and 737 transitions. Second operand has 3 states, 3 states have (on average 61.0) internal successors, (183), 2 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:56:28,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:56:28,765 INFO L93 Difference]: Finished difference Result 1354 states and 2203 transitions. [2025-01-08 22:56:28,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:56:28,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 2 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 183 [2025-01-08 22:56:28,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:56:28,775 INFO L225 Difference]: With dead ends: 1354 [2025-01-08 22:56:28,776 INFO L226 Difference]: Without dead ends: 902 [2025-01-08 22:56:28,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:56:28,779 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 366 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:56:28,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 601 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:56:28,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2025-01-08 22:56:28,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 899. [2025-01-08 22:56:28,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 899 states, 898 states have (on average 1.6291759465478841) internal successors, (1463), 898 states have internal predecessors, (1463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:56:28,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1463 transitions. [2025-01-08 22:56:28,845 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1463 transitions. Word has length 183 [2025-01-08 22:56:28,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:56:28,845 INFO L471 AbstractCegarLoop]: Abstraction has 899 states and 1463 transitions. [2025-01-08 22:56:28,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 2 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:56:28,845 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1463 transitions. [2025-01-08 22:56:28,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-01-08 22:56:28,851 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:56:28,852 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:56:28,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 22:56:28,853 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:56:28,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:56:28,857 INFO L85 PathProgramCache]: Analyzing trace with hash 358794070, now seen corresponding path program 1 times [2025-01-08 22:56:28,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:56:28,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911897172] [2025-01-08 22:56:28,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:56:28,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:56:28,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-01-08 22:56:28,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-01-08 22:56:28,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:56:28,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:29,082 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:56:29,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:56:29,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911897172] [2025-01-08 22:56:29,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911897172] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:56:29,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:56:29,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:56:29,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102002145] [2025-01-08 22:56:29,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:56:29,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:56:29,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:56:29,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:56:29,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:56:29,085 INFO L87 Difference]: Start difference. First operand 899 states and 1463 transitions. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 2 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:56:29,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:56:29,934 INFO L93 Difference]: Finished difference Result 2640 states and 4313 transitions. [2025-01-08 22:56:29,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:56:29,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 2 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2025-01-08 22:56:29,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:56:29,943 INFO L225 Difference]: With dead ends: 2640 [2025-01-08 22:56:29,944 INFO L226 Difference]: Without dead ends: 1743 [2025-01-08 22:56:29,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:56:29,949 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 260 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 22:56:29,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 142 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 22:56:29,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1743 states. [2025-01-08 22:56:29,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1743 to 1739. [2025-01-08 22:56:29,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1739 states, 1738 states have (on average 1.5391254315304947) internal successors, (2675), 1738 states have internal predecessors, (2675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:56:30,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 2675 transitions. [2025-01-08 22:56:30,004 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 2675 transitions. Word has length 184 [2025-01-08 22:56:30,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:56:30,004 INFO L471 AbstractCegarLoop]: Abstraction has 1739 states and 2675 transitions. [2025-01-08 22:56:30,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 2 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:56:30,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2675 transitions. [2025-01-08 22:56:30,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-01-08 22:56:30,011 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:56:30,012 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:56:30,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 22:56:30,013 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:56:30,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:56:30,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1063414793, now seen corresponding path program 1 times [2025-01-08 22:56:30,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:56:30,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71928849] [2025-01-08 22:56:30,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:56:30,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:56:30,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-01-08 22:56:30,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-01-08 22:56:30,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:56:30,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:30,196 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:56:30,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:56:30,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71928849] [2025-01-08 22:56:30,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71928849] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:56:30,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:56:30,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:56:30,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051414453] [2025-01-08 22:56:30,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:56:30,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:56:30,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:56:30,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:56:30,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:56:30,199 INFO L87 Difference]: Start difference. First operand 1739 states and 2675 transitions. Second operand has 3 states, 3 states have (on average 62.0) internal successors, (186), 2 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:56:31,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:56:31,063 INFO L93 Difference]: Finished difference Result 5141 states and 7941 transitions. [2025-01-08 22:56:31,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:56:31,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 2 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 186 [2025-01-08 22:56:31,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:56:31,075 INFO L225 Difference]: With dead ends: 5141 [2025-01-08 22:56:31,076 INFO L226 Difference]: Without dead ends: 3404 [2025-01-08 22:56:31,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:56:31,078 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 236 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 22:56:31,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 155 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 22:56:31,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3404 states. [2025-01-08 22:56:31,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3404 to 3368. [2025-01-08 22:56:31,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3368 states, 3367 states have (on average 1.5105435105435105) internal successors, (5086), 3367 states have internal predecessors, (5086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:56:31,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3368 states to 3368 states and 5086 transitions. [2025-01-08 22:56:31,142 INFO L78 Accepts]: Start accepts. Automaton has 3368 states and 5086 transitions. Word has length 186 [2025-01-08 22:56:31,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:56:31,142 INFO L471 AbstractCegarLoop]: Abstraction has 3368 states and 5086 transitions. [2025-01-08 22:56:31,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 2 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:56:31,143 INFO L276 IsEmpty]: Start isEmpty. Operand 3368 states and 5086 transitions. [2025-01-08 22:56:31,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-01-08 22:56:31,148 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:56:31,148 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:56:31,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 22:56:31,148 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:56:31,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:56:31,149 INFO L85 PathProgramCache]: Analyzing trace with hash 549812378, now seen corresponding path program 1 times [2025-01-08 22:56:31,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:56:31,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700954801] [2025-01-08 22:56:31,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:56:31,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:56:31,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-01-08 22:56:31,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-01-08 22:56:31,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:56:31,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:31,362 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:56:31,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:56:31,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700954801] [2025-01-08 22:56:31,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700954801] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:56:31,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:56:31,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:56:31,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937866853] [2025-01-08 22:56:31,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:56:31,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:56:31,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:56:31,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:56:31,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:56:31,365 INFO L87 Difference]: Start difference. First operand 3368 states and 5086 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:56:32,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:56:32,171 INFO L93 Difference]: Finished difference Result 10012 states and 15140 transitions. [2025-01-08 22:56:32,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:56:32,172 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 192 [2025-01-08 22:56:32,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:56:32,197 INFO L225 Difference]: With dead ends: 10012 [2025-01-08 22:56:32,197 INFO L226 Difference]: Without dead ends: 6646 [2025-01-08 22:56:32,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:56:32,204 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 242 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 22:56:32,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 180 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 22:56:32,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6646 states. [2025-01-08 22:56:32,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6646 to 6638. [2025-01-08 22:56:32,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6638 states, 6637 states have (on average 1.4266988097031792) internal successors, (9469), 6637 states have internal predecessors, (9469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:56:32,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6638 states to 6638 states and 9469 transitions. [2025-01-08 22:56:32,369 INFO L78 Accepts]: Start accepts. Automaton has 6638 states and 9469 transitions. Word has length 192 [2025-01-08 22:56:32,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:56:32,370 INFO L471 AbstractCegarLoop]: Abstraction has 6638 states and 9469 transitions. [2025-01-08 22:56:32,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:56:32,370 INFO L276 IsEmpty]: Start isEmpty. Operand 6638 states and 9469 transitions. [2025-01-08 22:56:32,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-01-08 22:56:32,382 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:56:32,382 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:56:32,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 22:56:32,382 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:56:32,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:56:32,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1776624906, now seen corresponding path program 1 times [2025-01-08 22:56:32,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:56:32,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944097927] [2025-01-08 22:56:32,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:56:32,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:56:32,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-08 22:56:32,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-08 22:56:32,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:56:32,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:32,861 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-08 22:56:32,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:56:32,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944097927] [2025-01-08 22:56:32,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944097927] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:56:32,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:56:32,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:56:32,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643958693] [2025-01-08 22:56:32,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:56:32,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:56:32,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:56:32,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:56:32,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:56:32,864 INFO L87 Difference]: Start difference. First operand 6638 states and 9469 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:56:33,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:56:33,790 INFO L93 Difference]: Finished difference Result 16368 states and 23302 transitions. [2025-01-08 22:56:33,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:56:33,790 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 195 [2025-01-08 22:56:33,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:56:33,829 INFO L225 Difference]: With dead ends: 16368 [2025-01-08 22:56:33,829 INFO L226 Difference]: Without dead ends: 9732 [2025-01-08 22:56:33,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:56:33,839 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 226 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 22:56:33,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 191 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 22:56:33,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9732 states. [2025-01-08 22:56:34,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9732 to 9708. [2025-01-08 22:56:34,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9708 states, 9707 states have (on average 1.4125888534047595) internal successors, (13712), 9707 states have internal predecessors, (13712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:56:34,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9708 states to 9708 states and 13712 transitions. [2025-01-08 22:56:34,061 INFO L78 Accepts]: Start accepts. Automaton has 9708 states and 13712 transitions. Word has length 195 [2025-01-08 22:56:34,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:56:34,061 INFO L471 AbstractCegarLoop]: Abstraction has 9708 states and 13712 transitions. [2025-01-08 22:56:34,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:56:34,061 INFO L276 IsEmpty]: Start isEmpty. Operand 9708 states and 13712 transitions. [2025-01-08 22:56:34,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-01-08 22:56:34,076 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:56:34,076 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:56:34,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 22:56:34,077 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:56:34,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:56:34,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1651736078, now seen corresponding path program 1 times [2025-01-08 22:56:34,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:56:34,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796136112] [2025-01-08 22:56:34,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:56:34,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:56:34,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-01-08 22:56:34,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-01-08 22:56:34,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:56:34,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:34,350 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:56:34,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:56:34,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796136112] [2025-01-08 22:56:34,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796136112] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:56:34,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:56:34,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:56:34,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623624129] [2025-01-08 22:56:34,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:56:34,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:56:34,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:56:34,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:56:34,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:56:34,352 INFO L87 Difference]: Start difference. First operand 9708 states and 13712 transitions. Second operand has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 2 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:56:35,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:56:35,275 INFO L93 Difference]: Finished difference Result 27737 states and 39271 transitions. [2025-01-08 22:56:35,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:56:35,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 2 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 197 [2025-01-08 22:56:35,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:56:35,342 INFO L225 Difference]: With dead ends: 27737 [2025-01-08 22:56:35,342 INFO L226 Difference]: Without dead ends: 18234 [2025-01-08 22:56:35,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:56:35,359 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 201 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 22:56:35,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 201 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 22:56:35,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18234 states. [2025-01-08 22:56:35,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18234 to 18234. [2025-01-08 22:56:35,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18234 states, 18233 states have (on average 1.2737344375582735) internal successors, (23224), 18233 states have internal predecessors, (23224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:56:35,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18234 states to 18234 states and 23224 transitions. [2025-01-08 22:56:35,767 INFO L78 Accepts]: Start accepts. Automaton has 18234 states and 23224 transitions. Word has length 197 [2025-01-08 22:56:35,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:56:35,767 INFO L471 AbstractCegarLoop]: Abstraction has 18234 states and 23224 transitions. [2025-01-08 22:56:35,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 2 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:56:35,768 INFO L276 IsEmpty]: Start isEmpty. Operand 18234 states and 23224 transitions. [2025-01-08 22:56:35,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-01-08 22:56:35,795 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:56:35,795 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:56:35,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 22:56:35,796 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:56:35,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:56:35,796 INFO L85 PathProgramCache]: Analyzing trace with hash 269843711, now seen corresponding path program 1 times [2025-01-08 22:56:35,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:56:35,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838680328] [2025-01-08 22:56:35,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:56:35,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:56:35,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-01-08 22:56:35,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-01-08 22:56:35,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:56:35,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:35,994 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:56:35,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:56:35,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838680328] [2025-01-08 22:56:35,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838680328] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:56:35,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:56:35,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:56:35,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460593738] [2025-01-08 22:56:35,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:56:35,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:56:35,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:56:35,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:56:35,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:56:35,998 INFO L87 Difference]: Start difference. First operand 18234 states and 23224 transitions. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:56:36,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:56:36,475 INFO L93 Difference]: Finished difference Result 54236 states and 69150 transitions. [2025-01-08 22:56:36,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:56:36,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 207 [2025-01-08 22:56:36,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:56:36,561 INFO L225 Difference]: With dead ends: 54236 [2025-01-08 22:56:36,561 INFO L226 Difference]: Without dead ends: 36207 [2025-01-08 22:56:36,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:56:36,593 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 353 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:56:36,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 546 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:56:36,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36207 states. [2025-01-08 22:56:37,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36207 to 36205. [2025-01-08 22:56:37,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36205 states, 36204 states have (on average 1.27333996243509) internal successors, (46100), 36204 states have internal predecessors, (46100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:56:37,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36205 states to 36205 states and 46100 transitions. [2025-01-08 22:56:37,371 INFO L78 Accepts]: Start accepts. Automaton has 36205 states and 46100 transitions. Word has length 207 [2025-01-08 22:56:37,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:56:37,371 INFO L471 AbstractCegarLoop]: Abstraction has 36205 states and 46100 transitions. [2025-01-08 22:56:37,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:56:37,371 INFO L276 IsEmpty]: Start isEmpty. Operand 36205 states and 46100 transitions. [2025-01-08 22:56:37,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-01-08 22:56:37,420 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:56:37,420 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:56:37,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 22:56:37,421 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:56:37,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:56:37,421 INFO L85 PathProgramCache]: Analyzing trace with hash 858040462, now seen corresponding path program 1 times [2025-01-08 22:56:37,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:56:37,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319686090] [2025-01-08 22:56:37,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:56:37,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:56:37,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-01-08 22:56:37,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-01-08 22:56:37,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:56:37,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:37,912 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 37 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:56:37,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:56:37,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319686090] [2025-01-08 22:56:37,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319686090] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:56:37,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878760737] [2025-01-08 22:56:37,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:56:37,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:56:37,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:56:37,915 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:56:37,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-08 22:56:38,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-01-08 22:56:38,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-01-08 22:56:38,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:56:38,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:38,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 22:56:38,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:56:38,392 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:56:38,393 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:56:38,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878760737] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:56:38,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:56:38,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-01-08 22:56:38,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541789363] [2025-01-08 22:56:38,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:56:38,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:56:38,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:56:38,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:56:38,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:56:38,396 INFO L87 Difference]: Start difference. First operand 36205 states and 46100 transitions. Second operand has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:56:39,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:56:39,458 INFO L93 Difference]: Finished difference Result 72193 states and 91955 transitions. [2025-01-08 22:56:39,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:56:39,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 216 [2025-01-08 22:56:39,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:56:39,542 INFO L225 Difference]: With dead ends: 72193 [2025-01-08 22:56:39,542 INFO L226 Difference]: Without dead ends: 36193 [2025-01-08 22:56:39,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:56:39,587 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 100 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 22:56:39,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 348 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 22:56:39,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36193 states. [2025-01-08 22:56:39,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36193 to 30497. [2025-01-08 22:56:40,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30497 states, 30496 states have (on average 1.2153725078698845) internal successors, (37064), 30496 states have internal predecessors, (37064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:56:40,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30497 states to 30497 states and 37064 transitions. [2025-01-08 22:56:40,082 INFO L78 Accepts]: Start accepts. Automaton has 30497 states and 37064 transitions. Word has length 216 [2025-01-08 22:56:40,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:56:40,084 INFO L471 AbstractCegarLoop]: Abstraction has 30497 states and 37064 transitions. [2025-01-08 22:56:40,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:56:40,084 INFO L276 IsEmpty]: Start isEmpty. Operand 30497 states and 37064 transitions. [2025-01-08 22:56:40,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-01-08 22:56:40,128 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:56:40,129 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:56:40,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-08 22:56:40,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:56:40,330 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:56:40,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:56:40,331 INFO L85 PathProgramCache]: Analyzing trace with hash 2029025635, now seen corresponding path program 1 times [2025-01-08 22:56:40,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:56:40,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378466887] [2025-01-08 22:56:40,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:56:40,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:56:40,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-01-08 22:56:40,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-01-08 22:56:40,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:56:40,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:40,676 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-08 22:56:40,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:56:40,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378466887] [2025-01-08 22:56:40,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378466887] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:56:40,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:56:40,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:56:40,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160878562] [2025-01-08 22:56:40,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:56:40,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:56:40,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:56:40,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:56:40,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:56:40,677 INFO L87 Difference]: Start difference. First operand 30497 states and 37064 transitions. Second operand has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:56:41,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:56:41,726 INFO L93 Difference]: Finished difference Result 73841 states and 90461 transitions. [2025-01-08 22:56:41,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:56:41,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 227 [2025-01-08 22:56:41,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:56:41,825 INFO L225 Difference]: With dead ends: 73841 [2025-01-08 22:56:41,826 INFO L226 Difference]: Without dead ends: 43549 [2025-01-08 22:56:41,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:56:41,856 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 202 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 22:56:41,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 371 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 22:56:41,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43549 states. [2025-01-08 22:56:42,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43549 to 43529. [2025-01-08 22:56:42,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43529 states, 43528 states have (on average 1.1970685535747105) internal successors, (52106), 43528 states have internal predecessors, (52106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:56:42,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43529 states to 43529 states and 52106 transitions. [2025-01-08 22:56:42,603 INFO L78 Accepts]: Start accepts. Automaton has 43529 states and 52106 transitions. Word has length 227 [2025-01-08 22:56:42,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:56:42,603 INFO L471 AbstractCegarLoop]: Abstraction has 43529 states and 52106 transitions. [2025-01-08 22:56:42,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:56:42,603 INFO L276 IsEmpty]: Start isEmpty. Operand 43529 states and 52106 transitions. [2025-01-08 22:56:42,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-01-08 22:56:42,642 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:56:42,643 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:56:42,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-08 22:56:42,644 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:56:42,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:56:42,645 INFO L85 PathProgramCache]: Analyzing trace with hash -377324622, now seen corresponding path program 1 times [2025-01-08 22:56:42,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:56:42,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003979579] [2025-01-08 22:56:42,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:56:42,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:56:42,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-01-08 22:56:42,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-01-08 22:56:42,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:56:42,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:43,075 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:56:43,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:56:43,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003979579] [2025-01-08 22:56:43,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003979579] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:56:43,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:56:43,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:56:43,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893623478] [2025-01-08 22:56:43,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:56:43,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:56:43,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:56:43,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:56:43,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:56:43,080 INFO L87 Difference]: Start difference. First operand 43529 states and 52106 transitions. Second operand has 4 states, 4 states have (on average 65.25) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:56:44,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:56:44,216 INFO L93 Difference]: Finished difference Result 83465 states and 99961 transitions. [2025-01-08 22:56:44,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:56:44,217 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 65.25) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 266 [2025-01-08 22:56:44,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:56:44,300 INFO L225 Difference]: With dead ends: 83465 [2025-01-08 22:56:44,300 INFO L226 Difference]: Without dead ends: 40141 [2025-01-08 22:56:44,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:56:44,339 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 535 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 22:56:44,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 53 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 22:56:44,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40141 states. [2025-01-08 22:56:44,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40141 to 40141. [2025-01-08 22:56:44,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40141 states, 40140 states have (on average 1.173916292974589) internal successors, (47121), 40140 states have internal predecessors, (47121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:56:45,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40141 states to 40141 states and 47121 transitions. [2025-01-08 22:56:45,068 INFO L78 Accepts]: Start accepts. Automaton has 40141 states and 47121 transitions. Word has length 266 [2025-01-08 22:56:45,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:56:45,068 INFO L471 AbstractCegarLoop]: Abstraction has 40141 states and 47121 transitions. [2025-01-08 22:56:45,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.25) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:56:45,069 INFO L276 IsEmpty]: Start isEmpty. Operand 40141 states and 47121 transitions. [2025-01-08 22:56:45,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2025-01-08 22:56:45,116 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:56:45,116 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:56:45,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-08 22:56:45,117 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:56:45,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:56:45,117 INFO L85 PathProgramCache]: Analyzing trace with hash 946017024, now seen corresponding path program 1 times [2025-01-08 22:56:45,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:56:45,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115465904] [2025-01-08 22:56:45,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:56:45,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:56:45,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 290 statements into 1 equivalence classes. [2025-01-08 22:56:45,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 290 of 290 statements. [2025-01-08 22:56:45,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:56:45,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:45,561 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:56:45,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:56:45,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115465904] [2025-01-08 22:56:45,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115465904] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:56:45,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:56:45,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:56:45,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054938929] [2025-01-08 22:56:45,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:56:45,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:56:45,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:56:45,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:56:45,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:56:45,563 INFO L87 Difference]: Start difference. First operand 40141 states and 47121 transitions. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:56:46,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:56:46,408 INFO L93 Difference]: Finished difference Result 91092 states and 106857 transitions. [2025-01-08 22:56:46,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:56:46,408 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 290 [2025-01-08 22:56:46,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:56:46,498 INFO L225 Difference]: With dead ends: 91092 [2025-01-08 22:56:46,498 INFO L226 Difference]: Without dead ends: 51156 [2025-01-08 22:56:46,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:56:46,536 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 124 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:56:46,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 327 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:56:46,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51156 states. [2025-01-08 22:56:47,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51156 to 51103. [2025-01-08 22:56:47,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51103 states, 51102 states have (on average 1.1490744002191695) internal successors, (58720), 51102 states have internal predecessors, (58720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:56:47,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51103 states to 51103 states and 58720 transitions. [2025-01-08 22:56:47,161 INFO L78 Accepts]: Start accepts. Automaton has 51103 states and 58720 transitions. Word has length 290 [2025-01-08 22:56:47,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:56:47,161 INFO L471 AbstractCegarLoop]: Abstraction has 51103 states and 58720 transitions. [2025-01-08 22:56:47,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:56:47,162 INFO L276 IsEmpty]: Start isEmpty. Operand 51103 states and 58720 transitions. [2025-01-08 22:56:47,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2025-01-08 22:56:47,200 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:56:47,200 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:56:47,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-08 22:56:47,201 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:56:47,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:56:47,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1289168363, now seen corresponding path program 1 times [2025-01-08 22:56:47,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:56:47,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689009696] [2025-01-08 22:56:47,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:56:47,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:56:47,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-01-08 22:56:47,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-01-08 22:56:47,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:56:47,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:47,452 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-01-08 22:56:47,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:56:47,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689009696] [2025-01-08 22:56:47,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689009696] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:56:47,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:56:47,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:56:47,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185914770] [2025-01-08 22:56:47,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:56:47,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:56:47,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:56:47,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:56:47,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:56:47,455 INFO L87 Difference]: Start difference. First operand 51103 states and 58720 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 2 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:56:48,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:56:48,529 INFO L93 Difference]: Finished difference Result 125838 states and 144273 transitions. [2025-01-08 22:56:48,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:56:48,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 2 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 294 [2025-01-08 22:56:48,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:56:48,615 INFO L225 Difference]: With dead ends: 125838 [2025-01-08 22:56:48,616 INFO L226 Difference]: Without dead ends: 74940 [2025-01-08 22:56:48,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:56:48,664 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 203 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 22:56:48,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 123 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 22:56:48,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74940 states. [2025-01-08 22:56:49,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74940 to 74936. [2025-01-08 22:56:49,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74936 states, 74935 states have (on average 1.142763728564756) internal successors, (85633), 74935 states have internal predecessors, (85633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:56:49,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74936 states to 74936 states and 85633 transitions. [2025-01-08 22:56:49,406 INFO L78 Accepts]: Start accepts. Automaton has 74936 states and 85633 transitions. Word has length 294 [2025-01-08 22:56:49,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:56:49,406 INFO L471 AbstractCegarLoop]: Abstraction has 74936 states and 85633 transitions. [2025-01-08 22:56:49,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 2 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:56:49,406 INFO L276 IsEmpty]: Start isEmpty. Operand 74936 states and 85633 transitions. [2025-01-08 22:56:49,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2025-01-08 22:56:49,444 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:56:49,444 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:56:49,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-08 22:56:49,444 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:56:49,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:56:49,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1640059057, now seen corresponding path program 1 times [2025-01-08 22:56:49,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:56:49,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084857072] [2025-01-08 22:56:49,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:56:49,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:56:49,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-01-08 22:56:49,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-01-08 22:56:49,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:56:49,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:49,893 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 89 proven. 6 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-01-08 22:56:49,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:56:49,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084857072] [2025-01-08 22:56:49,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084857072] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:56:49,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474643679] [2025-01-08 22:56:49,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:56:49,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:56:49,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:56:49,896 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:56:49,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-08 22:56:49,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-01-08 22:56:50,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-01-08 22:56:50,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:56:50,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:50,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 22:56:50,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:56:50,104 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2025-01-08 22:56:50,109 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:56:50,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474643679] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:56:50,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:56:50,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-01-08 22:56:50,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105858995] [2025-01-08 22:56:50,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:56:50,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:56:50,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:56:50,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:56:50,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:56:50,110 INFO L87 Difference]: Start difference. First operand 74936 states and 85633 transitions. Second operand has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:56:50,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:56:50,987 INFO L93 Difference]: Finished difference Result 172806 states and 199294 transitions. [2025-01-08 22:56:50,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:56:50,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 301 [2025-01-08 22:56:50,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:56:51,080 INFO L225 Difference]: With dead ends: 172806 [2025-01-08 22:56:51,080 INFO L226 Difference]: Without dead ends: 90767 [2025-01-08 22:56:51,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:56:51,140 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 203 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:56:51,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 366 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:56:51,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90767 states. [2025-01-08 22:56:52,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90767 to 77751. [2025-01-08 22:56:52,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77751 states, 77750 states have (on average 1.0817234726688103) internal successors, (84104), 77750 states have internal predecessors, (84104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:56:52,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77751 states to 77751 states and 84104 transitions. [2025-01-08 22:56:52,573 INFO L78 Accepts]: Start accepts. Automaton has 77751 states and 84104 transitions. Word has length 301 [2025-01-08 22:56:52,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:56:52,573 INFO L471 AbstractCegarLoop]: Abstraction has 77751 states and 84104 transitions. [2025-01-08 22:56:52,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:56:52,573 INFO L276 IsEmpty]: Start isEmpty. Operand 77751 states and 84104 transitions. [2025-01-08 22:56:52,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2025-01-08 22:56:52,607 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:56:52,607 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:56:52,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-08 22:56:52,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:56:52,809 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:56:52,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:56:52,810 INFO L85 PathProgramCache]: Analyzing trace with hash -736014897, now seen corresponding path program 1 times [2025-01-08 22:56:52,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:56:52,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060064320] [2025-01-08 22:56:52,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:56:52,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:56:52,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-01-08 22:56:52,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-01-08 22:56:52,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:56:52,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:53,199 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-01-08 22:56:53,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:56:53,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060064320] [2025-01-08 22:56:53,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060064320] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:56:53,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:56:53,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:56:53,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192010995] [2025-01-08 22:56:53,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:56:53,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:56:53,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:56:53,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:56:53,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:56:53,202 INFO L87 Difference]: Start difference. First operand 77751 states and 84104 transitions. Second operand has 4 states, 4 states have (on average 66.5) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:56:54,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:56:54,448 INFO L93 Difference]: Finished difference Result 156785 states and 169614 transitions. [2025-01-08 22:56:54,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:56:54,449 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 66.5) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 336 [2025-01-08 22:56:54,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:56:54,537 INFO L225 Difference]: With dead ends: 156785 [2025-01-08 22:56:54,537 INFO L226 Difference]: Without dead ends: 78224 [2025-01-08 22:56:54,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:56:54,591 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 352 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 1051 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 1174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 22:56:54,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 86 Invalid, 1174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1051 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 22:56:54,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78224 states. [2025-01-08 22:56:55,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78224 to 74503. [2025-01-08 22:56:55,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74503 states, 74502 states have (on average 1.081340098252396) internal successors, (80562), 74502 states have internal predecessors, (80562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:56:55,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74503 states to 74503 states and 80562 transitions. [2025-01-08 22:56:55,388 INFO L78 Accepts]: Start accepts. Automaton has 74503 states and 80562 transitions. Word has length 336 [2025-01-08 22:56:55,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:56:55,388 INFO L471 AbstractCegarLoop]: Abstraction has 74503 states and 80562 transitions. [2025-01-08 22:56:55,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.5) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:56:55,388 INFO L276 IsEmpty]: Start isEmpty. Operand 74503 states and 80562 transitions. [2025-01-08 22:56:55,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2025-01-08 22:56:55,421 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:56:55,421 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:56:55,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-08 22:56:55,421 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:56:55,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:56:55,422 INFO L85 PathProgramCache]: Analyzing trace with hash 827498773, now seen corresponding path program 1 times [2025-01-08 22:56:55,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:56:55,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172794038] [2025-01-08 22:56:55,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:56:55,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:56:55,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-01-08 22:56:55,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-01-08 22:56:55,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:56:55,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:56,247 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 111 proven. 6 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2025-01-08 22:56:56,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:56:56,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172794038] [2025-01-08 22:56:56,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172794038] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:56:56,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680196343] [2025-01-08 22:56:56,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:56:56,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:56:56,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:56:56,251 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:56:56,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-08 22:56:56,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-01-08 22:56:56,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-01-08 22:56:56,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:56:56,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:56,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 22:56:56,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:56:56,598 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2025-01-08 22:56:56,598 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:56:56,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680196343] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:56:56,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:56:56,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-01-08 22:56:56,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874216414] [2025-01-08 22:56:56,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:56:56,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:56:56,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:56:56,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:56:56,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:56:56,600 INFO L87 Difference]: Start difference. First operand 74503 states and 80562 transitions. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:56:57,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:56:57,341 INFO L93 Difference]: Finished difference Result 139011 states and 150419 transitions. [2025-01-08 22:56:57,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:56:57,342 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 343 [2025-01-08 22:56:57,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:56:57,344 INFO L225 Difference]: With dead ends: 139011 [2025-01-08 22:56:57,344 INFO L226 Difference]: Without dead ends: 0 [2025-01-08 22:56:57,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:56:57,390 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 64 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:56:57,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 302 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:56:57,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-08 22:56:57,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-08 22:56:57,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:56:57,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-08 22:56:57,391 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 343 [2025-01-08 22:56:57,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:56:57,392 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-08 22:56:57,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:56:57,392 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-08 22:56:57,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-08 22:56:57,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-08 22:56:57,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-08 22:56:57,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:56:57,598 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:56:57,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-08 22:57:02,899 WARN L286 SmtUtils]: Spent 5.29s on a formula simplification. DAG size of input: 587 DAG size of output: 537 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-01-08 22:57:06,953 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-08 22:57:06,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 10:57:06 BoogieIcfgContainer [2025-01-08 22:57:06,973 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-08 22:57:06,974 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-08 22:57:06,974 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-08 22:57:06,974 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-08 22:57:06,974 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:56:25" (3/4) ... [2025-01-08 22:57:06,977 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-08 22:57:07,013 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-08 22:57:07,015 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-08 22:57:07,017 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-08 22:57:07,019 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-08 22:57:07,211 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-08 22:57:07,212 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-08 22:57:07,212 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-08 22:57:07,213 INFO L158 Benchmark]: Toolchain (without parser) took 44617.09ms. Allocated memory was 142.6MB in the beginning and 6.1GB in the end (delta: 6.0GB). Free memory was 109.5MB in the beginning and 2.9GB in the end (delta: -2.8GB). Peak memory consumption was 3.2GB. Max. memory is 16.1GB. [2025-01-08 22:57:07,213 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 22:57:07,214 INFO L158 Benchmark]: CACSL2BoogieTranslator took 823.78ms. Allocated memory is still 142.6MB. Free memory was 109.0MB in the beginning and 50.5MB in the end (delta: 58.5MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-01-08 22:57:07,214 INFO L158 Benchmark]: Boogie Procedure Inliner took 162.10ms. Allocated memory is still 142.6MB. Free memory was 50.5MB in the beginning and 99.4MB in the end (delta: -48.9MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. [2025-01-08 22:57:07,214 INFO L158 Benchmark]: Boogie Preprocessor took 157.38ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 87.5MB in the end (delta: 11.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-08 22:57:07,215 INFO L158 Benchmark]: RCFGBuilder took 2049.12ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 87.5MB in the beginning and 114.5MB in the end (delta: -27.0MB). Peak memory consumption was 59.1MB. Max. memory is 16.1GB. [2025-01-08 22:57:07,215 INFO L158 Benchmark]: TraceAbstraction took 41180.12ms. Allocated memory was 176.2MB in the beginning and 6.1GB in the end (delta: 6.0GB). Free memory was 114.5MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 3.1GB. Max. memory is 16.1GB. [2025-01-08 22:57:07,215 INFO L158 Benchmark]: Witness Printer took 238.28ms. Allocated memory is still 6.1GB. Free memory was 3.0GB in the beginning and 2.9GB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-08 22:57:07,216 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 823.78ms. Allocated memory is still 142.6MB. Free memory was 109.0MB in the beginning and 50.5MB in the end (delta: 58.5MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 162.10ms. Allocated memory is still 142.6MB. Free memory was 50.5MB in the beginning and 99.4MB in the end (delta: -48.9MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 157.38ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 87.5MB in the end (delta: 11.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * RCFGBuilder took 2049.12ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 87.5MB in the beginning and 114.5MB in the end (delta: -27.0MB). Peak memory consumption was 59.1MB. Max. memory is 16.1GB. * TraceAbstraction took 41180.12ms. Allocated memory was 176.2MB in the beginning and 6.1GB in the end (delta: 6.0GB). Free memory was 114.5MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 3.1GB. Max. memory is 16.1GB. * Witness Printer took 238.28ms. Allocated memory is still 6.1GB. Free memory was 3.0GB in the beginning and 2.9GB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1579]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 302 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 31.7s, OverallIterations: 16, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.4s, AutomataDifference: 15.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3767 SdHoareTripleChecker+Valid, 11.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3767 mSDsluCounter, 4157 SdHoareTripleChecker+Invalid, 9.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 873 mSDsCounter, 1689 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9329 IncrementalHoareTripleChecker+Invalid, 11018 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1689 mSolverCounterUnsat, 3284 mSDtfsCounter, 9329 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 897 GetRequests, 873 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77751occurred in iteration=14, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 22601 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 4655 NumberOfCodeBlocks, 4655 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 4636 ConstructedInterpolants, 0 QuantifiedInterpolants, 8368 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1606 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 19 InterpolantComputations, 16 PerfectInterpolantSequences, 1935/1953 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1668]: Loop Invariant Derived loop invariant: ((((((((((((((((((a5 == 1) && (a26 <= 0)) && (a11 == 1)) && (a6 <= 0)) || (((a5 == 1) && (a11 == 1)) && (a6 == 1))) || (((a5 == 1) && (a6 == 1)) && (a11 <= 0))) || ((((a5 == 1) && (a3 == 1)) && (a11 <= 0)) && (a6 <= 0))) || ((((a5 == 1) && (a11 == 1)) && (a27 == 1)) && (a6 <= 0))) || (((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a11 <= 0)) && (a6 <= 0))) || (((((a5 == 1) && (a11 == 1)) && (a3 == 1)) && (a4 == 1)) && (a6 <= 0))) || ((((((((a15 == 1) && (a26 == 1)) && (a5 == 1)) && (a12 == 1)) && (a3 == 1)) && (a6 == 1)) && (a4 == 1)) && (a27 == 1))) || (((((a5 == 1) && (a3 <= 0)) && (a26 <= 0)) && (a11 <= 0)) && (a6 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a3 == 1)) && (a4 == 1)) && (a27 == 1)) && (a6 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a3 <= 0)) && (a6 == 1)) && (a27 == 1))) || (((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a11 == 1)) && (a6 <= 0))) || (((((a5 == 1) && (a26 <= 0)) && (a11 <= 0)) && (a27 == 1)) && (a6 <= 0))) || ((((a5 == 1) && (a3 <= 0)) && (a11 == 1)) && (a6 <= 0))) || ((((((a15 == 1) && (a26 == 1)) && (a5 == 1)) && (a11 <= 0)) && (a27 == 1)) && (a6 <= 0))) RESULT: Ultimate proved your program to be correct! [2025-01-08 22:57:07,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE