./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec2_product01.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_product01.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 8190dbbeca15ebdc96e247bb91a06680a00a60089c25180495df59d4a11849af --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:25:11,482 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:25:11,542 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:11,550 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:25:11,550 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:25:11,574 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:25:11,575 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:25:11,575 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:25:11,576 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:25:11,576 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:25:11,576 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:25:11,577 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:25:11,577 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:25:11,577 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:25:11,577 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:25:11,577 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:25:11,578 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:25:11,578 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:25:11,578 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:25:11,578 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:25:11,578 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:25:11,578 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:25:11,578 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:25:11,578 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:25:11,578 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:25:11,578 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:25:11,578 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:25:11,579 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:25:11,579 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:25:11,579 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:25:11,579 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:25:11,579 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:25:11,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:25:11,580 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:25:11,580 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:25:11,580 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:25:11,580 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:25:11,580 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:25:11,580 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:25:11,580 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:25:11,580 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:25:11,580 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:25:11,580 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:25:11,580 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 -> 8190dbbeca15ebdc96e247bb91a06680a00a60089c25180495df59d4a11849af [2025-03-08 05:25:11,805 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:25:11,811 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:25:11,816 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:25:11,816 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:25:11,817 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:25:11,817 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec2_product01.cil.c [2025-03-08 05:25:12,980 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/208d7ae3a/53b46363ffb24c71ad76ce8e6563348a/FLAG32c231d60 [2025-03-08 05:25:13,271 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:25:13,276 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product01.cil.c [2025-03-08 05:25:13,291 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/208d7ae3a/53b46363ffb24c71ad76ce8e6563348a/FLAG32c231d60 [2025-03-08 05:25:13,551 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/208d7ae3a/53b46363ffb24c71ad76ce8e6563348a [2025-03-08 05:25:13,555 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:25:13,556 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:25:13,557 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:25:13,557 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:25:13,560 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:25:13,561 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:25:13" (1/1) ... [2025-03-08 05:25:13,562 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@474ef4e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:13, skipping insertion in model container [2025-03-08 05:25:13,562 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:25:13" (1/1) ... [2025-03-08 05:25:13,609 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:25:13,718 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_product01.cil.c[1545,1558] [2025-03-08 05:25:13,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:25:13,964 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:25:13,973 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [48] [2025-03-08 05:25:13,974 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [57] [2025-03-08 05:25:13,974 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [178] [2025-03-08 05:25:13,975 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [192] [2025-03-08 05:25:13,975 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [375] [2025-03-08 05:25:13,975 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [741] [2025-03-08 05:25:13,976 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1101] [2025-03-08 05:25:13,976 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [2529] [2025-03-08 05:25:13,976 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2620] [2025-03-08 05:25:13,976 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2655] [2025-03-08 05:25:13,981 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_product01.cil.c[1545,1558] [2025-03-08 05:25:14,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:25:14,100 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:25:14,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:14 WrapperNode [2025-03-08 05:25:14,102 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:25:14,103 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:25:14,103 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:25:14,103 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:25:14,109 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:14" (1/1) ... [2025-03-08 05:25:14,132 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:14" (1/1) ... [2025-03-08 05:25:14,177 INFO L138 Inliner]: procedures = 88, calls = 328, calls flagged for inlining = 23, calls inlined = 20, statements flattened = 750 [2025-03-08 05:25:14,177 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:25:14,181 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:25:14,181 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:25:14,181 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:25:14,187 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:14" (1/1) ... [2025-03-08 05:25:14,188 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:14" (1/1) ... [2025-03-08 05:25:14,195 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:14" (1/1) ... [2025-03-08 05:25:14,226 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2025-03-08 05:25:14,226 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:14" (1/1) ... [2025-03-08 05:25:14,226 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:14" (1/1) ... [2025-03-08 05:25:14,240 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:14" (1/1) ... [2025-03-08 05:25:14,247 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:14" (1/1) ... [2025-03-08 05:25:14,254 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:14" (1/1) ... [2025-03-08 05:25:14,256 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:14" (1/1) ... [2025-03-08 05:25:14,264 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:25:14,265 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:25:14,267 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:25:14,268 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:25:14,268 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:14" (1/1) ... [2025-03-08 05:25:14,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:25:14,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:25:14,297 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:14,300 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:14,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:25:14,319 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-03-08 05:25:14,319 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-03-08 05:25:14,319 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-03-08 05:25:14,319 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-03-08 05:25:14,319 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-03-08 05:25:14,319 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-03-08 05:25:14,319 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-03-08 05:25:14,319 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-03-08 05:25:14,320 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-08 05:25:14,320 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-08 05:25:14,320 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-08 05:25:14,320 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-08 05:25:14,320 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2025-03-08 05:25:14,320 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2025-03-08 05:25:14,321 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-03-08 05:25:14,321 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-03-08 05:25:14,321 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-03-08 05:25:14,321 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-03-08 05:25:14,321 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-03-08 05:25:14,321 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-03-08 05:25:14,321 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-03-08 05:25:14,321 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-03-08 05:25:14,321 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-03-08 05:25:14,321 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-03-08 05:25:14,322 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-03-08 05:25:14,322 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-03-08 05:25:14,322 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-03-08 05:25:14,323 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-03-08 05:25:14,323 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-03-08 05:25:14,323 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-03-08 05:25:14,323 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-03-08 05:25:14,323 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-03-08 05:25:14,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:25:14,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:25:14,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 05:25:14,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 05:25:14,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 05:25:14,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 05:25:14,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 05:25:14,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 05:25:14,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-08 05:25:14,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-08 05:25:14,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-08 05:25:14,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-08 05:25:14,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-08 05:25:14,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-08 05:25:14,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-08 05:25:14,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-08 05:25:14,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-08 05:25:14,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-08 05:25:14,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-08 05:25:14,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-08 05:25:14,324 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-03-08 05:25:14,324 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-03-08 05:25:14,324 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-03-08 05:25:14,324 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-03-08 05:25:14,325 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-03-08 05:25:14,325 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-03-08 05:25:14,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:25:14,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:25:14,325 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-03-08 05:25:14,325 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-03-08 05:25:14,477 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:25:14,478 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:25:14,527 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L175: #res := ~retValue_acc~2; [2025-03-08 05:25:14,532 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1180: #res := ~retValue_acc~8; [2025-03-08 05:25:14,829 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1850: #res := ~retValue_acc~16; [2025-03-08 05:25:14,889 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1954: #res := ~retValue_acc~19; [2025-03-08 05:25:14,901 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L136: #res := ~retValue_acc~1; [2025-03-08 05:25:15,078 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1940-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~18#1; [2025-03-08 05:25:15,078 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1313-1: getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~9#1; [2025-03-08 05:25:15,078 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1356-1: buttonForFloorIsPressed_#res#1 := buttonForFloorIsPressed_~retValue_acc~11#1; [2025-03-08 05:25:15,128 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1485-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~14#1; [2025-03-08 05:25:15,129 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1498-1: isIdle_#res#1 := isIdle_~retValue_acc~15#1; [2025-03-08 05:25:15,181 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3002: #res := ~retValue_acc~24; [2025-03-08 05:25:15,238 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2652-1: valid_product_#res#1 := valid_product_~retValue_acc~22#1; [2025-03-08 05:25:15,238 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1098-1: main_#res#1 := main_~retValue_acc~7#1; [2025-03-08 05:25:15,246 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2766: #res := ~retValue_acc~23; [2025-03-08 05:25:15,248 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1322: #res := ~retValue_acc~10; [2025-03-08 05:25:15,251 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3313: #res := ~retValue_acc~25; [2025-03-08 05:25:15,355 INFO L? ?]: Removed 409 outVars from TransFormulas that were not future-live. [2025-03-08 05:25:15,355 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:25:15,380 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:25:15,380 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:25:15,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:25:15 BoogieIcfgContainer [2025-03-08 05:25:15,381 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:25:15,383 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:25:15,383 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:25:15,386 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:25:15,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:25:13" (1/3) ... [2025-03-08 05:25:15,386 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12578691 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:25:15, skipping insertion in model container [2025-03-08 05:25:15,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:14" (2/3) ... [2025-03-08 05:25:15,387 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12578691 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:25:15, skipping insertion in model container [2025-03-08 05:25:15,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:25:15" (3/3) ... [2025-03-08 05:25:15,388 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product01.cil.c [2025-03-08 05:25:15,397 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:25:15,400 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec2_product01.cil.c that has 21 procedures, 515 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:25:15,452 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:25:15,460 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;@65d10151, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:25:15,460 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:25:15,465 INFO L276 IsEmpty]: Start isEmpty. Operand has 515 states, 407 states have (on average 1.7174447174447174) internal successors, (699), 428 states have internal predecessors, (699), 86 states have call successors, (86), 20 states have call predecessors, (86), 20 states have return successors, (86), 80 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-08 05:25:15,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-08 05:25:15,483 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:15,484 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:15,484 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:15,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:15,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1684247418, now seen corresponding path program 1 times [2025-03-08 05:25:15,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:15,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274254670] [2025-03-08 05:25:15,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:15,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:15,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 05:25:15,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 05:25:15,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:15,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:15,901 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:15,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:15,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274254670] [2025-03-08 05:25:15,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274254670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:15,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:15,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:25:15,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787810120] [2025-03-08 05:25:15,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:15,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:25:15,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:15,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:25:15,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:15,923 INFO L87 Difference]: Start difference. First operand has 515 states, 407 states have (on average 1.7174447174447174) internal successors, (699), 428 states have internal predecessors, (699), 86 states have call successors, (86), 20 states have call predecessors, (86), 20 states have return successors, (86), 80 states have call predecessors, (86), 86 states have call successors, (86) 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:16,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:16,057 INFO L93 Difference]: Finished difference Result 1010 states and 1717 transitions. [2025-03-08 05:25:16,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:25:16,062 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:16,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:16,079 INFO L225 Difference]: With dead ends: 1010 [2025-03-08 05:25:16,080 INFO L226 Difference]: Without dead ends: 507 [2025-03-08 05:25:16,089 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:16,092 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 5 mSDsluCounter, 1698 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2549 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:16,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2549 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:16,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-03-08 05:25:16,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2025-03-08 05:25:16,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 401 states have (on average 1.71571072319202) internal successors, (688), 420 states have internal predecessors, (688), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-08 05:25:16,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 855 transitions. [2025-03-08 05:25:16,170 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 855 transitions. Word has length 74 [2025-03-08 05:25:16,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:16,171 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 855 transitions. [2025-03-08 05:25:16,173 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:16,173 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 855 transitions. [2025-03-08 05:25:16,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 05:25:16,178 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:16,178 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:16,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:25:16,179 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:16,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:16,179 INFO L85 PathProgramCache]: Analyzing trace with hash 81211100, now seen corresponding path program 1 times [2025-03-08 05:25:16,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:16,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396222758] [2025-03-08 05:25:16,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:16,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:16,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 05:25:16,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 05:25:16,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:16,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:16,370 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:16,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:16,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396222758] [2025-03-08 05:25:16,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396222758] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:16,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:16,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:25:16,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327932652] [2025-03-08 05:25:16,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:16,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:25:16,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:16,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:25:16,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:16,374 INFO L87 Difference]: Start difference. First operand 507 states and 855 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:16,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:16,447 INFO L93 Difference]: Finished difference Result 996 states and 1687 transitions. [2025-03-08 05:25:16,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:25:16,448 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:16,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:16,451 INFO L225 Difference]: With dead ends: 996 [2025-03-08 05:25:16,454 INFO L226 Difference]: Without dead ends: 507 [2025-03-08 05:25:16,456 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:16,457 INFO L435 NwaCegarLoop]: 844 mSDtfsCounter, 4 mSDsluCounter, 1684 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2528 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:16,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2528 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:16,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-03-08 05:25:16,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2025-03-08 05:25:16,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 401 states have (on average 1.713216957605985) internal successors, (687), 420 states have internal predecessors, (687), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-08 05:25:16,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 854 transitions. [2025-03-08 05:25:16,493 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 854 transitions. Word has length 76 [2025-03-08 05:25:16,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:16,493 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 854 transitions. [2025-03-08 05:25:16,493 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:16,493 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 854 transitions. [2025-03-08 05:25:16,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 05:25:16,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:16,496 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:16,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:25:16,496 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:16,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:16,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1675817723, now seen corresponding path program 1 times [2025-03-08 05:25:16,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:16,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25009565] [2025-03-08 05:25:16,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:16,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:16,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 05:25:16,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 05:25:16,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:16,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:16,636 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:16,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:16,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25009565] [2025-03-08 05:25:16,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25009565] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:16,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:16,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:25:16,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441860972] [2025-03-08 05:25:16,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:16,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:25:16,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:16,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:25:16,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:16,638 INFO L87 Difference]: Start difference. First operand 507 states and 854 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:16,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:16,694 INFO L93 Difference]: Finished difference Result 996 states and 1686 transitions. [2025-03-08 05:25:16,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:25:16,696 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:16,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:16,699 INFO L225 Difference]: With dead ends: 996 [2025-03-08 05:25:16,701 INFO L226 Difference]: Without dead ends: 507 [2025-03-08 05:25:16,703 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:16,703 INFO L435 NwaCegarLoop]: 844 mSDtfsCounter, 3 mSDsluCounter, 1684 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2528 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:16,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2528 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:16,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-03-08 05:25:16,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2025-03-08 05:25:16,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 401 states have (on average 1.7107231920199502) internal successors, (686), 420 states have internal predecessors, (686), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-08 05:25:16,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 853 transitions. [2025-03-08 05:25:16,724 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 853 transitions. Word has length 77 [2025-03-08 05:25:16,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:16,724 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 853 transitions. [2025-03-08 05:25:16,725 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:16,725 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 853 transitions. [2025-03-08 05:25:16,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 05:25:16,728 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:16,728 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:16,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:25:16,728 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:16,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:16,729 INFO L85 PathProgramCache]: Analyzing trace with hash -585289921, now seen corresponding path program 1 times [2025-03-08 05:25:16,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:16,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410980702] [2025-03-08 05:25:16,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:16,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:16,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 05:25:16,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 05:25:16,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:16,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:16,869 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:16,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:16,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410980702] [2025-03-08 05:25:16,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410980702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:16,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:16,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:25:16,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015117812] [2025-03-08 05:25:16,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:16,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:25:16,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:16,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:25:16,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:16,872 INFO L87 Difference]: Start difference. First operand 507 states and 853 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:16,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:16,918 INFO L93 Difference]: Finished difference Result 996 states and 1685 transitions. [2025-03-08 05:25:16,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:25:16,919 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:16,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:16,923 INFO L225 Difference]: With dead ends: 996 [2025-03-08 05:25:16,923 INFO L226 Difference]: Without dead ends: 507 [2025-03-08 05:25:16,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:16,929 INFO L435 NwaCegarLoop]: 844 mSDtfsCounter, 2 mSDsluCounter, 1684 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2528 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:16,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2528 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:16,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-03-08 05:25:16,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2025-03-08 05:25:16,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 401 states have (on average 1.7082294264339153) internal successors, (685), 420 states have internal predecessors, (685), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-08 05:25:16,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 852 transitions. [2025-03-08 05:25:16,952 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 852 transitions. Word has length 78 [2025-03-08 05:25:16,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:16,952 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 852 transitions. [2025-03-08 05:25:16,953 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:16,953 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 852 transitions. [2025-03-08 05:25:16,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 05:25:16,955 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:16,955 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:16,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 05:25:16,955 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:16,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:16,956 INFO L85 PathProgramCache]: Analyzing trace with hash -2114455554, now seen corresponding path program 1 times [2025-03-08 05:25:16,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:16,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734631479] [2025-03-08 05:25:16,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:16,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:16,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 05:25:16,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 05:25:16,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:16,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:17,067 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:17,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:17,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734631479] [2025-03-08 05:25:17,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734631479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:17,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:17,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:25:17,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228839488] [2025-03-08 05:25:17,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:17,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:25:17,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:17,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:25:17,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:17,069 INFO L87 Difference]: Start difference. First operand 507 states and 852 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:17,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:17,116 INFO L93 Difference]: Finished difference Result 996 states and 1684 transitions. [2025-03-08 05:25:17,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:25:17,117 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:17,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:17,120 INFO L225 Difference]: With dead ends: 996 [2025-03-08 05:25:17,121 INFO L226 Difference]: Without dead ends: 507 [2025-03-08 05:25:17,122 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:17,123 INFO L435 NwaCegarLoop]: 844 mSDtfsCounter, 1 mSDsluCounter, 1684 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2528 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:17,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2528 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:17,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-03-08 05:25:17,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2025-03-08 05:25:17,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 401 states have (on average 1.7057356608478802) internal successors, (684), 420 states have internal predecessors, (684), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-08 05:25:17,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 851 transitions. [2025-03-08 05:25:17,144 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 851 transitions. Word has length 79 [2025-03-08 05:25:17,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:17,144 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 851 transitions. [2025-03-08 05:25:17,144 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:17,144 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 851 transitions. [2025-03-08 05:25:17,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-08 05:25:17,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:17,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] [2025-03-08 05:25:17,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:25:17,147 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:17,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:17,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1866711970, now seen corresponding path program 1 times [2025-03-08 05:25:17,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:17,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432271784] [2025-03-08 05:25:17,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:17,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:17,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 05:25:17,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 05:25:17,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:17,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:17,307 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:17,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:17,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432271784] [2025-03-08 05:25:17,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432271784] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:17,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:17,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:25:17,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432552838] [2025-03-08 05:25:17,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:17,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:25:17,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:17,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:25:17,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:25:17,310 INFO L87 Difference]: Start difference. First operand 507 states and 851 transitions. Second operand has 7 states, 6 states have (on average 10.5) internal successors, (63), 6 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:17,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:17,389 INFO L93 Difference]: Finished difference Result 962 states and 1616 transitions. [2025-03-08 05:25:17,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:25:17,390 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.5) internal successors, (63), 6 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:17,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:17,394 INFO L225 Difference]: With dead ends: 962 [2025-03-08 05:25:17,394 INFO L226 Difference]: Without dead ends: 522 [2025-03-08 05:25:17,396 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:17,396 INFO L435 NwaCegarLoop]: 841 mSDtfsCounter, 91 mSDsluCounter, 4124 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 4965 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:17,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 4965 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:25:17,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-03-08 05:25:17,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 520. [2025-03-08 05:25:17,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 411 states have (on average 1.7007299270072993) internal successors, (699), 432 states have internal predecessors, (699), 87 states have call successors, (87), 20 states have call predecessors, (87), 21 states have return successors, (84), 80 states have call predecessors, (84), 82 states have call successors, (84) [2025-03-08 05:25:17,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 870 transitions. [2025-03-08 05:25:17,418 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 870 transitions. Word has length 80 [2025-03-08 05:25:17,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:17,418 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 870 transitions. [2025-03-08 05:25:17,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.5) internal successors, (63), 6 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:17,419 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 870 transitions. [2025-03-08 05:25:17,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-08 05:25:17,421 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:17,421 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:17,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:25:17,421 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:17,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:17,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1658013667, now seen corresponding path program 1 times [2025-03-08 05:25:17,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:17,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884035645] [2025-03-08 05:25:17,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:17,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:17,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 05:25:17,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 05:25:17,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:17,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:17,492 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:17,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:17,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884035645] [2025-03-08 05:25:17,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884035645] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:17,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:17,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:25:17,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443589074] [2025-03-08 05:25:17,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:17,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:25:17,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:17,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:25:17,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:17,495 INFO L87 Difference]: Start difference. First operand 520 states and 870 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:17,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:17,534 INFO L93 Difference]: Finished difference Result 1014 states and 1710 transitions. [2025-03-08 05:25:17,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:25:17,534 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:17,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:17,537 INFO L225 Difference]: With dead ends: 1014 [2025-03-08 05:25:17,537 INFO L226 Difference]: Without dead ends: 501 [2025-03-08 05:25:17,539 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:17,540 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 0 mSDsluCounter, 1685 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2530 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:17,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2530 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:17,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2025-03-08 05:25:17,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 501. [2025-03-08 05:25:17,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 395 states have (on average 1.6962025316455696) internal successors, (670), 414 states have internal predecessors, (670), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-08 05:25:17,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 837 transitions. [2025-03-08 05:25:17,560 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 837 transitions. Word has length 80 [2025-03-08 05:25:17,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:17,560 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 837 transitions. [2025-03-08 05:25:17,560 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:17,560 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 837 transitions. [2025-03-08 05:25:17,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 05:25:17,562 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:17,562 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:17,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:25:17,562 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:17,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:17,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1176367843, now seen corresponding path program 1 times [2025-03-08 05:25:17,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:17,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830952480] [2025-03-08 05:25:17,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:17,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:17,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 05:25:17,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 05:25:17,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:17,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:17,680 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:17,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:17,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830952480] [2025-03-08 05:25:17,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830952480] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:17,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:17,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:25:17,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627620574] [2025-03-08 05:25:17,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:17,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:25:17,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:17,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:25:17,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:25:17,682 INFO L87 Difference]: Start difference. First operand 501 states and 837 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:17,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:17,855 INFO L93 Difference]: Finished difference Result 959 states and 1608 transitions. [2025-03-08 05:25:17,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:25:17,856 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:17,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:17,859 INFO L225 Difference]: With dead ends: 959 [2025-03-08 05:25:17,860 INFO L226 Difference]: Without dead ends: 510 [2025-03-08 05:25:17,861 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:17,862 INFO L435 NwaCegarLoop]: 794 mSDtfsCounter, 55 mSDsluCounter, 3147 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 3941 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:17,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 3941 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:17,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2025-03-08 05:25:17,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 501. [2025-03-08 05:25:17,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 395 states have (on average 1.6860759493670887) internal successors, (666), 414 states have internal predecessors, (666), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-08 05:25:17,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 833 transitions. [2025-03-08 05:25:17,876 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 833 transitions. Word has length 81 [2025-03-08 05:25:17,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:17,876 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 833 transitions. [2025-03-08 05:25:17,876 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:17,876 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 833 transitions. [2025-03-08 05:25:17,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-08 05:25:17,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:17,878 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:17,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:25:17,878 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:17,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:17,879 INFO L85 PathProgramCache]: Analyzing trace with hash 612908939, now seen corresponding path program 1 times [2025-03-08 05:25:17,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:17,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248557871] [2025-03-08 05:25:17,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:17,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:17,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 05:25:17,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 05:25:17,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:17,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:17,970 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:17,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:17,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248557871] [2025-03-08 05:25:17,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248557871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:17,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:17,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:25:17,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548035433] [2025-03-08 05:25:17,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:17,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:25:17,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:17,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:25:17,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:25:17,971 INFO L87 Difference]: Start difference. First operand 501 states and 833 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:18,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:18,108 INFO L93 Difference]: Finished difference Result 959 states and 1604 transitions. [2025-03-08 05:25:18,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:25:18,109 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:18,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:18,112 INFO L225 Difference]: With dead ends: 959 [2025-03-08 05:25:18,112 INFO L226 Difference]: Without dead ends: 510 [2025-03-08 05:25:18,114 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:18,116 INFO L435 NwaCegarLoop]: 794 mSDtfsCounter, 54 mSDsluCounter, 3147 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 3941 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:18,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 3941 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:18,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2025-03-08 05:25:18,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 501. [2025-03-08 05:25:18,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 395 states have (on average 1.6759493670886076) internal successors, (662), 414 states have internal predecessors, (662), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-08 05:25:18,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 829 transitions. [2025-03-08 05:25:18,136 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 829 transitions. Word has length 82 [2025-03-08 05:25:18,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:18,136 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 829 transitions. [2025-03-08 05:25:18,137 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:18,137 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 829 transitions. [2025-03-08 05:25:18,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-08 05:25:18,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:18,139 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:18,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:25:18,139 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:18,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:18,139 INFO L85 PathProgramCache]: Analyzing trace with hash -994665542, now seen corresponding path program 1 times [2025-03-08 05:25:18,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:18,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582922022] [2025-03-08 05:25:18,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:18,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:18,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 05:25:18,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 05:25:18,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:18,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:18,258 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:18,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:18,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582922022] [2025-03-08 05:25:18,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582922022] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:18,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:18,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:25:18,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322350925] [2025-03-08 05:25:18,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:18,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:25:18,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:18,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:25:18,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:25:18,260 INFO L87 Difference]: Start difference. First operand 501 states and 829 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:18,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:18,396 INFO L93 Difference]: Finished difference Result 959 states and 1600 transitions. [2025-03-08 05:25:18,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:25:18,397 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:18,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:18,401 INFO L225 Difference]: With dead ends: 959 [2025-03-08 05:25:18,401 INFO L226 Difference]: Without dead ends: 510 [2025-03-08 05:25:18,403 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:18,403 INFO L435 NwaCegarLoop]: 793 mSDtfsCounter, 53 mSDsluCounter, 3130 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 3923 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:18,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 3923 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:18,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2025-03-08 05:25:18,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 501. [2025-03-08 05:25:18,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 395 states have (on average 1.6658227848101266) internal successors, (658), 414 states have internal predecessors, (658), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-08 05:25:18,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 825 transitions. [2025-03-08 05:25:18,420 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 825 transitions. Word has length 83 [2025-03-08 05:25:18,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:18,420 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 825 transitions. [2025-03-08 05:25:18,421 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:18,421 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 825 transitions. [2025-03-08 05:25:18,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-08 05:25:18,422 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:18,423 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:18,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 05:25:18,423 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:18,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:18,424 INFO L85 PathProgramCache]: Analyzing trace with hash 838917035, now seen corresponding path program 1 times [2025-03-08 05:25:18,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:18,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120986412] [2025-03-08 05:25:18,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:18,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:18,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 05:25:18,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 05:25:18,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:18,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:18,539 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:18,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:18,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120986412] [2025-03-08 05:25:18,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120986412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:18,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:18,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:25:18,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917816141] [2025-03-08 05:25:18,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:18,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:25:18,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:18,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:25:18,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:25:18,541 INFO L87 Difference]: Start difference. First operand 501 states and 825 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:18,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:18,591 INFO L93 Difference]: Finished difference Result 950 states and 1582 transitions. [2025-03-08 05:25:18,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:25:18,592 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:18,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:18,595 INFO L225 Difference]: With dead ends: 950 [2025-03-08 05:25:18,595 INFO L226 Difference]: Without dead ends: 480 [2025-03-08 05:25:18,597 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:18,598 INFO L435 NwaCegarLoop]: 814 mSDtfsCounter, 84 mSDsluCounter, 3997 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 4811 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:18,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 4811 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:18,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2025-03-08 05:25:18,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 480. [2025-03-08 05:25:18,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 374 states have (on average 1.6684491978609626) internal successors, (624), 393 states have internal predecessors, (624), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-08 05:25:18,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 791 transitions. [2025-03-08 05:25:18,610 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 791 transitions. Word has length 83 [2025-03-08 05:25:18,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:18,611 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 791 transitions. [2025-03-08 05:25:18,611 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:18,611 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 791 transitions. [2025-03-08 05:25:18,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-08 05:25:18,612 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:18,612 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:18,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:25:18,613 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:18,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:18,613 INFO L85 PathProgramCache]: Analyzing trace with hash -530446776, now seen corresponding path program 1 times [2025-03-08 05:25:18,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:18,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227033436] [2025-03-08 05:25:18,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:18,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:18,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-08 05:25:18,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-08 05:25:18,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:18,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:18,697 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:18,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:18,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227033436] [2025-03-08 05:25:18,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227033436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:18,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:18,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:25:18,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140749663] [2025-03-08 05:25:18,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:18,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:25:18,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:18,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:25:18,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:25:18,698 INFO L87 Difference]: Start difference. First operand 480 states and 791 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:18,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:18,752 INFO L93 Difference]: Finished difference Result 929 states and 1548 transitions. [2025-03-08 05:25:18,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:25:18,753 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:18,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:18,756 INFO L225 Difference]: With dead ends: 929 [2025-03-08 05:25:18,756 INFO L226 Difference]: Without dead ends: 480 [2025-03-08 05:25:18,757 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:18,758 INFO L435 NwaCegarLoop]: 774 mSDtfsCounter, 17 mSDsluCounter, 3087 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 3861 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:18,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 3861 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:18,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2025-03-08 05:25:18,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 480. [2025-03-08 05:25:18,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 374 states have (on average 1.6657754010695187) internal successors, (623), 393 states have internal predecessors, (623), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-08 05:25:18,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 790 transitions. [2025-03-08 05:25:18,771 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 790 transitions. Word has length 84 [2025-03-08 05:25:18,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:18,771 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 790 transitions. [2025-03-08 05:25:18,771 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:18,771 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 790 transitions. [2025-03-08 05:25:18,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-08 05:25:18,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:18,773 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:18,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 05:25:18,773 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:18,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:18,773 INFO L85 PathProgramCache]: Analyzing trace with hash -265146793, now seen corresponding path program 1 times [2025-03-08 05:25:18,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:18,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067993709] [2025-03-08 05:25:18,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:18,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:18,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-08 05:25:18,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-08 05:25:18,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:18,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:18,881 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:18,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:18,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067993709] [2025-03-08 05:25:18,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067993709] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:18,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:18,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:25:18,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762256871] [2025-03-08 05:25:18,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:18,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:25:18,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:18,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:25:18,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:25:18,882 INFO L87 Difference]: Start difference. First operand 480 states and 790 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:18,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:18,938 INFO L93 Difference]: Finished difference Result 929 states and 1547 transitions. [2025-03-08 05:25:18,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:25:18,938 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:18,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:18,942 INFO L225 Difference]: With dead ends: 929 [2025-03-08 05:25:18,942 INFO L226 Difference]: Without dead ends: 480 [2025-03-08 05:25:18,944 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:18,945 INFO L435 NwaCegarLoop]: 774 mSDtfsCounter, 16 mSDsluCounter, 3087 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 3861 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:18,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 3861 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:18,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2025-03-08 05:25:18,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 480. [2025-03-08 05:25:18,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 374 states have (on average 1.6631016042780749) internal successors, (622), 393 states have internal predecessors, (622), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-08 05:25:18,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 789 transitions. [2025-03-08 05:25:18,960 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 789 transitions. Word has length 85 [2025-03-08 05:25:18,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:18,960 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 789 transitions. [2025-03-08 05:25:18,960 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:18,960 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 789 transitions. [2025-03-08 05:25:18,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 05:25:18,962 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:18,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, 1, 1, 1, 1, 1, 1] [2025-03-08 05:25:18,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:25:18,962 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:18,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:18,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1851024412, now seen corresponding path program 1 times [2025-03-08 05:25:18,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:18,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108960289] [2025-03-08 05:25:18,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:18,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:18,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 05:25:18,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 05:25:18,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:18,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:19,037 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:19,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:19,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108960289] [2025-03-08 05:25:19,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108960289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:19,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:19,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:25:19,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347300199] [2025-03-08 05:25:19,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:19,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:25:19,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:19,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:25:19,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:19,038 INFO L87 Difference]: Start difference. First operand 480 states and 789 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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:19,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:19,068 INFO L93 Difference]: Finished difference Result 929 states and 1546 transitions. [2025-03-08 05:25:19,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:25:19,068 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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 86 [2025-03-08 05:25:19,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:19,071 INFO L225 Difference]: With dead ends: 929 [2025-03-08 05:25:19,071 INFO L226 Difference]: Without dead ends: 480 [2025-03-08 05:25:19,073 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:19,073 INFO L435 NwaCegarLoop]: 782 mSDtfsCounter, 9 mSDsluCounter, 1558 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2340 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:19,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2340 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:19,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2025-03-08 05:25:19,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 480. [2025-03-08 05:25:19,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 374 states have (on average 1.660427807486631) internal successors, (621), 393 states have internal predecessors, (621), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-08 05:25:19,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 788 transitions. [2025-03-08 05:25:19,088 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 788 transitions. Word has length 86 [2025-03-08 05:25:19,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:19,090 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 788 transitions. [2025-03-08 05:25:19,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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:19,090 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 788 transitions. [2025-03-08 05:25:19,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 05:25:19,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:19,092 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:19,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 05:25:19,092 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:19,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:19,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1871361787, now seen corresponding path program 1 times [2025-03-08 05:25:19,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:19,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728801341] [2025-03-08 05:25:19,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:19,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:19,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 05:25:19,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 05:25:19,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:19,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:19,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:19,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:19,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728801341] [2025-03-08 05:25:19,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728801341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:19,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:19,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:25:19,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122534481] [2025-03-08 05:25:19,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:19,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:25:19,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:19,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:25:19,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:19,180 INFO L87 Difference]: Start difference. First operand 480 states and 788 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:25:19,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:19,209 INFO L93 Difference]: Finished difference Result 923 states and 1534 transitions. [2025-03-08 05:25:19,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:25:19,209 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 86 [2025-03-08 05:25:19,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:19,213 INFO L225 Difference]: With dead ends: 923 [2025-03-08 05:25:19,213 INFO L226 Difference]: Without dead ends: 480 [2025-03-08 05:25:19,214 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:19,215 INFO L435 NwaCegarLoop]: 776 mSDtfsCounter, 4 mSDsluCounter, 1543 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2319 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:19,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2319 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:25:19,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2025-03-08 05:25:19,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 480. [2025-03-08 05:25:19,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 374 states have (on average 1.6577540106951871) internal successors, (620), 393 states have internal predecessors, (620), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-08 05:25:19,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 787 transitions. [2025-03-08 05:25:19,227 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 787 transitions. Word has length 86 [2025-03-08 05:25:19,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:19,227 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 787 transitions. [2025-03-08 05:25:19,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:25:19,228 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 787 transitions. [2025-03-08 05:25:19,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-08 05:25:19,229 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:19,229 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:19,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 05:25:19,229 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:19,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:19,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1657716420, now seen corresponding path program 1 times [2025-03-08 05:25:19,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:19,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555992708] [2025-03-08 05:25:19,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:19,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:19,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-08 05:25:19,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 05:25:19,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:19,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:19,391 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:19,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:19,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555992708] [2025-03-08 05:25:19,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555992708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:19,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:19,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:25:19,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224346330] [2025-03-08 05:25:19,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:19,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:25:19,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:19,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:25:19,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:25:19,393 INFO L87 Difference]: Start difference. First operand 480 states and 787 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:20,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:20,733 INFO L93 Difference]: Finished difference Result 919 states and 1546 transitions. [2025-03-08 05:25:20,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:25:20,734 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:20,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:20,739 INFO L225 Difference]: With dead ends: 919 [2025-03-08 05:25:20,739 INFO L226 Difference]: Without dead ends: 484 [2025-03-08 05:25:20,741 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:20,742 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 1206 mSDsluCounter, 1206 mSDsCounter, 0 mSdLazyCounter, 2374 mSolverCounterSat, 354 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1206 SdHoareTripleChecker+Valid, 1579 SdHoareTripleChecker+Invalid, 2728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 354 IncrementalHoareTripleChecker+Valid, 2374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:20,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1206 Valid, 1579 Invalid, 2728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [354 Valid, 2374 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 05:25:20,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2025-03-08 05:25:20,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 484. [2025-03-08 05:25:20,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 377 states have (on average 1.6525198938992043) internal successors, (623), 396 states have internal predecessors, (623), 86 states have call successors, (86), 20 states have call predecessors, (86), 20 states have return successors, (97), 80 states have call predecessors, (97), 81 states have call successors, (97) [2025-03-08 05:25:20,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 806 transitions. [2025-03-08 05:25:20,766 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 806 transitions. Word has length 87 [2025-03-08 05:25:20,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:20,766 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 806 transitions. [2025-03-08 05:25:20,766 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:20,766 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 806 transitions. [2025-03-08 05:25:20,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 05:25:20,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:20,768 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:20,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 05:25:20,768 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:20,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:20,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1097584708, now seen corresponding path program 1 times [2025-03-08 05:25:20,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:20,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391898899] [2025-03-08 05:25:20,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:20,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:20,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 05:25:20,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 05:25:20,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:20,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:20,908 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:20,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:20,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391898899] [2025-03-08 05:25:20,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391898899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:20,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:20,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:25:20,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136462688] [2025-03-08 05:25:20,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:20,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:25:20,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:20,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:25:20,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:25:20,910 INFO L87 Difference]: Start difference. First operand 484 states and 806 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:23,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:23,394 INFO L93 Difference]: Finished difference Result 1724 states and 2970 transitions. [2025-03-08 05:25:23,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 05:25:23,394 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:23,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:23,402 INFO L225 Difference]: With dead ends: 1724 [2025-03-08 05:25:23,403 INFO L226 Difference]: Without dead ends: 1285 [2025-03-08 05:25:23,405 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:23,405 INFO L435 NwaCegarLoop]: 601 mSDtfsCounter, 2167 mSDsluCounter, 1969 mSDsCounter, 0 mSdLazyCounter, 4315 mSolverCounterSat, 564 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2234 SdHoareTripleChecker+Valid, 2570 SdHoareTripleChecker+Invalid, 4879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 564 IncrementalHoareTripleChecker+Valid, 4315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:23,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2234 Valid, 2570 Invalid, 4879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [564 Valid, 4315 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-08 05:25:23,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1285 states. [2025-03-08 05:25:23,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1285 to 1228. [2025-03-08 05:25:23,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1228 states, 953 states have (on average 1.6684155299055614) internal successors, (1590), 1001 states have internal predecessors, (1590), 223 states have call successors, (223), 51 states have call predecessors, (223), 51 states have return successors, (238), 212 states have call predecessors, (238), 218 states have call successors, (238) [2025-03-08 05:25:23,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 2051 transitions. [2025-03-08 05:25:23,469 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 2051 transitions. Word has length 88 [2025-03-08 05:25:23,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:23,469 INFO L471 AbstractCegarLoop]: Abstraction has 1228 states and 2051 transitions. [2025-03-08 05:25:23,470 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:23,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 2051 transitions. [2025-03-08 05:25:23,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 05:25:23,471 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:23,471 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:23,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 05:25:23,472 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:23,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:23,472 INFO L85 PathProgramCache]: Analyzing trace with hash -644795482, now seen corresponding path program 1 times [2025-03-08 05:25:23,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:23,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293826909] [2025-03-08 05:25:23,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:23,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:23,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 05:25:23,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 05:25:23,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:23,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:23,652 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:23,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:23,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293826909] [2025-03-08 05:25:23,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293826909] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:23,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:23,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:25:23,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379391865] [2025-03-08 05:25:23,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:23,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:25:23,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:23,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:25:23,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:25:23,654 INFO L87 Difference]: Start difference. First operand 1228 states and 2051 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:26,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:26,317 INFO L93 Difference]: Finished difference Result 5346 states and 9152 transitions. [2025-03-08 05:25:26,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 05:25:26,318 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:26,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:26,348 INFO L225 Difference]: With dead ends: 5346 [2025-03-08 05:25:26,348 INFO L226 Difference]: Without dead ends: 4163 [2025-03-08 05:25:26,356 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:26,356 INFO L435 NwaCegarLoop]: 630 mSDtfsCounter, 2688 mSDsluCounter, 1685 mSDsCounter, 0 mSdLazyCounter, 4884 mSolverCounterSat, 618 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2793 SdHoareTripleChecker+Valid, 2315 SdHoareTripleChecker+Invalid, 5502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 618 IncrementalHoareTripleChecker+Valid, 4884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:26,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2793 Valid, 2315 Invalid, 5502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [618 Valid, 4884 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-08 05:25:26,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4163 states. [2025-03-08 05:25:26,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4163 to 3912. [2025-03-08 05:25:26,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3912 states, 2941 states have (on average 1.6722203332199932) internal successors, (4918), 3118 states have internal predecessors, (4918), 822 states have call successors, (822), 137 states have call predecessors, (822), 148 states have return successors, (962), 797 states have call predecessors, (962), 817 states have call successors, (962) [2025-03-08 05:25:26,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3912 states to 3912 states and 6702 transitions. [2025-03-08 05:25:26,556 INFO L78 Accepts]: Start accepts. Automaton has 3912 states and 6702 transitions. Word has length 90 [2025-03-08 05:25:26,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:26,557 INFO L471 AbstractCegarLoop]: Abstraction has 3912 states and 6702 transitions. [2025-03-08 05:25:26,557 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:26,557 INFO L276 IsEmpty]: Start isEmpty. Operand 3912 states and 6702 transitions. [2025-03-08 05:25:26,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 05:25:26,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:26,559 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:26,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 05:25:26,559 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:26,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:26,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1674154780, now seen corresponding path program 1 times [2025-03-08 05:25:26,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:26,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366873365] [2025-03-08 05:25:26,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:26,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:26,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 05:25:26,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 05:25:26,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:26,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:26,683 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:26,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:26,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366873365] [2025-03-08 05:25:26,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366873365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:26,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:26,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:25:26,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889602917] [2025-03-08 05:25:26,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:26,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:25:26,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:26,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:25:26,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:25:26,684 INFO L87 Difference]: Start difference. First operand 3912 states and 6702 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:28,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:28,635 INFO L93 Difference]: Finished difference Result 10697 states and 18471 transitions. [2025-03-08 05:25:28,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 05:25:28,635 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:28,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:28,681 INFO L225 Difference]: With dead ends: 10697 [2025-03-08 05:25:28,681 INFO L226 Difference]: Without dead ends: 7853 [2025-03-08 05:25:28,695 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:28,696 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 2234 mSDsluCounter, 1347 mSDsCounter, 0 mSdLazyCounter, 3349 mSolverCounterSat, 475 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2311 SdHoareTripleChecker+Valid, 1693 SdHoareTripleChecker+Invalid, 3824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 475 IncrementalHoareTripleChecker+Valid, 3349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:28,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2311 Valid, 1693 Invalid, 3824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [475 Valid, 3349 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 05:25:28,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7853 states. [2025-03-08 05:25:29,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7853 to 7406. [2025-03-08 05:25:29,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7406 states, 5600 states have (on average 1.6694642857142856) internal successors, (9349), 5931 states have internal predecessors, (9349), 1500 states have call successors, (1500), 254 states have call predecessors, (1500), 305 states have return successors, (1882), 1456 states have call predecessors, (1882), 1495 states have call successors, (1882) [2025-03-08 05:25:29,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7406 states to 7406 states and 12731 transitions. [2025-03-08 05:25:29,094 INFO L78 Accepts]: Start accepts. Automaton has 7406 states and 12731 transitions. Word has length 90 [2025-03-08 05:25:29,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:29,095 INFO L471 AbstractCegarLoop]: Abstraction has 7406 states and 12731 transitions. [2025-03-08 05:25:29,095 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:29,095 INFO L276 IsEmpty]: Start isEmpty. Operand 7406 states and 12731 transitions. [2025-03-08 05:25:29,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 05:25:29,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:29,097 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:29,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 05:25:29,097 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:29,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:29,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1116513350, now seen corresponding path program 1 times [2025-03-08 05:25:29,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:29,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116812437] [2025-03-08 05:25:29,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:29,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:29,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 05:25:29,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 05:25:29,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:29,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:29,182 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:29,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:29,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116812437] [2025-03-08 05:25:29,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116812437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:29,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:29,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:25:29,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393500647] [2025-03-08 05:25:29,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:29,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:25:29,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:29,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:25:29,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:25:29,183 INFO L87 Difference]: Start difference. First operand 7406 states and 12731 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:29,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:29,471 INFO L93 Difference]: Finished difference Result 13666 states and 23561 transitions. [2025-03-08 05:25:29,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:25:29,474 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:29,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:29,523 INFO L225 Difference]: With dead ends: 13666 [2025-03-08 05:25:29,523 INFO L226 Difference]: Without dead ends: 7493 [2025-03-08 05:25:29,546 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:29,548 INFO L435 NwaCegarLoop]: 785 mSDtfsCounter, 0 mSDsluCounter, 2325 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3110 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:29,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3110 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:29,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7493 states. [2025-03-08 05:25:29,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7493 to 7479. [2025-03-08 05:25:29,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7479 states, 5656 states have (on average 1.6623055162659124) internal successors, (9402), 5986 states have internal predecessors, (9402), 1497 states have call successors, (1497), 254 states have call predecessors, (1497), 325 states have return successors, (1945), 1474 states have call predecessors, (1945), 1492 states have call successors, (1945) [2025-03-08 05:25:29,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7479 states to 7479 states and 12844 transitions. [2025-03-08 05:25:29,838 INFO L78 Accepts]: Start accepts. Automaton has 7479 states and 12844 transitions. Word has length 95 [2025-03-08 05:25:29,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:29,839 INFO L471 AbstractCegarLoop]: Abstraction has 7479 states and 12844 transitions. [2025-03-08 05:25:29,839 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:29,839 INFO L276 IsEmpty]: Start isEmpty. Operand 7479 states and 12844 transitions. [2025-03-08 05:25:29,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 05:25:29,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:29,843 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:29,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 05:25:29,843 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:29,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:29,843 INFO L85 PathProgramCache]: Analyzing trace with hash -195056099, now seen corresponding path program 1 times [2025-03-08 05:25:29,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:29,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303282731] [2025-03-08 05:25:29,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:29,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:29,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 05:25:29,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 05:25:29,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:29,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:30,066 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:30,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:30,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303282731] [2025-03-08 05:25:30,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303282731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:30,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:30,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 05:25:30,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152464575] [2025-03-08 05:25:30,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:30,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 05:25:30,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:30,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 05:25:30,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:25:30,069 INFO L87 Difference]: Start difference. First operand 7479 states and 12844 transitions. Second operand has 9 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 4 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-08 05:25:30,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:30,606 INFO L93 Difference]: Finished difference Result 14892 states and 26034 transitions. [2025-03-08 05:25:30,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 05:25:30,606 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 4 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 102 [2025-03-08 05:25:30,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:30,655 INFO L225 Difference]: With dead ends: 14892 [2025-03-08 05:25:30,655 INFO L226 Difference]: Without dead ends: 7627 [2025-03-08 05:25:30,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:25:30,689 INFO L435 NwaCegarLoop]: 823 mSDtfsCounter, 242 mSDsluCounter, 5480 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 6303 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:30,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 6303 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:25:30,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7627 states. [2025-03-08 05:25:30,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7627 to 7503. [2025-03-08 05:25:31,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7503 states, 5677 states have (on average 1.6387176325524044) internal successors, (9303), 6010 states have internal predecessors, (9303), 1497 states have call successors, (1497), 254 states have call predecessors, (1497), 328 states have return successors, (1957), 1474 states have call predecessors, (1957), 1492 states have call successors, (1957) [2025-03-08 05:25:31,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7503 states to 7503 states and 12757 transitions. [2025-03-08 05:25:31,046 INFO L78 Accepts]: Start accepts. Automaton has 7503 states and 12757 transitions. Word has length 102 [2025-03-08 05:25:31,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:31,046 INFO L471 AbstractCegarLoop]: Abstraction has 7503 states and 12757 transitions. [2025-03-08 05:25:31,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 4 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-08 05:25:31,046 INFO L276 IsEmpty]: Start isEmpty. Operand 7503 states and 12757 transitions. [2025-03-08 05:25:31,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-08 05:25:31,048 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:31,048 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:25:31,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 05:25:31,048 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:31,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:31,049 INFO L85 PathProgramCache]: Analyzing trace with hash -627093188, now seen corresponding path program 1 times [2025-03-08 05:25:31,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:31,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279969420] [2025-03-08 05:25:31,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:31,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:31,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 05:25:31,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 05:25:31,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:31,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:31,167 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:25:31,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:31,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279969420] [2025-03-08 05:25:31,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279969420] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:31,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:31,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:25:31,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507698765] [2025-03-08 05:25:31,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:31,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:25:31,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:31,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:25:31,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:25:31,169 INFO L87 Difference]: Start difference. First operand 7503 states and 12757 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:25:32,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:32,810 INFO L93 Difference]: Finished difference Result 14525 states and 24746 transitions. [2025-03-08 05:25:32,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 05:25:32,813 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:25:32,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:32,861 INFO L225 Difference]: With dead ends: 14525 [2025-03-08 05:25:32,861 INFO L226 Difference]: Without dead ends: 8271 [2025-03-08 05:25:32,886 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:25:32,887 INFO L435 NwaCegarLoop]: 368 mSDtfsCounter, 1956 mSDsluCounter, 1263 mSDsCounter, 0 mSdLazyCounter, 2852 mSolverCounterSat, 448 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2030 SdHoareTripleChecker+Valid, 1631 SdHoareTripleChecker+Invalid, 3300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 448 IncrementalHoareTripleChecker+Valid, 2852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:32,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2030 Valid, 1631 Invalid, 3300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [448 Valid, 2852 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 05:25:32,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8271 states. [2025-03-08 05:25:33,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8271 to 7738. [2025-03-08 05:25:33,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7738 states, 5852 states have (on average 1.6271360218728639) internal successors, (9522), 6203 states have internal predecessors, (9522), 1517 states have call successors, (1517), 279 states have call predecessors, (1517), 368 states have return successors, (2049), 1492 states have call predecessors, (2049), 1512 states have call successors, (2049) [2025-03-08 05:25:33,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7738 states to 7738 states and 13088 transitions. [2025-03-08 05:25:33,195 INFO L78 Accepts]: Start accepts. Automaton has 7738 states and 13088 transitions. Word has length 107 [2025-03-08 05:25:33,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:33,195 INFO L471 AbstractCegarLoop]: Abstraction has 7738 states and 13088 transitions. [2025-03-08 05:25:33,196 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:25:33,196 INFO L276 IsEmpty]: Start isEmpty. Operand 7738 states and 13088 transitions. [2025-03-08 05:25:33,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-08 05:25:33,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:33,198 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:25:33,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 05:25:33,198 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:33,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:33,198 INFO L85 PathProgramCache]: Analyzing trace with hash -849747344, now seen corresponding path program 1 times [2025-03-08 05:25:33,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:33,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459599259] [2025-03-08 05:25:33,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:33,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:33,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 05:25:33,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 05:25:33,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:33,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:33,398 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:25:33,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:33,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459599259] [2025-03-08 05:25:33,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459599259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:33,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:33,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 05:25:33,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117718266] [2025-03-08 05:25:33,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:33,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 05:25:33,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:33,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 05:25:33,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:25:33,401 INFO L87 Difference]: Start difference. First operand 7738 states and 13088 transitions. Second operand has 13 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 7 states have call successors, (13), 3 states have call predecessors, (13), 5 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-08 05:25:36,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:36,458 INFO L93 Difference]: Finished difference Result 16730 states and 28064 transitions. [2025-03-08 05:25:36,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 05:25:36,459 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 7 states have call successors, (13), 3 states have call predecessors, (13), 5 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 114 [2025-03-08 05:25:36,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:36,526 INFO L225 Difference]: With dead ends: 16730 [2025-03-08 05:25:36,526 INFO L226 Difference]: Without dead ends: 10060 [2025-03-08 05:25:36,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2025-03-08 05:25:36,558 INFO L435 NwaCegarLoop]: 388 mSDtfsCounter, 2105 mSDsluCounter, 3643 mSDsCounter, 0 mSdLazyCounter, 7572 mSolverCounterSat, 460 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2188 SdHoareTripleChecker+Valid, 4031 SdHoareTripleChecker+Invalid, 8032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 460 IncrementalHoareTripleChecker+Valid, 7572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:36,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2188 Valid, 4031 Invalid, 8032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [460 Valid, 7572 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-08 05:25:36,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10060 states. [2025-03-08 05:25:36,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10060 to 9265. [2025-03-08 05:25:37,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9265 states, 7060 states have (on average 1.6021246458923513) internal successors, (11311), 7470 states have internal predecessors, (11311), 1710 states have call successors, (1710), 367 states have call predecessors, (1710), 494 states have return successors, (2332), 1664 states have call predecessors, (2332), 1705 states have call successors, (2332) [2025-03-08 05:25:37,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9265 states to 9265 states and 15353 transitions. [2025-03-08 05:25:37,060 INFO L78 Accepts]: Start accepts. Automaton has 9265 states and 15353 transitions. Word has length 114 [2025-03-08 05:25:37,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:37,060 INFO L471 AbstractCegarLoop]: Abstraction has 9265 states and 15353 transitions. [2025-03-08 05:25:37,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 7 states have call successors, (13), 3 states have call predecessors, (13), 5 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-08 05:25:37,061 INFO L276 IsEmpty]: Start isEmpty. Operand 9265 states and 15353 transitions. [2025-03-08 05:25:37,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 05:25:37,063 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:37,063 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:25:37,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 05:25:37,063 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:37,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:37,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1232595849, now seen corresponding path program 1 times [2025-03-08 05:25:37,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:37,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688632134] [2025-03-08 05:25:37,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:37,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:37,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 05:25:37,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 05:25:37,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:37,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:37,240 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:25:37,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:37,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688632134] [2025-03-08 05:25:37,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688632134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:37,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:37,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:25:37,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810232307] [2025-03-08 05:25:37,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:37,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:25:37,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:37,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:25:37,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:25:37,243 INFO L87 Difference]: Start difference. First operand 9265 states and 15353 transitions. Second operand has 8 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:25:37,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:37,716 INFO L93 Difference]: Finished difference Result 21706 states and 36086 transitions. [2025-03-08 05:25:37,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:25:37,716 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 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:25:37,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:37,800 INFO L225 Difference]: With dead ends: 21706 [2025-03-08 05:25:37,801 INFO L226 Difference]: Without dead ends: 13690 [2025-03-08 05:25:37,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:25:37,834 INFO L435 NwaCegarLoop]: 1265 mSDtfsCounter, 737 mSDsluCounter, 7030 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 8295 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:37,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [738 Valid, 8295 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:25:37,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13690 states. [2025-03-08 05:25:38,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13690 to 11836. [2025-03-08 05:25:38,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11836 states, 9008 states have (on average 1.6163410301953818) internal successors, (14560), 9527 states have internal predecessors, (14560), 2231 states have call successors, (2231), 448 states have call predecessors, (2231), 596 states have return successors, (2986), 2193 states have call predecessors, (2986), 2226 states have call successors, (2986) [2025-03-08 05:25:38,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11836 states to 11836 states and 19777 transitions. [2025-03-08 05:25:38,420 INFO L78 Accepts]: Start accepts. Automaton has 11836 states and 19777 transitions. Word has length 112 [2025-03-08 05:25:38,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:38,421 INFO L471 AbstractCegarLoop]: Abstraction has 11836 states and 19777 transitions. [2025-03-08 05:25:38,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:25:38,421 INFO L276 IsEmpty]: Start isEmpty. Operand 11836 states and 19777 transitions. [2025-03-08 05:25:38,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-08 05:25:38,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:38,423 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:25:38,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 05:25:38,423 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:38,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:38,424 INFO L85 PathProgramCache]: Analyzing trace with hash 958467024, now seen corresponding path program 1 times [2025-03-08 05:25:38,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:38,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781058123] [2025-03-08 05:25:38,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:38,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:38,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 05:25:38,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 05:25:38,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:38,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:38,550 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:25:38,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:38,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781058123] [2025-03-08 05:25:38,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781058123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:38,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:38,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:25:38,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737279434] [2025-03-08 05:25:38,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:38,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:25:38,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:38,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:25:38,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:25:38,552 INFO L87 Difference]: Start difference. First operand 11836 states and 19777 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, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:25:39,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:39,163 INFO L93 Difference]: Finished difference Result 11960 states and 19999 transitions. [2025-03-08 05:25:39,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:25:39,163 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, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 114 [2025-03-08 05:25:39,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:39,238 INFO L225 Difference]: With dead ends: 11960 [2025-03-08 05:25:39,238 INFO L226 Difference]: Without dead ends: 11945 [2025-03-08 05:25:39,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:25:39,250 INFO L435 NwaCegarLoop]: 767 mSDtfsCounter, 846 mSDsluCounter, 1980 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 847 SdHoareTripleChecker+Valid, 2747 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:39,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [847 Valid, 2747 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:25:39,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11945 states. [2025-03-08 05:25:39,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11945 to 11844. [2025-03-08 05:25:39,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11844 states, 9016 states have (on average 1.6157941437444543) internal successors, (14568), 9535 states have internal predecessors, (14568), 2231 states have call successors, (2231), 448 states have call predecessors, (2231), 596 states have return successors, (2986), 2193 states have call predecessors, (2986), 2226 states have call successors, (2986) [2025-03-08 05:25:39,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11844 states to 11844 states and 19785 transitions. [2025-03-08 05:25:39,770 INFO L78 Accepts]: Start accepts. Automaton has 11844 states and 19785 transitions. Word has length 114 [2025-03-08 05:25:39,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:39,771 INFO L471 AbstractCegarLoop]: Abstraction has 11844 states and 19785 transitions. [2025-03-08 05:25:39,771 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, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:25:39,771 INFO L276 IsEmpty]: Start isEmpty. Operand 11844 states and 19785 transitions. [2025-03-08 05:25:39,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-08 05:25:39,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:39,773 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:25:39,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 05:25:39,773 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:39,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:39,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1311952980, now seen corresponding path program 1 times [2025-03-08 05:25:39,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:39,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014549293] [2025-03-08 05:25:39,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:39,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:39,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-08 05:25:39,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-08 05:25:39,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:39,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:39,943 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:25:39,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:39,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014549293] [2025-03-08 05:25:39,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014549293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:39,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:39,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 05:25:39,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374702728] [2025-03-08 05:25:39,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:39,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 05:25:39,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:39,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 05:25:39,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:25:39,945 INFO L87 Difference]: Start difference. First operand 11844 states and 19785 transitions. Second operand has 10 states, 9 states have (on average 9.88888888888889) internal successors, (89), 8 states have internal predecessors, (89), 3 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:25:40,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:40,390 INFO L93 Difference]: Finished difference Result 11859 states and 19803 transitions. [2025-03-08 05:25:40,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 05:25:40,391 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 9.88888888888889) internal successors, (89), 8 states have internal predecessors, (89), 3 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) Word has length 118 [2025-03-08 05:25:40,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:40,449 INFO L225 Difference]: With dead ends: 11859 [2025-03-08 05:25:40,450 INFO L226 Difference]: Without dead ends: 11844 [2025-03-08 05:25:40,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:25:40,459 INFO L435 NwaCegarLoop]: 768 mSDtfsCounter, 17 mSDsluCounter, 6110 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 6878 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:40,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 6878 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:40,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11844 states. [2025-03-08 05:25:41,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11844 to 11844. [2025-03-08 05:25:41,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11844 states, 9016 states have (on average 1.6149068322981366) internal successors, (14560), 9535 states have internal predecessors, (14560), 2231 states have call successors, (2231), 448 states have call predecessors, (2231), 596 states have return successors, (2986), 2193 states have call predecessors, (2986), 2226 states have call successors, (2986) [2025-03-08 05:25:41,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11844 states to 11844 states and 19777 transitions. [2025-03-08 05:25:41,089 INFO L78 Accepts]: Start accepts. Automaton has 11844 states and 19777 transitions. Word has length 118 [2025-03-08 05:25:41,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:41,090 INFO L471 AbstractCegarLoop]: Abstraction has 11844 states and 19777 transitions. [2025-03-08 05:25:41,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 9.88888888888889) internal successors, (89), 8 states have internal predecessors, (89), 3 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:25:41,091 INFO L276 IsEmpty]: Start isEmpty. Operand 11844 states and 19777 transitions. [2025-03-08 05:25:41,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-08 05:25:41,093 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:41,093 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:25:41,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 05:25:41,095 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:41,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:41,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1379212767, now seen corresponding path program 1 times [2025-03-08 05:25:41,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:41,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776721736] [2025-03-08 05:25:41,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:41,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:41,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-08 05:25:41,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-08 05:25:41,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:41,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:41,270 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:25:41,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:41,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776721736] [2025-03-08 05:25:41,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776721736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:41,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:41,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:25:41,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587935530] [2025-03-08 05:25:41,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:41,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:25:41,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:41,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:25:41,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:25:41,273 INFO L87 Difference]: Start difference. First operand 11844 states and 19777 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:25:42,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:42,616 INFO L93 Difference]: Finished difference Result 23697 states and 39729 transitions. [2025-03-08 05:25:42,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:25:42,616 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:25:42,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:42,682 INFO L225 Difference]: With dead ends: 23697 [2025-03-08 05:25:42,682 INFO L226 Difference]: Without dead ends: 11910 [2025-03-08 05:25:42,715 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:25:42,715 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 1154 mSDsluCounter, 1199 mSDsCounter, 0 mSdLazyCounter, 2381 mSolverCounterSat, 318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1154 SdHoareTripleChecker+Valid, 1570 SdHoareTripleChecker+Invalid, 2699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 318 IncrementalHoareTripleChecker+Valid, 2381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:42,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1154 Valid, 1570 Invalid, 2699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 2381 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 05:25:42,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11910 states. [2025-03-08 05:25:43,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11910 to 11844. [2025-03-08 05:25:43,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11844 states, 9016 states have (on average 1.6140195208518189) internal successors, (14552), 9535 states have internal predecessors, (14552), 2231 states have call successors, (2231), 448 states have call predecessors, (2231), 596 states have return successors, (2986), 2193 states have call predecessors, (2986), 2226 states have call successors, (2986) [2025-03-08 05:25:43,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11844 states to 11844 states and 19769 transitions. [2025-03-08 05:25:43,147 INFO L78 Accepts]: Start accepts. Automaton has 11844 states and 19769 transitions. Word has length 128 [2025-03-08 05:25:43,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:43,148 INFO L471 AbstractCegarLoop]: Abstraction has 11844 states and 19769 transitions. [2025-03-08 05:25:43,148 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:25:43,148 INFO L276 IsEmpty]: Start isEmpty. Operand 11844 states and 19769 transitions. [2025-03-08 05:25:43,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-08 05:25:43,150 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:43,150 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] [2025-03-08 05:25:43,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 05:25:43,150 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:43,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:43,150 INFO L85 PathProgramCache]: Analyzing trace with hash 902326166, now seen corresponding path program 1 times [2025-03-08 05:25:43,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:43,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84641978] [2025-03-08 05:25:43,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:43,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:43,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-08 05:25:43,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-08 05:25:43,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:43,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:43,234 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:25:43,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:43,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84641978] [2025-03-08 05:25:43,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84641978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:43,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:43,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:25:43,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353236864] [2025-03-08 05:25:43,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:43,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:25:43,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:43,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:25:43,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:43,236 INFO L87 Difference]: Start difference. First operand 11844 states and 19769 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 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:25:45,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:45,191 INFO L93 Difference]: Finished difference Result 39075 states and 67162 transitions. [2025-03-08 05:25:45,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:25:45,192 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 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 137 [2025-03-08 05:25:45,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:45,404 INFO L225 Difference]: With dead ends: 39075 [2025-03-08 05:25:45,404 INFO L226 Difference]: Without dead ends: 27276 [2025-03-08 05:25:45,468 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:25:45,469 INFO L435 NwaCegarLoop]: 393 mSDtfsCounter, 1729 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 1121 mSolverCounterSat, 361 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1799 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 1482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 361 IncrementalHoareTripleChecker+Valid, 1121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:45,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1799 Valid, 910 Invalid, 1482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [361 Valid, 1121 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 05:25:45,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27276 states. [2025-03-08 05:25:46,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27276 to 26599. [2025-03-08 05:25:46,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26599 states, 19772 states have (on average 1.608739631802549) internal successors, (31808), 21042 states have internal predecessors, (31808), 5569 states have call successors, (5569), 891 states have call predecessors, (5569), 1257 states have return successors, (8572), 5506 states have call predecessors, (8572), 5564 states have call successors, (8572) [2025-03-08 05:25:46,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26599 states to 26599 states and 45949 transitions. [2025-03-08 05:25:46,835 INFO L78 Accepts]: Start accepts. Automaton has 26599 states and 45949 transitions. Word has length 137 [2025-03-08 05:25:46,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:46,836 INFO L471 AbstractCegarLoop]: Abstraction has 26599 states and 45949 transitions. [2025-03-08 05:25:46,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 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:25:46,836 INFO L276 IsEmpty]: Start isEmpty. Operand 26599 states and 45949 transitions. [2025-03-08 05:25:46,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-08 05:25:46,841 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:46,841 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:25:46,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 05:25:46,841 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:46,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:46,841 INFO L85 PathProgramCache]: Analyzing trace with hash -2092823056, now seen corresponding path program 1 times [2025-03-08 05:25:46,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:46,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141883036] [2025-03-08 05:25:46,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:46,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:46,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 05:25:46,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 05:25:46,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:46,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:46,955 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:25:46,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:46,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141883036] [2025-03-08 05:25:46,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141883036] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:46,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:46,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:25:46,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029762631] [2025-03-08 05:25:46,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:46,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:25:46,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:46,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:25:46,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:46,957 INFO L87 Difference]: Start difference. First operand 26599 states and 45949 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:25:50,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:50,870 INFO L93 Difference]: Finished difference Result 89736 states and 161627 transitions. [2025-03-08 05:25:50,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:25:50,870 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:25:50,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:51,323 INFO L225 Difference]: With dead ends: 89736 [2025-03-08 05:25:51,323 INFO L226 Difference]: Without dead ends: 63182 [2025-03-08 05:25:51,445 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:25:51,445 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 1731 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 1107 mSolverCounterSat, 365 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1800 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 1472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 365 IncrementalHoareTripleChecker+Valid, 1107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:51,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1800 Valid, 880 Invalid, 1472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [365 Valid, 1107 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 05:25:51,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63182 states. [2025-03-08 05:25:55,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63182 to 61340. [2025-03-08 05:25:55,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61340 states, 44419 states have (on average 1.6013867939395303) internal successors, (71132), 47579 states have internal predecessors, (71132), 14252 states have call successors, (14252), 1777 states have call predecessors, (14252), 2668 states have return successors, (25704), 14155 states have call predecessors, (25704), 14247 states have call successors, (25704) [2025-03-08 05:25:55,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61340 states to 61340 states and 111088 transitions. [2025-03-08 05:25:55,585 INFO L78 Accepts]: Start accepts. Automaton has 61340 states and 111088 transitions. Word has length 138 [2025-03-08 05:25:55,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:55,585 INFO L471 AbstractCegarLoop]: Abstraction has 61340 states and 111088 transitions. [2025-03-08 05:25:55,585 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:25:55,586 INFO L276 IsEmpty]: Start isEmpty. Operand 61340 states and 111088 transitions. [2025-03-08 05:25:55,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 05:25:55,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:55,591 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, 1] [2025-03-08 05:25:55,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 05:25:55,591 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:55,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:55,591 INFO L85 PathProgramCache]: Analyzing trace with hash -453172208, now seen corresponding path program 1 times [2025-03-08 05:25:55,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:55,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681528548] [2025-03-08 05:25:55,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:55,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:55,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 05:25:55,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 05:25:55,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:55,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:55,666 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:25:55,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:55,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681528548] [2025-03-08 05:25:55,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681528548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:55,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:55,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:25:55,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29466974] [2025-03-08 05:25:55,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:55,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:25:55,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:55,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:25:55,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:55,668 INFO L87 Difference]: Start difference. First operand 61340 states and 111088 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, (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:06,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:06,226 INFO L93 Difference]: Finished difference Result 210857 states and 404458 transitions. [2025-03-08 05:26:06,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:26:06,226 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, (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 139 [2025-03-08 05:26:06,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:07,457 INFO L225 Difference]: With dead ends: 210857 [2025-03-08 05:26:07,457 INFO L226 Difference]: Without dead ends: 149562 [2025-03-08 05:26:07,805 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:07,805 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 1719 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 1107 mSolverCounterSat, 367 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1787 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 1474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 367 IncrementalHoareTripleChecker+Valid, 1107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:07,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1787 Valid, 877 Invalid, 1474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [367 Valid, 1107 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 05:26:07,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149562 states.