./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label26.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/Problem12_label26.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 3e2e47b78067195f514cd980cc36561e3679a03106d39ad74c0665f1ff81079a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 23:46:21,675 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 23:46:21,744 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 23:46:21,751 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 23:46:21,751 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 23:46:21,779 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 23:46:21,780 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 23:46:21,780 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 23:46:21,781 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 23:46:21,781 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 23:46:21,782 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 23:46:21,782 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 23:46:21,782 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 23:46:21,782 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 23:46:21,782 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 23:46:21,783 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 23:46:21,783 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 23:46:21,783 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 23:46:21,783 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 23:46:21,783 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 23:46:21,783 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 23:46:21,783 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 23:46:21,784 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 23:46:21,784 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 23:46:21,784 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 23:46:21,784 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 23:46:21,784 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 23:46:21,784 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 23:46:21,784 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 23:46:21,784 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:46:21,784 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:46:21,785 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:46:21,785 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:46:21,785 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 23:46:21,785 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:46:21,785 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:46:21,786 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:46:21,786 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:46:21,786 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 23:46:21,786 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 23:46:21,786 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 23:46:21,786 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 23:46:21,786 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 23:46:21,786 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 23:46:21,786 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 23:46:21,786 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 23:46:21,786 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 23:46:21,786 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 23:46:21,786 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 -> 3e2e47b78067195f514cd980cc36561e3679a03106d39ad74c0665f1ff81079a [2025-01-08 23:46:22,065 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 23:46:22,075 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 23:46:22,078 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 23:46:22,078 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 23:46:22,079 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 23:46:22,080 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label26.c [2025-01-08 23:46:23,387 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/397aceaa7/6677e09a192349189c89132e3caede51/FLAGa8890cab8 [2025-01-08 23:46:23,942 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 23:46:23,943 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label26.c [2025-01-08 23:46:23,971 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/397aceaa7/6677e09a192349189c89132e3caede51/FLAGa8890cab8 [2025-01-08 23:46:23,990 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/397aceaa7/6677e09a192349189c89132e3caede51 [2025-01-08 23:46:23,992 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 23:46:23,994 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 23:46:23,995 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 23:46:23,996 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 23:46:23,999 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 23:46:24,000 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:46:23" (1/1) ... [2025-01-08 23:46:24,001 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@238aa771 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:46:24, skipping insertion in model container [2025-01-08 23:46:24,001 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:46:23" (1/1) ... [2025-01-08 23:46:24,091 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 23:46:24,305 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/Problem12_label26.c[5703,5716] [2025-01-08 23:46:24,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:46:24,891 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 23:46:24,911 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/Problem12_label26.c[5703,5716] [2025-01-08 23:46:25,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:46:25,230 INFO L204 MainTranslator]: Completed translation [2025-01-08 23:46:25,231 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:46:25 WrapperNode [2025-01-08 23:46:25,232 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 23:46:25,233 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 23:46:25,233 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 23:46:25,233 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 23:46:25,240 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:46:25" (1/1) ... [2025-01-08 23:46:25,290 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:46:25" (1/1) ... [2025-01-08 23:46:25,637 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4758 [2025-01-08 23:46:25,639 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 23:46:25,639 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 23:46:25,640 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 23:46:25,640 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 23:46:25,649 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:46:25" (1/1) ... [2025-01-08 23:46:25,650 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:46:25" (1/1) ... [2025-01-08 23:46:25,704 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:46:25" (1/1) ... [2025-01-08 23:46:25,879 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 23:46:25,880 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:46:25" (1/1) ... [2025-01-08 23:46:25,880 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:46:25" (1/1) ... [2025-01-08 23:46:25,994 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:46:25" (1/1) ... [2025-01-08 23:46:26,010 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:46:25" (1/1) ... [2025-01-08 23:46:26,042 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:46:25" (1/1) ... [2025-01-08 23:46:26,097 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:46:25" (1/1) ... [2025-01-08 23:46:26,119 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:46:25" (1/1) ... [2025-01-08 23:46:26,166 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 23:46:26,167 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 23:46:26,167 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 23:46:26,167 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 23:46:26,168 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:46:25" (1/1) ... [2025-01-08 23:46:26,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:46:26,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:46:26,197 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 23:46:26,200 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 23:46:26,221 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 23:46:26,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 23:46:26,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 23:46:26,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 23:46:26,285 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 23:46:26,287 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 23:46:30,569 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2025-01-08 23:46:30,569 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 23:46:30,609 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 23:46:30,609 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 23:46:30,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:46:30 BoogieIcfgContainer [2025-01-08 23:46:30,610 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 23:46:30,614 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 23:46:30,614 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 23:46:30,619 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 23:46:30,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 11:46:23" (1/3) ... [2025-01-08 23:46:30,620 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@152f1bc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:46:30, skipping insertion in model container [2025-01-08 23:46:30,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:46:25" (2/3) ... [2025-01-08 23:46:30,620 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@152f1bc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:46:30, skipping insertion in model container [2025-01-08 23:46:30,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:46:30" (3/3) ... [2025-01-08 23:46:30,621 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem12_label26.c [2025-01-08 23:46:30,634 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 23:46:30,635 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem12_label26.c that has 1 procedures, 818 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 23:46:30,719 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 23:46:30,731 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;@275b5819, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 23:46:30,731 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 23:46:30,737 INFO L276 IsEmpty]: Start isEmpty. Operand has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 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 23:46:30,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-08 23:46:30,742 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:46:30,742 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] [2025-01-08 23:46:30,743 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:46:30,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:46:30,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1182209948, now seen corresponding path program 1 times [2025-01-08 23:46:30,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:46:30,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91037578] [2025-01-08 23:46:30,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:46:30,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:46:30,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-08 23:46:30,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-08 23:46:30,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:46:30,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:46:31,112 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 23:46:31,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:46:31,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91037578] [2025-01-08 23:46:31,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91037578] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:46:31,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:46:31,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:46:31,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673983251] [2025-01-08 23:46:31,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:46:31,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:46:31,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:46:31,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:46:31,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:46:31,141 INFO L87 Difference]: Start difference. First operand has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 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 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:34,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:46:34,515 INFO L93 Difference]: Finished difference Result 2388 states and 4626 transitions. [2025-01-08 23:46:34,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:46:34,517 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-01-08 23:46:34,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:46:34,538 INFO L225 Difference]: With dead ends: 2388 [2025-01-08 23:46:34,538 INFO L226 Difference]: Without dead ends: 1506 [2025-01-08 23:46:34,543 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 23:46:34,545 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 852 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2437 mSolverCounterSat, 771 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 852 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 3208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 771 IncrementalHoareTripleChecker+Valid, 2437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-01-08 23:46:34,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [852 Valid, 156 Invalid, 3208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [771 Valid, 2437 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-01-08 23:46:34,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2025-01-08 23:46:34,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1506. [2025-01-08 23:46:34,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1505 states have (on average 1.8458471760797341) internal successors, (2778), 1505 states have internal predecessors, (2778), 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 23:46:34,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2778 transitions. [2025-01-08 23:46:34,640 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 2778 transitions. Word has length 45 [2025-01-08 23:46:34,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:46:34,640 INFO L471 AbstractCegarLoop]: Abstraction has 1506 states and 2778 transitions. [2025-01-08 23:46:34,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:34,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 2778 transitions. [2025-01-08 23:46:34,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-08 23:46:34,643 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:46:34,643 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-08 23:46:34,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 23:46:34,644 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:46:34,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:46:34,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1701324202, now seen corresponding path program 1 times [2025-01-08 23:46:34,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:46:34,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812353674] [2025-01-08 23:46:34,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:46:34,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:46:34,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-08 23:46:34,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-08 23:46:34,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:46:34,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:46:34,907 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:46:34,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:46:34,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812353674] [2025-01-08 23:46:34,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812353674] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:46:34,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:46:34,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:46:34,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984971832] [2025-01-08 23:46:34,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:46:34,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:46:34,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:46:34,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:46:34,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:46:34,911 INFO L87 Difference]: Start difference. First operand 1506 states and 2778 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 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 23:46:37,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:46:37,707 INFO L93 Difference]: Finished difference Result 3761 states and 6893 transitions. [2025-01-08 23:46:37,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:46:37,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 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 114 [2025-01-08 23:46:37,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:46:37,717 INFO L225 Difference]: With dead ends: 3761 [2025-01-08 23:46:37,717 INFO L226 Difference]: Without dead ends: 2257 [2025-01-08 23:46:37,719 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 23:46:37,720 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 780 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1995 mSolverCounterSat, 864 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 2859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 864 IncrementalHoareTripleChecker+Valid, 1995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:46:37,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 448 Invalid, 2859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [864 Valid, 1995 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-08 23:46:37,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2257 states. [2025-01-08 23:46:37,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2257 to 2257. [2025-01-08 23:46:37,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2257 states, 2256 states have (on average 1.4419326241134751) internal successors, (3253), 2256 states have internal predecessors, (3253), 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 23:46:37,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 2257 states and 3253 transitions. [2025-01-08 23:46:37,761 INFO L78 Accepts]: Start accepts. Automaton has 2257 states and 3253 transitions. Word has length 114 [2025-01-08 23:46:37,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:46:37,762 INFO L471 AbstractCegarLoop]: Abstraction has 2257 states and 3253 transitions. [2025-01-08 23:46:37,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 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 23:46:37,762 INFO L276 IsEmpty]: Start isEmpty. Operand 2257 states and 3253 transitions. [2025-01-08 23:46:37,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-08 23:46:37,763 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:46:37,764 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-08 23:46:37,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 23:46:37,764 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:46:37,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:46:37,765 INFO L85 PathProgramCache]: Analyzing trace with hash -297483557, now seen corresponding path program 1 times [2025-01-08 23:46:37,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:46:37,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667287048] [2025-01-08 23:46:37,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:46:37,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:46:37,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-08 23:46:37,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-08 23:46:37,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:46:37,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:46:38,174 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:46:38,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:46:38,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667287048] [2025-01-08 23:46:38,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667287048] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:46:38,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:46:38,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:46:38,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797917164] [2025-01-08 23:46:38,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:46:38,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:46:38,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:46:38,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:46:38,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:46:38,178 INFO L87 Difference]: Start difference. First operand 2257 states and 3253 transitions. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 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 23:46:41,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:46:41,365 INFO L93 Difference]: Finished difference Result 6802 states and 9791 transitions. [2025-01-08 23:46:41,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:46:41,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 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 116 [2025-01-08 23:46:41,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:46:41,383 INFO L225 Difference]: With dead ends: 6802 [2025-01-08 23:46:41,383 INFO L226 Difference]: Without dead ends: 4510 [2025-01-08 23:46:41,387 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 23:46:41,388 INFO L435 NwaCegarLoop]: 686 mSDtfsCounter, 703 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 3105 mSolverCounterSat, 729 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 3834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 729 IncrementalHoareTripleChecker+Valid, 3105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-01-08 23:46:41,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 700 Invalid, 3834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [729 Valid, 3105 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-01-08 23:46:41,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4510 states. [2025-01-08 23:46:41,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4510 to 3759. [2025-01-08 23:46:41,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3759 states, 3758 states have (on average 1.2714209686003193) internal successors, (4778), 3758 states have internal predecessors, (4778), 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 23:46:41,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3759 states to 3759 states and 4778 transitions. [2025-01-08 23:46:41,458 INFO L78 Accepts]: Start accepts. Automaton has 3759 states and 4778 transitions. Word has length 116 [2025-01-08 23:46:41,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:46:41,459 INFO L471 AbstractCegarLoop]: Abstraction has 3759 states and 4778 transitions. [2025-01-08 23:46:41,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 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 23:46:41,460 INFO L276 IsEmpty]: Start isEmpty. Operand 3759 states and 4778 transitions. [2025-01-08 23:46:41,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2025-01-08 23:46:41,466 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:46:41,466 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-08 23:46:41,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 23:46:41,466 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:46:41,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:46:41,467 INFO L85 PathProgramCache]: Analyzing trace with hash 920104821, now seen corresponding path program 1 times [2025-01-08 23:46:41,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:46:41,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806630150] [2025-01-08 23:46:41,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:46:41,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:46:41,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-01-08 23:46:41,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-01-08 23:46:41,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:46:41,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:46:41,967 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-01-08 23:46:41,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:46:41,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806630150] [2025-01-08 23:46:41,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806630150] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:46:41,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:46:41,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:46:41,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485153584] [2025-01-08 23:46:41,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:46:41,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:46:41,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:46:41,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:46:41,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:46:41,971 INFO L87 Difference]: Start difference. First operand 3759 states and 4778 transitions. Second operand has 4 states, 4 states have (on average 47.0) internal successors, (188), 3 states have internal predecessors, (188), 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 23:46:44,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:46:44,937 INFO L93 Difference]: Finished difference Result 9808 states and 12774 transitions. [2025-01-08 23:46:44,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:46:44,938 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.0) internal successors, (188), 3 states have internal predecessors, (188), 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 257 [2025-01-08 23:46:44,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:46:44,959 INFO L225 Difference]: With dead ends: 9808 [2025-01-08 23:46:44,960 INFO L226 Difference]: Without dead ends: 6014 [2025-01-08 23:46:44,967 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 23:46:44,969 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 775 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 3718 mSolverCounterSat, 542 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 4260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 542 IncrementalHoareTripleChecker+Valid, 3718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:46:44,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 327 Invalid, 4260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [542 Valid, 3718 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-01-08 23:46:44,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6014 states. [2025-01-08 23:46:45,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6014 to 6012. [2025-01-08 23:46:45,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6012 states, 6011 states have (on average 1.222758276493096) internal successors, (7350), 6011 states have internal predecessors, (7350), 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 23:46:45,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6012 states to 6012 states and 7350 transitions. [2025-01-08 23:46:45,119 INFO L78 Accepts]: Start accepts. Automaton has 6012 states and 7350 transitions. Word has length 257 [2025-01-08 23:46:45,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:46:45,120 INFO L471 AbstractCegarLoop]: Abstraction has 6012 states and 7350 transitions. [2025-01-08 23:46:45,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.0) internal successors, (188), 3 states have internal predecessors, (188), 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 23:46:45,120 INFO L276 IsEmpty]: Start isEmpty. Operand 6012 states and 7350 transitions. [2025-01-08 23:46:45,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2025-01-08 23:46:45,123 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:46:45,123 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-08 23:46:45,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 23:46:45,123 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:46:45,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:46:45,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1133975563, now seen corresponding path program 1 times [2025-01-08 23:46:45,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:46:45,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354927332] [2025-01-08 23:46:45,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:46:45,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:46:45,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-01-08 23:46:45,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-01-08 23:46:45,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:46:45,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:46:45,675 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-08 23:46:45,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:46:45,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354927332] [2025-01-08 23:46:45,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354927332] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:46:45,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:46:45,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:46:45,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417514602] [2025-01-08 23:46:45,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:46:45,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:46:45,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:46:45,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:46:45,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:46:45,678 INFO L87 Difference]: Start difference. First operand 6012 states and 7350 transitions. Second operand has 4 states, 4 states have (on average 54.0) internal successors, (216), 3 states have internal predecessors, (216), 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 23:46:49,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:46:49,601 INFO L93 Difference]: Finished difference Result 18030 states and 22021 transitions. [2025-01-08 23:46:49,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:46:49,602 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.0) internal successors, (216), 3 states have internal predecessors, (216), 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 258 [2025-01-08 23:46:49,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:46:49,630 INFO L225 Difference]: With dead ends: 18030 [2025-01-08 23:46:49,630 INFO L226 Difference]: Without dead ends: 12020 [2025-01-08 23:46:49,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:46:49,638 INFO L435 NwaCegarLoop]: 585 mSDtfsCounter, 2026 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 4470 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2026 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 5020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 4470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:46:49,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2026 Valid, 605 Invalid, 5020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 4470 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-01-08 23:46:49,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12020 states. [2025-01-08 23:46:49,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12020 to 10518. [2025-01-08 23:46:49,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10518 states, 10517 states have (on average 1.156223257582961) internal successors, (12160), 10517 states have internal predecessors, (12160), 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 23:46:49,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10518 states to 10518 states and 12160 transitions. [2025-01-08 23:46:49,807 INFO L78 Accepts]: Start accepts. Automaton has 10518 states and 12160 transitions. Word has length 258 [2025-01-08 23:46:49,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:46:49,807 INFO L471 AbstractCegarLoop]: Abstraction has 10518 states and 12160 transitions. [2025-01-08 23:46:49,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.0) internal successors, (216), 3 states have internal predecessors, (216), 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 23:46:49,807 INFO L276 IsEmpty]: Start isEmpty. Operand 10518 states and 12160 transitions. [2025-01-08 23:46:49,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2025-01-08 23:46:49,813 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:46:49,813 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, 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, 3, 3, 3, 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] [2025-01-08 23:46:49,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 23:46:49,813 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:46:49,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:46:49,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1591303586, now seen corresponding path program 1 times [2025-01-08 23:46:49,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:46:49,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367917815] [2025-01-08 23:46:49,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:46:49,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:46:49,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-01-08 23:46:49,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-01-08 23:46:49,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:46:49,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:46:50,031 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 306 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-08 23:46:50,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:46:50,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367917815] [2025-01-08 23:46:50,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367917815] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:46:50,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:46:50,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:46:50,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566593622] [2025-01-08 23:46:50,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:46:50,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:46:50,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:46:50,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:46:50,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:46:50,034 INFO L87 Difference]: Start difference. First operand 10518 states and 12160 transitions. Second operand has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 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 23:46:52,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:46:52,744 INFO L93 Difference]: Finished difference Result 30797 states and 35716 transitions. [2025-01-08 23:46:52,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:46:52,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 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 340 [2025-01-08 23:46:52,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:46:52,787 INFO L225 Difference]: With dead ends: 30797 [2025-01-08 23:46:52,787 INFO L226 Difference]: Without dead ends: 20281 [2025-01-08 23:46:52,800 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 23:46:52,801 INFO L435 NwaCegarLoop]: 1378 mSDtfsCounter, 667 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2720 mSolverCounterSat, 361 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 1386 SdHoareTripleChecker+Invalid, 3081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 361 IncrementalHoareTripleChecker+Valid, 2720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:46:52,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 1386 Invalid, 3081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [361 Valid, 2720 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-08 23:46:52,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20281 states. [2025-01-08 23:46:53,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20281 to 18779. [2025-01-08 23:46:53,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18779 states, 18778 states have (on average 1.1468207476834593) internal successors, (21535), 18778 states have internal predecessors, (21535), 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 23:46:53,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18779 states to 18779 states and 21535 transitions. [2025-01-08 23:46:53,071 INFO L78 Accepts]: Start accepts. Automaton has 18779 states and 21535 transitions. Word has length 340 [2025-01-08 23:46:53,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:46:53,071 INFO L471 AbstractCegarLoop]: Abstraction has 18779 states and 21535 transitions. [2025-01-08 23:46:53,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 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 23:46:53,076 INFO L276 IsEmpty]: Start isEmpty. Operand 18779 states and 21535 transitions. [2025-01-08 23:46:53,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2025-01-08 23:46:53,086 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:46:53,086 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, 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, 3, 3, 3, 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] [2025-01-08 23:46:53,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 23:46:53,087 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:46:53,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:46:53,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1290250796, now seen corresponding path program 1 times [2025-01-08 23:46:53,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:46:53,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825293961] [2025-01-08 23:46:53,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:46:53,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:46:53,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-01-08 23:46:53,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-01-08 23:46:53,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:46:53,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:46:53,449 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-08 23:46:53,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:46:53,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825293961] [2025-01-08 23:46:53,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825293961] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:46:53,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:46:53,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:46:53,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672204147] [2025-01-08 23:46:53,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:46:53,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:46:53,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:46:53,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:46:53,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:46:53,453 INFO L87 Difference]: Start difference. First operand 18779 states and 21535 transitions. Second operand has 3 states, 3 states have (on average 87.0) 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 23:46:55,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:46:55,898 INFO L93 Difference]: Finished difference Result 45817 states and 53206 transitions. [2025-01-08 23:46:55,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:46:55,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.0) 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 344 [2025-01-08 23:46:55,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:46:55,955 INFO L225 Difference]: With dead ends: 45817 [2025-01-08 23:46:55,956 INFO L226 Difference]: Without dead ends: 27040 [2025-01-08 23:46:55,976 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 23:46:55,977 INFO L435 NwaCegarLoop]: 1196 mSDtfsCounter, 704 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2238 mSolverCounterSat, 433 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 2671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 433 IncrementalHoareTripleChecker+Valid, 2238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:46:55,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 1204 Invalid, 2671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [433 Valid, 2238 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-08 23:46:55,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27040 states. [2025-01-08 23:46:56,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27040 to 27040. [2025-01-08 23:46:56,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27040 states, 27039 states have (on average 1.1243759014756463) internal successors, (30402), 27039 states have internal predecessors, (30402), 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 23:46:56,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27040 states to 27040 states and 30402 transitions. [2025-01-08 23:46:56,292 INFO L78 Accepts]: Start accepts. Automaton has 27040 states and 30402 transitions. Word has length 344 [2025-01-08 23:46:56,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:46:56,293 INFO L471 AbstractCegarLoop]: Abstraction has 27040 states and 30402 transitions. [2025-01-08 23:46:56,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.0) 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 23:46:56,294 INFO L276 IsEmpty]: Start isEmpty. Operand 27040 states and 30402 transitions. [2025-01-08 23:46:56,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2025-01-08 23:46:56,301 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:46:56,302 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, 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, 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, 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] [2025-01-08 23:46:56,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 23:46:56,302 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:46:56,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:46:56,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1717212, now seen corresponding path program 1 times [2025-01-08 23:46:56,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:46:56,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779970982] [2025-01-08 23:46:56,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:46:56,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:46:56,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 376 statements into 1 equivalence classes. [2025-01-08 23:46:56,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 376 of 376 statements. [2025-01-08 23:46:56,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:46:56,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:46:56,622 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-01-08 23:46:56,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:46:56,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779970982] [2025-01-08 23:46:56,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779970982] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:46:56,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:46:56,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:46:56,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762567380] [2025-01-08 23:46:56,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:46:56,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:46:56,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:46:56,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:46:56,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:46:56,625 INFO L87 Difference]: Start difference. First operand 27040 states and 30402 transitions. Second operand has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 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 23:46:59,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:46:59,243 INFO L93 Difference]: Finished difference Result 66845 states and 75537 transitions. [2025-01-08 23:46:59,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:46:59,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 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 376 [2025-01-08 23:46:59,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:46:59,310 INFO L225 Difference]: With dead ends: 66845 [2025-01-08 23:46:59,310 INFO L226 Difference]: Without dead ends: 39807 [2025-01-08 23:46:59,338 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 23:46:59,338 INFO L435 NwaCegarLoop]: 397 mSDtfsCounter, 731 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2520 mSolverCounterSat, 436 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 2956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 436 IncrementalHoareTripleChecker+Valid, 2520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:46:59,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 404 Invalid, 2956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [436 Valid, 2520 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-08 23:46:59,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39807 states. [2025-01-08 23:46:59,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39807 to 38305. [2025-01-08 23:46:59,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38305 states, 38304 states have (on average 1.1223370927318295) internal successors, (42990), 38304 states have internal predecessors, (42990), 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 23:46:59,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38305 states to 38305 states and 42990 transitions. [2025-01-08 23:46:59,818 INFO L78 Accepts]: Start accepts. Automaton has 38305 states and 42990 transitions. Word has length 376 [2025-01-08 23:46:59,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:46:59,819 INFO L471 AbstractCegarLoop]: Abstraction has 38305 states and 42990 transitions. [2025-01-08 23:46:59,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 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 23:46:59,819 INFO L276 IsEmpty]: Start isEmpty. Operand 38305 states and 42990 transitions. [2025-01-08 23:46:59,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2025-01-08 23:46:59,828 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:46:59,828 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, 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, 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, 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] [2025-01-08 23:46:59,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 23:46:59,829 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:46:59,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:46:59,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1342064735, now seen corresponding path program 1 times [2025-01-08 23:46:59,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:46:59,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626655277] [2025-01-08 23:46:59,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:46:59,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:46:59,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 383 statements into 1 equivalence classes. [2025-01-08 23:46:59,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 383 of 383 statements. [2025-01-08 23:46:59,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:46:59,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:47:00,096 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 320 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-08 23:47:00,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:47:00,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626655277] [2025-01-08 23:47:00,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626655277] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:47:00,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:47:00,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:47:00,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774620749] [2025-01-08 23:47:00,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:47:00,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:47:00,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:47:00,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:47:00,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:47:00,101 INFO L87 Difference]: Start difference. First operand 38305 states and 42990 transitions. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 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 23:47:02,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:47:02,665 INFO L93 Difference]: Finished difference Result 94632 states and 107674 transitions. [2025-01-08 23:47:02,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:47:02,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 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 383 [2025-01-08 23:47:02,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:47:02,732 INFO L225 Difference]: With dead ends: 94632 [2025-01-08 23:47:02,732 INFO L226 Difference]: Without dead ends: 56329 [2025-01-08 23:47:02,757 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 23:47:02,758 INFO L435 NwaCegarLoop]: 1251 mSDtfsCounter, 704 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2128 mSolverCounterSat, 688 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 2816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 688 IncrementalHoareTripleChecker+Valid, 2128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:47:02,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 1259 Invalid, 2816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [688 Valid, 2128 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-08 23:47:02,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56329 states. [2025-01-08 23:47:03,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56329 to 54076. [2025-01-08 23:47:03,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54076 states, 54075 states have (on average 1.1104761904761904) internal successors, (60049), 54075 states have internal predecessors, (60049), 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 23:47:03,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54076 states to 54076 states and 60049 transitions. [2025-01-08 23:47:03,268 INFO L78 Accepts]: Start accepts. Automaton has 54076 states and 60049 transitions. Word has length 383 [2025-01-08 23:47:03,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:47:03,269 INFO L471 AbstractCegarLoop]: Abstraction has 54076 states and 60049 transitions. [2025-01-08 23:47:03,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 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 23:47:03,269 INFO L276 IsEmpty]: Start isEmpty. Operand 54076 states and 60049 transitions. [2025-01-08 23:47:03,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2025-01-08 23:47:03,279 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:47:03,279 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 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, 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] [2025-01-08 23:47:03,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 23:47:03,279 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:47:03,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:47:03,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1966166048, now seen corresponding path program 1 times [2025-01-08 23:47:03,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:47:03,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566224395] [2025-01-08 23:47:03,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:47:03,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:47:03,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes. [2025-01-08 23:47:03,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements. [2025-01-08 23:47:03,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:47:03,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:47:03,736 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 419 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-01-08 23:47:03,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:47:03,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566224395] [2025-01-08 23:47:03,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566224395] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:47:03,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:47:03,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:47:03,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560962859] [2025-01-08 23:47:03,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:47:03,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:47:03,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:47:03,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:47:03,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:47:03,739 INFO L87 Difference]: Start difference. First operand 54076 states and 60049 transitions. Second operand has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 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 23:47:06,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:47:06,596 INFO L93 Difference]: Finished difference Result 137439 states and 153697 transitions. [2025-01-08 23:47:06,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:47:06,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 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 466 [2025-01-08 23:47:06,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:47:06,677 INFO L225 Difference]: With dead ends: 137439 [2025-01-08 23:47:06,678 INFO L226 Difference]: Without dead ends: 79610 [2025-01-08 23:47:06,719 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 23:47:06,719 INFO L435 NwaCegarLoop]: 1279 mSDtfsCounter, 705 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2206 mSolverCounterSat, 611 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 2817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 611 IncrementalHoareTripleChecker+Valid, 2206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:47:06,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 1287 Invalid, 2817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [611 Valid, 2206 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-08 23:47:06,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79610 states. [2025-01-08 23:47:07,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79610 to 78108. [2025-01-08 23:47:07,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78108 states, 78107 states have (on average 1.0931542627421358) internal successors, (85383), 78107 states have internal predecessors, (85383), 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 23:47:07,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78108 states to 78108 states and 85383 transitions. [2025-01-08 23:47:07,482 INFO L78 Accepts]: Start accepts. Automaton has 78108 states and 85383 transitions. Word has length 466 [2025-01-08 23:47:07,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:47:07,483 INFO L471 AbstractCegarLoop]: Abstraction has 78108 states and 85383 transitions. [2025-01-08 23:47:07,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 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 23:47:07,483 INFO L276 IsEmpty]: Start isEmpty. Operand 78108 states and 85383 transitions. [2025-01-08 23:47:07,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2025-01-08 23:47:07,497 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:47:07,497 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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, 1, 1, 1, 1, 1, 1, 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 23:47:07,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-08 23:47:07,497 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:47:07,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:47:07,498 INFO L85 PathProgramCache]: Analyzing trace with hash -485174333, now seen corresponding path program 1 times [2025-01-08 23:47:07,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:47:07,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701729503] [2025-01-08 23:47:07,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:47:07,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:47:07,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-01-08 23:47:07,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-01-08 23:47:07,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:47:07,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:47:08,412 INFO L134 CoverageAnalysis]: Checked inductivity of 754 backedges. 414 proven. 108 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2025-01-08 23:47:08,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:47:08,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701729503] [2025-01-08 23:47:08,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701729503] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:47:08,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129702042] [2025-01-08 23:47:08,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:47:08,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:47:08,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:47:08,417 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 23:47:08,418 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 23:47:08,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-01-08 23:47:08,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-01-08 23:47:08,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:47:08,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:47:08,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 683 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:47:08,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:47:08,804 INFO L134 CoverageAnalysis]: Checked inductivity of 754 backedges. 457 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-01-08 23:47:08,804 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:47:08,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129702042] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:47:08,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:47:08,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:47:08,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180830448] [2025-01-08 23:47:08,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:47:08,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:47:08,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:47:08,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:47:08,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:47:08,806 INFO L87 Difference]: Start difference. First operand 78108 states and 85383 transitions. Second operand has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 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 23:47:11,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:47:11,470 INFO L93 Difference]: Finished difference Result 166728 states and 184598 transitions. [2025-01-08 23:47:11,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:47:11,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 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 532 [2025-01-08 23:47:11,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:47:11,574 INFO L225 Difference]: With dead ends: 166728 [2025-01-08 23:47:11,574 INFO L226 Difference]: Without dead ends: 88622 [2025-01-08 23:47:11,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 535 GetRequests, 531 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:47:11,614 INFO L435 NwaCegarLoop]: 1367 mSDtfsCounter, 650 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2120 mSolverCounterSat, 581 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 1375 SdHoareTripleChecker+Invalid, 2701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 581 IncrementalHoareTripleChecker+Valid, 2120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:47:11,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [650 Valid, 1375 Invalid, 2701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [581 Valid, 2120 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-08 23:47:11,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88622 states. [2025-01-08 23:47:12,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88622 to 85618. [2025-01-08 23:47:12,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85618 states, 85617 states have (on average 1.0882067813635143) internal successors, (93169), 85617 states have internal predecessors, (93169), 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 23:47:12,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85618 states to 85618 states and 93169 transitions. [2025-01-08 23:47:12,533 INFO L78 Accepts]: Start accepts. Automaton has 85618 states and 93169 transitions. Word has length 532 [2025-01-08 23:47:12,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:47:12,534 INFO L471 AbstractCegarLoop]: Abstraction has 85618 states and 93169 transitions. [2025-01-08 23:47:12,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 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 23:47:12,534 INFO L276 IsEmpty]: Start isEmpty. Operand 85618 states and 93169 transitions. [2025-01-08 23:47:12,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 630 [2025-01-08 23:47:12,556 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:47:12,556 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:47:12,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-08 23:47:12,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-08 23:47:12,757 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:47:12,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:47:12,758 INFO L85 PathProgramCache]: Analyzing trace with hash 338500612, now seen corresponding path program 1 times [2025-01-08 23:47:12,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:47:12,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341099674] [2025-01-08 23:47:12,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:47:12,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:47:12,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 629 statements into 1 equivalence classes. [2025-01-08 23:47:12,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 629 of 629 statements. [2025-01-08 23:47:12,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:47:12,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:47:13,427 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 383 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-01-08 23:47:13,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:47:13,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341099674] [2025-01-08 23:47:13,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341099674] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:47:13,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:47:13,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:47:13,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090590626] [2025-01-08 23:47:13,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:47:13,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:47:13,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:47:13,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:47:13,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:47:13,431 INFO L87 Difference]: Start difference. First operand 85618 states and 93169 transitions. Second operand has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 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 23:47:16,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:47:16,406 INFO L93 Difference]: Finished difference Result 216296 states and 235562 transitions. [2025-01-08 23:47:16,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:47:16,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 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 629 [2025-01-08 23:47:16,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:47:16,545 INFO L225 Difference]: With dead ends: 216296 [2025-01-08 23:47:16,545 INFO L226 Difference]: Without dead ends: 130680 [2025-01-08 23:47:16,593 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 23:47:16,594 INFO L435 NwaCegarLoop]: 528 mSDtfsCounter, 475 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2380 mSolverCounterSat, 528 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 2908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 528 IncrementalHoareTripleChecker+Valid, 2380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:47:16,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 535 Invalid, 2908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [528 Valid, 2380 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-08 23:47:16,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130680 states. [2025-01-08 23:47:17,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130680 to 125421. [2025-01-08 23:47:17,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125421 states, 125420 states have (on average 1.0795008770531016) internal successors, (135391), 125420 states have internal predecessors, (135391), 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 23:47:18,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125421 states to 125421 states and 135391 transitions. [2025-01-08 23:47:18,050 INFO L78 Accepts]: Start accepts. Automaton has 125421 states and 135391 transitions. Word has length 629 [2025-01-08 23:47:18,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:47:18,050 INFO L471 AbstractCegarLoop]: Abstraction has 125421 states and 135391 transitions. [2025-01-08 23:47:18,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 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 23:47:18,050 INFO L276 IsEmpty]: Start isEmpty. Operand 125421 states and 135391 transitions. [2025-01-08 23:47:18,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 632 [2025-01-08 23:47:18,068 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:47:18,069 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:47:18,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-08 23:47:18,069 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:47:18,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:47:18,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1256470409, now seen corresponding path program 1 times [2025-01-08 23:47:18,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:47:18,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601727282] [2025-01-08 23:47:18,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:47:18,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:47:18,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 631 statements into 1 equivalence classes. [2025-01-08 23:47:18,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 631 of 631 statements. [2025-01-08 23:47:18,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:47:18,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:47:18,511 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 385 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-08 23:47:18,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:47:18,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601727282] [2025-01-08 23:47:18,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601727282] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:47:18,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:47:18,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:47:18,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209577232] [2025-01-08 23:47:18,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:47:18,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:47:18,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:47:18,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:47:18,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:47:18,515 INFO L87 Difference]: Start difference. First operand 125421 states and 135391 transitions. Second operand has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 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 23:47:21,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:47:21,685 INFO L93 Difference]: Finished difference Result 295900 states and 319953 transitions. [2025-01-08 23:47:21,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:47:21,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 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 631 [2025-01-08 23:47:21,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:47:21,888 INFO L225 Difference]: With dead ends: 295900 [2025-01-08 23:47:21,888 INFO L226 Difference]: Without dead ends: 170481 [2025-01-08 23:47:21,964 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 23:47:21,965 INFO L435 NwaCegarLoop]: 1288 mSDtfsCounter, 436 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2325 mSolverCounterSat, 482 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 2807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 482 IncrementalHoareTripleChecker+Valid, 2325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:47:21,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 1296 Invalid, 2807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [482 Valid, 2325 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-08 23:47:22,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170481 states. [2025-01-08 23:47:23,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170481 to 159967. [2025-01-08 23:47:23,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159967 states, 159966 states have (on average 1.072165335133716) internal successors, (171510), 159966 states have internal predecessors, (171510), 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 23:47:24,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159967 states to 159967 states and 171510 transitions. [2025-01-08 23:47:24,079 INFO L78 Accepts]: Start accepts. Automaton has 159967 states and 171510 transitions. Word has length 631 [2025-01-08 23:47:24,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:47:24,080 INFO L471 AbstractCegarLoop]: Abstraction has 159967 states and 171510 transitions. [2025-01-08 23:47:24,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 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 23:47:24,080 INFO L276 IsEmpty]: Start isEmpty. Operand 159967 states and 171510 transitions. [2025-01-08 23:47:24,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 775 [2025-01-08 23:47:24,121 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:47:24,122 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:47:24,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-08 23:47:24,122 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:47:24,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:47:24,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1925983441, now seen corresponding path program 1 times [2025-01-08 23:47:24,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:47:24,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625104836] [2025-01-08 23:47:24,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:47:24,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:47:24,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 774 statements into 1 equivalence classes. [2025-01-08 23:47:24,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 774 of 774 statements. [2025-01-08 23:47:24,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:47:24,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:47:24,756 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 700 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2025-01-08 23:47:24,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:47:24,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625104836] [2025-01-08 23:47:24,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625104836] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:47:24,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:47:24,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:47:24,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536530240] [2025-01-08 23:47:24,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:47:24,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:47:24,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:47:24,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:47:24,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:47:24,759 INFO L87 Difference]: Start difference. First operand 159967 states and 171510 transitions. Second operand has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 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 23:47:28,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:47:28,101 INFO L93 Difference]: Finished difference Result 319932 states and 343018 transitions. [2025-01-08 23:47:28,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:47:28,102 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 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 774 [2025-01-08 23:47:28,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:47:28,297 INFO L225 Difference]: With dead ends: 319932 [2025-01-08 23:47:28,298 INFO L226 Difference]: Without dead ends: 159967 [2025-01-08 23:47:28,357 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 23:47:28,357 INFO L435 NwaCegarLoop]: 1254 mSDtfsCounter, 405 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2214 mSolverCounterSat, 429 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 1262 SdHoareTripleChecker+Invalid, 2643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 429 IncrementalHoareTripleChecker+Valid, 2214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:47:28,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 1262 Invalid, 2643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [429 Valid, 2214 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-08 23:47:28,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159967 states. [2025-01-08 23:47:29,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159967 to 156212. [2025-01-08 23:47:30,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156212 states, 156211 states have (on average 1.0507518676661696) internal successors, (164139), 156211 states have internal predecessors, (164139), 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 23:47:30,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156212 states to 156212 states and 164139 transitions. [2025-01-08 23:47:30,206 INFO L78 Accepts]: Start accepts. Automaton has 156212 states and 164139 transitions. Word has length 774 [2025-01-08 23:47:30,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:47:30,207 INFO L471 AbstractCegarLoop]: Abstraction has 156212 states and 164139 transitions. [2025-01-08 23:47:30,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 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 23:47:30,207 INFO L276 IsEmpty]: Start isEmpty. Operand 156212 states and 164139 transitions. [2025-01-08 23:47:30,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 807 [2025-01-08 23:47:30,259 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:47:30,259 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:47:30,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-08 23:47:30,260 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:47:30,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:47:30,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1856031542, now seen corresponding path program 1 times [2025-01-08 23:47:30,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:47:30,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058804374] [2025-01-08 23:47:30,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:47:30,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:47:30,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 806 statements into 1 equivalence classes. [2025-01-08 23:47:30,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 806 of 806 statements. [2025-01-08 23:47:30,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:47:30,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:47:31,373 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-01-08 23:47:31,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:47:31,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058804374] [2025-01-08 23:47:31,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058804374] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:47:31,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:47:31,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:47:31,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030149162] [2025-01-08 23:47:31,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:47:31,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:47:31,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:47:31,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:47:31,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:47:31,378 INFO L87 Difference]: Start difference. First operand 156212 states and 164139 transitions. Second operand has 3 states, 3 states have (on average 182.33333333333334) internal successors, (547), 3 states have internal predecessors, (547), 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 23:47:34,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:47:34,285 INFO L93 Difference]: Finished difference Result 334952 states and 351984 transitions. [2025-01-08 23:47:34,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:47:34,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 182.33333333333334) internal successors, (547), 3 states have internal predecessors, (547), 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 806 [2025-01-08 23:47:34,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:47:34,483 INFO L225 Difference]: With dead ends: 334952 [2025-01-08 23:47:34,483 INFO L226 Difference]: Without dead ends: 178742 [2025-01-08 23:47:34,547 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 23:47:34,548 INFO L435 NwaCegarLoop]: 586 mSDtfsCounter, 745 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2309 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 2586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 2309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-08 23:47:34,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 593 Invalid, 2586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 2309 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-08 23:47:34,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178742 states. [2025-01-08 23:47:36,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178742 to 174236. [2025-01-08 23:47:36,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174236 states, 174235 states have (on average 1.049060177346687) internal successors, (182783), 174235 states have internal predecessors, (182783), 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 23:47:36,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174236 states to 174236 states and 182783 transitions. [2025-01-08 23:47:36,805 INFO L78 Accepts]: Start accepts. Automaton has 174236 states and 182783 transitions. Word has length 806 [2025-01-08 23:47:36,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:47:36,805 INFO L471 AbstractCegarLoop]: Abstraction has 174236 states and 182783 transitions. [2025-01-08 23:47:36,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 182.33333333333334) internal successors, (547), 3 states have internal predecessors, (547), 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 23:47:36,805 INFO L276 IsEmpty]: Start isEmpty. Operand 174236 states and 182783 transitions. [2025-01-08 23:47:36,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 898 [2025-01-08 23:47:36,845 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:47:36,845 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 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] [2025-01-08 23:47:36,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-08 23:47:36,845 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:47:36,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:47:36,846 INFO L85 PathProgramCache]: Analyzing trace with hash -925912096, now seen corresponding path program 1 times [2025-01-08 23:47:36,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:47:36,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535687284] [2025-01-08 23:47:36,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:47:36,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:47:36,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 897 statements into 1 equivalence classes. [2025-01-08 23:47:36,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 897 of 897 statements. [2025-01-08 23:47:36,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:47:36,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:47:37,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1006 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 835 trivial. 0 not checked. [2025-01-08 23:47:37,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:47:37,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535687284] [2025-01-08 23:47:37,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535687284] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:47:37,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:47:37,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:47:37,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929924462] [2025-01-08 23:47:37,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:47:37,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:47:37,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:47:37,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:47:37,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:47:37,479 INFO L87 Difference]: Start difference. First operand 174236 states and 182783 transitions. Second operand has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 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)