./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec2_product22.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/elevator_spec2_product22.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8090ac1e7e8284dad30217492085f9e11f6491349a4adb4aa3c2904a72e0131a --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:25:51,935 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:25:51,990 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:25:51,995 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:25:51,995 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:25:52,017 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:25:52,019 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:25:52,019 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:25:52,019 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:25:52,019 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:25:52,020 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:25:52,020 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:25:52,020 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:25:52,020 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:25:52,020 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:25:52,020 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:25:52,021 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:25:52,021 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:25:52,021 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:25:52,021 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:25:52,021 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:25:52,021 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:25:52,021 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:25:52,022 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:25:52,022 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:25:52,022 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:25:52,022 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:25:52,022 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:25:52,022 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:25:52,022 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:25:52,022 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:25:52,022 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:25:52,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:25:52,022 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:25:52,023 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:25:52,023 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:25:52,023 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:25:52,023 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:25:52,023 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:25:52,023 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:25:52,023 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:25:52,024 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:25:52,024 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:25:52,024 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8090ac1e7e8284dad30217492085f9e11f6491349a4adb4aa3c2904a72e0131a [2025-03-08 05:25:52,232 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:25:52,239 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:25:52,241 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:25:52,242 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:25:52,242 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:25:52,243 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec2_product22.cil.c [2025-03-08 05:25:53,390 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/001a29170/8bef77779e9e475fae275b40a56021ef/FLAG7d3f3b60d [2025-03-08 05:25:53,746 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:25:53,746 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product22.cil.c [2025-03-08 05:25:53,769 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/001a29170/8bef77779e9e475fae275b40a56021ef/FLAG7d3f3b60d [2025-03-08 05:25:53,958 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/001a29170/8bef77779e9e475fae275b40a56021ef [2025-03-08 05:25:53,961 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:25:53,962 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:25:53,963 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:25:53,963 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:25:53,966 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:25:53,967 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:25:53" (1/1) ... [2025-03-08 05:25:53,967 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@233792c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:53, skipping insertion in model container [2025-03-08 05:25:53,967 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:25:53" (1/1) ... [2025-03-08 05:25:54,011 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:25:54,129 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product22.cil.c[1545,1558] [2025-03-08 05:25:54,411 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:25:54,423 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:25:54,428 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [48] [2025-03-08 05:25:54,429 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [57] [2025-03-08 05:25:54,429 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [421] [2025-03-08 05:25:54,430 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1088] [2025-03-08 05:25:54,430 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1454] [2025-03-08 05:25:54,431 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [1466] [2025-03-08 05:25:54,431 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1586] [2025-03-08 05:25:54,431 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1621] [2025-03-08 05:25:54,431 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [3188] [2025-03-08 05:25:54,431 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [3279] [2025-03-08 05:25:54,433 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product22.cil.c[1545,1558] [2025-03-08 05:25:54,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:25:54,539 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:25:54,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:54 WrapperNode [2025-03-08 05:25:54,541 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:25:54,542 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:25:54,542 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:25:54,542 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:25:54,546 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:54" (1/1) ... [2025-03-08 05:25:54,562 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:54" (1/1) ... [2025-03-08 05:25:54,597 INFO L138 Inliner]: procedures = 94, calls = 345, calls flagged for inlining = 26, calls inlined = 22, statements flattened = 872 [2025-03-08 05:25:54,597 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:25:54,598 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:25:54,598 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:25:54,598 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:25:54,608 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:54" (1/1) ... [2025-03-08 05:25:54,608 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:54" (1/1) ... [2025-03-08 05:25:54,613 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:54" (1/1) ... [2025-03-08 05:25:54,648 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2025-03-08 05:25:54,648 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:54" (1/1) ... [2025-03-08 05:25:54,649 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:54" (1/1) ... [2025-03-08 05:25:54,660 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:54" (1/1) ... [2025-03-08 05:25:54,663 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:54" (1/1) ... [2025-03-08 05:25:54,666 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:54" (1/1) ... [2025-03-08 05:25:54,668 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:54" (1/1) ... [2025-03-08 05:25:54,674 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:25:54,679 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:25:54,679 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:25:54,679 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:25:54,680 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:54" (1/1) ... [2025-03-08 05:25:54,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:25:54,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:25:54,720 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 05:25:54,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 05:25:54,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:25:54,742 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-03-08 05:25:54,742 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-03-08 05:25:54,742 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-03-08 05:25:54,742 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-03-08 05:25:54,742 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-03-08 05:25:54,742 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-03-08 05:25:54,743 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-03-08 05:25:54,743 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-03-08 05:25:54,743 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-03-08 05:25:54,743 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-03-08 05:25:54,743 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-08 05:25:54,743 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-08 05:25:54,744 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-08 05:25:54,744 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-08 05:25:54,744 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2025-03-08 05:25:54,744 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2025-03-08 05:25:54,744 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-03-08 05:25:54,744 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-03-08 05:25:54,744 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-03-08 05:25:54,745 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-03-08 05:25:54,745 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-03-08 05:25:54,745 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-03-08 05:25:54,745 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-03-08 05:25:54,745 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-03-08 05:25:54,745 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2025-03-08 05:25:54,745 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2025-03-08 05:25:54,745 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-03-08 05:25:54,745 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-03-08 05:25:54,745 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-03-08 05:25:54,745 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-03-08 05:25:54,745 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-03-08 05:25:54,745 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-03-08 05:25:54,745 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-03-08 05:25:54,745 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-03-08 05:25:54,745 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-03-08 05:25:54,745 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-03-08 05:25:54,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:25:54,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:25:54,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 05:25:54,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 05:25:54,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 05:25:54,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 05:25:54,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 05:25:54,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 05:25:54,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-08 05:25:54,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-08 05:25:54,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-08 05:25:54,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-08 05:25:54,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-08 05:25:54,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-08 05:25:54,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-08 05:25:54,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-08 05:25:54,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-08 05:25:54,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-08 05:25:54,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-08 05:25:54,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-08 05:25:54,748 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2025-03-08 05:25:54,748 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2025-03-08 05:25:54,748 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-03-08 05:25:54,748 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-03-08 05:25:54,748 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-03-08 05:25:54,748 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-03-08 05:25:54,748 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-03-08 05:25:54,748 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-03-08 05:25:54,748 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__twothirdsfull [2025-03-08 05:25:54,748 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__twothirdsfull [2025-03-08 05:25:54,748 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2025-03-08 05:25:54,748 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2025-03-08 05:25:54,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:25:54,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:25:54,748 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-03-08 05:25:54,748 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-03-08 05:25:54,883 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:25:54,885 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:25:54,931 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1583: #res := ~retValue_acc~10; [2025-03-08 05:25:54,946 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1505: #res := ~retValue_acc~8; [2025-03-08 05:25:54,949 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1699: #res := ~retValue_acc~13; [2025-03-08 05:25:54,961 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1857: #res := ~retValue_acc~14; [2025-03-08 05:25:55,126 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2433: #res#1 := ~retValue_acc~22#1; [2025-03-08 05:25:55,126 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2467-1: isAnyLiftButtonPressed_#res#1 := isAnyLiftButtonPressed_~retValue_acc~23#1; [2025-03-08 05:25:55,193 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2565: #res := ~retValue_acc~26; [2025-03-08 05:25:55,206 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1544: #res := ~retValue_acc~9; [2025-03-08 05:25:55,227 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1900: #res := ~retValue_acc~16; [2025-03-08 05:25:55,328 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2042-1: isIdle_#res#1 := isIdle_~retValue_acc~20#1; [2025-03-08 05:25:55,329 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2029-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~19#1; [2025-03-08 05:25:55,416 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L774: #res := ~retValue_acc~3; [2025-03-08 05:25:55,498 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2523-1: stopRequestedAtCurrentFloor__wrappee__weight_#res#1 := stopRequestedAtCurrentFloor__wrappee__weight_~retValue_acc~24#1; [2025-03-08 05:25:55,498 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2551-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~25#1; [2025-03-08 05:25:55,598 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2394: #res := ~retValue_acc~21; [2025-03-08 05:25:55,652 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L418-1: main_#res#1 := main_~retValue_acc~1#1; [2025-03-08 05:25:55,652 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1618-1: valid_product_#res#1 := valid_product_~retValue_acc~12#1; [2025-03-08 05:25:55,660 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L538: #res := ~retValue_acc~2; [2025-03-08 05:25:55,661 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1866: #res := ~retValue_acc~15; [2025-03-08 05:25:55,664 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1085: #res := ~retValue_acc~4; [2025-03-08 05:25:55,767 INFO L? ?]: Removed 450 outVars from TransFormulas that were not future-live. [2025-03-08 05:25:55,768 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:25:55,783 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:25:55,783 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:25:55,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:25:55 BoogieIcfgContainer [2025-03-08 05:25:55,783 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:25:55,785 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:25:55,785 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:25:55,787 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:25:55,788 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:25:53" (1/3) ... [2025-03-08 05:25:55,788 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@385743a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:25:55, skipping insertion in model container [2025-03-08 05:25:55,788 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:54" (2/3) ... [2025-03-08 05:25:55,788 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@385743a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:25:55, skipping insertion in model container [2025-03-08 05:25:55,788 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:25:55" (3/3) ... [2025-03-08 05:25:55,789 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product22.cil.c [2025-03-08 05:25:55,798 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:25:55,800 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec2_product22.cil.c that has 26 procedures, 570 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:25:55,877 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:25:55,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;@5c8a591e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:25:55,888 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:25:55,892 INFO L276 IsEmpty]: Start isEmpty. Operand has 570 states, 445 states have (on average 1.6921348314606741) internal successors, (753), 468 states have internal predecessors, (753), 98 states have call successors, (98), 25 states have call predecessors, (98), 25 states have return successors, (98), 91 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-08 05:25:55,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-08 05:25:55,904 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:55,905 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:25:55,905 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:55,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:55,909 INFO L85 PathProgramCache]: Analyzing trace with hash -585854631, now seen corresponding path program 1 times [2025-03-08 05:25:55,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:55,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198740532] [2025-03-08 05:25:55,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:55,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:55,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 05:25:56,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 05:25:56,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:56,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:56,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:25:56,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:56,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198740532] [2025-03-08 05:25:56,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198740532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:56,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:56,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:25:56,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827143630] [2025-03-08 05:25:56,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:56,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:25:56,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:56,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:25:56,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:56,331 INFO L87 Difference]: Start difference. First operand has 570 states, 445 states have (on average 1.6921348314606741) internal successors, (753), 468 states have internal predecessors, (753), 98 states have call successors, (98), 25 states have call predecessors, (98), 25 states have return successors, (98), 91 states have call predecessors, (98), 98 states have call successors, (98) Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:25:56,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:56,461 INFO L93 Difference]: Finished difference Result 1120 states and 1873 transitions. [2025-03-08 05:25:56,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:25:56,462 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 60 [2025-03-08 05:25:56,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:56,475 INFO L225 Difference]: With dead ends: 1120 [2025-03-08 05:25:56,475 INFO L226 Difference]: Without dead ends: 562 [2025-03-08 05:25:56,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:56,483 INFO L435 NwaCegarLoop]: 929 mSDtfsCounter, 5 mSDsluCounter, 1854 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2783 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:56,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2783 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:25:56,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2025-03-08 05:25:56,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2025-03-08 05:25:56,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 439 states have (on average 1.6902050113895217) internal successors, (742), 460 states have internal predecessors, (742), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-08 05:25:56,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 933 transitions. [2025-03-08 05:25:56,553 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 933 transitions. Word has length 60 [2025-03-08 05:25:56,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:56,555 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 933 transitions. [2025-03-08 05:25:56,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:25:56,555 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 933 transitions. [2025-03-08 05:25:56,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 05:25:56,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:56,561 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:25:56,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:25:56,562 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:56,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:56,562 INFO L85 PathProgramCache]: Analyzing trace with hash -598033181, now seen corresponding path program 1 times [2025-03-08 05:25:56,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:56,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838914767] [2025-03-08 05:25:56,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:56,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:56,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 05:25:56,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 05:25:56,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:56,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:56,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:25:56,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:56,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838914767] [2025-03-08 05:25:56,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838914767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:56,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:56,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:25:56,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105373349] [2025-03-08 05:25:56,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:56,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:25:56,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:56,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:25:56,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:56,747 INFO L87 Difference]: Start difference. First operand 562 states and 933 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:25:56,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:56,816 INFO L93 Difference]: Finished difference Result 1106 states and 1843 transitions. [2025-03-08 05:25:56,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:25:56,817 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 62 [2025-03-08 05:25:56,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:56,823 INFO L225 Difference]: With dead ends: 1106 [2025-03-08 05:25:56,824 INFO L226 Difference]: Without dead ends: 562 [2025-03-08 05:25:56,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:56,826 INFO L435 NwaCegarLoop]: 922 mSDtfsCounter, 4 mSDsluCounter, 1840 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2762 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:56,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2762 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:25:56,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2025-03-08 05:25:56,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2025-03-08 05:25:56,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 439 states have (on average 1.6879271070615034) internal successors, (741), 460 states have internal predecessors, (741), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-08 05:25:56,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 932 transitions. [2025-03-08 05:25:56,860 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 932 transitions. Word has length 62 [2025-03-08 05:25:56,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:56,860 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 932 transitions. [2025-03-08 05:25:56,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:25:56,861 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 932 transitions. [2025-03-08 05:25:56,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 05:25:56,863 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:56,863 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:25:56,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:25:56,863 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:56,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:56,864 INFO L85 PathProgramCache]: Analyzing trace with hash -2064730179, now seen corresponding path program 1 times [2025-03-08 05:25:56,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:56,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138231457] [2025-03-08 05:25:56,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:56,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:56,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 05:25:56,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 05:25:56,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:56,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:56,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:25:56,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:56,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138231457] [2025-03-08 05:25:56,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138231457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:56,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:56,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:25:57,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543295598] [2025-03-08 05:25:57,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:57,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:25:57,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:57,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:25:57,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:57,009 INFO L87 Difference]: Start difference. First operand 562 states and 932 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:25:57,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:57,068 INFO L93 Difference]: Finished difference Result 1106 states and 1842 transitions. [2025-03-08 05:25:57,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:25:57,069 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 63 [2025-03-08 05:25:57,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:57,074 INFO L225 Difference]: With dead ends: 1106 [2025-03-08 05:25:57,074 INFO L226 Difference]: Without dead ends: 562 [2025-03-08 05:25:57,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:57,078 INFO L435 NwaCegarLoop]: 922 mSDtfsCounter, 3 mSDsluCounter, 1840 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2762 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:57,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2762 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:25:57,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2025-03-08 05:25:57,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2025-03-08 05:25:57,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 439 states have (on average 1.6856492027334853) internal successors, (740), 460 states have internal predecessors, (740), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-08 05:25:57,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 931 transitions. [2025-03-08 05:25:57,104 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 931 transitions. Word has length 63 [2025-03-08 05:25:57,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:57,104 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 931 transitions. [2025-03-08 05:25:57,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:25:57,105 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 931 transitions. [2025-03-08 05:25:57,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 05:25:57,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:57,107 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:25:57,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:25:57,107 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:57,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:57,108 INFO L85 PathProgramCache]: Analyzing trace with hash 185624038, now seen corresponding path program 1 times [2025-03-08 05:25:57,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:57,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184081939] [2025-03-08 05:25:57,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:57,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:57,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 05:25:57,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 05:25:57,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:57,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:57,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:25:57,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:57,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184081939] [2025-03-08 05:25:57,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184081939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:57,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:57,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:25:57,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87578064] [2025-03-08 05:25:57,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:57,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:25:57,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:57,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:25:57,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:57,229 INFO L87 Difference]: Start difference. First operand 562 states and 931 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:25:57,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:57,271 INFO L93 Difference]: Finished difference Result 1106 states and 1841 transitions. [2025-03-08 05:25:57,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:25:57,271 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 64 [2025-03-08 05:25:57,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:57,275 INFO L225 Difference]: With dead ends: 1106 [2025-03-08 05:25:57,276 INFO L226 Difference]: Without dead ends: 562 [2025-03-08 05:25:57,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:57,279 INFO L435 NwaCegarLoop]: 922 mSDtfsCounter, 2 mSDsluCounter, 1840 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2762 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:57,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2762 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:25:57,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2025-03-08 05:25:57,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2025-03-08 05:25:57,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 439 states have (on average 1.683371298405467) internal successors, (739), 460 states have internal predecessors, (739), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-08 05:25:57,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 930 transitions. [2025-03-08 05:25:57,304 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 930 transitions. Word has length 64 [2025-03-08 05:25:57,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:57,306 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 930 transitions. [2025-03-08 05:25:57,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:25:57,306 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 930 transitions. [2025-03-08 05:25:57,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 05:25:57,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:57,307 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:25:57,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 05:25:57,307 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:57,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:57,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1700448928, now seen corresponding path program 1 times [2025-03-08 05:25:57,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:57,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340722932] [2025-03-08 05:25:57,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:57,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:57,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 05:25:57,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 05:25:57,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:57,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:57,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:25:57,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:57,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340722932] [2025-03-08 05:25:57,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340722932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:57,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:57,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:25:57,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724642129] [2025-03-08 05:25:57,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:57,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:25:57,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:57,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:25:57,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:57,415 INFO L87 Difference]: Start difference. First operand 562 states and 930 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:25:57,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:57,450 INFO L93 Difference]: Finished difference Result 1106 states and 1840 transitions. [2025-03-08 05:25:57,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:25:57,451 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2025-03-08 05:25:57,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:57,454 INFO L225 Difference]: With dead ends: 1106 [2025-03-08 05:25:57,454 INFO L226 Difference]: Without dead ends: 562 [2025-03-08 05:25:57,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:57,457 INFO L435 NwaCegarLoop]: 922 mSDtfsCounter, 1 mSDsluCounter, 1840 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2762 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:57,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2762 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:25:57,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2025-03-08 05:25:57,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2025-03-08 05:25:57,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 439 states have (on average 1.6810933940774488) internal successors, (738), 460 states have internal predecessors, (738), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-08 05:25:57,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 929 transitions. [2025-03-08 05:25:57,484 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 929 transitions. Word has length 65 [2025-03-08 05:25:57,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:57,485 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 929 transitions. [2025-03-08 05:25:57,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:25:57,485 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 929 transitions. [2025-03-08 05:25:57,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 05:25:57,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:57,487 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:25:57,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:25:57,488 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:57,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:57,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1888701161, now seen corresponding path program 1 times [2025-03-08 05:25:57,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:57,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545935804] [2025-03-08 05:25:57,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:57,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:57,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 05:25:57,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 05:25:57,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:57,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:57,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:25:57,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:57,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545935804] [2025-03-08 05:25:57,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545935804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:57,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:57,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 05:25:57,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875206795] [2025-03-08 05:25:57,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:57,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 05:25:57,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:57,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 05:25:57,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:25:57,691 INFO L87 Difference]: Start difference. First operand 562 states and 929 transitions. Second operand has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 05:25:57,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:57,813 INFO L93 Difference]: Finished difference Result 1072 states and 1772 transitions. [2025-03-08 05:25:57,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 05:25:57,816 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 66 [2025-03-08 05:25:57,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:57,821 INFO L225 Difference]: With dead ends: 1072 [2025-03-08 05:25:57,821 INFO L226 Difference]: Without dead ends: 577 [2025-03-08 05:25:57,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:25:57,824 INFO L435 NwaCegarLoop]: 917 mSDtfsCounter, 91 mSDsluCounter, 6336 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 7253 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:57,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 7253 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:25:57,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2025-03-08 05:25:57,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 575. [2025-03-08 05:25:57,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 449 states have (on average 1.6770601336302895) internal successors, (753), 472 states have internal predecessors, (753), 99 states have call successors, (99), 25 states have call predecessors, (99), 26 states have return successors, (96), 91 states have call predecessors, (96), 94 states have call successors, (96) [2025-03-08 05:25:57,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 948 transitions. [2025-03-08 05:25:57,847 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 948 transitions. Word has length 66 [2025-03-08 05:25:57,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:57,850 INFO L471 AbstractCegarLoop]: Abstraction has 575 states and 948 transitions. [2025-03-08 05:25:57,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 05:25:57,850 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 948 transitions. [2025-03-08 05:25:57,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 05:25:57,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:57,854 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:25:57,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:25:57,854 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:57,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:57,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1880941802, now seen corresponding path program 1 times [2025-03-08 05:25:57,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:57,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023562305] [2025-03-08 05:25:57,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:57,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:57,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 05:25:57,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 05:25:57,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:57,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:57,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:25:57,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:57,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023562305] [2025-03-08 05:25:57,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023562305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:57,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:57,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:25:57,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880483536] [2025-03-08 05:25:57,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:57,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:25:57,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:57,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:25:57,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:57,924 INFO L87 Difference]: Start difference. First operand 575 states and 948 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:25:57,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:57,961 INFO L93 Difference]: Finished difference Result 1124 states and 1866 transitions. [2025-03-08 05:25:57,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:25:57,962 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2025-03-08 05:25:57,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:57,966 INFO L225 Difference]: With dead ends: 1124 [2025-03-08 05:25:57,966 INFO L226 Difference]: Without dead ends: 556 [2025-03-08 05:25:57,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:57,968 INFO L435 NwaCegarLoop]: 923 mSDtfsCounter, 0 mSDsluCounter, 1841 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2764 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:57,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2764 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:25:57,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-03-08 05:25:57,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2025-03-08 05:25:57,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 433 states have (on average 1.672055427251732) internal successors, (724), 454 states have internal predecessors, (724), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-08 05:25:57,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 915 transitions. [2025-03-08 05:25:57,986 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 915 transitions. Word has length 66 [2025-03-08 05:25:57,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:57,986 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 915 transitions. [2025-03-08 05:25:57,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:25:57,987 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 915 transitions. [2025-03-08 05:25:57,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 05:25:57,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:57,988 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:25:57,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:25:57,988 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:57,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:57,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1559080022, now seen corresponding path program 1 times [2025-03-08 05:25:57,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:57,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508487293] [2025-03-08 05:25:57,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:57,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:58,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 05:25:58,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 05:25:58,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:58,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:58,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:25:58,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:58,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508487293] [2025-03-08 05:25:58,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508487293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:58,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:58,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:25:58,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328896381] [2025-03-08 05:25:58,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:58,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:25:58,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:58,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:25:58,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:25:58,092 INFO L87 Difference]: Start difference. First operand 556 states and 915 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:25:58,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:58,236 INFO L93 Difference]: Finished difference Result 1069 states and 1764 transitions. [2025-03-08 05:25:58,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:25:58,236 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2025-03-08 05:25:58,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:58,240 INFO L225 Difference]: With dead ends: 1069 [2025-03-08 05:25:58,240 INFO L226 Difference]: Without dead ends: 565 [2025-03-08 05:25:58,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:25:58,243 INFO L435 NwaCegarLoop]: 872 mSDtfsCounter, 55 mSDsluCounter, 3459 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4331 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:58,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4331 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:25:58,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2025-03-08 05:25:58,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 556. [2025-03-08 05:25:58,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 433 states have (on average 1.6628175519630486) internal successors, (720), 454 states have internal predecessors, (720), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-08 05:25:58,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 911 transitions. [2025-03-08 05:25:58,262 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 911 transitions. Word has length 67 [2025-03-08 05:25:58,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:58,262 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 911 transitions. [2025-03-08 05:25:58,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:25:58,263 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 911 transitions. [2025-03-08 05:25:58,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 05:25:58,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:58,264 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:25:58,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:25:58,264 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:58,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:58,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1008835758, now seen corresponding path program 1 times [2025-03-08 05:25:58,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:58,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704257687] [2025-03-08 05:25:58,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:58,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:58,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 05:25:58,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 05:25:58,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:58,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:58,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:25:58,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:58,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704257687] [2025-03-08 05:25:58,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704257687] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:58,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:58,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:25:58,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674485764] [2025-03-08 05:25:58,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:58,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:25:58,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:58,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:25:58,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:25:58,364 INFO L87 Difference]: Start difference. First operand 556 states and 911 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:25:58,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:58,510 INFO L93 Difference]: Finished difference Result 1069 states and 1760 transitions. [2025-03-08 05:25:58,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:25:58,510 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 68 [2025-03-08 05:25:58,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:58,514 INFO L225 Difference]: With dead ends: 1069 [2025-03-08 05:25:58,514 INFO L226 Difference]: Without dead ends: 565 [2025-03-08 05:25:58,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:25:58,516 INFO L435 NwaCegarLoop]: 872 mSDtfsCounter, 54 mSDsluCounter, 3459 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4331 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:58,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4331 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:25:58,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2025-03-08 05:25:58,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 556. [2025-03-08 05:25:58,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 433 states have (on average 1.653579676674365) internal successors, (716), 454 states have internal predecessors, (716), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-08 05:25:58,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 907 transitions. [2025-03-08 05:25:58,534 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 907 transitions. Word has length 68 [2025-03-08 05:25:58,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:58,535 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 907 transitions. [2025-03-08 05:25:58,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:25:58,535 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 907 transitions. [2025-03-08 05:25:58,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 05:25:58,536 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:58,536 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:25:58,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:25:58,536 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:58,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:58,537 INFO L85 PathProgramCache]: Analyzing trace with hash -109666233, now seen corresponding path program 1 times [2025-03-08 05:25:58,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:58,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79636197] [2025-03-08 05:25:58,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:58,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:58,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 05:25:58,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 05:25:58,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:58,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:58,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:25:58,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:58,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79636197] [2025-03-08 05:25:58,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79636197] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:58,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:58,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:25:58,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33585232] [2025-03-08 05:25:58,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:58,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:25:58,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:58,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:25:58,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:25:58,633 INFO L87 Difference]: Start difference. First operand 556 states and 907 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:25:58,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:58,770 INFO L93 Difference]: Finished difference Result 1069 states and 1756 transitions. [2025-03-08 05:25:58,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:25:58,771 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 69 [2025-03-08 05:25:58,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:58,775 INFO L225 Difference]: With dead ends: 1069 [2025-03-08 05:25:58,775 INFO L226 Difference]: Without dead ends: 565 [2025-03-08 05:25:58,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:25:58,777 INFO L435 NwaCegarLoop]: 871 mSDtfsCounter, 53 mSDsluCounter, 3442 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4313 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:58,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4313 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:25:58,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2025-03-08 05:25:58,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 556. [2025-03-08 05:25:58,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 433 states have (on average 1.6443418013856812) internal successors, (712), 454 states have internal predecessors, (712), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-08 05:25:58,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 903 transitions. [2025-03-08 05:25:58,793 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 903 transitions. Word has length 69 [2025-03-08 05:25:58,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:58,794 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 903 transitions. [2025-03-08 05:25:58,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:25:58,794 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 903 transitions. [2025-03-08 05:25:58,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 05:25:58,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:58,795 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:25:58,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 05:25:58,795 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:58,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:58,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1578096136, now seen corresponding path program 1 times [2025-03-08 05:25:58,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:58,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100028848] [2025-03-08 05:25:58,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:58,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:58,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 05:25:58,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 05:25:58,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:58,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:58,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:25:58,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:58,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100028848] [2025-03-08 05:25:58,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100028848] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:58,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:58,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:25:58,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617727245] [2025-03-08 05:25:58,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:58,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:25:58,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:58,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:25:58,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:25:58,905 INFO L87 Difference]: Start difference. First operand 556 states and 903 transitions. Second operand has 7 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 05:25:58,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:58,960 INFO L93 Difference]: Finished difference Result 1060 states and 1738 transitions. [2025-03-08 05:25:58,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:25:58,961 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 69 [2025-03-08 05:25:58,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:58,965 INFO L225 Difference]: With dead ends: 1060 [2025-03-08 05:25:58,965 INFO L226 Difference]: Without dead ends: 535 [2025-03-08 05:25:58,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:25:58,968 INFO L435 NwaCegarLoop]: 892 mSDtfsCounter, 84 mSDsluCounter, 4387 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 5279 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:58,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 5279 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:25:58,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-03-08 05:25:58,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2025-03-08 05:25:58,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 412 states have (on average 1.645631067961165) internal successors, (678), 433 states have internal predecessors, (678), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-08 05:25:58,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 869 transitions. [2025-03-08 05:25:58,984 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 869 transitions. Word has length 69 [2025-03-08 05:25:58,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:58,984 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 869 transitions. [2025-03-08 05:25:58,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 05:25:58,984 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 869 transitions. [2025-03-08 05:25:58,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 05:25:58,985 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:58,985 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:25:58,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:25:58,985 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:58,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:58,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1278715505, now seen corresponding path program 1 times [2025-03-08 05:25:58,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:58,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426453907] [2025-03-08 05:25:58,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:58,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:58,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 05:25:59,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 05:25:59,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:59,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:59,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:25:59,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:59,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426453907] [2025-03-08 05:25:59,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426453907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:59,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:59,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:25:59,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964050032] [2025-03-08 05:25:59,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:59,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:25:59,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:59,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:25:59,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:25:59,079 INFO L87 Difference]: Start difference. First operand 535 states and 869 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:25:59,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:59,157 INFO L93 Difference]: Finished difference Result 1039 states and 1704 transitions. [2025-03-08 05:25:59,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:25:59,158 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2025-03-08 05:25:59,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:59,161 INFO L225 Difference]: With dead ends: 1039 [2025-03-08 05:25:59,161 INFO L226 Difference]: Without dead ends: 535 [2025-03-08 05:25:59,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:25:59,164 INFO L435 NwaCegarLoop]: 852 mSDtfsCounter, 17 mSDsluCounter, 3399 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4251 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:59,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4251 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:25:59,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-03-08 05:25:59,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2025-03-08 05:25:59,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 412 states have (on average 1.6432038834951457) internal successors, (677), 433 states have internal predecessors, (677), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-08 05:25:59,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 868 transitions. [2025-03-08 05:25:59,183 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 868 transitions. Word has length 70 [2025-03-08 05:25:59,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:59,183 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 868 transitions. [2025-03-08 05:25:59,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:25:59,183 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 868 transitions. [2025-03-08 05:25:59,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-08 05:25:59,184 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:59,184 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:25:59,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 05:25:59,184 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:59,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:59,184 INFO L85 PathProgramCache]: Analyzing trace with hash -2138038044, now seen corresponding path program 1 times [2025-03-08 05:25:59,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:59,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203204167] [2025-03-08 05:25:59,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:59,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:59,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 05:25:59,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 05:25:59,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:59,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:59,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:25:59,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:59,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203204167] [2025-03-08 05:25:59,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203204167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:59,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:59,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:25:59,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704890999] [2025-03-08 05:25:59,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:59,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:25:59,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:59,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:25:59,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:25:59,288 INFO L87 Difference]: Start difference. First operand 535 states and 868 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:25:59,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:59,342 INFO L93 Difference]: Finished difference Result 1039 states and 1703 transitions. [2025-03-08 05:25:59,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:25:59,343 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 71 [2025-03-08 05:25:59,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:59,347 INFO L225 Difference]: With dead ends: 1039 [2025-03-08 05:25:59,347 INFO L226 Difference]: Without dead ends: 535 [2025-03-08 05:25:59,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:25:59,349 INFO L435 NwaCegarLoop]: 852 mSDtfsCounter, 16 mSDsluCounter, 3399 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4251 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:59,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4251 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:25:59,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-03-08 05:25:59,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2025-03-08 05:25:59,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 412 states have (on average 1.6407766990291262) internal successors, (676), 433 states have internal predecessors, (676), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-08 05:25:59,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 867 transitions. [2025-03-08 05:25:59,364 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 867 transitions. Word has length 71 [2025-03-08 05:25:59,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:59,364 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 867 transitions. [2025-03-08 05:25:59,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:25:59,364 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 867 transitions. [2025-03-08 05:25:59,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-08 05:25:59,365 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:59,365 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:25:59,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:25:59,366 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:59,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:59,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1985766452, now seen corresponding path program 1 times [2025-03-08 05:25:59,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:59,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139553096] [2025-03-08 05:25:59,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:59,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:59,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 05:25:59,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 05:25:59,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:59,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:59,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:25:59,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:59,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139553096] [2025-03-08 05:25:59,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139553096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:59,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:59,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 05:25:59,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123343790] [2025-03-08 05:25:59,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:59,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 05:25:59,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:59,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 05:25:59,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:25:59,518 INFO L87 Difference]: Start difference. First operand 535 states and 867 transitions. Second operand has 10 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 05:25:59,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:59,599 INFO L93 Difference]: Finished difference Result 1033 states and 1691 transitions. [2025-03-08 05:25:59,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 05:25:59,599 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 72 [2025-03-08 05:25:59,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:59,603 INFO L225 Difference]: With dead ends: 1033 [2025-03-08 05:25:59,603 INFO L226 Difference]: Without dead ends: 535 [2025-03-08 05:25:59,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:25:59,605 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 6 mSDsluCounter, 6786 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 7637 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:59,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 7637 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:25:59,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-03-08 05:25:59,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2025-03-08 05:25:59,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 412 states have (on average 1.6383495145631068) internal successors, (675), 433 states have internal predecessors, (675), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-08 05:25:59,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 866 transitions. [2025-03-08 05:25:59,622 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 866 transitions. Word has length 72 [2025-03-08 05:25:59,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:59,622 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 866 transitions. [2025-03-08 05:25:59,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 05:25:59,623 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 866 transitions. [2025-03-08 05:25:59,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-08 05:25:59,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:59,625 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:25:59,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 05:25:59,625 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:59,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:59,626 INFO L85 PathProgramCache]: Analyzing trace with hash 949697361, now seen corresponding path program 1 times [2025-03-08 05:25:59,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:59,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644523206] [2025-03-08 05:25:59,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:59,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:59,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 05:25:59,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 05:25:59,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:59,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:59,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:25:59,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:59,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644523206] [2025-03-08 05:25:59,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644523206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:59,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:59,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:25:59,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380271752] [2025-03-08 05:25:59,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:59,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:25:59,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:59,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:25:59,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:25:59,799 INFO L87 Difference]: Start difference. First operand 535 states and 866 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 6 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-08 05:26:01,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:01,596 INFO L93 Difference]: Finished difference Result 1663 states and 2755 transitions. [2025-03-08 05:26:01,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:26:01,596 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 6 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 73 [2025-03-08 05:26:01,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:01,602 INFO L225 Difference]: With dead ends: 1663 [2025-03-08 05:26:01,602 INFO L226 Difference]: Without dead ends: 1173 [2025-03-08 05:26:01,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:26:01,605 INFO L435 NwaCegarLoop]: 367 mSDtfsCounter, 3265 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 1851 mSolverCounterSat, 784 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3332 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 2635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 784 IncrementalHoareTripleChecker+Valid, 1851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:01,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3332 Valid, 987 Invalid, 2635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [784 Valid, 1851 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-08 05:26:01,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2025-03-08 05:26:01,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 1051. [2025-03-08 05:26:01,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1051 states, 816 states have (on average 1.6593137254901962) internal successors, (1354), 846 states have internal predecessors, (1354), 190 states have call successors, (190), 43 states have call predecessors, (190), 44 states have return successors, (192), 174 states have call predecessors, (192), 185 states have call successors, (192) [2025-03-08 05:26:01,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1736 transitions. [2025-03-08 05:26:01,647 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1736 transitions. Word has length 73 [2025-03-08 05:26:01,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:01,648 INFO L471 AbstractCegarLoop]: Abstraction has 1051 states and 1736 transitions. [2025-03-08 05:26:01,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 6 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-08 05:26:01,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1736 transitions. [2025-03-08 05:26:01,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 05:26:01,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:01,651 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:26:01,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 05:26:01,652 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:01,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:01,652 INFO L85 PathProgramCache]: Analyzing trace with hash 704365335, now seen corresponding path program 1 times [2025-03-08 05:26:01,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:01,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785319993] [2025-03-08 05:26:01,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:01,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:01,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 05:26:01,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 05:26:01,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:01,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:01,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:26:01,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:01,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785319993] [2025-03-08 05:26:01,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785319993] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:01,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:01,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:26:01,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274205694] [2025-03-08 05:26:01,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:01,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:26:01,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:01,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:26:01,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:26:01,961 INFO L87 Difference]: Start difference. First operand 1051 states and 1736 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 5 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-08 05:26:03,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:03,363 INFO L93 Difference]: Finished difference Result 2065 states and 3474 transitions. [2025-03-08 05:26:03,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:26:03,363 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 5 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) Word has length 112 [2025-03-08 05:26:03,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:03,370 INFO L225 Difference]: With dead ends: 2065 [2025-03-08 05:26:03,370 INFO L226 Difference]: Without dead ends: 1059 [2025-03-08 05:26:03,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:26:03,376 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 1311 mSDsluCounter, 1218 mSDsCounter, 0 mSdLazyCounter, 2747 mSolverCounterSat, 400 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1311 SdHoareTripleChecker+Valid, 1601 SdHoareTripleChecker+Invalid, 3147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 400 IncrementalHoareTripleChecker+Valid, 2747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:03,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1311 Valid, 1601 Invalid, 3147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [400 Valid, 2747 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 05:26:03,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2025-03-08 05:26:03,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 1059. [2025-03-08 05:26:03,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1059 states, 822 states have (on average 1.6545012165450121) internal successors, (1360), 852 states have internal predecessors, (1360), 190 states have call successors, (190), 43 states have call predecessors, (190), 46 states have return successors, (224), 176 states have call predecessors, (224), 185 states have call successors, (224) [2025-03-08 05:26:03,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1774 transitions. [2025-03-08 05:26:03,426 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 1774 transitions. Word has length 112 [2025-03-08 05:26:03,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:03,426 INFO L471 AbstractCegarLoop]: Abstraction has 1059 states and 1774 transitions. [2025-03-08 05:26:03,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 5 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-08 05:26:03,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1774 transitions. [2025-03-08 05:26:03,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 05:26:03,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:03,430 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:26:03,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 05:26:03,430 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:03,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:03,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1955669572, now seen corresponding path program 1 times [2025-03-08 05:26:03,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:03,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144413418] [2025-03-08 05:26:03,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:03,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:03,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 05:26:03,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 05:26:03,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:03,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:03,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:26:03,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:03,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144413418] [2025-03-08 05:26:03,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144413418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:03,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:03,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 05:26:03,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871145890] [2025-03-08 05:26:03,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:03,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 05:26:03,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:03,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 05:26:03,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:26:03,674 INFO L87 Difference]: Start difference. First operand 1059 states and 1774 transitions. Second operand has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 10 states have internal predecessors, (87), 5 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-08 05:26:07,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:07,635 INFO L93 Difference]: Finished difference Result 3876 states and 6535 transitions. [2025-03-08 05:26:07,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 05:26:07,635 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 10 states have internal predecessors, (87), 5 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) Word has length 112 [2025-03-08 05:26:07,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:07,648 INFO L225 Difference]: With dead ends: 3876 [2025-03-08 05:26:07,648 INFO L226 Difference]: Without dead ends: 2862 [2025-03-08 05:26:07,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2025-03-08 05:26:07,654 INFO L435 NwaCegarLoop]: 755 mSDtfsCounter, 2224 mSDsluCounter, 4020 mSDsCounter, 0 mSdLazyCounter, 10226 mSolverCounterSat, 636 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2302 SdHoareTripleChecker+Valid, 4775 SdHoareTripleChecker+Invalid, 10862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 636 IncrementalHoareTripleChecker+Valid, 10226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:07,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2302 Valid, 4775 Invalid, 10862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [636 Valid, 10226 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-03-08 05:26:07,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2862 states. [2025-03-08 05:26:07,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2862 to 2766. [2025-03-08 05:26:07,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2766 states, 2077 states have (on average 1.622532498796341) internal successors, (3370), 2153 states have internal predecessors, (3370), 566 states have call successors, (566), 99 states have call predecessors, (566), 122 states have return successors, (665), 546 states have call predecessors, (665), 561 states have call successors, (665) [2025-03-08 05:26:07,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 4601 transitions. [2025-03-08 05:26:07,786 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 4601 transitions. Word has length 112 [2025-03-08 05:26:07,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:07,787 INFO L471 AbstractCegarLoop]: Abstraction has 2766 states and 4601 transitions. [2025-03-08 05:26:07,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 10 states have internal predecessors, (87), 5 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-08 05:26:07,787 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 4601 transitions. [2025-03-08 05:26:07,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 05:26:07,790 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:07,790 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:26:07,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 05:26:07,790 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:07,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:07,791 INFO L85 PathProgramCache]: Analyzing trace with hash 212306488, now seen corresponding path program 1 times [2025-03-08 05:26:07,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:07,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494468480] [2025-03-08 05:26:07,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:07,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:07,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 05:26:07,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 05:26:07,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:07,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:07,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:26:07,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:07,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494468480] [2025-03-08 05:26:07,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494468480] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:07,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:07,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:26:07,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906730130] [2025-03-08 05:26:07,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:07,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:26:07,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:07,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:26:07,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:26:07,944 INFO L87 Difference]: Start difference. First operand 2766 states and 4601 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 5 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-08 05:26:10,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:10,094 INFO L93 Difference]: Finished difference Result 8883 states and 15150 transitions. [2025-03-08 05:26:10,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 05:26:10,094 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 5 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) Word has length 113 [2025-03-08 05:26:10,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:10,119 INFO L225 Difference]: With dead ends: 8883 [2025-03-08 05:26:10,120 INFO L226 Difference]: Without dead ends: 6162 [2025-03-08 05:26:10,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-08 05:26:10,131 INFO L435 NwaCegarLoop]: 612 mSDtfsCounter, 2757 mSDsluCounter, 1900 mSDsCounter, 0 mSdLazyCounter, 4514 mSolverCounterSat, 744 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2837 SdHoareTripleChecker+Valid, 2512 SdHoareTripleChecker+Invalid, 5258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 744 IncrementalHoareTripleChecker+Valid, 4514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:10,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2837 Valid, 2512 Invalid, 5258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [744 Valid, 4514 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-08 05:26:10,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6162 states. [2025-03-08 05:26:10,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6162 to 5927. [2025-03-08 05:26:10,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5927 states, 4453 states have (on average 1.6123961374354367) internal successors, (7180), 4634 states have internal predecessors, (7180), 1204 states have call successors, (1204), 237 states have call predecessors, (1204), 269 states have return successors, (1389), 1132 states have call predecessors, (1389), 1199 states have call successors, (1389) [2025-03-08 05:26:10,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5927 states to 5927 states and 9773 transitions. [2025-03-08 05:26:10,388 INFO L78 Accepts]: Start accepts. Automaton has 5927 states and 9773 transitions. Word has length 113 [2025-03-08 05:26:10,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:10,390 INFO L471 AbstractCegarLoop]: Abstraction has 5927 states and 9773 transitions. [2025-03-08 05:26:10,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 5 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-08 05:26:10,391 INFO L276 IsEmpty]: Start isEmpty. Operand 5927 states and 9773 transitions. [2025-03-08 05:26:10,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-08 05:26:10,393 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:10,394 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:26:10,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 05:26:10,394 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:10,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:10,394 INFO L85 PathProgramCache]: Analyzing trace with hash 549949729, now seen corresponding path program 1 times [2025-03-08 05:26:10,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:10,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575833233] [2025-03-08 05:26:10,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:10,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:10,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 05:26:10,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 05:26:10,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:10,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:10,531 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 05:26:10,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:10,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575833233] [2025-03-08 05:26:10,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575833233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:10,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:10,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:26:10,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296909262] [2025-03-08 05:26:10,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:10,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:26:10,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:10,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:26:10,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:26:10,533 INFO L87 Difference]: Start difference. First operand 5927 states and 9773 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-08 05:26:12,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:12,687 INFO L93 Difference]: Finished difference Result 16845 states and 28245 transitions. [2025-03-08 05:26:12,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:26:12,688 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 115 [2025-03-08 05:26:12,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:12,740 INFO L225 Difference]: With dead ends: 16845 [2025-03-08 05:26:12,740 INFO L226 Difference]: Without dead ends: 10959 [2025-03-08 05:26:12,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:26:12,760 INFO L435 NwaCegarLoop]: 724 mSDtfsCounter, 3256 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 3316 mSolverCounterSat, 882 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3292 SdHoareTripleChecker+Valid, 1819 SdHoareTripleChecker+Invalid, 4198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 882 IncrementalHoareTripleChecker+Valid, 3316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:12,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3292 Valid, 1819 Invalid, 4198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [882 Valid, 3316 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-08 05:26:12,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10959 states. [2025-03-08 05:26:13,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10959 to 9468. [2025-03-08 05:26:13,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9468 states, 6968 states have (on average 1.5984500574052813) internal successors, (11138), 7306 states have internal predecessors, (11138), 2070 states have call successors, (2070), 360 states have call predecessors, (2070), 429 states have return successors, (2408), 1997 states have call predecessors, (2408), 2065 states have call successors, (2408) [2025-03-08 05:26:13,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9468 states to 9468 states and 15616 transitions. [2025-03-08 05:26:13,262 INFO L78 Accepts]: Start accepts. Automaton has 9468 states and 15616 transitions. Word has length 115 [2025-03-08 05:26:13,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:13,262 INFO L471 AbstractCegarLoop]: Abstraction has 9468 states and 15616 transitions. [2025-03-08 05:26:13,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-08 05:26:13,263 INFO L276 IsEmpty]: Start isEmpty. Operand 9468 states and 15616 transitions. [2025-03-08 05:26:13,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-08 05:26:13,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:13,266 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:26:13,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 05:26:13,266 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:13,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:13,266 INFO L85 PathProgramCache]: Analyzing trace with hash 267522934, now seen corresponding path program 1 times [2025-03-08 05:26:13,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:13,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645741863] [2025-03-08 05:26:13,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:13,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:13,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 05:26:13,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 05:26:13,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:13,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:13,400 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 05:26:13,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:13,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645741863] [2025-03-08 05:26:13,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645741863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:13,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:13,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:26:13,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407442151] [2025-03-08 05:26:13,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:13,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:26:13,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:13,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:26:13,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:26:13,402 INFO L87 Difference]: Start difference. First operand 9468 states and 15616 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-08 05:26:16,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:16,163 INFO L93 Difference]: Finished difference Result 30622 states and 51706 transitions. [2025-03-08 05:26:16,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:26:16,163 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 116 [2025-03-08 05:26:16,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:16,273 INFO L225 Difference]: With dead ends: 30622 [2025-03-08 05:26:16,273 INFO L226 Difference]: Without dead ends: 21202 [2025-03-08 05:26:16,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:26:16,319 INFO L435 NwaCegarLoop]: 723 mSDtfsCounter, 3269 mSDsluCounter, 1109 mSDsCounter, 0 mSdLazyCounter, 3279 mSolverCounterSat, 905 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3306 SdHoareTripleChecker+Valid, 1832 SdHoareTripleChecker+Invalid, 4184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 905 IncrementalHoareTripleChecker+Valid, 3279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:16,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3306 Valid, 1832 Invalid, 4184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [905 Valid, 3279 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-08 05:26:16,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21202 states. [2025-03-08 05:26:17,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21202 to 18322. [2025-03-08 05:26:17,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18322 states, 13154 states have (on average 1.585221225482743) internal successors, (20852), 13892 states have internal predecessors, (20852), 4359 states have call successors, (4359), 608 states have call predecessors, (4359), 808 states have return successors, (5177), 4318 states have call predecessors, (5177), 4354 states have call successors, (5177) [2025-03-08 05:26:17,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18322 states to 18322 states and 30388 transitions. [2025-03-08 05:26:17,283 INFO L78 Accepts]: Start accepts. Automaton has 18322 states and 30388 transitions. Word has length 116 [2025-03-08 05:26:17,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:17,283 INFO L471 AbstractCegarLoop]: Abstraction has 18322 states and 30388 transitions. [2025-03-08 05:26:17,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-08 05:26:17,283 INFO L276 IsEmpty]: Start isEmpty. Operand 18322 states and 30388 transitions. [2025-03-08 05:26:17,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-08 05:26:17,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:17,286 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:26:17,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 05:26:17,286 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:17,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:17,287 INFO L85 PathProgramCache]: Analyzing trace with hash 412648508, now seen corresponding path program 1 times [2025-03-08 05:26:17,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:17,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436060771] [2025-03-08 05:26:17,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:17,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:17,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 05:26:17,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 05:26:17,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:17,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:17,424 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 05:26:17,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:17,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436060771] [2025-03-08 05:26:17,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436060771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:17,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:17,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:26:17,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348179906] [2025-03-08 05:26:17,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:17,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:26:17,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:17,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:26:17,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:26:17,426 INFO L87 Difference]: Start difference. First operand 18322 states and 30388 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-08 05:26:21,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:21,800 INFO L93 Difference]: Finished difference Result 67201 states and 114445 transitions. [2025-03-08 05:26:21,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:26:21,800 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 117 [2025-03-08 05:26:21,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:22,118 INFO L225 Difference]: With dead ends: 67201 [2025-03-08 05:26:22,118 INFO L226 Difference]: Without dead ends: 48929 [2025-03-08 05:26:22,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:26:22,203 INFO L435 NwaCegarLoop]: 729 mSDtfsCounter, 3281 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 3288 mSolverCounterSat, 907 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3319 SdHoareTripleChecker+Valid, 1853 SdHoareTripleChecker+Invalid, 4195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 907 IncrementalHoareTripleChecker+Valid, 3288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:22,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3319 Valid, 1853 Invalid, 4195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [907 Valid, 3288 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-08 05:26:22,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48929 states. [2025-03-08 05:26:25,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48929 to 41594. [2025-03-08 05:26:25,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41594 states, 29220 states have (on average 1.5772416153319644) internal successors, (46087), 31016 states have internal predecessors, (46087), 10614 states have call successors, (10614), 1104 states have call predecessors, (10614), 1759 states have return successors, (12976), 10747 states have call predecessors, (12976), 10609 states have call successors, (12976) [2025-03-08 05:26:25,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41594 states to 41594 states and 69677 transitions. [2025-03-08 05:26:25,455 INFO L78 Accepts]: Start accepts. Automaton has 41594 states and 69677 transitions. Word has length 117 [2025-03-08 05:26:25,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:25,455 INFO L471 AbstractCegarLoop]: Abstraction has 41594 states and 69677 transitions. [2025-03-08 05:26:25,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-08 05:26:25,456 INFO L276 IsEmpty]: Start isEmpty. Operand 41594 states and 69677 transitions. [2025-03-08 05:26:25,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-08 05:26:25,458 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:25,458 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:26:25,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 05:26:25,459 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:25,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:25,459 INFO L85 PathProgramCache]: Analyzing trace with hash 926995633, now seen corresponding path program 1 times [2025-03-08 05:26:25,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:25,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046292441] [2025-03-08 05:26:25,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:25,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:25,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-08 05:26:25,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-08 05:26:25,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:25,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:25,571 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 05:26:25,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:25,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046292441] [2025-03-08 05:26:25,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046292441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:25,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:25,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:26:25,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094749937] [2025-03-08 05:26:25,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:25,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:26:25,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:25,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:26:25,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:26:25,573 INFO L87 Difference]: Start difference. First operand 41594 states and 69677 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-08 05:26:35,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:35,473 INFO L93 Difference]: Finished difference Result 168888 states and 290333 transitions. [2025-03-08 05:26:35,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:26:35,473 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 118 [2025-03-08 05:26:35,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:36,252 INFO L225 Difference]: With dead ends: 168888 [2025-03-08 05:26:36,252 INFO L226 Difference]: Without dead ends: 127348 [2025-03-08 05:26:36,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:26:36,445 INFO L435 NwaCegarLoop]: 735 mSDtfsCounter, 3293 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 3297 mSolverCounterSat, 909 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3332 SdHoareTripleChecker+Valid, 1874 SdHoareTripleChecker+Invalid, 4206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 909 IncrementalHoareTripleChecker+Valid, 3297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:36,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3332 Valid, 1874 Invalid, 4206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [909 Valid, 3297 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-08 05:26:36,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127348 states. [2025-03-08 05:26:43,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127348 to 105770. [2025-03-08 05:26:43,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105770 states, 73280 states have (on average 1.5742085152838428) internal successors, (115358), 77960 states have internal predecessors, (115358), 28189 states have call successors, (28189), 2096 states have call predecessors, (28189), 4300 states have return successors, (35557), 29024 states have call predecessors, (35557), 28184 states have call successors, (35557)