./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec2_product17.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_product17.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 f4d752ef50871b3af82701ffcd8ca92c2975f63f8274731e1afbb137d2562986 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:25:39,190 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:25:39,249 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:39,252 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:25:39,252 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:25:39,271 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:25:39,272 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:25:39,272 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:25:39,273 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:25:39,273 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:25:39,273 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:25:39,274 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:25:39,274 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:25:39,274 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:25:39,274 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:25:39,274 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:25:39,274 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:25:39,274 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:25:39,275 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:25:39,275 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:25:39,275 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:25:39,275 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:25:39,275 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:25:39,275 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:25:39,275 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:25:39,275 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:25:39,275 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:25:39,275 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:25:39,275 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:25:39,275 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:25:39,275 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:25:39,276 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:25:39,276 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:25:39,276 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:25:39,276 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:25:39,276 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:25:39,276 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:25:39,277 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:25:39,277 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:25:39,277 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:25:39,277 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:25:39,277 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:25:39,277 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:25:39,277 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 -> f4d752ef50871b3af82701ffcd8ca92c2975f63f8274731e1afbb137d2562986 [2025-03-08 05:25:39,513 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:25:39,522 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:25:39,523 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:25:39,524 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:25:39,524 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:25:39,525 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec2_product17.cil.c [2025-03-08 05:25:40,626 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ce39e105/51d9f17f02064c31be9641bc6fc7e5e2/FLAG7109c8c7d [2025-03-08 05:25:41,004 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:25:41,005 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product17.cil.c [2025-03-08 05:25:41,029 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ce39e105/51d9f17f02064c31be9641bc6fc7e5e2/FLAG7109c8c7d [2025-03-08 05:25:41,203 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ce39e105/51d9f17f02064c31be9641bc6fc7e5e2 [2025-03-08 05:25:41,205 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:25:41,206 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:25:41,207 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:25:41,207 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:25:41,211 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:25:41,212 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:25:41" (1/1) ... [2025-03-08 05:25:41,213 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e6a8f98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:41, skipping insertion in model container [2025-03-08 05:25:41,213 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:25:41" (1/1) ... [2025-03-08 05:25:41,261 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:25:41,449 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_product17.cil.c[17414,17427] [2025-03-08 05:25:41,646 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:25:41,664 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:25:41,671 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [48] [2025-03-08 05:25:41,672 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [716] [2025-03-08 05:25:41,672 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [725] [2025-03-08 05:25:41,673 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [846] [2025-03-08 05:25:41,673 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [884] [2025-03-08 05:25:41,673 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [983] [2025-03-08 05:25:41,673 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1337] [2025-03-08 05:25:41,674 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [2786] [2025-03-08 05:25:41,674 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2967] [2025-03-08 05:25:41,674 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [3333] [2025-03-08 05:25:41,696 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_product17.cil.c[17414,17427] [2025-03-08 05:25:41,764 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:25:41,786 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:25:41,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:41 WrapperNode [2025-03-08 05:25:41,787 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:25:41,788 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:25:41,788 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:25:41,788 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:25:41,792 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:41" (1/1) ... [2025-03-08 05:25:41,811 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:41" (1/1) ... [2025-03-08 05:25:41,843 INFO L138 Inliner]: procedures = 90, calls = 332, calls flagged for inlining = 25, calls inlined = 22, statements flattened = 798 [2025-03-08 05:25:41,843 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:25:41,844 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:25:41,844 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:25:41,844 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:25:41,854 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:41" (1/1) ... [2025-03-08 05:25:41,854 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:41" (1/1) ... [2025-03-08 05:25:41,859 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:41" (1/1) ... [2025-03-08 05:25:41,886 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. 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:41,887 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:41" (1/1) ... [2025-03-08 05:25:41,887 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:41" (1/1) ... [2025-03-08 05:25:41,901 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:41" (1/1) ... [2025-03-08 05:25:41,902 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:41" (1/1) ... [2025-03-08 05:25:41,905 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:41" (1/1) ... [2025-03-08 05:25:41,906 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:41" (1/1) ... [2025-03-08 05:25:41,909 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:25:41,910 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:25:41,910 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:25:41,910 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:25:41,912 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:41" (1/1) ... [2025-03-08 05:25:41,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:25:41,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:25:41,942 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:41,944 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:41,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:25:41,961 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-03-08 05:25:41,961 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-03-08 05:25:41,961 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-03-08 05:25:41,961 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-03-08 05:25:41,961 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-03-08 05:25:41,961 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-03-08 05:25:41,961 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-03-08 05:25:41,961 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-03-08 05:25:41,962 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-03-08 05:25:41,962 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-03-08 05:25:41,962 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-08 05:25:41,962 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-08 05:25:41,962 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-08 05:25:41,962 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-08 05:25:41,962 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2025-03-08 05:25:41,963 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2025-03-08 05:25:41,963 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-03-08 05:25:41,963 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-03-08 05:25:41,963 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-03-08 05:25:41,963 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-03-08 05:25:41,963 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-03-08 05:25:41,964 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-03-08 05:25:41,964 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-03-08 05:25:41,964 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-03-08 05:25:41,964 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-03-08 05:25:41,964 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-03-08 05:25:41,964 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-03-08 05:25:41,964 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-03-08 05:25:41,964 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-03-08 05:25:41,964 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-03-08 05:25:41,964 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-03-08 05:25:41,965 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-03-08 05:25:41,965 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-03-08 05:25:41,965 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-03-08 05:25:41,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:25:41,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:25:41,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 05:25:41,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 05:25:41,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 05:25:41,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 05:25:41,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 05:25:41,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 05:25:41,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-08 05:25:41,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-08 05:25:41,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-08 05:25:41,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-08 05:25:41,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-08 05:25:41,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-08 05:25:41,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-08 05:25:41,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-08 05:25:41,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-08 05:25:41,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-08 05:25:41,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-08 05:25:41,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-08 05:25:41,965 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-03-08 05:25:41,965 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-03-08 05:25:41,965 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-03-08 05:25:41,965 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-03-08 05:25:41,965 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-03-08 05:25:41,965 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-03-08 05:25:41,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:25:41,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:25:41,966 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-03-08 05:25:41,966 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-03-08 05:25:42,113 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:25:42,116 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:25:42,159 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L843: #res := ~retValue_acc~5; [2025-03-08 05:25:42,183 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L765: #res := ~retValue_acc~3; [2025-03-08 05:25:42,186 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1411: #res := ~retValue_acc~10; [2025-03-08 05:25:42,481 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2106: #res := ~retValue_acc~18; [2025-03-08 05:25:42,551 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2210: #res := ~retValue_acc~21; [2025-03-08 05:25:42,563 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L804: #res := ~retValue_acc~4; [2025-03-08 05:25:42,699 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1741-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~16#1; [2025-03-08 05:25:42,699 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1754-1: isIdle_#res#1 := isIdle_~retValue_acc~17#1; [2025-03-08 05:25:42,871 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2196-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~20#1; [2025-03-08 05:25:42,871 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1569-1: getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~11#1; [2025-03-08 05:25:42,871 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1612-1: buttonForFloorIsPressed_#res#1 := buttonForFloorIsPressed_~retValue_acc~13#1; [2025-03-08 05:25:42,928 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L402: #res := ~retValue_acc~1; [2025-03-08 05:25:42,992 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1334-1: main_#res#1 := main_~retValue_acc~9#1; [2025-03-08 05:25:42,992 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L881-1: valid_product_#res#1 := valid_product_~retValue_acc~7#1; [2025-03-08 05:25:43,003 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L166: #res := ~retValue_acc~0; [2025-03-08 05:25:43,005 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1578: #res := ~retValue_acc~12; [2025-03-08 05:25:43,010 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L713: #res := ~retValue_acc~2; [2025-03-08 05:25:43,167 INFO L? ?]: Removed 427 outVars from TransFormulas that were not future-live. [2025-03-08 05:25:43,167 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:25:43,188 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:25:43,189 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:25:43,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:25:43 BoogieIcfgContainer [2025-03-08 05:25:43,189 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:25:43,192 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:25:43,192 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:25:43,196 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:25:43,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:25:41" (1/3) ... [2025-03-08 05:25:43,196 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cf19ef9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:25:43, skipping insertion in model container [2025-03-08 05:25:43,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:41" (2/3) ... [2025-03-08 05:25:43,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cf19ef9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:25:43, skipping insertion in model container [2025-03-08 05:25:43,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:25:43" (3/3) ... [2025-03-08 05:25:43,198 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product17.cil.c [2025-03-08 05:25:43,211 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:25:43,214 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec2_product17.cil.c that has 22 procedures, 530 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:25:43,271 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:25:43,280 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;@6de0bab6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:25:43,280 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:25:43,286 INFO L276 IsEmpty]: Start isEmpty. Operand has 530 states, 419 states have (on average 1.7112171837708832) internal successors, (717), 440 states have internal predecessors, (717), 88 states have call successors, (88), 21 states have call predecessors, (88), 21 states have return successors, (88), 82 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-08 05:25:43,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-08 05:25:43,302 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:43,303 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] [2025-03-08 05:25:43,303 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:43,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:43,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1407054602, now seen corresponding path program 1 times [2025-03-08 05:25:43,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:43,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548501390] [2025-03-08 05:25:43,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:43,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:43,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 05:25:43,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 05:25:43,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:43,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:43,765 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:43,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:43,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548501390] [2025-03-08 05:25:43,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548501390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:43,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:43,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:25:43,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894237701] [2025-03-08 05:25:43,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:43,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:25:43,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:43,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:25:43,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:43,787 INFO L87 Difference]: Start difference. First operand has 530 states, 419 states have (on average 1.7112171837708832) internal successors, (717), 440 states have internal predecessors, (717), 88 states have call successors, (88), 21 states have call predecessors, (88), 21 states have return successors, (88), 82 states have call predecessors, (88), 88 states have call successors, (88) Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:25:43,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:43,907 INFO L93 Difference]: Finished difference Result 1040 states and 1761 transitions. [2025-03-08 05:25:43,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:25:43,909 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 74 [2025-03-08 05:25:43,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:43,924 INFO L225 Difference]: With dead ends: 1040 [2025-03-08 05:25:43,924 INFO L226 Difference]: Without dead ends: 522 [2025-03-08 05:25:43,931 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:43,932 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 5 mSDsluCounter, 1742 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2615 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:43,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2615 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:43,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-03-08 05:25:43,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 522. [2025-03-08 05:25:43,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 413 states have (on average 1.7094430992736078) internal successors, (706), 432 states have internal predecessors, (706), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-08 05:25:43,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 877 transitions. [2025-03-08 05:25:44,003 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 877 transitions. Word has length 74 [2025-03-08 05:25:44,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:44,004 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 877 transitions. [2025-03-08 05:25:44,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:25:44,004 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 877 transitions. [2025-03-08 05:25:44,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 05:25:44,009 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:44,010 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] [2025-03-08 05:25:44,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:25:44,011 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:44,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:44,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1741757151, now seen corresponding path program 1 times [2025-03-08 05:25:44,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:44,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372882026] [2025-03-08 05:25:44,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:44,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:44,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 05:25:44,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 05:25:44,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:44,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:44,179 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:44,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:44,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372882026] [2025-03-08 05:25:44,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372882026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:44,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:44,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:25:44,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169877223] [2025-03-08 05:25:44,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:44,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:25:44,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:44,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:25:44,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:44,183 INFO L87 Difference]: Start difference. First operand 522 states and 877 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:25:44,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:44,241 INFO L93 Difference]: Finished difference Result 1026 states and 1731 transitions. [2025-03-08 05:25:44,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:25:44,242 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 76 [2025-03-08 05:25:44,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:44,247 INFO L225 Difference]: With dead ends: 1026 [2025-03-08 05:25:44,248 INFO L226 Difference]: Without dead ends: 522 [2025-03-08 05:25:44,250 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:44,251 INFO L435 NwaCegarLoop]: 866 mSDtfsCounter, 4 mSDsluCounter, 1728 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2594 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:44,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2594 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:44,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-03-08 05:25:44,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 522. [2025-03-08 05:25:44,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 413 states have (on average 1.7070217917675545) internal successors, (705), 432 states have internal predecessors, (705), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-08 05:25:44,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 876 transitions. [2025-03-08 05:25:44,285 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 876 transitions. Word has length 76 [2025-03-08 05:25:44,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:44,286 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 876 transitions. [2025-03-08 05:25:44,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:25:44,286 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 876 transitions. [2025-03-08 05:25:44,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 05:25:44,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:44,291 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] [2025-03-08 05:25:44,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:25:44,291 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:44,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:44,292 INFO L85 PathProgramCache]: Analyzing trace with hash 2127979441, now seen corresponding path program 1 times [2025-03-08 05:25:44,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:44,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769042559] [2025-03-08 05:25:44,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:44,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:44,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 05:25:44,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 05:25:44,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:44,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:44,443 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:44,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:44,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769042559] [2025-03-08 05:25:44,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769042559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:44,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:44,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:25:44,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252707647] [2025-03-08 05:25:44,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:44,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:25:44,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:44,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:25:44,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:44,446 INFO L87 Difference]: Start difference. First operand 522 states and 876 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:25:44,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:44,494 INFO L93 Difference]: Finished difference Result 1026 states and 1730 transitions. [2025-03-08 05:25:44,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:25:44,495 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 77 [2025-03-08 05:25:44,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:44,498 INFO L225 Difference]: With dead ends: 1026 [2025-03-08 05:25:44,498 INFO L226 Difference]: Without dead ends: 522 [2025-03-08 05:25:44,500 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:44,500 INFO L435 NwaCegarLoop]: 866 mSDtfsCounter, 3 mSDsluCounter, 1728 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2594 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:44,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2594 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:44,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-03-08 05:25:44,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 522. [2025-03-08 05:25:44,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 413 states have (on average 1.7046004842615012) internal successors, (704), 432 states have internal predecessors, (704), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-08 05:25:44,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 875 transitions. [2025-03-08 05:25:44,519 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 875 transitions. Word has length 77 [2025-03-08 05:25:44,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:44,519 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 875 transitions. [2025-03-08 05:25:44,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:25:44,519 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 875 transitions. [2025-03-08 05:25:44,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 05:25:44,522 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:44,522 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] [2025-03-08 05:25:44,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:25:44,522 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:44,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:44,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1061663138, now seen corresponding path program 1 times [2025-03-08 05:25:44,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:44,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260757325] [2025-03-08 05:25:44,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:44,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:44,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 05:25:44,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 05:25:44,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:44,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:44,640 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:44,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:44,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260757325] [2025-03-08 05:25:44,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260757325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:44,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:44,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:25:44,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890220965] [2025-03-08 05:25:44,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:44,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:25:44,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:44,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:25:44,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:44,645 INFO L87 Difference]: Start difference. First operand 522 states and 875 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:25:44,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:44,689 INFO L93 Difference]: Finished difference Result 1026 states and 1729 transitions. [2025-03-08 05:25:44,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:25:44,691 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 78 [2025-03-08 05:25:44,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:44,695 INFO L225 Difference]: With dead ends: 1026 [2025-03-08 05:25:44,696 INFO L226 Difference]: Without dead ends: 522 [2025-03-08 05:25:44,698 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:44,699 INFO L435 NwaCegarLoop]: 866 mSDtfsCounter, 2 mSDsluCounter, 1728 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2594 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:44,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2594 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:44,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-03-08 05:25:44,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 522. [2025-03-08 05:25:44,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 413 states have (on average 1.702179176755448) internal successors, (703), 432 states have internal predecessors, (703), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-08 05:25:44,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 874 transitions. [2025-03-08 05:25:44,723 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 874 transitions. Word has length 78 [2025-03-08 05:25:44,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:44,724 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 874 transitions. [2025-03-08 05:25:44,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:25:44,724 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 874 transitions. [2025-03-08 05:25:44,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 05:25:44,726 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:44,727 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] [2025-03-08 05:25:44,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 05:25:44,727 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:44,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:44,728 INFO L85 PathProgramCache]: Analyzing trace with hash -2083676588, now seen corresponding path program 1 times [2025-03-08 05:25:44,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:44,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016950100] [2025-03-08 05:25:44,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:44,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:44,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 05:25:44,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 05:25:44,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:44,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:44,876 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:44,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:44,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016950100] [2025-03-08 05:25:44,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016950100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:44,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:44,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:25:44,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339700693] [2025-03-08 05:25:44,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:44,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:25:44,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:44,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:25:44,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:44,877 INFO L87 Difference]: Start difference. First operand 522 states and 874 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:25:44,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:44,918 INFO L93 Difference]: Finished difference Result 1026 states and 1728 transitions. [2025-03-08 05:25:44,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:25:44,918 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 79 [2025-03-08 05:25:44,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:44,923 INFO L225 Difference]: With dead ends: 1026 [2025-03-08 05:25:44,923 INFO L226 Difference]: Without dead ends: 522 [2025-03-08 05:25:44,926 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:44,928 INFO L435 NwaCegarLoop]: 866 mSDtfsCounter, 1 mSDsluCounter, 1728 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2594 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:44,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2594 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:44,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-03-08 05:25:44,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 522. [2025-03-08 05:25:44,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 413 states have (on average 1.6997578692493946) internal successors, (702), 432 states have internal predecessors, (702), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-08 05:25:44,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 873 transitions. [2025-03-08 05:25:44,959 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 873 transitions. Word has length 79 [2025-03-08 05:25:44,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:44,959 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 873 transitions. [2025-03-08 05:25:44,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:25:44,959 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 873 transitions. [2025-03-08 05:25:44,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-08 05:25:44,962 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:44,962 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] [2025-03-08 05:25:44,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:25:44,962 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:44,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:44,963 INFO L85 PathProgramCache]: Analyzing trace with hash -959265691, now seen corresponding path program 1 times [2025-03-08 05:25:44,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:44,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172662934] [2025-03-08 05:25:44,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:44,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:44,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 05:25:44,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 05:25:44,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:44,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:45,199 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:45,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:45,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172662934] [2025-03-08 05:25:45,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172662934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:45,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:45,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 05:25:45,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879712119] [2025-03-08 05:25:45,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:45,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 05:25:45,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:45,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 05:25:45,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:25:45,201 INFO L87 Difference]: Start difference. First operand 522 states and 873 transitions. Second operand has 9 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 05:25:45,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:45,303 INFO L93 Difference]: Finished difference Result 992 states and 1660 transitions. [2025-03-08 05:25:45,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 05:25:45,304 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 80 [2025-03-08 05:25:45,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:45,307 INFO L225 Difference]: With dead ends: 992 [2025-03-08 05:25:45,307 INFO L226 Difference]: Without dead ends: 537 [2025-03-08 05:25:45,309 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:45,309 INFO L435 NwaCegarLoop]: 861 mSDtfsCounter, 91 mSDsluCounter, 5944 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 6805 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:45,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 6805 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:45,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-03-08 05:25:45,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 535. [2025-03-08 05:25:45,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 423 states have (on average 1.6950354609929077) internal successors, (717), 444 states have internal predecessors, (717), 89 states have call successors, (89), 21 states have call predecessors, (89), 22 states have return successors, (86), 82 states have call predecessors, (86), 84 states have call successors, (86) [2025-03-08 05:25:45,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 892 transitions. [2025-03-08 05:25:45,327 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 892 transitions. Word has length 80 [2025-03-08 05:25:45,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:45,328 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 892 transitions. [2025-03-08 05:25:45,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 05:25:45,328 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 892 transitions. [2025-03-08 05:25:45,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-08 05:25:45,330 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:45,330 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] [2025-03-08 05:25:45,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:25:45,330 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:45,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:45,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1167963994, now seen corresponding path program 1 times [2025-03-08 05:25:45,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:45,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042981298] [2025-03-08 05:25:45,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:45,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:45,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 05:25:45,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 05:25:45,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:45,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:45,392 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:45,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:45,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042981298] [2025-03-08 05:25:45,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042981298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:45,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:45,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:25:45,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255359394] [2025-03-08 05:25:45,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:45,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:25:45,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:45,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:25:45,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:45,394 INFO L87 Difference]: Start difference. First operand 535 states and 892 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:25:45,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:45,423 INFO L93 Difference]: Finished difference Result 1044 states and 1754 transitions. [2025-03-08 05:25:45,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:25:45,423 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 80 [2025-03-08 05:25:45,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:45,426 INFO L225 Difference]: With dead ends: 1044 [2025-03-08 05:25:45,426 INFO L226 Difference]: Without dead ends: 516 [2025-03-08 05:25:45,428 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:45,429 INFO L435 NwaCegarLoop]: 867 mSDtfsCounter, 0 mSDsluCounter, 1729 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2596 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:45,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2596 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:45,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-03-08 05:25:45,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2025-03-08 05:25:45,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 407 states have (on average 1.6904176904176904) internal successors, (688), 426 states have internal predecessors, (688), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-08 05:25:45,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 859 transitions. [2025-03-08 05:25:45,443 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 859 transitions. Word has length 80 [2025-03-08 05:25:45,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:45,443 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 859 transitions. [2025-03-08 05:25:45,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:25:45,443 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 859 transitions. [2025-03-08 05:25:45,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 05:25:45,445 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:45,445 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] [2025-03-08 05:25:45,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:25:45,445 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:45,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:45,446 INFO L85 PathProgramCache]: Analyzing trace with hash -579411077, now seen corresponding path program 1 times [2025-03-08 05:25:45,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:45,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293526897] [2025-03-08 05:25:45,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:45,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:45,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 05:25:45,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 05:25:45,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:45,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:45,594 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:45,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:45,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293526897] [2025-03-08 05:25:45,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293526897] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:45,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:45,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:25:45,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107016874] [2025-03-08 05:25:45,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:45,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:25:45,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:45,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:25:45,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:25:45,596 INFO L87 Difference]: Start difference. First operand 516 states and 859 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:25:45,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:45,777 INFO L93 Difference]: Finished difference Result 989 states and 1652 transitions. [2025-03-08 05:25:45,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:25:45,779 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 81 [2025-03-08 05:25:45,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:45,784 INFO L225 Difference]: With dead ends: 989 [2025-03-08 05:25:45,784 INFO L226 Difference]: Without dead ends: 525 [2025-03-08 05:25:45,786 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:45,787 INFO L435 NwaCegarLoop]: 816 mSDtfsCounter, 55 mSDsluCounter, 3235 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4051 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:45,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4051 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:45,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2025-03-08 05:25:45,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 516. [2025-03-08 05:25:45,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 407 states have (on average 1.6805896805896805) internal successors, (684), 426 states have internal predecessors, (684), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-08 05:25:45,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 855 transitions. [2025-03-08 05:25:45,812 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 855 transitions. Word has length 81 [2025-03-08 05:25:45,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:45,812 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 855 transitions. [2025-03-08 05:25:45,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:25:45,812 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 855 transitions. [2025-03-08 05:25:45,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-08 05:25:45,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:45,815 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] [2025-03-08 05:25:45,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:25:45,815 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:45,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:45,816 INFO L85 PathProgramCache]: Analyzing trace with hash -53349458, now seen corresponding path program 1 times [2025-03-08 05:25:45,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:45,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685440368] [2025-03-08 05:25:45,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:45,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:45,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 05:25:45,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 05:25:45,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:45,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:45,955 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:45,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:45,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685440368] [2025-03-08 05:25:45,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685440368] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:45,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:45,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:25:45,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654536215] [2025-03-08 05:25:45,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:45,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:25:45,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:45,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:25:45,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:25:45,959 INFO L87 Difference]: Start difference. First operand 516 states and 855 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:25:46,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:46,135 INFO L93 Difference]: Finished difference Result 989 states and 1648 transitions. [2025-03-08 05:25:46,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:25:46,136 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 82 [2025-03-08 05:25:46,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:46,141 INFO L225 Difference]: With dead ends: 989 [2025-03-08 05:25:46,141 INFO L226 Difference]: Without dead ends: 525 [2025-03-08 05:25:46,143 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:46,144 INFO L435 NwaCegarLoop]: 816 mSDtfsCounter, 54 mSDsluCounter, 3235 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4051 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:46,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4051 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:46,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2025-03-08 05:25:46,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 516. [2025-03-08 05:25:46,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 407 states have (on average 1.6707616707616708) internal successors, (680), 426 states have internal predecessors, (680), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-08 05:25:46,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 851 transitions. [2025-03-08 05:25:46,163 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 851 transitions. Word has length 82 [2025-03-08 05:25:46,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:46,163 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 851 transitions. [2025-03-08 05:25:46,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:25:46,164 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 851 transitions. [2025-03-08 05:25:46,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-08 05:25:46,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:46,166 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] [2025-03-08 05:25:46,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:25:46,167 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:46,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:46,167 INFO L85 PathProgramCache]: Analyzing trace with hash 2129078968, now seen corresponding path program 1 times [2025-03-08 05:25:46,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:46,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700842182] [2025-03-08 05:25:46,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:46,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:46,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 05:25:46,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 05:25:46,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:46,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:46,304 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:46,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:46,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700842182] [2025-03-08 05:25:46,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700842182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:46,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:46,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:25:46,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641244455] [2025-03-08 05:25:46,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:46,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:25:46,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:46,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:25:46,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:25:46,306 INFO L87 Difference]: Start difference. First operand 516 states and 851 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:25:46,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:46,429 INFO L93 Difference]: Finished difference Result 989 states and 1644 transitions. [2025-03-08 05:25:46,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:25:46,430 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 83 [2025-03-08 05:25:46,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:46,434 INFO L225 Difference]: With dead ends: 989 [2025-03-08 05:25:46,434 INFO L226 Difference]: Without dead ends: 525 [2025-03-08 05:25:46,436 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:46,436 INFO L435 NwaCegarLoop]: 815 mSDtfsCounter, 53 mSDsluCounter, 3218 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4033 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:46,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4033 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:46,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2025-03-08 05:25:46,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 516. [2025-03-08 05:25:46,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 407 states have (on average 1.660933660933661) internal successors, (676), 426 states have internal predecessors, (676), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-08 05:25:46,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 847 transitions. [2025-03-08 05:25:46,451 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 847 transitions. Word has length 83 [2025-03-08 05:25:46,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:46,451 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 847 transitions. [2025-03-08 05:25:46,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:25:46,452 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 847 transitions. [2025-03-08 05:25:46,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-08 05:25:46,453 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:46,454 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] [2025-03-08 05:25:46,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 05:25:46,454 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:46,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:46,454 INFO L85 PathProgramCache]: Analyzing trace with hash -332305751, now seen corresponding path program 1 times [2025-03-08 05:25:46,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:46,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896499432] [2025-03-08 05:25:46,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:46,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:46,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 05:25:46,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 05:25:46,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:46,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:46,580 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:46,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:46,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896499432] [2025-03-08 05:25:46,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896499432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:46,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:46,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:25:46,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154329450] [2025-03-08 05:25:46,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:46,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:25:46,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:46,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:25:46,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:25:46,581 INFO L87 Difference]: Start difference. First operand 516 states and 847 transitions. Second operand has 7 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 05:25:46,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:46,659 INFO L93 Difference]: Finished difference Result 980 states and 1626 transitions. [2025-03-08 05:25:46,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:25:46,660 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 83 [2025-03-08 05:25:46,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:46,665 INFO L225 Difference]: With dead ends: 980 [2025-03-08 05:25:46,665 INFO L226 Difference]: Without dead ends: 495 [2025-03-08 05:25:46,668 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:46,669 INFO L435 NwaCegarLoop]: 836 mSDtfsCounter, 84 mSDsluCounter, 4107 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 4943 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:46,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 4943 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:46,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2025-03-08 05:25:46,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 495. [2025-03-08 05:25:46,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 386 states have (on average 1.6632124352331605) internal successors, (642), 405 states have internal predecessors, (642), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-08 05:25:46,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 813 transitions. [2025-03-08 05:25:46,688 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 813 transitions. Word has length 83 [2025-03-08 05:25:46,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:46,688 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 813 transitions. [2025-03-08 05:25:46,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 05:25:46,689 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 813 transitions. [2025-03-08 05:25:46,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-08 05:25:46,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:46,693 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] [2025-03-08 05:25:46,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:25:46,693 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:46,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:46,694 INFO L85 PathProgramCache]: Analyzing trace with hash -175696437, now seen corresponding path program 1 times [2025-03-08 05:25:46,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:46,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216206468] [2025-03-08 05:25:46,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:46,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:46,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-08 05:25:46,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-08 05:25:46,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:46,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:46,830 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:46,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:46,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216206468] [2025-03-08 05:25:46,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216206468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:46,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:46,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:25:46,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169787723] [2025-03-08 05:25:46,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:46,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:25:46,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:46,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:25:46,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:25:46,832 INFO L87 Difference]: Start difference. First operand 495 states and 813 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:25:46,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:46,911 INFO L93 Difference]: Finished difference Result 959 states and 1592 transitions. [2025-03-08 05:25:46,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:25:46,912 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 84 [2025-03-08 05:25:46,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:46,917 INFO L225 Difference]: With dead ends: 959 [2025-03-08 05:25:46,917 INFO L226 Difference]: Without dead ends: 495 [2025-03-08 05:25:46,920 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:46,921 INFO L435 NwaCegarLoop]: 796 mSDtfsCounter, 17 mSDsluCounter, 3175 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 3971 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:46,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 3971 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:46,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2025-03-08 05:25:46,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 495. [2025-03-08 05:25:46,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 386 states have (on average 1.660621761658031) internal successors, (641), 405 states have internal predecessors, (641), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-08 05:25:46,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 812 transitions. [2025-03-08 05:25:46,945 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 812 transitions. Word has length 84 [2025-03-08 05:25:46,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:46,946 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 812 transitions. [2025-03-08 05:25:46,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:25:46,946 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 812 transitions. [2025-03-08 05:25:46,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-08 05:25:46,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:46,949 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] [2025-03-08 05:25:46,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 05:25:46,949 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:46,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:46,950 INFO L85 PathProgramCache]: Analyzing trace with hash 150130165, now seen corresponding path program 1 times [2025-03-08 05:25:46,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:46,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735531459] [2025-03-08 05:25:46,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:46,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:46,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-08 05:25:46,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-08 05:25:46,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:46,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:47,103 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:47,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:47,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735531459] [2025-03-08 05:25:47,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735531459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:47,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:47,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:25:47,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088357391] [2025-03-08 05:25:47,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:47,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:25:47,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:47,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:25:47,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:25:47,106 INFO L87 Difference]: Start difference. First operand 495 states and 812 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:25:47,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:47,183 INFO L93 Difference]: Finished difference Result 959 states and 1591 transitions. [2025-03-08 05:25:47,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:25:47,184 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 85 [2025-03-08 05:25:47,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:47,188 INFO L225 Difference]: With dead ends: 959 [2025-03-08 05:25:47,189 INFO L226 Difference]: Without dead ends: 495 [2025-03-08 05:25:47,191 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:47,192 INFO L435 NwaCegarLoop]: 796 mSDtfsCounter, 16 mSDsluCounter, 3175 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 3971 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:47,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 3971 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:47,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2025-03-08 05:25:47,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 495. [2025-03-08 05:25:47,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 386 states have (on average 1.6580310880829014) internal successors, (640), 405 states have internal predecessors, (640), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-08 05:25:47,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 811 transitions. [2025-03-08 05:25:47,211 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 811 transitions. Word has length 85 [2025-03-08 05:25:47,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:47,211 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 811 transitions. [2025-03-08 05:25:47,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:25:47,211 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 811 transitions. [2025-03-08 05:25:47,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 05:25:47,213 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:47,213 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] [2025-03-08 05:25:47,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:25:47,214 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:47,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:47,214 INFO L85 PathProgramCache]: Analyzing trace with hash 420240360, now seen corresponding path program 1 times [2025-03-08 05:25:47,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:47,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707863939] [2025-03-08 05:25:47,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:47,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:47,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 05:25:47,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 05:25:47,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:47,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:47,372 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:47,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:47,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707863939] [2025-03-08 05:25:47,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707863939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:47,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:47,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 05:25:47,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677615625] [2025-03-08 05:25:47,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:47,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 05:25:47,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:47,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 05:25:47,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:25:47,374 INFO L87 Difference]: Start difference. First operand 495 states and 811 transitions. Second operand has 10 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 05:25:47,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:47,474 INFO L93 Difference]: Finished difference Result 953 states and 1579 transitions. [2025-03-08 05:25:47,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 05:25:47,474 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 86 [2025-03-08 05:25:47,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:47,477 INFO L225 Difference]: With dead ends: 953 [2025-03-08 05:25:47,477 INFO L226 Difference]: Without dead ends: 495 [2025-03-08 05:25:47,479 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:47,479 INFO L435 NwaCegarLoop]: 795 mSDtfsCounter, 6 mSDsluCounter, 6338 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 7133 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:47,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 7133 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:47,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2025-03-08 05:25:47,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 495. [2025-03-08 05:25:47,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 386 states have (on average 1.6554404145077721) internal successors, (639), 405 states have internal predecessors, (639), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-08 05:25:47,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 810 transitions. [2025-03-08 05:25:47,491 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 810 transitions. Word has length 86 [2025-03-08 05:25:47,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:47,492 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 810 transitions. [2025-03-08 05:25:47,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 05:25:47,492 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 810 transitions. [2025-03-08 05:25:47,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-08 05:25:47,493 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:47,493 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] [2025-03-08 05:25:47,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 05:25:47,494 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:47,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:47,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1985857282, now seen corresponding path program 1 times [2025-03-08 05:25:47,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:47,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709810125] [2025-03-08 05:25:47,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:47,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:47,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-08 05:25:47,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 05:25:47,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:47,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:47,651 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:47,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:47,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709810125] [2025-03-08 05:25:47,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709810125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:47,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:47,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:25:47,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001562256] [2025-03-08 05:25:47,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:47,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:25:47,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:47,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:25:47,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:25:47,653 INFO L87 Difference]: Start difference. First operand 495 states and 810 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 7 states have internal predecessors, (70), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 05:25:49,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:49,119 INFO L93 Difference]: Finished difference Result 949 states and 1591 transitions. [2025-03-08 05:25:49,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:25:49,119 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 7 states have internal predecessors, (70), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) Word has length 87 [2025-03-08 05:25:49,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:49,123 INFO L225 Difference]: With dead ends: 949 [2025-03-08 05:25:49,123 INFO L226 Difference]: Without dead ends: 499 [2025-03-08 05:25:49,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 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:25:49,125 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 1244 mSDsluCounter, 1210 mSDsCounter, 0 mSdLazyCounter, 2484 mSolverCounterSat, 362 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1244 SdHoareTripleChecker+Valid, 1584 SdHoareTripleChecker+Invalid, 2846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 362 IncrementalHoareTripleChecker+Valid, 2484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:49,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1244 Valid, 1584 Invalid, 2846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [362 Valid, 2484 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 05:25:49,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2025-03-08 05:25:49,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 499. [2025-03-08 05:25:49,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 389 states have (on average 1.6503856041131106) internal successors, (642), 408 states have internal predecessors, (642), 88 states have call successors, (88), 21 states have call predecessors, (88), 21 states have return successors, (99), 82 states have call predecessors, (99), 83 states have call successors, (99) [2025-03-08 05:25:49,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 829 transitions. [2025-03-08 05:25:49,145 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 829 transitions. Word has length 87 [2025-03-08 05:25:49,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:49,145 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 829 transitions. [2025-03-08 05:25:49,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 7 states have internal predecessors, (70), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 05:25:49,145 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 829 transitions. [2025-03-08 05:25:49,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 05:25:49,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:49,147 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] [2025-03-08 05:25:49,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 05:25:49,147 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:49,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:49,148 INFO L85 PathProgramCache]: Analyzing trace with hash 934586445, now seen corresponding path program 1 times [2025-03-08 05:25:49,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:49,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898829859] [2025-03-08 05:25:49,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:49,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:49,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 05:25:49,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 05:25:49,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:49,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:49,263 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:49,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:49,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898829859] [2025-03-08 05:25:49,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898829859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:49,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:49,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:25:49,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202539753] [2025-03-08 05:25:49,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:49,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:25:49,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:49,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:25:49,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:25:49,264 INFO L87 Difference]: Start difference. First operand 499 states and 829 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-08 05:25:51,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:51,964 INFO L93 Difference]: Finished difference Result 1784 states and 3059 transitions. [2025-03-08 05:25:51,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 05:25:51,964 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 88 [2025-03-08 05:25:51,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:51,973 INFO L225 Difference]: With dead ends: 1784 [2025-03-08 05:25:51,973 INFO L226 Difference]: Without dead ends: 1330 [2025-03-08 05:25:51,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 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:25:51,977 INFO L435 NwaCegarLoop]: 601 mSDtfsCounter, 2243 mSDsluCounter, 1969 mSDsCounter, 0 mSdLazyCounter, 4517 mSolverCounterSat, 576 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2312 SdHoareTripleChecker+Valid, 2570 SdHoareTripleChecker+Invalid, 5093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 576 IncrementalHoareTripleChecker+Valid, 4517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:51,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2312 Valid, 2570 Invalid, 5093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [576 Valid, 4517 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-08 05:25:51,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2025-03-08 05:25:52,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1273. [2025-03-08 05:25:52,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1273 states, 989 states have (on average 1.6632962588473206) internal successors, (1645), 1037 states have internal predecessors, (1645), 229 states have call successors, (229), 54 states have call predecessors, (229), 54 states have return successors, (244), 218 states have call predecessors, (244), 224 states have call successors, (244) [2025-03-08 05:25:52,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1273 states to 1273 states and 2118 transitions. [2025-03-08 05:25:52,036 INFO L78 Accepts]: Start accepts. Automaton has 1273 states and 2118 transitions. Word has length 88 [2025-03-08 05:25:52,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:52,037 INFO L471 AbstractCegarLoop]: Abstraction has 1273 states and 2118 transitions. [2025-03-08 05:25:52,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-08 05:25:52,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1273 states and 2118 transitions. [2025-03-08 05:25:52,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 05:25:52,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:52,039 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] [2025-03-08 05:25:52,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 05:25:52,039 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:52,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:52,040 INFO L85 PathProgramCache]: Analyzing trace with hash -968017487, now seen corresponding path program 1 times [2025-03-08 05:25:52,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:52,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246755502] [2025-03-08 05:25:52,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:52,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:52,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 05:25:52,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 05:25:52,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:52,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:52,188 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:52,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:52,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246755502] [2025-03-08 05:25:52,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246755502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:52,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:52,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:25:52,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064558462] [2025-03-08 05:25:52,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:52,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:25:52,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:52,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:25:52,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:25:52,190 INFO L87 Difference]: Start difference. First operand 1273 states and 2118 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-08 05:25:55,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:55,199 INFO L93 Difference]: Finished difference Result 5526 states and 9417 transitions. [2025-03-08 05:25:55,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 05:25:55,199 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 90 [2025-03-08 05:25:55,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:55,241 INFO L225 Difference]: With dead ends: 5526 [2025-03-08 05:25:55,242 INFO L226 Difference]: Without dead ends: 4298 [2025-03-08 05:25:55,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-03-08 05:25:55,252 INFO L435 NwaCegarLoop]: 630 mSDtfsCounter, 2764 mSDsluCounter, 1685 mSDsCounter, 0 mSdLazyCounter, 5098 mSolverCounterSat, 630 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2871 SdHoareTripleChecker+Valid, 2315 SdHoareTripleChecker+Invalid, 5728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 630 IncrementalHoareTripleChecker+Valid, 5098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:55,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2871 Valid, 2315 Invalid, 5728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [630 Valid, 5098 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-08 05:25:55,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4298 states. [2025-03-08 05:25:55,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4298 to 4047. [2025-03-08 05:25:55,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4047 states, 3049 states have (on average 1.6664480157428665) internal successors, (5081), 3226 states have internal predecessors, (5081), 840 states have call successors, (840), 146 states have call predecessors, (840), 157 states have return successors, (980), 815 states have call predecessors, (980), 835 states have call successors, (980) [2025-03-08 05:25:55,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4047 states to 4047 states and 6901 transitions. [2025-03-08 05:25:55,504 INFO L78 Accepts]: Start accepts. Automaton has 4047 states and 6901 transitions. Word has length 90 [2025-03-08 05:25:55,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:55,504 INFO L471 AbstractCegarLoop]: Abstraction has 4047 states and 6901 transitions. [2025-03-08 05:25:55,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-08 05:25:55,504 INFO L276 IsEmpty]: Start isEmpty. Operand 4047 states and 6901 transitions. [2025-03-08 05:25:55,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 05:25:55,506 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:55,506 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] [2025-03-08 05:25:55,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 05:25:55,506 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:55,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:55,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1997376785, now seen corresponding path program 1 times [2025-03-08 05:25:55,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:55,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532849050] [2025-03-08 05:25:55,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:55,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:55,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 05:25:55,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 05:25:55,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:55,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:55,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:55,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:55,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532849050] [2025-03-08 05:25:55,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532849050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:55,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:55,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:25:55,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096330083] [2025-03-08 05:25:55,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:55,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:25:55,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:55,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:25:55,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:25:55,632 INFO L87 Difference]: Start difference. First operand 4047 states and 6901 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-08 05:25:57,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:57,805 INFO L93 Difference]: Finished difference Result 11012 states and 18934 transitions. [2025-03-08 05:25:57,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 05:25:57,806 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 90 [2025-03-08 05:25:57,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:57,857 INFO L225 Difference]: With dead ends: 11012 [2025-03-08 05:25:57,857 INFO L226 Difference]: Without dead ends: 8078 [2025-03-08 05:25:57,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-03-08 05:25:57,872 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 2292 mSDsluCounter, 1347 mSDsCounter, 0 mSdLazyCounter, 3463 mSolverCounterSat, 483 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2371 SdHoareTripleChecker+Valid, 1693 SdHoareTripleChecker+Invalid, 3946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 483 IncrementalHoareTripleChecker+Valid, 3463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:57,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2371 Valid, 1693 Invalid, 3946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [483 Valid, 3463 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-08 05:25:57,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8078 states. [2025-03-08 05:25:58,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8078 to 7631. [2025-03-08 05:25:58,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7631 states, 5780 states have (on average 1.6643598615916955) internal successors, (9620), 6111 states have internal predecessors, (9620), 1530 states have call successors, (1530), 269 states have call predecessors, (1530), 320 states have return successors, (1912), 1486 states have call predecessors, (1912), 1525 states have call successors, (1912) [2025-03-08 05:25:58,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7631 states to 7631 states and 13062 transitions. [2025-03-08 05:25:58,247 INFO L78 Accepts]: Start accepts. Automaton has 7631 states and 13062 transitions. Word has length 90 [2025-03-08 05:25:58,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:58,248 INFO L471 AbstractCegarLoop]: Abstraction has 7631 states and 13062 transitions. [2025-03-08 05:25:58,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-08 05:25:58,249 INFO L276 IsEmpty]: Start isEmpty. Operand 7631 states and 13062 transitions. [2025-03-08 05:25:58,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 05:25:58,250 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:58,251 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] [2025-03-08 05:25:58,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 05:25:58,251 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:58,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:58,251 INFO L85 PathProgramCache]: Analyzing trace with hash 787541162, now seen corresponding path program 1 times [2025-03-08 05:25:58,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:58,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529201534] [2025-03-08 05:25:58,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:58,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:58,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 05:25:58,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 05:25:58,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:58,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:58,353 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,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:58,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529201534] [2025-03-08 05:25:58,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529201534] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:58,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:58,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:25:58,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072480177] [2025-03-08 05:25:58,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:58,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:25:58,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:58,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:25:58,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:25:58,354 INFO L87 Difference]: Start difference. First operand 7631 states and 13062 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:25:58,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:58,727 INFO L93 Difference]: Finished difference Result 14071 states and 24156 transitions. [2025-03-08 05:25:58,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:25:58,732 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 95 [2025-03-08 05:25:58,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:58,789 INFO L225 Difference]: With dead ends: 14071 [2025-03-08 05:25:58,790 INFO L226 Difference]: Without dead ends: 7718 [2025-03-08 05:25:58,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:25:58,816 INFO L435 NwaCegarLoop]: 808 mSDtfsCounter, 0 mSDsluCounter, 2394 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3202 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:58,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3202 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:25:58,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7718 states. [2025-03-08 05:25:59,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7718 to 7704. [2025-03-08 05:25:59,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7704 states, 5836 states have (on average 1.6574708704592187) internal successors, (9673), 6166 states have internal predecessors, (9673), 1527 states have call successors, (1527), 269 states have call predecessors, (1527), 340 states have return successors, (1975), 1504 states have call predecessors, (1975), 1522 states have call successors, (1975) [2025-03-08 05:25:59,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7704 states to 7704 states and 13175 transitions. [2025-03-08 05:25:59,143 INFO L78 Accepts]: Start accepts. Automaton has 7704 states and 13175 transitions. Word has length 95 [2025-03-08 05:25:59,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:59,143 INFO L471 AbstractCegarLoop]: Abstraction has 7704 states and 13175 transitions. [2025-03-08 05:25:59,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:25:59,144 INFO L276 IsEmpty]: Start isEmpty. Operand 7704 states and 13175 transitions. [2025-03-08 05:25:59,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 05:25:59,145 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:59,145 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] [2025-03-08 05:25:59,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 05:25:59,146 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:59,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:59,146 INFO L85 PathProgramCache]: Analyzing trace with hash 651320616, now seen corresponding path program 1 times [2025-03-08 05:25:59,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:59,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554989771] [2025-03-08 05:25:59,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:59,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:59,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 05:25:59,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 05:25:59,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:59,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:59,259 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,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:59,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554989771] [2025-03-08 05:25:59,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554989771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:59,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:59,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:25:59,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332886903] [2025-03-08 05:25:59,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:59,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:25:59,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:59,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:25:59,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:25:59,261 INFO L87 Difference]: Start difference. First operand 7704 states and 13175 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 05:25:59,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:59,643 INFO L93 Difference]: Finished difference Result 15297 states and 26629 transitions. [2025-03-08 05:25:59,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:25:59,644 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 102 [2025-03-08 05:25:59,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:59,690 INFO L225 Difference]: With dead ends: 15297 [2025-03-08 05:25:59,690 INFO L226 Difference]: Without dead ends: 7852 [2025-03-08 05:25:59,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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,718 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 225 mSDsluCounter, 3147 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 3997 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:59,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 3997 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:25:59,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7852 states. [2025-03-08 05:26:00,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7852 to 7728. [2025-03-08 05:26:00,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7728 states, 5857 states have (on average 1.6346252347618235) internal successors, (9574), 6190 states have internal predecessors, (9574), 1527 states have call successors, (1527), 269 states have call predecessors, (1527), 343 states have return successors, (1987), 1504 states have call predecessors, (1987), 1522 states have call successors, (1987) [2025-03-08 05:26:00,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7728 states to 7728 states and 13088 transitions. [2025-03-08 05:26:00,138 INFO L78 Accepts]: Start accepts. Automaton has 7728 states and 13088 transitions. Word has length 102 [2025-03-08 05:26:00,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:00,138 INFO L471 AbstractCegarLoop]: Abstraction has 7728 states and 13088 transitions. [2025-03-08 05:26:00,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 05:26:00,138 INFO L276 IsEmpty]: Start isEmpty. Operand 7728 states and 13088 transitions. [2025-03-08 05:26:00,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-08 05:26:00,141 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:00,141 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] [2025-03-08 05:26:00,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 05:26:00,142 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:00,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:00,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1273030240, now seen corresponding path program 1 times [2025-03-08 05:26:00,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:00,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648611615] [2025-03-08 05:26:00,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:00,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:00,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 05:26:00,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 05:26:00,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:00,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:00,352 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:26:00,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:00,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648611615] [2025-03-08 05:26:00,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648611615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:00,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:00,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:26:00,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877646410] [2025-03-08 05:26:00,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:00,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:26:00,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:00,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:26:00,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:26:00,353 INFO L87 Difference]: Start difference. First operand 7728 states and 13088 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-08 05:26:02,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:02,513 INFO L93 Difference]: Finished difference Result 14930 states and 25341 transitions. [2025-03-08 05:26:02,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 05:26:02,513 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) Word has length 107 [2025-03-08 05:26:02,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:02,570 INFO L225 Difference]: With dead ends: 14930 [2025-03-08 05:26:02,570 INFO L226 Difference]: Without dead ends: 8496 [2025-03-08 05:26:02,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2025-03-08 05:26:02,600 INFO L435 NwaCegarLoop]: 368 mSDtfsCounter, 2014 mSDsluCounter, 1263 mSDsCounter, 0 mSdLazyCounter, 2966 mSolverCounterSat, 456 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2090 SdHoareTripleChecker+Valid, 1631 SdHoareTripleChecker+Invalid, 3422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 456 IncrementalHoareTripleChecker+Valid, 2966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:02,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2090 Valid, 1631 Invalid, 3422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [456 Valid, 2966 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 05:26:02,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8496 states. [2025-03-08 05:26:02,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8496 to 7963. [2025-03-08 05:26:02,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7963 states, 6032 states have (on average 1.6235079575596818) internal successors, (9793), 6383 states have internal predecessors, (9793), 1547 states have call successors, (1547), 294 states have call predecessors, (1547), 383 states have return successors, (2079), 1522 states have call predecessors, (2079), 1542 states have call successors, (2079) [2025-03-08 05:26:03,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7963 states to 7963 states and 13419 transitions. [2025-03-08 05:26:03,021 INFO L78 Accepts]: Start accepts. Automaton has 7963 states and 13419 transitions. Word has length 107 [2025-03-08 05:26:03,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:03,022 INFO L471 AbstractCegarLoop]: Abstraction has 7963 states and 13419 transitions. [2025-03-08 05:26:03,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-08 05:26:03,022 INFO L276 IsEmpty]: Start isEmpty. Operand 7963 states and 13419 transitions. [2025-03-08 05:26:03,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 05:26:03,024 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:03,024 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:26:03,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 05:26:03,024 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:03,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:03,025 INFO L85 PathProgramCache]: Analyzing trace with hash 2142941602, now seen corresponding path program 1 times [2025-03-08 05:26:03,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:03,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660826321] [2025-03-08 05:26:03,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:03,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:03,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 05:26:03,044 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,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:03,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:03,114 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 05:26:03,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:03,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660826321] [2025-03-08 05:26:03,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660826321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:03,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:03,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:26:03,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822981252] [2025-03-08 05:26:03,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:03,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:26:03,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:03,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:26:03,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:26:03,116 INFO L87 Difference]: Start difference. First operand 7963 states and 13419 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-08 05:26:03,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:03,465 INFO L93 Difference]: Finished difference Result 17955 states and 30423 transitions. [2025-03-08 05:26:03,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:26:03,467 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2025-03-08 05:26:03,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:03,532 INFO L225 Difference]: With dead ends: 17955 [2025-03-08 05:26:03,533 INFO L226 Difference]: Without dead ends: 11286 [2025-03-08 05:26:03,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:26:03,563 INFO L435 NwaCegarLoop]: 1303 mSDtfsCounter, 741 mSDsluCounter, 3381 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 4684 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:03,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 4684 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:26:03,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11286 states. [2025-03-08 05:26:03,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11286 to 10612. [2025-03-08 05:26:03,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10612 states, 8046 states have (on average 1.6336067611235396) internal successors, (13144), 8500 states have internal predecessors, (13144), 2080 states have call successors, (2080), 381 states have call predecessors, (2080), 485 states have return successors, (2733), 2062 states have call predecessors, (2733), 2075 states have call successors, (2733) [2025-03-08 05:26:03,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10612 states to 10612 states and 17957 transitions. [2025-03-08 05:26:03,981 INFO L78 Accepts]: Start accepts. Automaton has 10612 states and 17957 transitions. Word has length 112 [2025-03-08 05:26:03,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:03,981 INFO L471 AbstractCegarLoop]: Abstraction has 10612 states and 17957 transitions. [2025-03-08 05:26:03,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-08 05:26:03,981 INFO L276 IsEmpty]: Start isEmpty. Operand 10612 states and 17957 transitions. [2025-03-08 05:26:03,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-08 05:26:03,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:03,983 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:26:03,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 05:26:03,984 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:03,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:03,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1103709824, now seen corresponding path program 1 times [2025-03-08 05:26:03,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:03,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499742264] [2025-03-08 05:26:03,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:03,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:03,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 05:26:04,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 05:26:04,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:04,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:04,136 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 05:26:04,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:04,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499742264] [2025-03-08 05:26:04,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499742264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:04,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:04,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 05:26:04,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432263603] [2025-03-08 05:26:04,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:04,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 05:26:04,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:04,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 05:26:04,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:26:04,137 INFO L87 Difference]: Start difference. First operand 10612 states and 17957 transitions. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 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:06,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:06,838 INFO L93 Difference]: Finished difference Result 23096 states and 38821 transitions. [2025-03-08 05:26:06,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 05:26:06,839 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 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 114 [2025-03-08 05:26:06,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:06,921 INFO L225 Difference]: With dead ends: 23096 [2025-03-08 05:26:06,921 INFO L226 Difference]: Without dead ends: 13597 [2025-03-08 05:26:06,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2025-03-08 05:26:06,960 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 2713 mSDsluCounter, 2581 mSDsCounter, 0 mSdLazyCounter, 5948 mSolverCounterSat, 625 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2798 SdHoareTripleChecker+Valid, 3088 SdHoareTripleChecker+Invalid, 6573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 625 IncrementalHoareTripleChecker+Valid, 5948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:06,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2798 Valid, 3088 Invalid, 6573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [625 Valid, 5948 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-08 05:26:06,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13597 states. [2025-03-08 05:26:07,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13597 to 12374. [2025-03-08 05:26:07,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12374 states, 9438 states have (on average 1.614007204916296) internal successors, (15233), 9957 states have internal predecessors, (15233), 2313 states have call successors, (2313), 470 states have call predecessors, (2313), 622 states have return successors, (3074), 2271 states have call predecessors, (3074), 2308 states have call successors, (3074) [2025-03-08 05:26:07,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12374 states to 12374 states and 20620 transitions. [2025-03-08 05:26:07,845 INFO L78 Accepts]: Start accepts. Automaton has 12374 states and 20620 transitions. Word has length 114 [2025-03-08 05:26:07,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:07,845 INFO L471 AbstractCegarLoop]: Abstraction has 12374 states and 20620 transitions. [2025-03-08 05:26:07,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 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,845 INFO L276 IsEmpty]: Start isEmpty. Operand 12374 states and 20620 transitions. [2025-03-08 05:26:07,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 05:26:07,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:07,848 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:26:07,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 05:26:07,848 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:07,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:07,849 INFO L85 PathProgramCache]: Analyzing trace with hash 104885313, now seen corresponding path program 1 times [2025-03-08 05:26:07,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:07,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920393811] [2025-03-08 05:26:07,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:07,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:07,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 05:26:07,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 05:26:07,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:07,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:08,020 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 05:26:08,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:08,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920393811] [2025-03-08 05:26:08,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920393811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:08,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:08,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:26:08,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045444619] [2025-03-08 05:26:08,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:08,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:26:08,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:08,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:26:08,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:26:08,022 INFO L87 Difference]: Start difference. First operand 12374 states and 20620 transitions. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:26:08,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:08,693 INFO L93 Difference]: Finished difference Result 12498 states and 20843 transitions. [2025-03-08 05:26:08,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:26:08,694 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 112 [2025-03-08 05:26:08,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:08,764 INFO L225 Difference]: With dead ends: 12498 [2025-03-08 05:26:08,764 INFO L226 Difference]: Without dead ends: 12483 [2025-03-08 05:26:08,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:26:08,777 INFO L435 NwaCegarLoop]: 790 mSDtfsCounter, 868 mSDsluCounter, 1452 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 SdHoareTripleChecker+Valid, 2242 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:08,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [869 Valid, 2242 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:26:08,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12483 states. [2025-03-08 05:26:09,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12483 to 12382. [2025-03-08 05:26:09,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12382 states, 9446 states have (on average 1.6134871903451196) internal successors, (15241), 9965 states have internal predecessors, (15241), 2313 states have call successors, (2313), 470 states have call predecessors, (2313), 622 states have return successors, (3074), 2271 states have call predecessors, (3074), 2308 states have call successors, (3074) [2025-03-08 05:26:09,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12382 states to 12382 states and 20628 transitions. [2025-03-08 05:26:09,301 INFO L78 Accepts]: Start accepts. Automaton has 12382 states and 20628 transitions. Word has length 112 [2025-03-08 05:26:09,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:09,301 INFO L471 AbstractCegarLoop]: Abstraction has 12382 states and 20628 transitions. [2025-03-08 05:26:09,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:26:09,301 INFO L276 IsEmpty]: Start isEmpty. Operand 12382 states and 20628 transitions. [2025-03-08 05:26:09,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-08 05:26:09,304 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:09,304 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:26:09,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 05:26:09,304 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:09,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:09,305 INFO L85 PathProgramCache]: Analyzing trace with hash 537018175, now seen corresponding path program 1 times [2025-03-08 05:26:09,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:09,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352272433] [2025-03-08 05:26:09,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:09,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:09,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-08 05:26:09,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-08 05:26:09,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:09,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:09,441 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 05:26:09,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:09,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352272433] [2025-03-08 05:26:09,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352272433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:09,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:09,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:26:09,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467470620] [2025-03-08 05:26:09,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:09,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:26:09,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:09,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:26:09,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:26:09,442 INFO L87 Difference]: Start difference. First operand 12382 states and 20628 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 6 states have internal predecessors, (89), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 05:26:09,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:09,750 INFO L93 Difference]: Finished difference Result 12397 states and 20646 transitions. [2025-03-08 05:26:09,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:26:09,750 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 6 states have internal predecessors, (89), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2025-03-08 05:26:09,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:09,893 INFO L225 Difference]: With dead ends: 12397 [2025-03-08 05:26:09,894 INFO L226 Difference]: Without dead ends: 12382 [2025-03-08 05:26:09,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:26:09,900 INFO L435 NwaCegarLoop]: 795 mSDtfsCounter, 0 mSDsluCounter, 3969 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4764 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:26:09,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4764 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:26:09,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12382 states. [2025-03-08 05:26:10,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12382 to 12382. [2025-03-08 05:26:10,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12382 states, 9446 states have (on average 1.6126402710141858) internal successors, (15233), 9965 states have internal predecessors, (15233), 2313 states have call successors, (2313), 470 states have call predecessors, (2313), 622 states have return successors, (3074), 2271 states have call predecessors, (3074), 2308 states have call successors, (3074) [2025-03-08 05:26:10,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12382 states to 12382 states and 20620 transitions. [2025-03-08 05:26:10,292 INFO L78 Accepts]: Start accepts. Automaton has 12382 states and 20620 transitions. Word has length 118 [2025-03-08 05:26:10,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:10,292 INFO L471 AbstractCegarLoop]: Abstraction has 12382 states and 20620 transitions. [2025-03-08 05:26:10,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 6 states have internal predecessors, (89), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 05:26:10,292 INFO L276 IsEmpty]: Start isEmpty. Operand 12382 states and 20620 transitions. [2025-03-08 05:26:10,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-08 05:26:10,294 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:10,295 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 05:26:10,295 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:10,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:10,295 INFO L85 PathProgramCache]: Analyzing trace with hash -2100081815, now seen corresponding path program 1 times [2025-03-08 05:26:10,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:10,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801544549] [2025-03-08 05:26:10,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:10,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:10,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-08 05:26:10,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-08 05:26:10,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:10,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:10,459 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 05:26:10,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:10,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801544549] [2025-03-08 05:26:10,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801544549] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:10,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:10,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:26:10,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839289295] [2025-03-08 05:26:10,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:10,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:26:10,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:10,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:26:10,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:26:10,461 INFO L87 Difference]: Start difference. First operand 12382 states and 20620 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 4 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-08 05:26:11,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:11,879 INFO L93 Difference]: Finished difference Result 24773 states and 41414 transitions. [2025-03-08 05:26:11,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:26:11,880 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 4 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) Word has length 128 [2025-03-08 05:26:11,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:11,948 INFO L225 Difference]: With dead ends: 24773 [2025-03-08 05:26:11,948 INFO L226 Difference]: Without dead ends: 12448 [2025-03-08 05:26:11,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 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:11,983 INFO L435 NwaCegarLoop]: 372 mSDtfsCounter, 1192 mSDsluCounter, 1203 mSDsCounter, 0 mSdLazyCounter, 2491 mSolverCounterSat, 326 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1192 SdHoareTripleChecker+Valid, 1575 SdHoareTripleChecker+Invalid, 2817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 326 IncrementalHoareTripleChecker+Valid, 2491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:11,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1192 Valid, 1575 Invalid, 2817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [326 Valid, 2491 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 05:26:11,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12448 states. [2025-03-08 05:26:12,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12448 to 12382. [2025-03-08 05:26:12,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12382 states, 9446 states have (on average 1.611793351683252) internal successors, (15225), 9965 states have internal predecessors, (15225), 2313 states have call successors, (2313), 470 states have call predecessors, (2313), 622 states have return successors, (3074), 2271 states have call predecessors, (3074), 2308 states have call successors, (3074) [2025-03-08 05:26:12,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12382 states to 12382 states and 20612 transitions. [2025-03-08 05:26:12,432 INFO L78 Accepts]: Start accepts. Automaton has 12382 states and 20612 transitions. Word has length 128 [2025-03-08 05:26:12,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:12,433 INFO L471 AbstractCegarLoop]: Abstraction has 12382 states and 20612 transitions. [2025-03-08 05:26:12,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 4 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-08 05:26:12,433 INFO L276 IsEmpty]: Start isEmpty. Operand 12382 states and 20612 transitions. [2025-03-08 05:26:12,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 05:26:12,435 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:12,435 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 05:26:12,436 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:12,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:12,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1319636928, now seen corresponding path program 1 times [2025-03-08 05:26:12,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:12,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947762516] [2025-03-08 05:26:12,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:12,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:12,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 05:26:12,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 05:26:12,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:12,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:12,524 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 05:26:12,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:12,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947762516] [2025-03-08 05:26:12,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947762516] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:12,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:12,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:26:12,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538513715] [2025-03-08 05:26:12,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:12,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:26:12,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:12,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:26:12,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:26:12,525 INFO L87 Difference]: Start difference. First operand 12382 states and 20612 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 4 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 05:26:15,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:15,044 INFO L93 Difference]: Finished difference Result 40677 states and 69687 transitions. [2025-03-08 05:26:15,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:26:15,045 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 4 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 139 [2025-03-08 05:26:15,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:15,291 INFO L225 Difference]: With dead ends: 40677 [2025-03-08 05:26:15,291 INFO L226 Difference]: Without dead ends: 28340 [2025-03-08 05:26:15,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:26:15,359 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 1779 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 1170 mSolverCounterSat, 365 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1849 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 1535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 365 IncrementalHoareTripleChecker+Valid, 1170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:15,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1849 Valid, 914 Invalid, 1535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [365 Valid, 1170 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 05:26:15,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28340 states. [2025-03-08 05:26:16,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28340 to 27427. [2025-03-08 05:26:16,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27427 states, 20440 states have (on average 1.6051369863013698) internal successors, (32809), 21702 states have internal predecessors, (32809), 5677 states have call successors, (5677), 935 states have call predecessors, (5677), 1309 states have return successors, (8692), 5614 states have call predecessors, (8692), 5672 states have call successors, (8692) [2025-03-08 05:26:16,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27427 states to 27427 states and 47178 transitions. [2025-03-08 05:26:16,552 INFO L78 Accepts]: Start accepts. Automaton has 27427 states and 47178 transitions. Word has length 139 [2025-03-08 05:26:16,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:16,553 INFO L471 AbstractCegarLoop]: Abstraction has 27427 states and 47178 transitions. [2025-03-08 05:26:16,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 4 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 05:26:16,553 INFO L276 IsEmpty]: Start isEmpty. Operand 27427 states and 47178 transitions. [2025-03-08 05:26:16,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-08 05:26:16,556 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:16,556 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:26:16,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 05:26:16,556 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:16,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:16,557 INFO L85 PathProgramCache]: Analyzing trace with hash 273044373, now seen corresponding path program 1 times [2025-03-08 05:26:16,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:16,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981863007] [2025-03-08 05:26:16,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:16,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:16,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 05:26:16,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 05:26:16,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:16,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:16,636 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 05:26:16,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:16,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981863007] [2025-03-08 05:26:16,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981863007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:16,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:16,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:26:16,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090775259] [2025-03-08 05:26:16,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:16,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:26:16,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:16,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:26:16,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:26:16,638 INFO L87 Difference]: Start difference. First operand 27427 states and 47178 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:26:20,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:20,713 INFO L93 Difference]: Finished difference Result 91820 states and 164560 transitions. [2025-03-08 05:26:20,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:26:20,714 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 138 [2025-03-08 05:26:20,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:21,166 INFO L225 Difference]: With dead ends: 91820 [2025-03-08 05:26:21,167 INFO L226 Difference]: Without dead ends: 64438 [2025-03-08 05:26:21,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:26:21,325 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 1789 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 1152 mSolverCounterSat, 372 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1860 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 1524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 372 IncrementalHoareTripleChecker+Valid, 1152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:21,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1860 Valid, 883 Invalid, 1524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [372 Valid, 1152 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 05:26:21,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64438 states. [2025-03-08 05:26:24,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64438 to 62420. [2025-03-08 05:26:24,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62420 states, 45307 states have (on average 1.596684838987353) internal successors, (72341), 48423 states have internal predecessors, (72341), 14344 states have call successors, (14344), 1865 states have call predecessors, (14344), 2768 states have return successors, (25784), 14271 states have call predecessors, (25784), 14339 states have call successors, (25784) [2025-03-08 05:26:25,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62420 states to 62420 states and 112469 transitions. [2025-03-08 05:26:25,352 INFO L78 Accepts]: Start accepts. Automaton has 62420 states and 112469 transitions. Word has length 138 [2025-03-08 05:26:25,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:25,353 INFO L471 AbstractCegarLoop]: Abstraction has 62420 states and 112469 transitions. [2025-03-08 05:26:25,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:26:25,353 INFO L276 IsEmpty]: Start isEmpty. Operand 62420 states and 112469 transitions. [2025-03-08 05:26:25,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 05:26:25,358 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:25,358 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 05:26:25,358 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:25,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:25,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1150393242, now seen corresponding path program 1 times [2025-03-08 05:26:25,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:25,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86188994] [2025-03-08 05:26:25,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:25,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:25,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 05:26:25,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 05:26:25,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:25,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:25,437 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 05:26:25,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:25,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86188994] [2025-03-08 05:26:25,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86188994] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:25,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:25,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:26:25,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078508233] [2025-03-08 05:26:25,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:25,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:26:25,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:25,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:26:25,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:26:25,438 INFO L87 Difference]: Start difference. First operand 62420 states and 112469 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 4 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 05:26:36,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:36,327 INFO L93 Difference]: Finished difference Result 212625 states and 405319 transitions. [2025-03-08 05:26:36,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:26:36,328 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 4 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 141 [2025-03-08 05:26:36,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:37,728 INFO L225 Difference]: With dead ends: 212625 [2025-03-08 05:26:37,728 INFO L226 Difference]: Without dead ends: 150250 [2025-03-08 05:26:38,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:26:38,192 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 1771 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 1152 mSolverCounterSat, 373 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1839 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 1525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 373 IncrementalHoareTripleChecker+Valid, 1152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:38,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1839 Valid, 877 Invalid, 1525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [373 Valid, 1152 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 05:26:38,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150250 states.