./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label35.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem11_label35.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 332223a74015f37ef1848305a6dc2d3188fda0d257576dbd7b4025d0bb05f229 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 01:42:47,955 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 01:42:48,007 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 01:42:48,013 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 01:42:48,013 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 01:42:48,035 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 01:42:48,035 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 01:42:48,035 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 01:42:48,035 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 01:42:48,036 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 01:42:48,036 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 01:42:48,036 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 01:42:48,037 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 01:42:48,037 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 01:42:48,037 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 01:42:48,037 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 01:42:48,037 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 01:42:48,037 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 01:42:48,037 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 01:42:48,037 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 01:42:48,037 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 01:42:48,037 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 01:42:48,037 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 01:42:48,037 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 01:42:48,037 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 01:42:48,037 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 01:42:48,037 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 01:42:48,037 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 01:42:48,037 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 01:42:48,037 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 01:42:48,037 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 01:42:48,037 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 01:42:48,037 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 01:42:48,038 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 01:42:48,038 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 01:42:48,038 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 01:42:48,038 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 01:42:48,038 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 01:42:48,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 01:42:48,038 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 01:42:48,038 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 01:42:48,038 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 01:42:48,038 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 01:42:48,038 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> 332223a74015f37ef1848305a6dc2d3188fda0d257576dbd7b4025d0bb05f229 [2025-03-08 01:42:48,241 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 01:42:48,249 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 01:42:48,251 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 01:42:48,252 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 01:42:48,252 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 01:42:48,253 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label35.c [2025-03-08 01:42:49,355 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d3ff03a5/ba26be57e43f4cbbb0b138568ab05e2c/FLAGea0ae546b [2025-03-08 01:42:49,662 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 01:42:49,664 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label35.c [2025-03-08 01:42:49,678 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d3ff03a5/ba26be57e43f4cbbb0b138568ab05e2c/FLAGea0ae546b [2025-03-08 01:42:49,915 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d3ff03a5/ba26be57e43f4cbbb0b138568ab05e2c [2025-03-08 01:42:49,918 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 01:42:49,919 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 01:42:49,920 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 01:42:49,920 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 01:42:49,923 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 01:42:49,924 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:42:49" (1/1) ... [2025-03-08 01:42:49,924 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b010d21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:42:49, skipping insertion in model container [2025-03-08 01:42:49,925 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:42:49" (1/1) ... [2025-03-08 01:42:49,957 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 01:42:50,112 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label35.c[8398,8411] [2025-03-08 01:42:50,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 01:42:50,282 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 01:42:50,307 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label35.c[8398,8411] [2025-03-08 01:42:50,373 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 01:42:50,384 INFO L204 MainTranslator]: Completed translation [2025-03-08 01:42:50,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:42:50 WrapperNode [2025-03-08 01:42:50,385 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 01:42:50,386 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 01:42:50,387 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 01:42:50,387 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 01:42:50,390 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:42:50" (1/1) ... [2025-03-08 01:42:50,410 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:42:50" (1/1) ... [2025-03-08 01:42:50,467 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 997 [2025-03-08 01:42:50,467 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 01:42:50,468 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 01:42:50,468 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 01:42:50,468 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 01:42:50,474 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:42:50" (1/1) ... [2025-03-08 01:42:50,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:42:50" (1/1) ... [2025-03-08 01:42:50,482 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:42:50" (1/1) ... [2025-03-08 01:42:50,559 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 01:42:50,559 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:42:50" (1/1) ... [2025-03-08 01:42:50,560 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:42:50" (1/1) ... [2025-03-08 01:42:50,591 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:42:50" (1/1) ... [2025-03-08 01:42:50,599 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:42:50" (1/1) ... [2025-03-08 01:42:50,608 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:42:50" (1/1) ... [2025-03-08 01:42:50,612 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:42:50" (1/1) ... [2025-03-08 01:42:50,621 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 01:42:50,623 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 01:42:50,623 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 01:42:50,623 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 01:42:50,624 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:42:50" (1/1) ... [2025-03-08 01:42:50,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 01:42:50,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:42:50,651 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 01:42:50,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 01:42:50,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 01:42:50,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 01:42:50,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 01:42:50,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 01:42:50,719 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 01:42:50,721 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 01:42:51,855 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-03-08 01:42:51,856 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 01:42:51,868 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 01:42:51,869 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 01:42:51,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:42:51 BoogieIcfgContainer [2025-03-08 01:42:51,869 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 01:42:51,873 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 01:42:51,873 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 01:42:51,876 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 01:42:51,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:42:49" (1/3) ... [2025-03-08 01:42:51,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f39a0d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:42:51, skipping insertion in model container [2025-03-08 01:42:51,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:42:50" (2/3) ... [2025-03-08 01:42:51,877 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f39a0d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:42:51, skipping insertion in model container [2025-03-08 01:42:51,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:42:51" (3/3) ... [2025-03-08 01:42:51,877 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem11_label35.c [2025-03-08 01:42:51,888 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 01:42:51,889 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem11_label35.c that has 1 procedures, 283 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 01:42:51,945 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 01:42:51,954 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;@4ba78227, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 01:42:51,954 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 01:42:51,960 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:42:51,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 01:42:51,966 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:42:51,966 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:42:51,966 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:42:51,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:42:51,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1477919632, now seen corresponding path program 1 times [2025-03-08 01:42:51,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:42:51,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299310507] [2025-03-08 01:42:51,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:42:51,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:42:52,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 01:42:52,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 01:42:52,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:42:52,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:42:52,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:42:52,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:42:52,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299310507] [2025-03-08 01:42:52,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299310507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:42:52,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:42:52,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:42:52,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615917455] [2025-03-08 01:42:52,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:42:52,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:42:52,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:42:52,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:42:52,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:42:52,311 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 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 19.333333333333332) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:42:53,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:42:53,184 INFO L93 Difference]: Finished difference Result 776 states and 1360 transitions. [2025-03-08 01:42:53,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:42:53,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 2 states have internal predecessors, (58), 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 58 [2025-03-08 01:42:53,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:42:53,192 INFO L225 Difference]: With dead ends: 776 [2025-03-08 01:42:53,193 INFO L226 Difference]: Without dead ends: 413 [2025-03-08 01:42:53,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:42:53,197 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 169 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 01:42:53,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 196 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 01:42:53,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-03-08 01:42:53,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 411. [2025-03-08 01:42:53,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 410 states have (on average 1.4585365853658536) internal successors, (598), 410 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:42:53,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 598 transitions. [2025-03-08 01:42:53,235 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 598 transitions. Word has length 58 [2025-03-08 01:42:53,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:42:53,235 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 598 transitions. [2025-03-08 01:42:53,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:42:53,236 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 598 transitions. [2025-03-08 01:42:53,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-08 01:42:53,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:42:53,238 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, 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] [2025-03-08 01:42:53,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 01:42:53,238 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:42:53,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:42:53,239 INFO L85 PathProgramCache]: Analyzing trace with hash 914238181, now seen corresponding path program 1 times [2025-03-08 01:42:53,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:42:53,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340344322] [2025-03-08 01:42:53,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:42:53,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:42:53,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 01:42:53,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 01:42:53,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:42:53,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:42:53,437 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:42:53,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:42:53,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340344322] [2025-03-08 01:42:53,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340344322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:42:53,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:42:53,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:42:53,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236219202] [2025-03-08 01:42:53,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:42:53,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:42:53,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:42:53,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:42:53,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:42:53,439 INFO L87 Difference]: Start difference. First operand 411 states and 598 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:42:54,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:42:54,050 INFO L93 Difference]: Finished difference Result 1209 states and 1765 transitions. [2025-03-08 01:42:54,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:42:54,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 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 126 [2025-03-08 01:42:54,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:42:54,053 INFO L225 Difference]: With dead ends: 1209 [2025-03-08 01:42:54,053 INFO L226 Difference]: Without dead ends: 800 [2025-03-08 01:42:54,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:42:54,055 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 144 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:42:54,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 121 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 01:42:54,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2025-03-08 01:42:54,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 787. [2025-03-08 01:42:54,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 786 states have (on average 1.3854961832061068) internal successors, (1089), 786 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:42:54,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1089 transitions. [2025-03-08 01:42:54,074 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1089 transitions. Word has length 126 [2025-03-08 01:42:54,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:42:54,074 INFO L471 AbstractCegarLoop]: Abstraction has 787 states and 1089 transitions. [2025-03-08 01:42:54,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:42:54,075 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1089 transitions. [2025-03-08 01:42:54,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 01:42:54,077 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:42:54,077 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, 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] [2025-03-08 01:42:54,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 01:42:54,077 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:42:54,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:42:54,078 INFO L85 PathProgramCache]: Analyzing trace with hash -748597347, now seen corresponding path program 1 times [2025-03-08 01:42:54,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:42:54,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150044971] [2025-03-08 01:42:54,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:42:54,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:42:54,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 01:42:54,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 01:42:54,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:42:54,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:42:54,454 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:42:54,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:42:54,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150044971] [2025-03-08 01:42:54,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150044971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:42:54,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:42:54,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:42:54,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693628322] [2025-03-08 01:42:54,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:42:54,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:42:54,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:42:54,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:42:54,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:42:54,456 INFO L87 Difference]: Start difference. First operand 787 states and 1089 transitions. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:42:55,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:42:55,403 INFO L93 Difference]: Finished difference Result 2316 states and 3094 transitions. [2025-03-08 01:42:55,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:42:55,405 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 3 states have internal predecessors, (127), 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 127 [2025-03-08 01:42:55,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:42:55,409 INFO L225 Difference]: With dead ends: 2316 [2025-03-08 01:42:55,409 INFO L226 Difference]: Without dead ends: 1531 [2025-03-08 01:42:55,410 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-03-08 01:42:55,411 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 486 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1133 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 1196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 01:42:55,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 218 Invalid, 1196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1133 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 01:42:55,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1531 states. [2025-03-08 01:42:55,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1531 to 1528. [2025-03-08 01:42:55,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1528 states, 1527 states have (on average 1.2508185985592666) internal successors, (1910), 1527 states have internal predecessors, (1910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:42:55,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1528 states and 1910 transitions. [2025-03-08 01:42:55,436 INFO L78 Accepts]: Start accepts. Automaton has 1528 states and 1910 transitions. Word has length 127 [2025-03-08 01:42:55,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:42:55,437 INFO L471 AbstractCegarLoop]: Abstraction has 1528 states and 1910 transitions. [2025-03-08 01:42:55,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:42:55,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 1910 transitions. [2025-03-08 01:42:55,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-08 01:42:55,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:42:55,438 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, 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] [2025-03-08 01:42:55,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 01:42:55,439 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:42:55,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:42:55,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1815410861, now seen corresponding path program 1 times [2025-03-08 01:42:55,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:42:55,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134634613] [2025-03-08 01:42:55,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:42:55,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:42:55,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 01:42:55,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 01:42:55,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:42:55,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:42:55,606 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-08 01:42:55,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:42:55,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134634613] [2025-03-08 01:42:55,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134634613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:42:55,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:42:55,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:42:55,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712753023] [2025-03-08 01:42:55,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:42:55,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:42:55,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:42:55,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:42:55,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:42:55,607 INFO L87 Difference]: Start difference. First operand 1528 states and 1910 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 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-03-08 01:42:56,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:42:56,201 INFO L93 Difference]: Finished difference Result 3431 states and 4428 transitions. [2025-03-08 01:42:56,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:42:56,202 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 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 170 [2025-03-08 01:42:56,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:42:56,207 INFO L225 Difference]: With dead ends: 3431 [2025-03-08 01:42:56,207 INFO L226 Difference]: Without dead ends: 2089 [2025-03-08 01:42:56,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:42:56,209 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 108 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:42:56,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 157 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 01:42:56,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2089 states. [2025-03-08 01:42:56,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2089 to 2089. [2025-03-08 01:42:56,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2089 states, 2088 states have (on average 1.2274904214559388) internal successors, (2563), 2088 states have internal predecessors, (2563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:42:56,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2089 states to 2089 states and 2563 transitions. [2025-03-08 01:42:56,237 INFO L78 Accepts]: Start accepts. Automaton has 2089 states and 2563 transitions. Word has length 170 [2025-03-08 01:42:56,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:42:56,237 INFO L471 AbstractCegarLoop]: Abstraction has 2089 states and 2563 transitions. [2025-03-08 01:42:56,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 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-03-08 01:42:56,237 INFO L276 IsEmpty]: Start isEmpty. Operand 2089 states and 2563 transitions. [2025-03-08 01:42:56,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-08 01:42:56,239 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:42:56,239 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, 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] [2025-03-08 01:42:56,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 01:42:56,239 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:42:56,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:42:56,239 INFO L85 PathProgramCache]: Analyzing trace with hash -2062760813, now seen corresponding path program 1 times [2025-03-08 01:42:56,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:42:56,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709687892] [2025-03-08 01:42:56,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:42:56,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:42:56,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-08 01:42:56,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-08 01:42:56,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:42:56,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:42:56,414 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:42:56,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:42:56,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709687892] [2025-03-08 01:42:56,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709687892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:42:56,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:42:56,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:42:56,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183689356] [2025-03-08 01:42:56,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:42:56,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:42:56,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:42:56,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:42:56,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:42:56,416 INFO L87 Difference]: Start difference. First operand 2089 states and 2563 transitions. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:42:57,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:42:57,012 INFO L93 Difference]: Finished difference Result 4927 states and 6145 transitions. [2025-03-08 01:42:57,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:42:57,012 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 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 185 [2025-03-08 01:42:57,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:42:57,020 INFO L225 Difference]: With dead ends: 4927 [2025-03-08 01:42:57,020 INFO L226 Difference]: Without dead ends: 3024 [2025-03-08 01:42:57,022 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-03-08 01:42:57,024 INFO L435 NwaCegarLoop]: 315 mSDtfsCounter, 147 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:42:57,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 336 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 01:42:57,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3024 states. [2025-03-08 01:42:57,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3024 to 2828. [2025-03-08 01:42:57,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2828 states, 2827 states have (on average 1.2104704633887513) internal successors, (3422), 2827 states have internal predecessors, (3422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:42:57,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2828 states to 2828 states and 3422 transitions. [2025-03-08 01:42:57,066 INFO L78 Accepts]: Start accepts. Automaton has 2828 states and 3422 transitions. Word has length 185 [2025-03-08 01:42:57,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:42:57,067 INFO L471 AbstractCegarLoop]: Abstraction has 2828 states and 3422 transitions. [2025-03-08 01:42:57,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:42:57,067 INFO L276 IsEmpty]: Start isEmpty. Operand 2828 states and 3422 transitions. [2025-03-08 01:42:57,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2025-03-08 01:42:57,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:42:57,069 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 01:42:57,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 01:42:57,070 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:42:57,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:42:57,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1655806336, now seen corresponding path program 1 times [2025-03-08 01:42:57,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:42:57,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119838779] [2025-03-08 01:42:57,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:42:57,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:42:57,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 239 statements into 1 equivalence classes. [2025-03-08 01:42:57,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 239 of 239 statements. [2025-03-08 01:42:57,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:42:57,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:42:57,257 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-08 01:42:57,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:42:57,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119838779] [2025-03-08 01:42:57,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119838779] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:42:57,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:42:57,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:42:57,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283013871] [2025-03-08 01:42:57,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:42:57,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:42:57,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:42:57,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:42:57,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:42:57,258 INFO L87 Difference]: Start difference. First operand 2828 states and 3422 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:42:57,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:42:57,818 INFO L93 Difference]: Finished difference Result 6217 states and 7560 transitions. [2025-03-08 01:42:57,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:42:57,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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 239 [2025-03-08 01:42:57,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:42:57,828 INFO L225 Difference]: With dead ends: 6217 [2025-03-08 01:42:57,828 INFO L226 Difference]: Without dead ends: 3391 [2025-03-08 01:42:57,831 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-03-08 01:42:57,832 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 144 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 01:42:57,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 347 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 01:42:57,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3391 states. [2025-03-08 01:42:57,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3391 to 3380. [2025-03-08 01:42:57,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3380 states, 3379 states have (on average 1.2044983722994969) internal successors, (4070), 3379 states have internal predecessors, (4070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:42:57,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3380 states to 3380 states and 4070 transitions. [2025-03-08 01:42:57,884 INFO L78 Accepts]: Start accepts. Automaton has 3380 states and 4070 transitions. Word has length 239 [2025-03-08 01:42:57,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:42:57,885 INFO L471 AbstractCegarLoop]: Abstraction has 3380 states and 4070 transitions. [2025-03-08 01:42:57,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:42:57,885 INFO L276 IsEmpty]: Start isEmpty. Operand 3380 states and 4070 transitions. [2025-03-08 01:42:57,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2025-03-08 01:42:57,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:42:57,887 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 01:42:57,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 01:42:57,887 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:42:57,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:42:57,888 INFO L85 PathProgramCache]: Analyzing trace with hash 357858397, now seen corresponding path program 1 times [2025-03-08 01:42:57,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:42:57,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804123705] [2025-03-08 01:42:57,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:42:57,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:42:57,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-03-08 01:42:57,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-03-08 01:42:57,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:42:57,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:42:58,052 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-08 01:42:58,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:42:58,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804123705] [2025-03-08 01:42:58,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804123705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:42:58,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:42:58,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:42:58,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24423936] [2025-03-08 01:42:58,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:42:58,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:42:58,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:42:58,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:42:58,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:42:58,054 INFO L87 Difference]: Start difference. First operand 3380 states and 4070 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:42:58,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:42:58,671 INFO L93 Difference]: Finished difference Result 7687 states and 9341 transitions. [2025-03-08 01:42:58,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:42:58,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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 240 [2025-03-08 01:42:58,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:42:58,683 INFO L225 Difference]: With dead ends: 7687 [2025-03-08 01:42:58,683 INFO L226 Difference]: Without dead ends: 4309 [2025-03-08 01:42:58,687 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-03-08 01:42:58,687 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 139 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:42:58,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 381 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 01:42:58,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4309 states. [2025-03-08 01:42:58,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4309 to 4300. [2025-03-08 01:42:58,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4300 states, 4299 states have (on average 1.1886485229123052) internal successors, (5110), 4299 states have internal predecessors, (5110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:42:58,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4300 states to 4300 states and 5110 transitions. [2025-03-08 01:42:58,747 INFO L78 Accepts]: Start accepts. Automaton has 4300 states and 5110 transitions. Word has length 240 [2025-03-08 01:42:58,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:42:58,748 INFO L471 AbstractCegarLoop]: Abstraction has 4300 states and 5110 transitions. [2025-03-08 01:42:58,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:42:58,748 INFO L276 IsEmpty]: Start isEmpty. Operand 4300 states and 5110 transitions. [2025-03-08 01:42:58,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-03-08 01:42:58,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:42:58,751 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 01:42:58,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 01:42:58,751 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:42:58,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:42:58,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1243186603, now seen corresponding path program 1 times [2025-03-08 01:42:58,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:42:58,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408340895] [2025-03-08 01:42:58,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:42:58,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:42:58,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-03-08 01:42:58,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-03-08 01:42:58,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:42:58,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:42:59,084 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:42:59,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:42:59,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408340895] [2025-03-08 01:42:59,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408340895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:42:59,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:42:59,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 01:42:59,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892169447] [2025-03-08 01:42:59,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:42:59,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:42:59,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:42:59,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:42:59,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:42:59,085 INFO L87 Difference]: Start difference. First operand 4300 states and 5110 transitions. Second operand has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:43:00,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:43:00,220 INFO L93 Difference]: Finished difference Result 13236 states and 15983 transitions. [2025-03-08 01:43:00,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:43:00,223 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 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 260 [2025-03-08 01:43:00,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:43:00,244 INFO L225 Difference]: With dead ends: 13236 [2025-03-08 01:43:00,245 INFO L226 Difference]: Without dead ends: 8938 [2025-03-08 01:43:00,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:43:00,251 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 274 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 1238 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 1374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 1238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 01:43:00,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 229 Invalid, 1374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 1238 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 01:43:00,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8938 states. [2025-03-08 01:43:00,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8938 to 7637. [2025-03-08 01:43:00,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7637 states, 7636 states have (on average 1.1830801466736511) internal successors, (9034), 7636 states have internal predecessors, (9034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:43:00,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7637 states to 7637 states and 9034 transitions. [2025-03-08 01:43:00,379 INFO L78 Accepts]: Start accepts. Automaton has 7637 states and 9034 transitions. Word has length 260 [2025-03-08 01:43:00,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:43:00,379 INFO L471 AbstractCegarLoop]: Abstraction has 7637 states and 9034 transitions. [2025-03-08 01:43:00,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:43:00,379 INFO L276 IsEmpty]: Start isEmpty. Operand 7637 states and 9034 transitions. [2025-03-08 01:43:00,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-03-08 01:43:00,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:43:00,383 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 01:43:00,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 01:43:00,383 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:43:00,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:43:00,383 INFO L85 PathProgramCache]: Analyzing trace with hash 41162290, now seen corresponding path program 1 times [2025-03-08 01:43:00,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:43:00,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749524305] [2025-03-08 01:43:00,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:43:00,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:43:00,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-08 01:43:00,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-08 01:43:00,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:43:00,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:43:00,566 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:43:00,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:43:00,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749524305] [2025-03-08 01:43:00,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749524305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:43:00,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:43:00,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:43:00,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62156043] [2025-03-08 01:43:00,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:43:00,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:43:00,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:43:00,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:43:00,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:43:00,569 INFO L87 Difference]: Start difference. First operand 7637 states and 9034 transitions. Second operand has 4 states, 4 states have (on average 67.5) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:43:01,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:43:01,651 INFO L93 Difference]: Finished difference Result 22305 states and 26765 transitions. [2025-03-08 01:43:01,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:43:01,652 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 67.5) internal successors, (270), 3 states have internal predecessors, (270), 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 270 [2025-03-08 01:43:01,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:43:01,688 INFO L225 Difference]: With dead ends: 22305 [2025-03-08 01:43:01,688 INFO L226 Difference]: Without dead ends: 14670 [2025-03-08 01:43:01,696 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-03-08 01:43:01,698 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 277 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1185 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 1349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 1185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 01:43:01,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 97 Invalid, 1349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 1185 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 01:43:01,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14670 states. [2025-03-08 01:43:01,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14670 to 14485. [2025-03-08 01:43:01,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14485 states, 14484 states have (on average 1.1892433029549847) internal successors, (17225), 14484 states have internal predecessors, (17225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:43:01,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14485 states to 14485 states and 17225 transitions. [2025-03-08 01:43:01,868 INFO L78 Accepts]: Start accepts. Automaton has 14485 states and 17225 transitions. Word has length 270 [2025-03-08 01:43:01,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:43:01,868 INFO L471 AbstractCegarLoop]: Abstraction has 14485 states and 17225 transitions. [2025-03-08 01:43:01,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.5) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:43:01,869 INFO L276 IsEmpty]: Start isEmpty. Operand 14485 states and 17225 transitions. [2025-03-08 01:43:01,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-03-08 01:43:01,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:43:01,873 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 01:43:01,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 01:43:01,873 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:43:01,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:43:01,876 INFO L85 PathProgramCache]: Analyzing trace with hash 932236754, now seen corresponding path program 1 times [2025-03-08 01:43:01,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:43:01,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794972637] [2025-03-08 01:43:01,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:43:01,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:43:01,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-08 01:43:01,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-08 01:43:01,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:43:01,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:43:02,140 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:43:02,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:43:02,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794972637] [2025-03-08 01:43:02,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794972637] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:43:02,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:43:02,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 01:43:02,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001082895] [2025-03-08 01:43:02,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:43:02,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:43:02,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:43:02,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:43:02,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:43:02,142 INFO L87 Difference]: Start difference. First operand 14485 states and 17225 transitions. Second operand has 4 states, 4 states have (on average 67.5) internal successors, (270), 4 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:43:03,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:43:03,259 INFO L93 Difference]: Finished difference Result 33766 states and 40838 transitions. [2025-03-08 01:43:03,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:43:03,259 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 67.5) internal successors, (270), 4 states have internal predecessors, (270), 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 270 [2025-03-08 01:43:03,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:43:03,289 INFO L225 Difference]: With dead ends: 33766 [2025-03-08 01:43:03,289 INFO L226 Difference]: Without dead ends: 19652 [2025-03-08 01:43:03,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:43:03,301 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 285 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1125 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 1331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 1125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 01:43:03,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 131 Invalid, 1331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 1125 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 01:43:03,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19652 states. [2025-03-08 01:43:03,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19652 to 19638. [2025-03-08 01:43:03,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19638 states, 19637 states have (on average 1.1967204766512196) internal successors, (23500), 19637 states have internal predecessors, (23500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:43:03,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19638 states to 19638 states and 23500 transitions. [2025-03-08 01:43:03,485 INFO L78 Accepts]: Start accepts. Automaton has 19638 states and 23500 transitions. Word has length 270 [2025-03-08 01:43:03,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:43:03,485 INFO L471 AbstractCegarLoop]: Abstraction has 19638 states and 23500 transitions. [2025-03-08 01:43:03,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.5) internal successors, (270), 4 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:43:03,485 INFO L276 IsEmpty]: Start isEmpty. Operand 19638 states and 23500 transitions. [2025-03-08 01:43:03,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2025-03-08 01:43:03,490 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:43:03,490 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 01:43:03,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 01:43:03,490 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:43:03,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:43:03,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1658401841, now seen corresponding path program 1 times [2025-03-08 01:43:03,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:43:03,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467411739] [2025-03-08 01:43:03,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:43:03,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:43:03,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-03-08 01:43:03,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-03-08 01:43:03,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:43:03,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:43:03,677 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-08 01:43:03,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:43:03,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467411739] [2025-03-08 01:43:03,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467411739] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:43:03,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:43:03,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:43:03,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210851557] [2025-03-08 01:43:03,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:43:03,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:43:03,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:43:03,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:43:03,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:43:03,678 INFO L87 Difference]: Start difference. First operand 19638 states and 23500 transitions. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:43:04,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:43:04,355 INFO L93 Difference]: Finished difference Result 39102 states and 46833 transitions. [2025-03-08 01:43:04,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:43:04,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 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 277 [2025-03-08 01:43:04,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:43:04,386 INFO L225 Difference]: With dead ends: 39102 [2025-03-08 01:43:04,386 INFO L226 Difference]: Without dead ends: 19650 [2025-03-08 01:43:04,402 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-03-08 01:43:04,402 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 143 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:43:04,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 378 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 01:43:04,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19650 states. [2025-03-08 01:43:04,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19650 to 19453. [2025-03-08 01:43:04,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19453 states, 19452 states have (on average 1.1614229899239152) internal successors, (22592), 19452 states have internal predecessors, (22592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:43:04,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19453 states to 19453 states and 22592 transitions. [2025-03-08 01:43:04,574 INFO L78 Accepts]: Start accepts. Automaton has 19453 states and 22592 transitions. Word has length 277 [2025-03-08 01:43:04,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:43:04,574 INFO L471 AbstractCegarLoop]: Abstraction has 19453 states and 22592 transitions. [2025-03-08 01:43:04,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:43:04,575 INFO L276 IsEmpty]: Start isEmpty. Operand 19453 states and 22592 transitions. [2025-03-08 01:43:04,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2025-03-08 01:43:04,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:43:04,581 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 01:43:04,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 01:43:04,582 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:43:04,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:43:04,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1232215594, now seen corresponding path program 1 times [2025-03-08 01:43:04,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:43:04,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332852522] [2025-03-08 01:43:04,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:43:04,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:43:04,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-03-08 01:43:04,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-03-08 01:43:04,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:43:04,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:43:04,825 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:43:04,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:43:04,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332852522] [2025-03-08 01:43:04,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332852522] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:43:04,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:43:04,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:43:04,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775991820] [2025-03-08 01:43:04,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:43:04,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:43:04,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:43:04,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:43:04,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:43:04,826 INFO L87 Difference]: Start difference. First operand 19453 states and 22592 transitions. Second operand has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:43:05,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:43:05,647 INFO L93 Difference]: Finished difference Result 41291 states and 48303 transitions. [2025-03-08 01:43:05,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:43:05,648 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 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 291 [2025-03-08 01:43:05,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:43:05,680 INFO L225 Difference]: With dead ends: 41291 [2025-03-08 01:43:05,680 INFO L226 Difference]: Without dead ends: 21472 [2025-03-08 01:43:05,692 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-03-08 01:43:05,693 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 215 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 01:43:05,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 171 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 01:43:05,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21472 states. [2025-03-08 01:43:05,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21472 to 18323. [2025-03-08 01:43:05,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18323 states, 18322 states have (on average 1.125422988756686) internal successors, (20620), 18322 states have internal predecessors, (20620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:43:05,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18323 states to 18323 states and 20620 transitions. [2025-03-08 01:43:05,862 INFO L78 Accepts]: Start accepts. Automaton has 18323 states and 20620 transitions. Word has length 291 [2025-03-08 01:43:05,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:43:05,863 INFO L471 AbstractCegarLoop]: Abstraction has 18323 states and 20620 transitions. [2025-03-08 01:43:05,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:43:05,863 INFO L276 IsEmpty]: Start isEmpty. Operand 18323 states and 20620 transitions. [2025-03-08 01:43:05,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-03-08 01:43:05,869 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:43:05,869 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, 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, 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-03-08 01:43:05,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 01:43:05,869 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:43:05,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:43:05,870 INFO L85 PathProgramCache]: Analyzing trace with hash 611012776, now seen corresponding path program 1 times [2025-03-08 01:43:05,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:43:05,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860276197] [2025-03-08 01:43:05,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:43:05,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:43:05,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-03-08 01:43:05,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-03-08 01:43:05,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:43:05,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:43:05,986 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2025-03-08 01:43:05,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:43:05,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860276197] [2025-03-08 01:43:05,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860276197] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:43:05,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:43:05,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:43:05,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236707180] [2025-03-08 01:43:05,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:43:05,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:43:05,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:43:05,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:43:05,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:43:05,987 INFO L87 Difference]: Start difference. First operand 18323 states and 20620 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:43:06,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:43:06,532 INFO L93 Difference]: Finished difference Result 38295 states and 43076 transitions. [2025-03-08 01:43:06,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:43:06,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 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 325 [2025-03-08 01:43:06,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:43:06,557 INFO L225 Difference]: With dead ends: 38295 [2025-03-08 01:43:06,557 INFO L226 Difference]: Without dead ends: 22370 [2025-03-08 01:43:06,570 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-03-08 01:43:06,570 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 164 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 01:43:06,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 147 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 01:43:06,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22370 states. [2025-03-08 01:43:06,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22370 to 13714. [2025-03-08 01:43:06,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13714 states, 13713 states have (on average 1.1335958579450156) internal successors, (15545), 13713 states have internal predecessors, (15545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:43:06,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13714 states to 13714 states and 15545 transitions. [2025-03-08 01:43:06,722 INFO L78 Accepts]: Start accepts. Automaton has 13714 states and 15545 transitions. Word has length 325 [2025-03-08 01:43:06,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:43:06,723 INFO L471 AbstractCegarLoop]: Abstraction has 13714 states and 15545 transitions. [2025-03-08 01:43:06,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:43:06,723 INFO L276 IsEmpty]: Start isEmpty. Operand 13714 states and 15545 transitions. [2025-03-08 01:43:06,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2025-03-08 01:43:06,728 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:43:06,728 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 01:43:06,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 01:43:06,729 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:43:06,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:43:06,729 INFO L85 PathProgramCache]: Analyzing trace with hash -112656828, now seen corresponding path program 1 times [2025-03-08 01:43:06,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:43:06,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501453942] [2025-03-08 01:43:06,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:43:06,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:43:06,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes. [2025-03-08 01:43:06,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements. [2025-03-08 01:43:06,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:43:06,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:43:07,078 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 247 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:43:07,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:43:07,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501453942] [2025-03-08 01:43:07,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501453942] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:43:07,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:43:07,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:43:07,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515360937] [2025-03-08 01:43:07,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:43:07,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:43:07,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:43:07,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:43:07,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:43:07,080 INFO L87 Difference]: Start difference. First operand 13714 states and 15545 transitions. Second operand has 4 states, 4 states have (on average 84.5) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:43:07,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:43:07,991 INFO L93 Difference]: Finished difference Result 32592 states and 36987 transitions. [2025-03-08 01:43:07,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:43:07,992 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 84.5) internal successors, (338), 3 states have internal predecessors, (338), 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 338 [2025-03-08 01:43:07,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:43:08,013 INFO L225 Difference]: With dead ends: 32592 [2025-03-08 01:43:08,013 INFO L226 Difference]: Without dead ends: 18880 [2025-03-08 01:43:08,024 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-03-08 01:43:08,025 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 157 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1093 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 1093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 01:43:08,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 119 Invalid, 1312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 1093 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 01:43:08,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18880 states. [2025-03-08 01:43:08,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18880 to 18137. [2025-03-08 01:43:08,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18137 states, 18136 states have (on average 1.1295213939126598) internal successors, (20485), 18136 states have internal predecessors, (20485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:43:08,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18137 states to 18137 states and 20485 transitions. [2025-03-08 01:43:08,187 INFO L78 Accepts]: Start accepts. Automaton has 18137 states and 20485 transitions. Word has length 338 [2025-03-08 01:43:08,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:43:08,188 INFO L471 AbstractCegarLoop]: Abstraction has 18137 states and 20485 transitions. [2025-03-08 01:43:08,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.5) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:43:08,188 INFO L276 IsEmpty]: Start isEmpty. Operand 18137 states and 20485 transitions. [2025-03-08 01:43:08,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2025-03-08 01:43:08,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:43:08,194 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, 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, 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] [2025-03-08 01:43:08,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 01:43:08,194 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:43:08,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:43:08,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1854720918, now seen corresponding path program 1 times [2025-03-08 01:43:08,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:43:08,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016902042] [2025-03-08 01:43:08,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:43:08,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:43:08,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-03-08 01:43:08,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-03-08 01:43:08,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:43:08,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:43:08,698 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 267 proven. 74 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-08 01:43:08,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:43:08,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016902042] [2025-03-08 01:43:08,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016902042] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:43:08,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055509393] [2025-03-08 01:43:08,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:43:08,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:43:08,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:43:08,702 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 01:43:08,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 01:43:08,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-03-08 01:43:08,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-03-08 01:43:08,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:43:08,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:43:08,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 01:43:08,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:43:09,240 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 341 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-08 01:43:09,240 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:43:09,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055509393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:43:09,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:43:09,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-08 01:43:09,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274602937] [2025-03-08 01:43:09,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:43:09,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:43:09,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:43:09,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:43:09,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-08 01:43:09,242 INFO L87 Difference]: Start difference. First operand 18137 states and 20485 transitions. Second operand has 4 states, 4 states have (on average 65.5) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:43:09,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:43:09,922 INFO L93 Difference]: Finished difference Result 42172 states and 47482 transitions. [2025-03-08 01:43:09,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:43:09,923 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 65.5) internal successors, (262), 3 states have internal predecessors, (262), 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 345 [2025-03-08 01:43:09,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:43:09,948 INFO L225 Difference]: With dead ends: 42172 [2025-03-08 01:43:09,948 INFO L226 Difference]: Without dead ends: 24405 [2025-03-08 01:43:09,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-08 01:43:09,963 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 294 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:43:09,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 155 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 01:43:09,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24405 states. [2025-03-08 01:43:10,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24405 to 23665. [2025-03-08 01:43:10,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23665 states, 23664 states have (on average 1.1230138607167004) internal successors, (26575), 23664 states have internal predecessors, (26575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:43:10,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23665 states to 23665 states and 26575 transitions. [2025-03-08 01:43:10,246 INFO L78 Accepts]: Start accepts. Automaton has 23665 states and 26575 transitions. Word has length 345 [2025-03-08 01:43:10,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:43:10,246 INFO L471 AbstractCegarLoop]: Abstraction has 23665 states and 26575 transitions. [2025-03-08 01:43:10,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.5) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:43:10,246 INFO L276 IsEmpty]: Start isEmpty. Operand 23665 states and 26575 transitions. [2025-03-08 01:43:10,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2025-03-08 01:43:10,253 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:43:10,254 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, 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, 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-03-08 01:43:10,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 01:43:10,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-08 01:43:10,454 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:43:10,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:43:10,455 INFO L85 PathProgramCache]: Analyzing trace with hash -2024517557, now seen corresponding path program 1 times [2025-03-08 01:43:10,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:43:10,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496417433] [2025-03-08 01:43:10,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:43:10,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:43:10,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes. [2025-03-08 01:43:10,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-03-08 01:43:10,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:43:10,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:43:10,779 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-03-08 01:43:10,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:43:10,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496417433] [2025-03-08 01:43:10,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496417433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:43:10,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:43:10,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 01:43:10,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080472618] [2025-03-08 01:43:10,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:43:10,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 01:43:10,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:43:10,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 01:43:10,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 01:43:10,780 INFO L87 Difference]: Start difference. First operand 23665 states and 26575 transitions. Second operand has 7 states, 7 states have (on average 39.57142857142857) internal successors, (277), 6 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:43:11,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:43:11,517 INFO L93 Difference]: Finished difference Result 45656 states and 51300 transitions. [2025-03-08 01:43:11,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 01:43:11,517 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 39.57142857142857) internal successors, (277), 6 states have internal predecessors, (277), 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 362 [2025-03-08 01:43:11,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:43:11,541 INFO L225 Difference]: With dead ends: 45656 [2025-03-08 01:43:11,541 INFO L226 Difference]: Without dead ends: 21989 [2025-03-08 01:43:11,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 01:43:11,558 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 217 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1354 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 1366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:43:11,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 112 Invalid, 1366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1354 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 01:43:11,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21989 states. [2025-03-08 01:43:11,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21989 to 21978. [2025-03-08 01:43:11,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21978 states, 21977 states have (on average 1.1213086408517996) internal successors, (24643), 21977 states have internal predecessors, (24643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:43:11,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21978 states to 21978 states and 24643 transitions. [2025-03-08 01:43:11,811 INFO L78 Accepts]: Start accepts. Automaton has 21978 states and 24643 transitions. Word has length 362 [2025-03-08 01:43:11,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:43:11,812 INFO L471 AbstractCegarLoop]: Abstraction has 21978 states and 24643 transitions. [2025-03-08 01:43:11,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 39.57142857142857) internal successors, (277), 6 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:43:11,812 INFO L276 IsEmpty]: Start isEmpty. Operand 21978 states and 24643 transitions. [2025-03-08 01:43:11,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2025-03-08 01:43:11,822 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:43:11,822 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, 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, 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-03-08 01:43:11,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 01:43:11,822 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:43:11,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:43:11,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1462797359, now seen corresponding path program 1 times [2025-03-08 01:43:11,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:43:11,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947883340] [2025-03-08 01:43:11,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:43:11,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:43:11,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 367 statements into 1 equivalence classes. [2025-03-08 01:43:11,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 367 of 367 statements. [2025-03-08 01:43:11,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:43:11,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:43:12,157 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 346 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-08 01:43:12,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:43:12,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947883340] [2025-03-08 01:43:12,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947883340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:43:12,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:43:12,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 01:43:12,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677207307] [2025-03-08 01:43:12,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:43:12,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:43:12,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:43:12,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:43:12,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:43:12,159 INFO L87 Difference]: Start difference. First operand 21978 states and 24643 transitions. Second operand has 4 states, 4 states have (on average 68.0) internal successors, (272), 4 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:43:13,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:43:13,108 INFO L93 Difference]: Finished difference Result 47459 states and 53284 transitions. [2025-03-08 01:43:13,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:43:13,108 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 68.0) internal successors, (272), 4 states have internal predecessors, (272), 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 367 [2025-03-08 01:43:13,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:43:13,137 INFO L225 Difference]: With dead ends: 47459 [2025-03-08 01:43:13,137 INFO L226 Difference]: Without dead ends: 26215 [2025-03-08 01:43:13,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:43:13,151 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 273 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1378 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 1478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 01:43:13,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 341 Invalid, 1478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1378 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 01:43:13,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26215 states. [2025-03-08 01:43:13,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26215 to 22335. [2025-03-08 01:43:13,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22335 states, 22334 states have (on average 1.0929972239634638) internal successors, (24411), 22334 states have internal predecessors, (24411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:43:13,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22335 states to 22335 states and 24411 transitions. [2025-03-08 01:43:13,349 INFO L78 Accepts]: Start accepts. Automaton has 22335 states and 24411 transitions. Word has length 367 [2025-03-08 01:43:13,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:43:13,350 INFO L471 AbstractCegarLoop]: Abstraction has 22335 states and 24411 transitions. [2025-03-08 01:43:13,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.0) internal successors, (272), 4 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:43:13,350 INFO L276 IsEmpty]: Start isEmpty. Operand 22335 states and 24411 transitions. [2025-03-08 01:43:13,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2025-03-08 01:43:13,361 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:43:13,361 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 01:43:13,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 01:43:13,361 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:43:13,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:43:13,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1906335889, now seen corresponding path program 1 times [2025-03-08 01:43:13,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:43:13,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825604276] [2025-03-08 01:43:13,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:43:13,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:43:13,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 470 statements into 1 equivalence classes. [2025-03-08 01:43:13,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 470 of 470 statements. [2025-03-08 01:43:13,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:43:13,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:43:14,036 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 154 proven. 346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:43:14,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:43:14,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825604276] [2025-03-08 01:43:14,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825604276] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:43:14,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290299740] [2025-03-08 01:43:14,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:43:14,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:43:14,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:43:14,039 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 01:43:14,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 01:43:14,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 470 statements into 1 equivalence classes. [2025-03-08 01:43:14,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 470 of 470 statements. [2025-03-08 01:43:14,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:43:14,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:43:14,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 01:43:14,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:43:15,360 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 154 proven. 346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:43:15,360 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 01:43:18,064 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 257 proven. 243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:43:18,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290299740] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 01:43:18,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 01:43:18,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-08 01:43:18,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63139170] [2025-03-08 01:43:18,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 01:43:18,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 01:43:18,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:43:18,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 01:43:18,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2025-03-08 01:43:18,066 INFO L87 Difference]: Start difference. First operand 22335 states and 24411 transitions. Second operand has 13 states, 13 states have (on average 104.0) internal successors, (1352), 12 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:43:21,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:43:21,555 INFO L93 Difference]: Finished difference Result 50200 states and 54887 transitions. [2025-03-08 01:43:21,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 01:43:21,556 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 104.0) internal successors, (1352), 12 states have internal predecessors, (1352), 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 470 [2025-03-08 01:43:21,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:43:21,583 INFO L225 Difference]: With dead ends: 50200 [2025-03-08 01:43:21,583 INFO L226 Difference]: Without dead ends: 28051 [2025-03-08 01:43:21,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 950 GetRequests, 932 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=245, Unknown=0, NotChecked=0, Total=380 [2025-03-08 01:43:21,599 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 1439 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 6901 mSolverCounterSat, 666 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1439 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 7567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 666 IncrementalHoareTripleChecker+Valid, 6901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-03-08 01:43:21,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1439 Valid, 229 Invalid, 7567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [666 Valid, 6901 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-03-08 01:43:21,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28051 states. [2025-03-08 01:43:21,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28051 to 22519. [2025-03-08 01:43:21,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22519 states, 22518 states have (on average 1.0893063327116086) internal successors, (24529), 22518 states have internal predecessors, (24529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:43:21,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22519 states to 22519 states and 24529 transitions. [2025-03-08 01:43:21,793 INFO L78 Accepts]: Start accepts. Automaton has 22519 states and 24529 transitions. Word has length 470 [2025-03-08 01:43:21,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:43:21,793 INFO L471 AbstractCegarLoop]: Abstraction has 22519 states and 24529 transitions. [2025-03-08 01:43:21,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 104.0) internal successors, (1352), 12 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:43:21,794 INFO L276 IsEmpty]: Start isEmpty. Operand 22519 states and 24529 transitions. [2025-03-08 01:43:21,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2025-03-08 01:43:21,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:43:21,809 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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] [2025-03-08 01:43:21,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 01:43:22,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-08 01:43:22,010 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:43:22,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:43:22,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1047883531, now seen corresponding path program 1 times [2025-03-08 01:43:22,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:43:22,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036499584] [2025-03-08 01:43:22,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:43:22,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:43:22,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 574 statements into 1 equivalence classes. [2025-03-08 01:43:22,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 574 of 574 statements. [2025-03-08 01:43:22,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:43:22,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:43:22,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1144 backedges. 629 proven. 0 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2025-03-08 01:43:22,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:43:22,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036499584] [2025-03-08 01:43:22,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036499584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:43:22,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:43:22,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:43:22,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106948567] [2025-03-08 01:43:22,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:43:22,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:43:22,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:43:22,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:43:22,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:43:22,228 INFO L87 Difference]: Start difference. First operand 22519 states and 24529 transitions. Second operand has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:43:22,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:43:22,764 INFO L93 Difference]: Finished difference Result 43398 states and 47254 transitions. [2025-03-08 01:43:22,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:43:22,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 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 574 [2025-03-08 01:43:22,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:43:22,783 INFO L225 Difference]: With dead ends: 43398 [2025-03-08 01:43:22,783 INFO L226 Difference]: Without dead ends: 23091 [2025-03-08 01:43:22,789 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-03-08 01:43:22,789 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 105 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 01:43:22,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 138 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 01:43:22,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23091 states. [2025-03-08 01:43:22,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23091 to 15705. [2025-03-08 01:43:22,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15705 states, 15704 states have (on average 1.087493632195619) internal successors, (17078), 15704 states have internal predecessors, (17078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:43:22,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15705 states to 15705 states and 17078 transitions. [2025-03-08 01:43:22,920 INFO L78 Accepts]: Start accepts. Automaton has 15705 states and 17078 transitions. Word has length 574 [2025-03-08 01:43:22,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:43:22,920 INFO L471 AbstractCegarLoop]: Abstraction has 15705 states and 17078 transitions. [2025-03-08 01:43:22,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:43:22,921 INFO L276 IsEmpty]: Start isEmpty. Operand 15705 states and 17078 transitions. [2025-03-08 01:43:22,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2025-03-08 01:43:22,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:43:22,929 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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] [2025-03-08 01:43:22,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 01:43:22,929 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:43:22,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:43:22,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1415336186, now seen corresponding path program 1 times [2025-03-08 01:43:22,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:43:22,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614154057] [2025-03-08 01:43:22,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:43:22,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:43:22,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 575 statements into 1 equivalence classes. [2025-03-08 01:43:22,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 575 of 575 statements. [2025-03-08 01:43:22,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:43:22,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:43:23,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1144 backedges. 629 proven. 0 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2025-03-08 01:43:23,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:43:23,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614154057] [2025-03-08 01:43:23,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614154057] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:43:23,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:43:23,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:43:23,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826129843] [2025-03-08 01:43:23,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:43:23,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:43:23,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:43:23,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:43:23,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:43:23,079 INFO L87 Difference]: Start difference. First operand 15705 states and 17078 transitions. Second operand has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:43:23,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:43:23,485 INFO L93 Difference]: Finished difference Result 31772 states and 34523 transitions. [2025-03-08 01:43:23,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:43:23,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 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 575 [2025-03-08 01:43:23,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:43:23,501 INFO L225 Difference]: With dead ends: 31772 [2025-03-08 01:43:23,501 INFO L226 Difference]: Without dead ends: 16437 [2025-03-08 01:43:23,511 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-03-08 01:43:23,511 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 100 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 01:43:23,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 129 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 01:43:23,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16437 states. [2025-03-08 01:43:23,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16437 to 14959. [2025-03-08 01:43:23,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14959 states, 14958 states have (on average 1.082765075544859) internal successors, (16196), 14958 states have internal predecessors, (16196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:43:23,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14959 states to 14959 states and 16196 transitions. [2025-03-08 01:43:23,630 INFO L78 Accepts]: Start accepts. Automaton has 14959 states and 16196 transitions. Word has length 575 [2025-03-08 01:43:23,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:43:23,630 INFO L471 AbstractCegarLoop]: Abstraction has 14959 states and 16196 transitions. [2025-03-08 01:43:23,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:43:23,631 INFO L276 IsEmpty]: Start isEmpty. Operand 14959 states and 16196 transitions. [2025-03-08 01:43:23,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 626 [2025-03-08 01:43:23,639 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:43:23,640 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:43:23,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 01:43:23,640 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:43:23,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:43:23,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1083814638, now seen corresponding path program 1 times [2025-03-08 01:43:23,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:43:23,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485353491] [2025-03-08 01:43:23,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:43:23,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:43:23,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 625 statements into 1 equivalence classes. [2025-03-08 01:43:23,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 625 of 625 statements. [2025-03-08 01:43:23,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:43:23,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:43:23,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 762 proven. 0 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2025-03-08 01:43:23,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:43:23,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485353491] [2025-03-08 01:43:23,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485353491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:43:23,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:43:23,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:43:23,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933847985] [2025-03-08 01:43:23,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:43:23,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:43:23,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:43:23,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:43:23,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:43:23,826 INFO L87 Difference]: Start difference. First operand 14959 states and 16196 transitions. Second operand has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:43:24,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:43:24,282 INFO L93 Difference]: Finished difference Result 28255 states and 30572 transitions. [2025-03-08 01:43:24,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:43:24,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 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 625 [2025-03-08 01:43:24,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:43:24,294 INFO L225 Difference]: With dead ends: 28255 [2025-03-08 01:43:24,294 INFO L226 Difference]: Without dead ends: 13850 [2025-03-08 01:43:24,302 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-03-08 01:43:24,303 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 190 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 01:43:24,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 316 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 01:43:24,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13850 states. [2025-03-08 01:43:24,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13850 to 13850. [2025-03-08 01:43:24,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13850 states, 13849 states have (on average 1.075023467398368) internal successors, (14888), 13849 states have internal predecessors, (14888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:43:24,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13850 states to 13850 states and 14888 transitions. [2025-03-08 01:43:24,402 INFO L78 Accepts]: Start accepts. Automaton has 13850 states and 14888 transitions. Word has length 625 [2025-03-08 01:43:24,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:43:24,403 INFO L471 AbstractCegarLoop]: Abstraction has 13850 states and 14888 transitions. [2025-03-08 01:43:24,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:43:24,403 INFO L276 IsEmpty]: Start isEmpty. Operand 13850 states and 14888 transitions. [2025-03-08 01:43:24,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 709 [2025-03-08 01:43:24,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:43:24,415 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2025-03-08 01:43:24,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 01:43:24,415 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:43:24,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:43:24,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1390526711, now seen corresponding path program 1 times [2025-03-08 01:43:24,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:43:24,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308920777] [2025-03-08 01:43:24,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:43:24,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:43:24,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 708 statements into 1 equivalence classes. [2025-03-08 01:43:24,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 708 of 708 statements. [2025-03-08 01:43:24,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:43:24,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:43:24,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1695 backedges. 1124 proven. 0 refuted. 0 times theorem prover too weak. 571 trivial. 0 not checked. [2025-03-08 01:43:24,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:43:24,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308920777] [2025-03-08 01:43:24,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308920777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:43:24,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:43:24,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:43:24,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98402288] [2025-03-08 01:43:24,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:43:24,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:43:24,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:43:24,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:43:24,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:43:24,610 INFO L87 Difference]: Start difference. First operand 13850 states and 14888 transitions. Second operand has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:43:25,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:43:25,071 INFO L93 Difference]: Finished difference Result 27327 states and 29344 transitions. [2025-03-08 01:43:25,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:43:25,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 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 708 [2025-03-08 01:43:25,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:43:25,073 INFO L225 Difference]: With dead ends: 27327 [2025-03-08 01:43:25,073 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 01:43:25,082 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-03-08 01:43:25,083 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 52 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 01:43:25,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 306 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 01:43:25,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 01:43:25,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 01:43:25,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:43:25,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 01:43:25,084 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 708 [2025-03-08 01:43:25,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:43:25,084 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 01:43:25,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:43:25,085 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 01:43:25,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 01:43:25,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 01:43:25,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 01:43:25,089 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:43:25,091 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 01:43:30,598 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 01:43:30,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 01:43:30 BoogieIcfgContainer [2025-03-08 01:43:30,624 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 01:43:30,624 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 01:43:30,628 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 01:43:30,628 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 01:43:30,629 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:42:51" (3/4) ... [2025-03-08 01:43:30,630 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 01:43:30,654 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-08 01:43:30,655 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-08 01:43:30,656 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 01:43:30,656 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 01:43:30,838 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 01:43:30,838 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 01:43:30,838 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 01:43:30,839 INFO L158 Benchmark]: Toolchain (without parser) took 40919.58ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 102.9MB in the beginning and 291.1MB in the end (delta: -188.2MB). Peak memory consumption was 217.7MB. Max. memory is 16.1GB. [2025-03-08 01:43:30,839 INFO L158 Benchmark]: CDTParser took 0.73ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 01:43:30,839 INFO L158 Benchmark]: CACSL2BoogieTranslator took 466.10ms. Allocated memory is still 142.6MB. Free memory was 102.9MB in the beginning and 60.0MB in the end (delta: 42.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-08 01:43:30,839 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.86ms. Allocated memory is still 142.6MB. Free memory was 60.0MB in the beginning and 43.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 01:43:30,842 INFO L158 Benchmark]: Boogie Preprocessor took 153.72ms. Allocated memory is still 142.6MB. Free memory was 43.2MB in the beginning and 80.6MB in the end (delta: -37.4MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB. [2025-03-08 01:43:30,843 INFO L158 Benchmark]: IcfgBuilder took 1248.47ms. Allocated memory is still 142.6MB. Free memory was 80.6MB in the beginning and 35.2MB in the end (delta: 45.4MB). Peak memory consumption was 58.6MB. Max. memory is 16.1GB. [2025-03-08 01:43:30,843 INFO L158 Benchmark]: TraceAbstraction took 38751.12ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 34.3MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 892.5MB. Max. memory is 16.1GB. [2025-03-08 01:43:30,843 INFO L158 Benchmark]: Witness Printer took 213.81ms. Allocated memory was 1.6GB in the beginning and 419.4MB in the end (delta: -1.2GB). Free memory was 1.4GB in the beginning and 291.1MB in the end (delta: 1.1GB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. [2025-03-08 01:43:30,844 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.73ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 466.10ms. Allocated memory is still 142.6MB. Free memory was 102.9MB in the beginning and 60.0MB in the end (delta: 42.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.86ms. Allocated memory is still 142.6MB. Free memory was 60.0MB in the beginning and 43.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 153.72ms. Allocated memory is still 142.6MB. Free memory was 43.2MB in the beginning and 80.6MB in the end (delta: -37.4MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB. * IcfgBuilder took 1248.47ms. Allocated memory is still 142.6MB. Free memory was 80.6MB in the beginning and 35.2MB in the end (delta: 45.4MB). Peak memory consumption was 58.6MB. Max. memory is 16.1GB. * TraceAbstraction took 38751.12ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 34.3MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 892.5MB. Max. memory is 16.1GB. * Witness Printer took 213.81ms. Allocated memory was 1.6GB in the beginning and 419.4MB in the end (delta: -1.2GB). Free memory was 1.4GB in the beginning and 291.1MB in the end (delta: 1.1GB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 190]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 481 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 33.2s, OverallIterations: 22, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 19.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5522 SdHoareTripleChecker+Valid, 16.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5522 mSDsluCounter, 4754 SdHoareTripleChecker+Invalid, 14.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 871 mSDsCounter, 2828 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 23498 IncrementalHoareTripleChecker+Invalid, 26326 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2828 mSolverCounterUnsat, 3883 mSDtfsCounter, 23498 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1363 GetRequests, 1307 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23665occurred in iteration=15, InterpolantAutomatonStates: 88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 22 MinimizatonAttempts, 33506 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 8017 NumberOfCodeBlocks, 8017 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 8462 ConstructedInterpolants, 0 QuantifiedInterpolants, 35507 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1077 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 25 InterpolantComputations, 21 PerfectInterpolantSequences, 9661/10670 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1044]: Location Invariant Derived location invariant: ((((((((((((((((((((((((((((((((a29 <= 277) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && (a25 == 10)) || (((((a25 == 11) && (a3 == 1)) && (a4 == 1)) && (a23 <= 312)) && (a8 == 15))) || (((((a25 == 9) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && (130 <= a29))) || (((((a25 == 11) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && (130 <= a29))) || (((((((long long) a23 + 43) <= 0) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && (a25 == 10))) || (((((((long long) a23 + 43) <= 0) && (a29 <= 140)) && (a25 == 11)) && (a3 == 1)) && (a8 == 15))) || ((((((a29 <= 140) && (a25 == 9)) && (a3 == 1)) && (a23 <= 138)) && (a8 == 15)) && (0 <= ((long long) a23 + 42)))) || ((((a25 == 12) && (((long long) a29 + 275824) <= 0)) && (a3 == 1)) && (a8 == 15))) || ((((((a25 == 12) && (a29 <= 277)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && (130 <= a29))) || ((((a25 == 9) && (a4 == 1)) && (a23 <= 312)) && (a29 <= 130))) || ((((((long long) a23 + 127601) <= 0) && (a25 == 11)) && (a3 == 1)) && (a8 == 15))) || (((((a25 == 13) && (a3 == 1)) && (a23 <= 138)) && (a8 == 15)) && (0 <= ((long long) a23 + 42)))) || (((((a29 <= 275) && (a25 == 12)) && (a3 == 1)) && (a8 == 15)) && (130 <= a29))) || (((((a25 == 12) && (a23 <= 262)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || (((((a25 == 13) && ((a23 < 307) || (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) < 138096))) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || ((((a3 == 1) && (a8 == 15)) && (a25 == 10)) && (a29 <= 130))) || ((((((a29 <= 140) && (a3 == 1)) && (a23 <= 138)) && (a8 == 15)) && (0 <= ((long long) a23 + 42))) && (a25 == 10))) || (((((a25 == 12) && (a3 == 1)) && (a23 <= 138)) && (a8 == 15)) && (0 <= ((long long) a23 + 42)))) || ((((((a25 <= 10) && (a3 == 1)) && (((long long) a23 + 599772) <= 0)) && (a8 == 15)) && (a25 != 9)) && (a29 <= 130))) || (((((((long long) a23 + 127601) <= 0) && (a25 <= 10)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || (((a25 == 9) && (((long long) a23 + 599772) <= 0)) && (a4 == 1))) || (((((((long long) a23 + 43) <= 0) && (a25 == 9)) && (a3 == 1)) && (a8 == 15)) && (130 <= a29))) || (((((((a25 == 11) && (((long long) a29 + 275824) <= 0)) && (a4 == 1)) || ((((a25 == 12) || ((a25 <= 10) && (a25 != 9))) && (((long long) a29 + 275802) <= 0)) && (a4 == 1))) && (a3 == 1)) && (312 <= a23)) && (a8 == 15))) || ((((((a25 <= 10) && (a23 <= 262)) && (a3 == 1)) && (a29 <= 220)) && (a4 == 1)) && (a8 == 15))) || (((((307 <= a23) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && (a25 == 10))) || (((((((long long) a23 + 43) <= 0) && (((long long) a29 + 275824) <= 0)) && (a25 == 9)) && (a3 == 1)) && (a8 == 15))) || (((((((300138 <= a29) && (a25 <= 10)) && (a3 == 1)) && (a4 == 1)) && (312 <= a23)) && (a8 == 15)) && (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) < 483831))) || ((((a25 == 12) && (((long long) a23 + 127601) <= 0)) && (a3 == 1)) && (a8 == 15))) RESULT: Ultimate proved your program to be correct! [2025-03-08 01:43:30,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE