./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem19_label11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem19_label11.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ce9ec331bbd0957d91f023d2cde751d43aea048fc58a1bf2a8faaac825bae047 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:23:21,381 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:23:21,444 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 00:23:21,453 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:23:21,454 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:23:21,478 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:23:21,479 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:23:21,479 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:23:21,480 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:23:21,480 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:23:21,480 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:23:21,480 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:23:21,481 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:23:21,481 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:23:21,481 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:23:21,481 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:23:21,481 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:23:21,482 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:23:21,482 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:23:21,482 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:23:21,482 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:23:21,482 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:23:21,482 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:23:21,482 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:23:21,482 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:23:21,482 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:23:21,482 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:23:21,482 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:23:21,482 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:23:21,482 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:23:21,483 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:23:21,483 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:23:21,483 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:23:21,483 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:23:21,483 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:23:21,483 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:23:21,483 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:23:21,484 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:23:21,484 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:23:21,484 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:23:21,484 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:23:21,484 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:23:21,484 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:23:21,484 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:23:21,484 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:23:21,485 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:23:21,485 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:23:21,485 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:23:21,485 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ce9ec331bbd0957d91f023d2cde751d43aea048fc58a1bf2a8faaac825bae047 [2025-01-09 00:23:21,740 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:23:21,748 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:23:21,750 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:23:21,751 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:23:21,752 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:23:21,752 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem19_label11.c [2025-01-09 00:23:22,888 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bfa4089b7/6e4fbb22dcdc4f338e0c4084147b077f/FLAG66b9676ac [2025-01-09 00:23:23,456 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:23:23,457 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label11.c [2025-01-09 00:23:23,509 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bfa4089b7/6e4fbb22dcdc4f338e0c4084147b077f/FLAG66b9676ac [2025-01-09 00:23:23,960 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bfa4089b7/6e4fbb22dcdc4f338e0c4084147b077f [2025-01-09 00:23:23,962 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:23:23,963 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:23:23,964 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:23:23,964 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:23:23,967 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:23:23,967 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:23:23" (1/1) ... [2025-01-09 00:23:23,968 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18584c78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:23:23, skipping insertion in model container [2025-01-09 00:23:23,968 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:23:23" (1/1) ... [2025-01-09 00:23:24,069 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:23:24,280 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label11.c[2490,2503] [2025-01-09 00:23:25,038 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:23:25,050 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:23:25,058 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label11.c[2490,2503] [2025-01-09 00:23:25,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:23:25,573 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:23:25,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:23:25 WrapperNode [2025-01-09 00:23:25,574 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:23:25,575 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:23:25,575 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:23:25,575 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:23:25,579 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:23:25" (1/1) ... [2025-01-09 00:23:25,667 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:23:25" (1/1) ... [2025-01-09 00:23:26,253 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 9428 [2025-01-09 00:23:26,258 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:23:26,258 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:23:26,259 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:23:26,259 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:23:26,273 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:23:25" (1/1) ... [2025-01-09 00:23:26,276 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:23:25" (1/1) ... [2025-01-09 00:23:26,433 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:23:25" (1/1) ... [2025-01-09 00:23:26,654 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 00:23:26,658 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:23:25" (1/1) ... [2025-01-09 00:23:26,658 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:23:25" (1/1) ... [2025-01-09 00:23:27,040 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:23:25" (1/1) ... [2025-01-09 00:23:27,088 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:23:25" (1/1) ... [2025-01-09 00:23:27,136 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:23:25" (1/1) ... [2025-01-09 00:23:27,209 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:23:25" (1/1) ... [2025-01-09 00:23:27,238 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:23:25" (1/1) ... [2025-01-09 00:23:27,326 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:23:27,327 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:23:27,327 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:23:27,327 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:23:27,328 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:23:25" (1/1) ... [2025-01-09 00:23:27,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:23:27,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:23:27,353 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 00:23:27,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 00:23:27,373 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:23:27,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:23:27,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:23:27,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:23:27,421 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:23:27,422 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:23:33,756 INFO L? ?]: Removed 1320 outVars from TransFormulas that were not future-live. [2025-01-09 00:23:33,756 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:23:33,795 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:23:33,796 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 00:23:33,797 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:23:33 BoogieIcfgContainer [2025-01-09 00:23:33,797 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:23:33,799 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:23:33,801 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:23:33,804 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:23:33,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:23:23" (1/3) ... [2025-01-09 00:23:33,805 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65858665 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:23:33, skipping insertion in model container [2025-01-09 00:23:33,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:23:25" (2/3) ... [2025-01-09 00:23:33,806 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65858665 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:23:33, skipping insertion in model container [2025-01-09 00:23:33,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:23:33" (3/3) ... [2025-01-09 00:23:33,807 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem19_label11.c [2025-01-09 00:23:33,816 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:23:33,818 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem19_label11.c that has 1 procedures, 1748 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:23:33,880 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:23:33,888 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;@5219735, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:23:33,888 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:23:33,894 INFO L276 IsEmpty]: Start isEmpty. Operand has 1748 states, 1746 states have (on average 1.8694158075601375) internal successors, (3264), 1747 states have internal predecessors, (3264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:23:33,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-09 00:23:33,898 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:23:33,898 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:23:33,899 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:23:33,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:23:33,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1192939278, now seen corresponding path program 1 times [2025-01-09 00:23:33,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:23:33,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548746474] [2025-01-09 00:23:33,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:23:33,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:23:33,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 00:23:33,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 00:23:33,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:23:33,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:23:34,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:23:34,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:23:34,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548746474] [2025-01-09 00:23:34,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548746474] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:23:34,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:23:34,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:23:34,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934411109] [2025-01-09 00:23:34,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:23:34,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:23:34,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:23:34,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:23:34,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:23:34,126 INFO L87 Difference]: Start difference. First operand has 1748 states, 1746 states have (on average 1.8694158075601375) internal successors, (3264), 1747 states have internal predecessors, (3264), 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 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:23:40,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:23:40,484 INFO L93 Difference]: Finished difference Result 4975 states and 9413 transitions. [2025-01-09 00:23:40,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:23:40,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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 16 [2025-01-09 00:23:40,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:23:40,511 INFO L225 Difference]: With dead ends: 4975 [2025-01-09 00:23:40,511 INFO L226 Difference]: Without dead ends: 3163 [2025-01-09 00:23:40,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:23:40,522 INFO L435 NwaCegarLoop]: 1354 mSDtfsCounter, 1530 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 4670 mSolverCounterSat, 1123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1530 SdHoareTripleChecker+Valid, 1525 SdHoareTripleChecker+Invalid, 5793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1123 IncrementalHoareTripleChecker+Valid, 4670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:23:40,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1530 Valid, 1525 Invalid, 5793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1123 Valid, 4670 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2025-01-09 00:23:40,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3163 states. [2025-01-09 00:23:40,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3163 to 3123. [2025-01-09 00:23:40,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3123 states, 3122 states have (on average 1.6268417680973735) internal successors, (5079), 3122 states have internal predecessors, (5079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:23:40,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 5079 transitions. [2025-01-09 00:23:40,680 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 5079 transitions. Word has length 16 [2025-01-09 00:23:40,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:23:40,681 INFO L471 AbstractCegarLoop]: Abstraction has 3123 states and 5079 transitions. [2025-01-09 00:23:40,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:23:40,681 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 5079 transitions. [2025-01-09 00:23:40,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-09 00:23:40,682 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:23:40,683 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:23:40,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:23:40,683 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:23:40,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:23:40,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1844203832, now seen corresponding path program 1 times [2025-01-09 00:23:40,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:23:40,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102479171] [2025-01-09 00:23:40,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:23:40,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:23:40,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 00:23:40,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 00:23:40,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:23:40,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:23:40,947 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:23:40,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:23:40,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102479171] [2025-01-09 00:23:40,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102479171] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:23:40,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:23:40,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:23:40,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93300365] [2025-01-09 00:23:40,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:23:40,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:23:40,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:23:40,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:23:40,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:23:40,951 INFO L87 Difference]: Start difference. First operand 3123 states and 5079 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:23:46,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:23:46,058 INFO L93 Difference]: Finished difference Result 9053 states and 14813 transitions. [2025-01-09 00:23:46,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:23:46,058 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 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 87 [2025-01-09 00:23:46,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:23:46,077 INFO L225 Difference]: With dead ends: 9053 [2025-01-09 00:23:46,077 INFO L226 Difference]: Without dead ends: 5932 [2025-01-09 00:23:46,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:23:46,083 INFO L435 NwaCegarLoop]: 1329 mSDtfsCounter, 1534 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 4265 mSolverCounterSat, 1473 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1534 SdHoareTripleChecker+Valid, 1548 SdHoareTripleChecker+Invalid, 5738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1473 IncrementalHoareTripleChecker+Valid, 4265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:23:46,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1534 Valid, 1548 Invalid, 5738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1473 Valid, 4265 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2025-01-09 00:23:46,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5932 states. [2025-01-09 00:23:46,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5932 to 5910. [2025-01-09 00:23:46,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5910 states, 5909 states have (on average 1.423421898798443) internal successors, (8411), 5909 states have internal predecessors, (8411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:23:46,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5910 states to 5910 states and 8411 transitions. [2025-01-09 00:23:46,175 INFO L78 Accepts]: Start accepts. Automaton has 5910 states and 8411 transitions. Word has length 87 [2025-01-09 00:23:46,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:23:46,176 INFO L471 AbstractCegarLoop]: Abstraction has 5910 states and 8411 transitions. [2025-01-09 00:23:46,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:23:46,177 INFO L276 IsEmpty]: Start isEmpty. Operand 5910 states and 8411 transitions. [2025-01-09 00:23:46,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 00:23:46,180 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:23:46,180 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:23:46,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:23:46,181 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:23:46,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:23:46,181 INFO L85 PathProgramCache]: Analyzing trace with hash 572660073, now seen corresponding path program 1 times [2025-01-09 00:23:46,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:23:46,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447710860] [2025-01-09 00:23:46,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:23:46,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:23:46,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 00:23:46,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 00:23:46,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:23:46,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:23:46,390 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:23:46,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:23:46,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447710860] [2025-01-09 00:23:46,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447710860] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:23:46,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:23:46,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:23:46,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365677330] [2025-01-09 00:23:46,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:23:46,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:23:46,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:23:46,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:23:46,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:23:46,392 INFO L87 Difference]: Start difference. First operand 5910 states and 8411 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:23:51,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:23:51,396 INFO L93 Difference]: Finished difference Result 17505 states and 24942 transitions. [2025-01-09 00:23:51,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:23:51,396 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 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 113 [2025-01-09 00:23:51,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:23:51,443 INFO L225 Difference]: With dead ends: 17505 [2025-01-09 00:23:51,444 INFO L226 Difference]: Without dead ends: 11597 [2025-01-09 00:23:51,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:23:51,455 INFO L435 NwaCegarLoop]: 1531 mSDtfsCounter, 1750 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 4227 mSolverCounterSat, 1430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1750 SdHoareTripleChecker+Valid, 1804 SdHoareTripleChecker+Invalid, 5657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1430 IncrementalHoareTripleChecker+Valid, 4227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:23:51,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1750 Valid, 1804 Invalid, 5657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1430 Valid, 4227 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2025-01-09 00:23:51,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11597 states. [2025-01-09 00:23:51,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11597 to 11578. [2025-01-09 00:23:51,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11578 states, 11577 states have (on average 1.2801243845555843) internal successors, (14820), 11577 states have internal predecessors, (14820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:23:51,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11578 states to 11578 states and 14820 transitions. [2025-01-09 00:23:51,631 INFO L78 Accepts]: Start accepts. Automaton has 11578 states and 14820 transitions. Word has length 113 [2025-01-09 00:23:51,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:23:51,631 INFO L471 AbstractCegarLoop]: Abstraction has 11578 states and 14820 transitions. [2025-01-09 00:23:51,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:23:51,631 INFO L276 IsEmpty]: Start isEmpty. Operand 11578 states and 14820 transitions. [2025-01-09 00:23:51,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 00:23:51,634 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:23:51,634 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:23:51,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 00:23:51,634 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:23:51,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:23:51,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1208130773, now seen corresponding path program 1 times [2025-01-09 00:23:51,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:23:51,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205716110] [2025-01-09 00:23:51,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:23:51,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:23:51,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 00:23:51,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 00:23:51,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:23:51,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:23:51,793 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:23:51,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:23:51,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205716110] [2025-01-09 00:23:51,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205716110] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:23:51,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:23:51,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:23:51,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203269171] [2025-01-09 00:23:51,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:23:51,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:23:51,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:23:51,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:23:51,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:23:51,794 INFO L87 Difference]: Start difference. First operand 11578 states and 14820 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:23:56,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:23:56,877 INFO L93 Difference]: Finished difference Result 34273 states and 43832 transitions. [2025-01-09 00:23:56,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:23:56,877 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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 121 [2025-01-09 00:23:56,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:23:56,916 INFO L225 Difference]: With dead ends: 34273 [2025-01-09 00:23:56,916 INFO L226 Difference]: Without dead ends: 22697 [2025-01-09 00:23:56,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:23:56,924 INFO L435 NwaCegarLoop]: 721 mSDtfsCounter, 2497 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 5120 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2497 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 5554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 5120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:23:56,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2497 Valid, 993 Invalid, 5554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 5120 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2025-01-09 00:23:56,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22697 states. [2025-01-09 00:23:57,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22697 to 22694. [2025-01-09 00:23:57,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22694 states, 22693 states have (on average 1.238663905168995) internal successors, (28109), 22693 states have internal predecessors, (28109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:23:57,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22694 states to 22694 states and 28109 transitions. [2025-01-09 00:23:57,169 INFO L78 Accepts]: Start accepts. Automaton has 22694 states and 28109 transitions. Word has length 121 [2025-01-09 00:23:57,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:23:57,170 INFO L471 AbstractCegarLoop]: Abstraction has 22694 states and 28109 transitions. [2025-01-09 00:23:57,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:23:57,171 INFO L276 IsEmpty]: Start isEmpty. Operand 22694 states and 28109 transitions. [2025-01-09 00:23:57,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2025-01-09 00:23:57,177 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:23:57,178 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:23:57,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 00:23:57,178 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:23:57,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:23:57,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1275492641, now seen corresponding path program 1 times [2025-01-09 00:23:57,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:23:57,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860540357] [2025-01-09 00:23:57,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:23:57,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:23:57,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 383 statements into 1 equivalence classes. [2025-01-09 00:23:57,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 383 of 383 statements. [2025-01-09 00:23:57,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:23:57,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:23:58,143 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 00:23:58,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:23:58,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860540357] [2025-01-09 00:23:58,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860540357] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:23:58,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:23:58,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:23:58,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487775852] [2025-01-09 00:23:58,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:23:58,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:23:58,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:23:58,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:23:58,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:23:58,148 INFO L87 Difference]: Start difference. First operand 22694 states and 28109 transitions. Second operand has 4 states, 4 states have (on average 92.5) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:24:04,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:24:04,782 INFO L93 Difference]: Finished difference Result 57752 states and 69837 transitions. [2025-01-09 00:24:04,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:24:04,782 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 92.5) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 383 [2025-01-09 00:24:04,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:24:04,865 INFO L225 Difference]: With dead ends: 57752 [2025-01-09 00:24:04,865 INFO L226 Difference]: Without dead ends: 35060 [2025-01-09 00:24:04,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:24:04,894 INFO L435 NwaCegarLoop]: 1806 mSDtfsCounter, 3756 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 9454 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3756 SdHoareTripleChecker+Valid, 2162 SdHoareTripleChecker+Invalid, 9698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 9454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:24:04,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3756 Valid, 2162 Invalid, 9698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 9454 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2025-01-09 00:24:04,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35060 states. [2025-01-09 00:24:05,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35060 to 32288. [2025-01-09 00:24:05,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32288 states, 32287 states have (on average 1.1912844178771642) internal successors, (38463), 32287 states have internal predecessors, (38463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:24:05,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32288 states to 32288 states and 38463 transitions. [2025-01-09 00:24:05,447 INFO L78 Accepts]: Start accepts. Automaton has 32288 states and 38463 transitions. Word has length 383 [2025-01-09 00:24:05,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:24:05,452 INFO L471 AbstractCegarLoop]: Abstraction has 32288 states and 38463 transitions. [2025-01-09 00:24:05,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.5) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:24:05,452 INFO L276 IsEmpty]: Start isEmpty. Operand 32288 states and 38463 transitions. [2025-01-09 00:24:05,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2025-01-09 00:24:05,458 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:24:05,459 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:24:05,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 00:24:05,459 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:24:05,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:24:05,460 INFO L85 PathProgramCache]: Analyzing trace with hash 2146371705, now seen corresponding path program 1 times [2025-01-09 00:24:05,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:24:05,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910438210] [2025-01-09 00:24:05,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:24:05,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:24:05,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 411 statements into 1 equivalence classes. [2025-01-09 00:24:05,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 411 of 411 statements. [2025-01-09 00:24:05,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:24:05,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:24:06,093 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:24:06,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:24:06,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910438210] [2025-01-09 00:24:06,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910438210] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:24:06,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:24:06,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:24:06,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265338406] [2025-01-09 00:24:06,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:24:06,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:24:06,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:24:06,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:24:06,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:24:06,097 INFO L87 Difference]: Start difference. First operand 32288 states and 38463 transitions. Second operand has 4 states, 4 states have (on average 102.75) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:24:11,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:24:11,261 INFO L93 Difference]: Finished difference Result 67335 states and 79703 transitions. [2025-01-09 00:24:11,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:24:11,261 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 102.75) internal successors, (411), 3 states have internal predecessors, (411), 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 411 [2025-01-09 00:24:11,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:24:11,309 INFO L225 Difference]: With dead ends: 67335 [2025-01-09 00:24:11,309 INFO L226 Difference]: Without dead ends: 35018 [2025-01-09 00:24:11,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:24:11,331 INFO L435 NwaCegarLoop]: 1776 mSDtfsCounter, 1138 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 7327 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1138 SdHoareTripleChecker+Valid, 2118 SdHoareTripleChecker+Invalid, 7335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 7327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:24:11,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1138 Valid, 2118 Invalid, 7335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 7327 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2025-01-09 00:24:11,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35018 states. [2025-01-09 00:24:11,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35018 to 35018. [2025-01-09 00:24:11,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35018 states, 35017 states have (on average 1.1765142645000999) internal successors, (41198), 35017 states have internal predecessors, (41198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:24:11,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35018 states to 35018 states and 41198 transitions. [2025-01-09 00:24:11,766 INFO L78 Accepts]: Start accepts. Automaton has 35018 states and 41198 transitions. Word has length 411 [2025-01-09 00:24:11,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:24:11,767 INFO L471 AbstractCegarLoop]: Abstraction has 35018 states and 41198 transitions. [2025-01-09 00:24:11,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.75) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:24:11,767 INFO L276 IsEmpty]: Start isEmpty. Operand 35018 states and 41198 transitions. [2025-01-09 00:24:11,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2025-01-09 00:24:11,774 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:24:11,775 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:24:11,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 00:24:11,775 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:24:11,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:24:11,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1424021631, now seen corresponding path program 1 times [2025-01-09 00:24:11,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:24:11,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274099226] [2025-01-09 00:24:11,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:24:11,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:24:11,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 503 statements into 1 equivalence classes. [2025-01-09 00:24:11,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 503 of 503 statements. [2025-01-09 00:24:11,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:24:11,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:24:12,201 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:24:12,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:24:12,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274099226] [2025-01-09 00:24:12,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274099226] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:24:12,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:24:12,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:24:12,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383357156] [2025-01-09 00:24:12,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:24:12,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:24:12,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:24:12,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:24:12,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:24:12,203 INFO L87 Difference]: Start difference. First operand 35018 states and 41198 transitions. Second operand has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:24:16,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:24:16,737 INFO L93 Difference]: Finished difference Result 78377 states and 94558 transitions. [2025-01-09 00:24:16,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:24:16,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 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 503 [2025-01-09 00:24:16,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:24:16,785 INFO L225 Difference]: With dead ends: 78377 [2025-01-09 00:24:16,785 INFO L226 Difference]: Without dead ends: 46091 [2025-01-09 00:24:16,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:24:16,808 INFO L435 NwaCegarLoop]: 2745 mSDtfsCounter, 1519 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 4061 mSolverCounterSat, 1803 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1519 SdHoareTripleChecker+Valid, 2924 SdHoareTripleChecker+Invalid, 5864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1803 IncrementalHoareTripleChecker+Valid, 4061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:24:16,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1519 Valid, 2924 Invalid, 5864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1803 Valid, 4061 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-01-09 00:24:16,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46091 states. [2025-01-09 00:24:17,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46091 to 45986. [2025-01-09 00:24:17,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45986 states, 45985 states have (on average 1.167293682722627) internal successors, (53678), 45985 states have internal predecessors, (53678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:24:17,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45986 states to 45986 states and 53678 transitions. [2025-01-09 00:24:17,341 INFO L78 Accepts]: Start accepts. Automaton has 45986 states and 53678 transitions. Word has length 503 [2025-01-09 00:24:17,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:24:17,342 INFO L471 AbstractCegarLoop]: Abstraction has 45986 states and 53678 transitions. [2025-01-09 00:24:17,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:24:17,342 INFO L276 IsEmpty]: Start isEmpty. Operand 45986 states and 53678 transitions. [2025-01-09 00:24:17,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 716 [2025-01-09 00:24:17,350 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:24:17,351 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:24:17,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 00:24:17,351 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:24:17,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:24:17,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1082237975, now seen corresponding path program 1 times [2025-01-09 00:24:17,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:24:17,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984181478] [2025-01-09 00:24:17,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:24:17,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:24:17,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 715 statements into 1 equivalence classes. [2025-01-09 00:24:17,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 715 of 715 statements. [2025-01-09 00:24:17,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:24:17,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:24:17,953 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2025-01-09 00:24:17,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:24:17,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984181478] [2025-01-09 00:24:17,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984181478] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:24:17,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:24:17,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:24:17,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180931797] [2025-01-09 00:24:17,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:24:17,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:24:17,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:24:17,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:24:17,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:24:17,956 INFO L87 Difference]: Start difference. First operand 45986 states and 53678 transitions. Second operand has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:24:26,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:24:26,774 INFO L93 Difference]: Finished difference Result 146896 states and 174850 transitions. [2025-01-09 00:24:26,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:24:26,774 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 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 715 [2025-01-09 00:24:26,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:24:26,902 INFO L225 Difference]: With dead ends: 146896 [2025-01-09 00:24:26,903 INFO L226 Difference]: Without dead ends: 103642 [2025-01-09 00:24:26,938 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-01-09 00:24:26,939 INFO L435 NwaCegarLoop]: 909 mSDtfsCounter, 3330 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 8930 mSolverCounterSat, 2793 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3330 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 11723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2793 IncrementalHoareTripleChecker+Valid, 8930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:24:26,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3330 Valid, 1259 Invalid, 11723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2793 Valid, 8930 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2025-01-09 00:24:27,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103642 states. [2025-01-09 00:24:27,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103642 to 100736. [2025-01-09 00:24:27,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100736 states, 100735 states have (on average 1.1557849803941034) internal successors, (116428), 100735 states have internal predecessors, (116428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:24:27,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100736 states to 100736 states and 116428 transitions. [2025-01-09 00:24:27,940 INFO L78 Accepts]: Start accepts. Automaton has 100736 states and 116428 transitions. Word has length 715 [2025-01-09 00:24:27,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:24:27,941 INFO L471 AbstractCegarLoop]: Abstraction has 100736 states and 116428 transitions. [2025-01-09 00:24:27,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:24:27,941 INFO L276 IsEmpty]: Start isEmpty. Operand 100736 states and 116428 transitions. [2025-01-09 00:24:27,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 723 [2025-01-09 00:24:27,945 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:24:27,945 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:24:27,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 00:24:27,946 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:24:27,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:24:27,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1548592417, now seen corresponding path program 1 times [2025-01-09 00:24:27,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:24:27,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35551278] [2025-01-09 00:24:27,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:24:27,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:24:28,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 722 statements into 1 equivalence classes. [2025-01-09 00:24:28,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 722 of 722 statements. [2025-01-09 00:24:28,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:24:28,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:24:29,463 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 49 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:24:29,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:24:29,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35551278] [2025-01-09 00:24:29,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35551278] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:24:29,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065827297] [2025-01-09 00:24:29,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:24:29,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:24:29,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:24:29,466 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:24:29,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 00:24:29,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 722 statements into 1 equivalence classes. [2025-01-09 00:24:29,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 722 of 722 statements. [2025-01-09 00:24:29,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:24:29,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:24:29,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 828 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:24:29,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:24:29,727 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2025-01-09 00:24:29,728 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:24:29,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065827297] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:24:29,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:24:29,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-09 00:24:29,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80576125] [2025-01-09 00:24:29,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:24:29,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:24:29,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:24:29,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:24:29,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:24:29,730 INFO L87 Difference]: Start difference. First operand 100736 states and 116428 transitions. Second operand has 3 states, 3 states have (on average 168.33333333333334) internal successors, (505), 3 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:24:35,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:24:35,441 INFO L93 Difference]: Finished difference Result 283389 states and 329660 transitions. [2025-01-09 00:24:35,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:24:35,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 168.33333333333334) internal successors, (505), 3 states have internal predecessors, (505), 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 722 [2025-01-09 00:24:35,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:24:35,751 INFO L225 Difference]: With dead ends: 283389 [2025-01-09 00:24:35,751 INFO L226 Difference]: Without dead ends: 185385 [2025-01-09 00:24:35,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 725 GetRequests, 721 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:24:35,839 INFO L435 NwaCegarLoop]: 1587 mSDtfsCounter, 1542 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 5093 mSolverCounterSat, 998 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1542 SdHoareTripleChecker+Valid, 1716 SdHoareTripleChecker+Invalid, 6091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 998 IncrementalHoareTripleChecker+Valid, 5093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:24:35,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1542 Valid, 1716 Invalid, 6091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [998 Valid, 5093 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2025-01-09 00:24:35,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185385 states. [2025-01-09 00:24:37,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185385 to 174433. [2025-01-09 00:24:37,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174433 states, 174432 states have (on average 1.143012749954137) internal successors, (199378), 174432 states have internal predecessors, (199378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:24:37,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174433 states to 174433 states and 199378 transitions. [2025-01-09 00:24:37,866 INFO L78 Accepts]: Start accepts. Automaton has 174433 states and 199378 transitions. Word has length 722 [2025-01-09 00:24:37,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:24:37,866 INFO L471 AbstractCegarLoop]: Abstraction has 174433 states and 199378 transitions. [2025-01-09 00:24:37,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.33333333333334) internal successors, (505), 3 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:24:37,867 INFO L276 IsEmpty]: Start isEmpty. Operand 174433 states and 199378 transitions. [2025-01-09 00:24:37,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 834 [2025-01-09 00:24:37,872 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:24:37,872 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:24:37,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 00:24:38,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:24:38,074 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:24:38,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:24:38,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1125536765, now seen corresponding path program 1 times [2025-01-09 00:24:38,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:24:38,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979838470] [2025-01-09 00:24:38,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:24:38,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:24:38,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 833 statements into 1 equivalence classes. [2025-01-09 00:24:38,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 833 of 833 statements. [2025-01-09 00:24:38,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:24:38,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:24:38,844 INFO L134 CoverageAnalysis]: Checked inductivity of 466 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2025-01-09 00:24:38,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:24:38,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979838470] [2025-01-09 00:24:38,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979838470] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:24:38,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:24:38,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:24:38,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097946669] [2025-01-09 00:24:38,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:24:38,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:24:38,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:24:38,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:24:38,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:24:38,847 INFO L87 Difference]: Start difference. First operand 174433 states and 199378 transitions. Second operand has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 2 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:24:44,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:24:44,376 INFO L93 Difference]: Finished difference Result 404861 states and 463328 transitions. [2025-01-09 00:24:44,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:24:44,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 2 states have internal predecessors, (589), 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 833 [2025-01-09 00:24:44,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted.