./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec2_product09.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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_product09.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 4cb164e6307f0ddcae5850d7f4578967441d1456f6ed5a5be472ba090758b873 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:15:38,313 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:15:38,370 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:15:38,374 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:15:38,374 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:15:38,394 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:15:38,395 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:15:38,395 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:15:38,396 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:15:38,396 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:15:38,396 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:15:38,397 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:15:38,397 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:15:38,397 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:15:38,397 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:15:38,397 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:15:38,397 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:15:38,397 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:15:38,397 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:15:38,397 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:15:38,397 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:15:38,398 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:15:38,398 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:15:38,398 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:15:38,398 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:15:38,398 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:15:38,398 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:15:38,398 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:15:38,398 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:15:38,398 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:15:38,399 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:15:38,399 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:15:38,399 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:15:38,399 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:15:38,399 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:15:38,399 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:15:38,400 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:15:38,400 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:15:38,400 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:15:38,400 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:15:38,400 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:15:38,400 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:15:38,400 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:15:38,400 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 -> 4cb164e6307f0ddcae5850d7f4578967441d1456f6ed5a5be472ba090758b873 [2025-03-03 14:15:38,631 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:15:38,637 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:15:38,638 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:15:38,640 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:15:38,640 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:15:38,641 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec2_product09.cil.c [2025-03-03 14:15:39,710 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac412f15a/f3104fd2183942b4bd91de6405b3be55/FLAG3e51351bd [2025-03-03 14:15:40,052 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:15:40,057 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product09.cil.c [2025-03-03 14:15:40,081 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac412f15a/f3104fd2183942b4bd91de6405b3be55/FLAG3e51351bd [2025-03-03 14:15:40,285 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac412f15a/f3104fd2183942b4bd91de6405b3be55 [2025-03-03 14:15:40,287 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:15:40,288 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:15:40,290 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:15:40,290 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:15:40,293 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:15:40,295 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:15:40" (1/1) ... [2025-03-03 14:15:40,296 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7841822b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:40, skipping insertion in model container [2025-03-03 14:15:40,297 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:15:40" (1/1) ... [2025-03-03 14:15:40,342 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:15:40,583 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_product09.cil.c[28842,28855] [2025-03-03 14:15:40,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:15:40,687 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:15:40,693 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [48] [2025-03-03 14:15:40,694 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [412] [2025-03-03 14:15:40,694 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [532] [2025-03-03 14:15:40,695 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [716] [2025-03-03 14:15:40,695 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1383] [2025-03-03 14:15:40,695 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1418] [2025-03-03 14:15:40,695 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1427] [2025-03-03 14:15:40,696 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2869] [2025-03-03 14:15:40,696 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [3235] [2025-03-03 14:15:40,696 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [3247] [2025-03-03 14:15:40,742 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_product09.cil.c[28842,28855] [2025-03-03 14:15:40,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:15:40,821 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:15:40,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:40 WrapperNode [2025-03-03 14:15:40,823 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:15:40,823 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:15:40,823 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:15:40,823 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:15:40,828 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:40" (1/1) ... [2025-03-03 14:15:40,850 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:40" (1/1) ... [2025-03-03 14:15:40,881 INFO L138 Inliner]: procedures = 89, calls = 330, calls flagged for inlining = 25, calls inlined = 22, statements flattened = 808 [2025-03-03 14:15:40,882 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:15:40,882 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:15:40,882 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:15:40,882 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:15:40,889 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:40" (1/1) ... [2025-03-03 14:15:40,889 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:40" (1/1) ... [2025-03-03 14:15:40,893 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:40" (1/1) ... [2025-03-03 14:15:40,922 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2025-03-03 14:15:40,922 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:40" (1/1) ... [2025-03-03 14:15:40,922 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:40" (1/1) ... [2025-03-03 14:15:40,941 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:40" (1/1) ... [2025-03-03 14:15:40,947 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:40" (1/1) ... [2025-03-03 14:15:40,952 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:40" (1/1) ... [2025-03-03 14:15:40,953 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:40" (1/1) ... [2025-03-03 14:15:40,959 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:15:40,967 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:15:40,967 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:15:40,967 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:15:40,968 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:40" (1/1) ... [2025-03-03 14:15:40,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:15:40,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:15:40,992 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-03 14:15:40,995 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-03 14:15:41,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:15:41,012 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-03-03 14:15:41,013 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-03-03 14:15:41,013 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-03-03 14:15:41,013 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-03-03 14:15:41,013 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-03-03 14:15:41,013 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-03-03 14:15:41,013 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-03-03 14:15:41,013 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-03-03 14:15:41,014 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-03 14:15:41,014 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-03 14:15:41,014 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-03 14:15:41,014 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-03 14:15:41,014 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2025-03-03 14:15:41,014 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2025-03-03 14:15:41,014 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-03-03 14:15:41,015 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-03-03 14:15:41,015 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-03-03 14:15:41,015 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-03-03 14:15:41,015 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-03-03 14:15:41,015 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-03-03 14:15:41,015 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-03-03 14:15:41,015 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-03-03 14:15:41,017 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-03-03 14:15:41,017 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-03-03 14:15:41,017 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-03-03 14:15:41,017 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-03-03 14:15:41,017 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-03-03 14:15:41,017 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-03-03 14:15:41,017 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-03-03 14:15:41,017 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-03-03 14:15:41,017 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-03-03 14:15:41,017 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-03-03 14:15:41,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:15:41,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:15:41,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:15:41,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:15:41,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-03 14:15:41,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-03 14:15:41,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-03 14:15:41,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-03 14:15:41,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-03 14:15:41,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-03 14:15:41,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-03 14:15:41,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-03 14:15:41,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-03 14:15:41,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-03 14:15:41,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-03 14:15:41,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-03 14:15:41,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-03 14:15:41,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-03 14:15:41,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-03 14:15:41,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-03 14:15:41,018 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-03-03 14:15:41,018 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-03-03 14:15:41,018 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-03-03 14:15:41,018 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-03-03 14:15:41,018 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-03-03 14:15:41,018 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-03-03 14:15:41,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:15:41,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:15:41,018 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-03-03 14:15:41,018 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-03-03 14:15:41,155 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:15:41,158 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:15:41,203 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L529: #res := ~retValue_acc~4; [2025-03-03 14:15:41,206 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1500: #res := ~retValue_acc~10; [2025-03-03 14:15:41,453 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2190: #res := ~retValue_acc~18; [2025-03-03 14:15:41,499 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2294: #res := ~retValue_acc~21; [2025-03-03 14:15:41,508 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L490: #res := ~retValue_acc~3; [2025-03-03 14:15:41,565 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1745-1: isEmpty_#res#1 := isEmpty_~retValue_acc~15#1; [2025-03-03 14:15:41,625 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1825-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~16#1; [2025-03-03 14:15:41,625 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1838-1: isIdle_#res#1 := isIdle_~retValue_acc~17#1; [2025-03-03 14:15:41,753 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1696-1: buttonForFloorIsPressed_#res#1 := buttonForFloorIsPressed_~retValue_acc~13#1; [2025-03-03 14:15:41,754 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2280-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~20#1; [2025-03-03 14:15:41,755 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653-1: getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~11#1; [2025-03-03 14:15:41,799 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1069: #res := ~retValue_acc~6; [2025-03-03 14:15:41,862 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L409-1: main_#res#1 := main_~retValue_acc~1#1; [2025-03-03 14:15:41,862 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1415-1: valid_product_#res#1 := valid_product_~retValue_acc~9#1; [2025-03-03 14:15:41,870 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L833: #res := ~retValue_acc~5; [2025-03-03 14:15:41,871 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1662: #res := ~retValue_acc~12; [2025-03-03 14:15:41,875 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1380: #res := ~retValue_acc~7; [2025-03-03 14:15:41,968 INFO L? ?]: Removed 421 outVars from TransFormulas that were not future-live. [2025-03-03 14:15:41,968 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:15:41,985 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:15:41,987 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:15:41,988 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:15:41 BoogieIcfgContainer [2025-03-03 14:15:41,988 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:15:41,990 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:15:41,990 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:15:41,995 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:15:41,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:15:40" (1/3) ... [2025-03-03 14:15:41,996 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5319509 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:15:41, skipping insertion in model container [2025-03-03 14:15:41,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:40" (2/3) ... [2025-03-03 14:15:41,996 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5319509 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:15:41, skipping insertion in model container [2025-03-03 14:15:41,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:15:41" (3/3) ... [2025-03-03 14:15:41,997 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product09.cil.c [2025-03-03 14:15:42,007 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:15:42,010 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec2_product09.cil.c that has 21 procedures, 525 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:15:42,067 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:15:42,074 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;@50ee27bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:15:42,074 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:15:42,079 INFO L276 IsEmpty]: Start isEmpty. Operand has 525 states, 417 states have (on average 1.7170263788968825) internal successors, (716), 438 states have internal predecessors, (716), 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-03 14:15:42,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 14:15:42,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:42,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] [2025-03-03 14:15:42,097 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:42,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:42,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1483004138, now seen corresponding path program 1 times [2025-03-03 14:15:42,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:42,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474541173] [2025-03-03 14:15:42,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:42,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:42,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 14:15:42,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 14:15:42,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:42,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:42,556 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-03 14:15:42,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:42,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474541173] [2025-03-03 14:15:42,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474541173] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:42,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:42,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:15:42,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930044546] [2025-03-03 14:15:42,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:42,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:15:42,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:42,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:15:42,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:15:42,580 INFO L87 Difference]: Start difference. First operand has 525 states, 417 states have (on average 1.7170263788968825) internal successors, (716), 438 states have internal predecessors, (716), 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-03 14:15:42,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:42,702 INFO L93 Difference]: Finished difference Result 1030 states and 1751 transitions. [2025-03-03 14:15:42,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:15:42,704 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-03 14:15:42,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:42,720 INFO L225 Difference]: With dead ends: 1030 [2025-03-03 14:15:42,720 INFO L226 Difference]: Without dead ends: 517 [2025-03-03 14:15:42,724 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-03 14:15:42,726 INFO L435 NwaCegarLoop]: 868 mSDtfsCounter, 5 mSDsluCounter, 1732 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2600 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-03 14:15:42,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2600 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:15:42,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2025-03-03 14:15:42,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 517. [2025-03-03 14:15:42,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 411 states have (on average 1.7153284671532847) internal successors, (705), 430 states have internal predecessors, (705), 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-03 14:15:42,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 872 transitions. [2025-03-03 14:15:42,775 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 872 transitions. Word has length 74 [2025-03-03 14:15:42,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:42,775 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 872 transitions. [2025-03-03 14:15:42,775 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-03 14:15:42,777 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 872 transitions. [2025-03-03 14:15:42,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 14:15:42,784 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:42,784 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-03 14:15:42,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:15:42,785 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:42,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:42,786 INFO L85 PathProgramCache]: Analyzing trace with hash -889598729, now seen corresponding path program 1 times [2025-03-03 14:15:42,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:42,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039363468] [2025-03-03 14:15:42,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:42,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:42,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 14:15:42,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 14:15:42,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:42,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:42,950 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-03 14:15:42,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:42,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039363468] [2025-03-03 14:15:42,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039363468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:42,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:42,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:15:42,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712670246] [2025-03-03 14:15:42,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:42,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:15:42,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:42,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:15:42,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:15:42,954 INFO L87 Difference]: Start difference. First operand 517 states and 872 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-03 14:15:43,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:43,014 INFO L93 Difference]: Finished difference Result 1016 states and 1721 transitions. [2025-03-03 14:15:43,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:15:43,015 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-03 14:15:43,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:43,018 INFO L225 Difference]: With dead ends: 1016 [2025-03-03 14:15:43,019 INFO L226 Difference]: Without dead ends: 517 [2025-03-03 14:15:43,020 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-03 14:15:43,021 INFO L435 NwaCegarLoop]: 861 mSDtfsCounter, 4 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2579 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-03 14:15:43,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2579 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:15:43,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2025-03-03 14:15:43,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 517. [2025-03-03 14:15:43,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 411 states have (on average 1.7128953771289537) internal successors, (704), 430 states have internal predecessors, (704), 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-03 14:15:43,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 871 transitions. [2025-03-03 14:15:43,048 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 871 transitions. Word has length 77 [2025-03-03 14:15:43,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:43,049 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 871 transitions. [2025-03-03 14:15:43,049 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-03 14:15:43,049 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 871 transitions. [2025-03-03 14:15:43,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-03 14:15:43,052 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:43,052 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-03 14:15:43,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:15:43,052 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:43,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:43,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1613095932, now seen corresponding path program 1 times [2025-03-03 14:15:43,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:43,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195684093] [2025-03-03 14:15:43,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:43,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:43,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-03 14:15:43,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-03 14:15:43,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:43,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:43,216 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-03 14:15:43,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:43,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195684093] [2025-03-03 14:15:43,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195684093] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:43,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:43,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:15:43,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679866655] [2025-03-03 14:15:43,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:43,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:15:43,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:43,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:15:43,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:15:43,218 INFO L87 Difference]: Start difference. First operand 517 states and 871 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-03 14:15:43,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:43,268 INFO L93 Difference]: Finished difference Result 1016 states and 1720 transitions. [2025-03-03 14:15:43,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:15:43,270 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-03 14:15:43,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:43,275 INFO L225 Difference]: With dead ends: 1016 [2025-03-03 14:15:43,275 INFO L226 Difference]: Without dead ends: 517 [2025-03-03 14:15:43,277 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-03 14:15:43,277 INFO L435 NwaCegarLoop]: 861 mSDtfsCounter, 3 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2579 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-03 14:15:43,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2579 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:15:43,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2025-03-03 14:15:43,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 517. [2025-03-03 14:15:43,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 411 states have (on average 1.710462287104623) internal successors, (703), 430 states have internal predecessors, (703), 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-03 14:15:43,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 870 transitions. [2025-03-03 14:15:43,299 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 870 transitions. Word has length 78 [2025-03-03 14:15:43,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:43,300 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 870 transitions. [2025-03-03 14:15:43,300 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-03 14:15:43,300 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 870 transitions. [2025-03-03 14:15:43,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 14:15:43,303 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:43,303 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:15:43,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:15:43,303 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:43,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:43,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1239794292, now seen corresponding path program 1 times [2025-03-03 14:15:43,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:43,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841470415] [2025-03-03 14:15:43,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:43,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:43,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 14:15:43,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 14:15:43,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:43,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:43,419 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-03 14:15:43,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:43,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841470415] [2025-03-03 14:15:43,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841470415] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:43,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:43,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:15:43,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580189341] [2025-03-03 14:15:43,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:43,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:15:43,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:43,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:15:43,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:15:43,420 INFO L87 Difference]: Start difference. First operand 517 states and 870 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-03 14:15:43,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:43,452 INFO L93 Difference]: Finished difference Result 1016 states and 1719 transitions. [2025-03-03 14:15:43,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:15:43,453 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-03 14:15:43,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:43,456 INFO L225 Difference]: With dead ends: 1016 [2025-03-03 14:15:43,456 INFO L226 Difference]: Without dead ends: 517 [2025-03-03 14:15:43,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:15:43,458 INFO L435 NwaCegarLoop]: 861 mSDtfsCounter, 2 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2579 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-03 14:15:43,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2579 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:15:43,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2025-03-03 14:15:43,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 517. [2025-03-03 14:15:43,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 411 states have (on average 1.7080291970802919) internal successors, (702), 430 states have internal predecessors, (702), 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-03 14:15:43,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 869 transitions. [2025-03-03 14:15:43,477 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 869 transitions. Word has length 79 [2025-03-03 14:15:43,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:43,477 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 869 transitions. [2025-03-03 14:15:43,477 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-03 14:15:43,478 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 869 transitions. [2025-03-03 14:15:43,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-03 14:15:43,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:43,481 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-03 14:15:43,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:15:43,481 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:43,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:43,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1003422239, now seen corresponding path program 1 times [2025-03-03 14:15:43,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:43,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160853994] [2025-03-03 14:15:43,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:43,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:43,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 14:15:43,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 14:15:43,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:43,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:43,611 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-03 14:15:43,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:43,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160853994] [2025-03-03 14:15:43,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160853994] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:43,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:43,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:15:43,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248784205] [2025-03-03 14:15:43,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:43,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:15:43,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:43,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:15:43,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:15:43,613 INFO L87 Difference]: Start difference. First operand 517 states and 869 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-03 14:15:43,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:43,649 INFO L93 Difference]: Finished difference Result 1016 states and 1718 transitions. [2025-03-03 14:15:43,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:15:43,649 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-03 14:15:43,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:43,652 INFO L225 Difference]: With dead ends: 1016 [2025-03-03 14:15:43,652 INFO L226 Difference]: Without dead ends: 517 [2025-03-03 14:15:43,654 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-03 14:15:43,655 INFO L435 NwaCegarLoop]: 861 mSDtfsCounter, 1 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2579 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-03 14:15:43,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2579 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:15:43,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2025-03-03 14:15:43,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 517. [2025-03-03 14:15:43,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 411 states have (on average 1.705596107055961) internal successors, (701), 430 states have internal predecessors, (701), 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-03 14:15:43,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 868 transitions. [2025-03-03 14:15:43,684 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 868 transitions. Word has length 80 [2025-03-03 14:15:43,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:43,685 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 868 transitions. [2025-03-03 14:15:43,685 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-03 14:15:43,685 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 868 transitions. [2025-03-03 14:15:43,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 14:15:43,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:43,688 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-03 14:15:43,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:15:43,688 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:43,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:43,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1982809073, now seen corresponding path program 1 times [2025-03-03 14:15:43,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:43,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643002840] [2025-03-03 14:15:43,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:43,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:43,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 14:15:43,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 14:15:43,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:43,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:43,861 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-03 14:15:43,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:43,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643002840] [2025-03-03 14:15:43,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643002840] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:43,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:43,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:15:43,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63828641] [2025-03-03 14:15:43,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:43,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:15:43,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:43,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:15:43,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:15:43,864 INFO L87 Difference]: Start difference. First operand 517 states and 868 transitions. Second operand has 7 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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-03 14:15:43,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:43,952 INFO L93 Difference]: Finished difference Result 982 states and 1650 transitions. [2025-03-03 14:15:43,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:15:43,952 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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 81 [2025-03-03 14:15:43,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:43,957 INFO L225 Difference]: With dead ends: 982 [2025-03-03 14:15:43,957 INFO L226 Difference]: Without dead ends: 532 [2025-03-03 14:15:43,959 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-03 14:15:43,960 INFO L435 NwaCegarLoop]: 858 mSDtfsCounter, 91 mSDsluCounter, 4209 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 5067 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-03 14:15:43,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 5067 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:15:43,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-03-03 14:15:43,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 530. [2025-03-03 14:15:43,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 421 states have (on average 1.700712589073634) internal successors, (716), 442 states have internal predecessors, (716), 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-03 14:15:43,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 887 transitions. [2025-03-03 14:15:43,991 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 887 transitions. Word has length 81 [2025-03-03 14:15:43,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:43,991 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 887 transitions. [2025-03-03 14:15:43,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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-03 14:15:43,992 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 887 transitions. [2025-03-03 14:15:43,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 14:15:43,995 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:43,995 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-03 14:15:43,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:15:43,996 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:43,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:43,996 INFO L85 PathProgramCache]: Analyzing trace with hash -191871024, now seen corresponding path program 1 times [2025-03-03 14:15:43,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:43,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937072132] [2025-03-03 14:15:43,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:43,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:44,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 14:15:44,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 14:15:44,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:44,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:44,093 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-03 14:15:44,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:44,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937072132] [2025-03-03 14:15:44,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937072132] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:44,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:44,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:15:44,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841885287] [2025-03-03 14:15:44,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:44,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:15:44,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:44,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:15:44,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:15:44,094 INFO L87 Difference]: Start difference. First operand 530 states and 887 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-03 14:15:44,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:44,133 INFO L93 Difference]: Finished difference Result 1034 states and 1744 transitions. [2025-03-03 14:15:44,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:15:44,134 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 81 [2025-03-03 14:15:44,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:44,138 INFO L225 Difference]: With dead ends: 1034 [2025-03-03 14:15:44,138 INFO L226 Difference]: Without dead ends: 511 [2025-03-03 14:15:44,140 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-03 14:15:44,141 INFO L435 NwaCegarLoop]: 862 mSDtfsCounter, 0 mSDsluCounter, 1719 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2581 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-03 14:15:44,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2581 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:15:44,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-03-03 14:15:44,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 511. [2025-03-03 14:15:44,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 405 states have (on average 1.6962962962962962) internal successors, (687), 424 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-03 14:15:44,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 854 transitions. [2025-03-03 14:15:44,160 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 854 transitions. Word has length 81 [2025-03-03 14:15:44,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:44,161 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 854 transitions. [2025-03-03 14:15:44,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-03 14:15:44,161 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 854 transitions. [2025-03-03 14:15:44,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-03 14:15:44,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:44,163 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-03 14:15:44,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:15:44,163 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:44,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:44,164 INFO L85 PathProgramCache]: Analyzing trace with hash -2135839146, now seen corresponding path program 1 times [2025-03-03 14:15:44,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:44,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860581872] [2025-03-03 14:15:44,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:44,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:44,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-03 14:15:44,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-03 14:15:44,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:44,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:44,294 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-03 14:15:44,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:44,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860581872] [2025-03-03 14:15:44,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860581872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:44,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:44,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:15:44,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823131251] [2025-03-03 14:15:44,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:44,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:15:44,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:44,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:15:44,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:15:44,296 INFO L87 Difference]: Start difference. First operand 511 states and 854 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-03 14:15:44,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:44,456 INFO L93 Difference]: Finished difference Result 979 states and 1642 transitions. [2025-03-03 14:15:44,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:15:44,457 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-03 14:15:44,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:44,461 INFO L225 Difference]: With dead ends: 979 [2025-03-03 14:15:44,461 INFO L226 Difference]: Without dead ends: 520 [2025-03-03 14:15:44,463 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-03 14:15:44,464 INFO L435 NwaCegarLoop]: 811 mSDtfsCounter, 55 mSDsluCounter, 3215 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4026 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-03 14:15:44,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4026 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:15:44,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2025-03-03 14:15:44,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 511. [2025-03-03 14:15:44,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 405 states have (on average 1.6864197530864198) internal successors, (683), 424 states have internal predecessors, (683), 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-03 14:15:44,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 850 transitions. [2025-03-03 14:15:44,478 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 850 transitions. Word has length 82 [2025-03-03 14:15:44,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:44,479 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 850 transitions. [2025-03-03 14:15:44,479 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-03 14:15:44,479 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 850 transitions. [2025-03-03 14:15:44,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-03 14:15:44,481 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:44,481 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-03 14:15:44,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:15:44,481 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:44,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:44,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1804937944, now seen corresponding path program 1 times [2025-03-03 14:15:44,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:44,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660857712] [2025-03-03 14:15:44,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:44,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:44,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-03 14:15:44,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-03 14:15:44,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:44,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:44,585 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-03 14:15:44,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:44,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660857712] [2025-03-03 14:15:44,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660857712] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:44,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:44,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:15:44,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872892230] [2025-03-03 14:15:44,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:44,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:15:44,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:44,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:15:44,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:15:44,586 INFO L87 Difference]: Start difference. First operand 511 states and 850 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-03 14:15:44,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:44,714 INFO L93 Difference]: Finished difference Result 979 states and 1638 transitions. [2025-03-03 14:15:44,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:15:44,714 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-03 14:15:44,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:44,717 INFO L225 Difference]: With dead ends: 979 [2025-03-03 14:15:44,717 INFO L226 Difference]: Without dead ends: 520 [2025-03-03 14:15:44,719 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-03 14:15:44,719 INFO L435 NwaCegarLoop]: 811 mSDtfsCounter, 54 mSDsluCounter, 3215 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4026 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-03 14:15:44,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4026 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:15:44,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2025-03-03 14:15:44,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 511. [2025-03-03 14:15:44,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 405 states have (on average 1.6765432098765432) internal successors, (679), 424 states have internal predecessors, (679), 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-03 14:15:44,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 846 transitions. [2025-03-03 14:15:44,732 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 846 transitions. Word has length 83 [2025-03-03 14:15:44,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:44,733 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 846 transitions. [2025-03-03 14:15:44,733 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-03 14:15:44,733 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 846 transitions. [2025-03-03 14:15:44,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-03 14:15:44,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:44,735 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-03 14:15:44,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:15:44,735 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:44,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:44,735 INFO L85 PathProgramCache]: Analyzing trace with hash 59794265, now seen corresponding path program 1 times [2025-03-03 14:15:44,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:44,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121982546] [2025-03-03 14:15:44,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:44,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:44,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-03 14:15:44,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-03 14:15:44,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:44,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:44,835 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-03 14:15:44,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:44,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121982546] [2025-03-03 14:15:44,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121982546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:44,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:44,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:15:44,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074586383] [2025-03-03 14:15:44,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:44,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:15:44,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:44,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:15:44,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:15:44,837 INFO L87 Difference]: Start difference. First operand 511 states and 846 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-03 14:15:44,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:44,963 INFO L93 Difference]: Finished difference Result 979 states and 1634 transitions. [2025-03-03 14:15:44,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:15:44,964 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-03 14:15:44,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:44,968 INFO L225 Difference]: With dead ends: 979 [2025-03-03 14:15:44,968 INFO L226 Difference]: Without dead ends: 520 [2025-03-03 14:15:44,970 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-03 14:15:44,970 INFO L435 NwaCegarLoop]: 810 mSDtfsCounter, 53 mSDsluCounter, 3198 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4008 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-03 14:15:44,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4008 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:15:44,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2025-03-03 14:15:44,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 511. [2025-03-03 14:15:44,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 405 states have (on average 1.6666666666666667) internal successors, (675), 424 states have internal predecessors, (675), 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-03 14:15:44,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 842 transitions. [2025-03-03 14:15:44,985 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 842 transitions. Word has length 84 [2025-03-03 14:15:44,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:44,985 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 842 transitions. [2025-03-03 14:15:44,985 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-03 14:15:44,985 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 842 transitions. [2025-03-03 14:15:44,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-03 14:15:44,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:44,987 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-03 14:15:44,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:15:44,988 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:44,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:44,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1066279304, now seen corresponding path program 1 times [2025-03-03 14:15:44,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:44,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832574648] [2025-03-03 14:15:44,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:44,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:45,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-03 14:15:45,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-03 14:15:45,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:45,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:45,092 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-03 14:15:45,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:45,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832574648] [2025-03-03 14:15:45,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832574648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:45,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:45,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:15:45,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552593026] [2025-03-03 14:15:45,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:45,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:15:45,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:45,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:15:45,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:15:45,094 INFO L87 Difference]: Start difference. First operand 511 states and 842 transitions. Second operand has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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-03 14:15:45,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:45,147 INFO L93 Difference]: Finished difference Result 970 states and 1616 transitions. [2025-03-03 14:15:45,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:15:45,147 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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 84 [2025-03-03 14:15:45,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:45,150 INFO L225 Difference]: With dead ends: 970 [2025-03-03 14:15:45,150 INFO L226 Difference]: Without dead ends: 490 [2025-03-03 14:15:45,152 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-03 14:15:45,152 INFO L435 NwaCegarLoop]: 831 mSDtfsCounter, 84 mSDsluCounter, 4082 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 4913 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-03 14:15:45,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 4913 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:15:45,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2025-03-03 14:15:45,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 490. [2025-03-03 14:15:45,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 384 states have (on average 1.6692708333333333) internal successors, (641), 403 states have internal predecessors, (641), 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-03 14:15:45,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 808 transitions. [2025-03-03 14:15:45,164 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 808 transitions. Word has length 84 [2025-03-03 14:15:45,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:45,165 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 808 transitions. [2025-03-03 14:15:45,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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-03 14:15:45,165 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 808 transitions. [2025-03-03 14:15:45,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-03 14:15:45,167 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:45,167 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-03 14:15:45,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 14:15:45,167 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:45,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:45,168 INFO L85 PathProgramCache]: Analyzing trace with hash -2066319861, now seen corresponding path program 1 times [2025-03-03 14:15:45,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:45,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481885456] [2025-03-03 14:15:45,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:45,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:45,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-03 14:15:45,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-03 14:15:45,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:45,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:45,266 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-03 14:15:45,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:45,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481885456] [2025-03-03 14:15:45,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481885456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:45,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:45,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:15:45,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890610619] [2025-03-03 14:15:45,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:45,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:15:45,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:45,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:15:45,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:15:45,267 INFO L87 Difference]: Start difference. First operand 490 states and 808 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-03 14:15:45,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:45,326 INFO L93 Difference]: Finished difference Result 949 states and 1582 transitions. [2025-03-03 14:15:45,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:15:45,326 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-03 14:15:45,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:45,329 INFO L225 Difference]: With dead ends: 949 [2025-03-03 14:15:45,329 INFO L226 Difference]: Without dead ends: 490 [2025-03-03 14:15:45,331 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-03 14:15:45,332 INFO L435 NwaCegarLoop]: 791 mSDtfsCounter, 17 mSDsluCounter, 3155 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 3946 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-03 14:15:45,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 3946 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:15:45,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2025-03-03 14:15:45,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 490. [2025-03-03 14:15:45,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 384 states have (on average 1.6666666666666667) internal successors, (640), 403 states have internal predecessors, (640), 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-03 14:15:45,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 807 transitions. [2025-03-03 14:15:45,345 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 807 transitions. Word has length 85 [2025-03-03 14:15:45,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:45,345 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 807 transitions. [2025-03-03 14:15:45,345 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-03 14:15:45,345 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 807 transitions. [2025-03-03 14:15:45,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-03 14:15:45,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:45,347 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-03 14:15:45,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:15:45,347 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:45,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:45,347 INFO L85 PathProgramCache]: Analyzing trace with hash 940348508, now seen corresponding path program 1 times [2025-03-03 14:15:45,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:45,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127760680] [2025-03-03 14:15:45,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:45,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:45,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-03 14:15:45,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 14:15:45,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:45,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:45,434 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-03 14:15:45,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:45,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127760680] [2025-03-03 14:15:45,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127760680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:45,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:45,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:15:45,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550513805] [2025-03-03 14:15:45,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:45,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:15:45,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:45,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:15:45,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:15:45,436 INFO L87 Difference]: Start difference. First operand 490 states and 807 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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-03 14:15:45,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:45,490 INFO L93 Difference]: Finished difference Result 949 states and 1581 transitions. [2025-03-03 14:15:45,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:15:45,491 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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 86 [2025-03-03 14:15:45,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:45,494 INFO L225 Difference]: With dead ends: 949 [2025-03-03 14:15:45,494 INFO L226 Difference]: Without dead ends: 490 [2025-03-03 14:15:45,495 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-03 14:15:45,496 INFO L435 NwaCegarLoop]: 791 mSDtfsCounter, 16 mSDsluCounter, 3155 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 3946 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-03 14:15:45,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 3946 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:15:45,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2025-03-03 14:15:45,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 490. [2025-03-03 14:15:45,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 384 states have (on average 1.6640625) internal successors, (639), 403 states have internal predecessors, (639), 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-03 14:15:45,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 806 transitions. [2025-03-03 14:15:45,515 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 806 transitions. Word has length 86 [2025-03-03 14:15:45,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:45,515 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 806 transitions. [2025-03-03 14:15:45,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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-03 14:15:45,516 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 806 transitions. [2025-03-03 14:15:45,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 14:15:45,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:45,518 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-03 14:15:45,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:15:45,518 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:45,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:45,518 INFO L85 PathProgramCache]: Analyzing trace with hash 484975599, now seen corresponding path program 1 times [2025-03-03 14:15:45,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:45,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346479995] [2025-03-03 14:15:45,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:45,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:45,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 14:15:45,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 14:15:45,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:45,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:45,583 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-03 14:15:45,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:45,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346479995] [2025-03-03 14:15:45,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346479995] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:45,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:45,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:15:45,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422679651] [2025-03-03 14:15:45,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:45,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:15:45,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:45,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:15:45,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:15:45,584 INFO L87 Difference]: Start difference. First operand 490 states and 806 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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-03 14:15:45,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:45,612 INFO L93 Difference]: Finished difference Result 949 states and 1580 transitions. [2025-03-03 14:15:45,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:15:45,612 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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 87 [2025-03-03 14:15:45,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:45,615 INFO L225 Difference]: With dead ends: 949 [2025-03-03 14:15:45,615 INFO L226 Difference]: Without dead ends: 490 [2025-03-03 14:15:45,617 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-03 14:15:45,617 INFO L435 NwaCegarLoop]: 799 mSDtfsCounter, 9 mSDsluCounter, 1592 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2391 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-03 14:15:45,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2391 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:15:45,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2025-03-03 14:15:45,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 490. [2025-03-03 14:15:45,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 384 states have (on average 1.6614583333333333) internal successors, (638), 403 states have internal predecessors, (638), 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-03 14:15:45,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 805 transitions. [2025-03-03 14:15:45,630 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 805 transitions. Word has length 87 [2025-03-03 14:15:45,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:45,631 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 805 transitions. [2025-03-03 14:15:45,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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-03 14:15:45,631 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 805 transitions. [2025-03-03 14:15:45,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 14:15:45,632 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:45,632 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-03 14:15:45,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:15:45,633 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:45,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:45,633 INFO L85 PathProgramCache]: Analyzing trace with hash -145483026, now seen corresponding path program 1 times [2025-03-03 14:15:45,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:45,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660098505] [2025-03-03 14:15:45,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:45,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:45,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 14:15:45,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 14:15:45,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:45,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:45,705 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-03 14:15:45,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:45,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660098505] [2025-03-03 14:15:45,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660098505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:45,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:45,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:15:45,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383830950] [2025-03-03 14:15:45,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:45,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:15:45,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:45,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:15:45,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:15:45,707 INFO L87 Difference]: Start difference. First operand 490 states and 805 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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-03 14:15:45,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:45,737 INFO L93 Difference]: Finished difference Result 943 states and 1568 transitions. [2025-03-03 14:15:45,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:15:45,738 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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 87 [2025-03-03 14:15:45,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:45,742 INFO L225 Difference]: With dead ends: 943 [2025-03-03 14:15:45,742 INFO L226 Difference]: Without dead ends: 490 [2025-03-03 14:15:45,743 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-03 14:15:45,745 INFO L435 NwaCegarLoop]: 793 mSDtfsCounter, 4 mSDsluCounter, 1577 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2370 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-03 14:15:45,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2370 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:15:45,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2025-03-03 14:15:45,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 490. [2025-03-03 14:15:45,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 384 states have (on average 1.6588541666666667) internal successors, (637), 403 states have internal predecessors, (637), 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-03 14:15:45,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 804 transitions. [2025-03-03 14:15:45,757 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 804 transitions. Word has length 87 [2025-03-03 14:15:45,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:45,757 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 804 transitions. [2025-03-03 14:15:45,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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-03 14:15:45,757 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 804 transitions. [2025-03-03 14:15:45,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-03 14:15:45,760 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:45,760 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-03 14:15:45,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:15:45,760 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:45,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:45,761 INFO L85 PathProgramCache]: Analyzing trace with hash -34897521, now seen corresponding path program 1 times [2025-03-03 14:15:45,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:45,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23965860] [2025-03-03 14:15:45,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:45,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:45,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-03 14:15:45,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 14:15:45,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:45,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:45,938 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-03 14:15:45,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:45,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23965860] [2025-03-03 14:15:45,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23965860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:45,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:45,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:15:45,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678101296] [2025-03-03 14:15:45,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:45,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:15:45,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:45,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:15:45,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:15:45,940 INFO L87 Difference]: Start difference. First operand 490 states and 804 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 7 states have internal predecessors, (71), 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-03 14:15:47,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:47,235 INFO L93 Difference]: Finished difference Result 939 states and 1580 transitions. [2025-03-03 14:15:47,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:15:47,235 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 7 states have internal predecessors, (71), 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 88 [2025-03-03 14:15:47,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:47,239 INFO L225 Difference]: With dead ends: 939 [2025-03-03 14:15:47,239 INFO L226 Difference]: Without dead ends: 494 [2025-03-03 14:15:47,241 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-03 14:15:47,242 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 1240 mSDsluCounter, 1210 mSDsCounter, 0 mSdLazyCounter, 2454 mSolverCounterSat, 354 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1240 SdHoareTripleChecker+Valid, 1584 SdHoareTripleChecker+Invalid, 2808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 354 IncrementalHoareTripleChecker+Valid, 2454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:15:47,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1240 Valid, 1584 Invalid, 2808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [354 Valid, 2454 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 14:15:47,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2025-03-03 14:15:47,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 494. [2025-03-03 14:15:47,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 387 states have (on average 1.6537467700258397) internal successors, (640), 406 states have internal predecessors, (640), 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-03 14:15:47,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 823 transitions. [2025-03-03 14:15:47,262 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 823 transitions. Word has length 88 [2025-03-03 14:15:47,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:47,262 INFO L471 AbstractCegarLoop]: Abstraction has 494 states and 823 transitions. [2025-03-03 14:15:47,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 7 states have internal predecessors, (71), 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-03 14:15:47,262 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 823 transitions. [2025-03-03 14:15:47,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 14:15:47,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:47,264 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:15:47,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:15:47,264 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:47,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:47,265 INFO L85 PathProgramCache]: Analyzing trace with hash -622846660, now seen corresponding path program 1 times [2025-03-03 14:15:47,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:47,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349059085] [2025-03-03 14:15:47,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:47,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:47,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 14:15:47,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 14:15:47,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:47,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:47,375 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-03 14:15:47,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:47,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349059085] [2025-03-03 14:15:47,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349059085] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:47,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:47,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:15:47,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995178130] [2025-03-03 14:15:47,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:47,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:15:47,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:47,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:15:47,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:15:47,377 INFO L87 Difference]: Start difference. First operand 494 states and 823 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 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-03 14:15:49,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:49,926 INFO L93 Difference]: Finished difference Result 1763 states and 3037 transitions. [2025-03-03 14:15:49,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 14:15:49,927 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 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 89 [2025-03-03 14:15:49,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:49,935 INFO L225 Difference]: With dead ends: 1763 [2025-03-03 14:15:49,935 INFO L226 Difference]: Without dead ends: 1314 [2025-03-03 14:15:49,938 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-03 14:15:49,938 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 2233 mSDsluCounter, 1977 mSDsCounter, 0 mSdLazyCounter, 4459 mSolverCounterSat, 564 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2300 SdHoareTripleChecker+Valid, 2580 SdHoareTripleChecker+Invalid, 5023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 564 IncrementalHoareTripleChecker+Valid, 4459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:15:49,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2300 Valid, 2580 Invalid, 5023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [564 Valid, 4459 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 14:15:49,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2025-03-03 14:15:49,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1257. [2025-03-03 14:15:49,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1257 states, 982 states have (on average 1.670061099796334) internal successors, (1640), 1030 states have internal predecessors, (1640), 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-03 14:15:50,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 2101 transitions. [2025-03-03 14:15:50,009 INFO L78 Accepts]: Start accepts. Automaton has 1257 states and 2101 transitions. Word has length 89 [2025-03-03 14:15:50,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:50,010 INFO L471 AbstractCegarLoop]: Abstraction has 1257 states and 2101 transitions. [2025-03-03 14:15:50,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 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-03 14:15:50,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 2101 transitions. [2025-03-03 14:15:50,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 14:15:50,011 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:50,011 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] [2025-03-03 14:15:50,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:15:50,011 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:50,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:50,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1785943072, now seen corresponding path program 1 times [2025-03-03 14:15:50,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:50,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592528233] [2025-03-03 14:15:50,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:50,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:50,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 14:15:50,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 14:15:50,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:50,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:50,127 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-03 14:15:50,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:50,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592528233] [2025-03-03 14:15:50,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592528233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:50,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:50,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:15:50,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968436009] [2025-03-03 14:15:50,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:50,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:15:50,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:50,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:15:50,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:15:50,129 INFO L87 Difference]: Start difference. First operand 1257 states and 2101 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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-03 14:15:52,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:52,777 INFO L93 Difference]: Finished difference Result 5960 states and 10291 transitions. [2025-03-03 14:15:52,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 14:15:52,777 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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 91 [2025-03-03 14:15:52,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:52,806 INFO L225 Difference]: With dead ends: 5960 [2025-03-03 14:15:52,806 INFO L226 Difference]: Without dead ends: 4748 [2025-03-03 14:15:52,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-03-03 14:15:52,816 INFO L435 NwaCegarLoop]: 800 mSDtfsCounter, 2998 mSDsluCounter, 2032 mSDsCounter, 0 mSdLazyCounter, 5065 mSolverCounterSat, 792 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3127 SdHoareTripleChecker+Valid, 2832 SdHoareTripleChecker+Invalid, 5857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 792 IncrementalHoareTripleChecker+Valid, 5065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:15:52,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3127 Valid, 2832 Invalid, 5857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [792 Valid, 5065 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 14:15:52,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4748 states. [2025-03-03 14:15:52,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4748 to 4221. [2025-03-03 14:15:53,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4221 states, 3127 states have (on average 1.667732651103294) internal successors, (5215), 3339 states have internal predecessors, (5215), 940 states have call successors, (940), 137 states have call predecessors, (940), 153 states have return successors, (1134), 918 states have call predecessors, (1134), 935 states have call successors, (1134) [2025-03-03 14:15:53,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4221 states to 4221 states and 7289 transitions. [2025-03-03 14:15:53,025 INFO L78 Accepts]: Start accepts. Automaton has 4221 states and 7289 transitions. Word has length 91 [2025-03-03 14:15:53,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:53,025 INFO L471 AbstractCegarLoop]: Abstraction has 4221 states and 7289 transitions. [2025-03-03 14:15:53,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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-03 14:15:53,026 INFO L276 IsEmpty]: Start isEmpty. Operand 4221 states and 7289 transitions. [2025-03-03 14:15:53,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 14:15:53,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:53,027 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] [2025-03-03 14:15:53,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:15:53,027 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:53,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:53,029 INFO L85 PathProgramCache]: Analyzing trace with hash 663657058, now seen corresponding path program 1 times [2025-03-03 14:15:53,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:53,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151521193] [2025-03-03 14:15:53,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:53,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:53,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 14:15:53,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 14:15:53,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:53,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:53,136 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-03 14:15:53,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:53,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151521193] [2025-03-03 14:15:53,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151521193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:53,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:53,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:15:53,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402194462] [2025-03-03 14:15:53,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:53,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:15:53,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:53,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:15:53,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:15:53,138 INFO L87 Difference]: Start difference. First operand 4221 states and 7289 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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-03 14:15:54,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:54,955 INFO L93 Difference]: Finished difference Result 11460 states and 19921 transitions. [2025-03-03 14:15:54,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 14:15:54,956 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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 91 [2025-03-03 14:15:54,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:55,008 INFO L225 Difference]: With dead ends: 11460 [2025-03-03 14:15:55,009 INFO L226 Difference]: Without dead ends: 8390 [2025-03-03 14:15:55,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-03-03 14:15:55,027 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 2285 mSDsluCounter, 1353 mSDsCounter, 0 mSdLazyCounter, 3429 mSolverCounterSat, 475 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2362 SdHoareTripleChecker+Valid, 1700 SdHoareTripleChecker+Invalid, 3904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 475 IncrementalHoareTripleChecker+Valid, 3429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 14:15:55,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2362 Valid, 1700 Invalid, 3904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [475 Valid, 3429 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 14:15:55,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8390 states. [2025-03-03 14:15:55,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8390 to 7881. [2025-03-03 14:15:55,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7881 states, 5878 states have (on average 1.6658727458319156) internal successors, (9792), 6268 states have internal predecessors, (9792), 1690 states have call successors, (1690), 254 states have call predecessors, (1690), 312 states have return successors, (2163), 1649 states have call predecessors, (2163), 1685 states have call successors, (2163) [2025-03-03 14:15:55,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7881 states to 7881 states and 13645 transitions. [2025-03-03 14:15:55,405 INFO L78 Accepts]: Start accepts. Automaton has 7881 states and 13645 transitions. Word has length 91 [2025-03-03 14:15:55,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:55,407 INFO L471 AbstractCegarLoop]: Abstraction has 7881 states and 13645 transitions. [2025-03-03 14:15:55,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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-03 14:15:55,408 INFO L276 IsEmpty]: Start isEmpty. Operand 7881 states and 13645 transitions. [2025-03-03 14:15:55,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 14:15:55,409 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:55,410 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] [2025-03-03 14:15:55,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:15:55,410 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:55,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:55,411 INFO L85 PathProgramCache]: Analyzing trace with hash 183067478, now seen corresponding path program 1 times [2025-03-03 14:15:55,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:55,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286621150] [2025-03-03 14:15:55,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:55,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:55,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 14:15:55,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 14:15:55,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:55,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:55,538 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-03 14:15:55,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:55,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286621150] [2025-03-03 14:15:55,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286621150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:55,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:55,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:15:55,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062457357] [2025-03-03 14:15:55,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:55,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:15:55,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:55,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:15:55,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:15:55,539 INFO L87 Difference]: Start difference. First operand 7881 states and 13645 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 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-03 14:15:55,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:55,853 INFO L93 Difference]: Finished difference Result 14533 states and 25229 transitions. [2025-03-03 14:15:55,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:15:55,853 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 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 96 [2025-03-03 14:15:55,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:55,891 INFO L225 Difference]: With dead ends: 14533 [2025-03-03 14:15:55,891 INFO L226 Difference]: Without dead ends: 7968 [2025-03-03 14:15:55,912 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-03 14:15:55,913 INFO L435 NwaCegarLoop]: 802 mSDtfsCounter, 0 mSDsluCounter, 2376 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3178 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-03 14:15:55,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3178 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:15:55,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7968 states. [2025-03-03 14:15:56,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7968 to 7954. [2025-03-03 14:15:56,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7954 states, 5934 states have (on average 1.6590832490731378) internal successors, (9845), 6323 states have internal predecessors, (9845), 1687 states have call successors, (1687), 254 states have call predecessors, (1687), 332 states have return successors, (2226), 1667 states have call predecessors, (2226), 1682 states have call successors, (2226) [2025-03-03 14:15:56,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7954 states to 7954 states and 13758 transitions. [2025-03-03 14:15:56,241 INFO L78 Accepts]: Start accepts. Automaton has 7954 states and 13758 transitions. Word has length 96 [2025-03-03 14:15:56,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:56,241 INFO L471 AbstractCegarLoop]: Abstraction has 7954 states and 13758 transitions. [2025-03-03 14:15:56,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 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-03 14:15:56,242 INFO L276 IsEmpty]: Start isEmpty. Operand 7954 states and 13758 transitions. [2025-03-03 14:15:56,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 14:15:56,244 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:56,244 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:15:56,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 14:15:56,244 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:56,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:56,245 INFO L85 PathProgramCache]: Analyzing trace with hash -39571447, now seen corresponding path program 1 times [2025-03-03 14:15:56,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:56,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691081552] [2025-03-03 14:15:56,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:56,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:56,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 14:15:56,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 14:15:56,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:56,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:56,364 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-03 14:15:56,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:56,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691081552] [2025-03-03 14:15:56,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691081552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:56,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:56,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 14:15:56,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830253922] [2025-03-03 14:15:56,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:56,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 14:15:56,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:56,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 14:15:56,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:15:56,365 INFO L87 Difference]: Start difference. First operand 7954 states and 13758 transitions. Second operand has 9 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 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-03 14:15:56,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:56,753 INFO L93 Difference]: Finished difference Result 15759 states and 27702 transitions. [2025-03-03 14:15:56,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:15:56,753 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 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 103 [2025-03-03 14:15:56,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:56,795 INFO L225 Difference]: With dead ends: 15759 [2025-03-03 14:15:56,795 INFO L226 Difference]: Without dead ends: 8102 [2025-03-03 14:15:56,820 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-03 14:15:56,821 INFO L435 NwaCegarLoop]: 840 mSDtfsCounter, 242 mSDsluCounter, 5599 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 6439 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-03 14:15:56,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 6439 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:15:56,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8102 states. [2025-03-03 14:15:57,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8102 to 7978. [2025-03-03 14:15:57,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7978 states, 5955 states have (on average 1.636607892527288) internal successors, (9746), 6347 states have internal predecessors, (9746), 1687 states have call successors, (1687), 254 states have call predecessors, (1687), 335 states have return successors, (2238), 1667 states have call predecessors, (2238), 1682 states have call successors, (2238) [2025-03-03 14:15:57,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7978 states to 7978 states and 13671 transitions. [2025-03-03 14:15:57,285 INFO L78 Accepts]: Start accepts. Automaton has 7978 states and 13671 transitions. Word has length 103 [2025-03-03 14:15:57,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:57,285 INFO L471 AbstractCegarLoop]: Abstraction has 7978 states and 13671 transitions. [2025-03-03 14:15:57,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 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-03 14:15:57,286 INFO L276 IsEmpty]: Start isEmpty. Operand 7978 states and 13671 transitions. [2025-03-03 14:15:57,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 14:15:57,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:57,288 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:15:57,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 14:15:57,289 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:57,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:57,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1023753664, now seen corresponding path program 1 times [2025-03-03 14:15:57,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:57,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385931671] [2025-03-03 14:15:57,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:57,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:57,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 14:15:57,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 14:15:57,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:57,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:57,442 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-03 14:15:57,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:57,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385931671] [2025-03-03 14:15:57,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385931671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:57,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:57,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:15:57,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884510364] [2025-03-03 14:15:57,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:57,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:15:57,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:57,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:15:57,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:15:57,444 INFO L87 Difference]: Start difference. First operand 7978 states and 13671 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 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-03 14:15:59,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:59,298 INFO L93 Difference]: Finished difference Result 15364 states and 26369 transitions. [2025-03-03 14:15:59,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 14:15:59,301 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 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 108 [2025-03-03 14:15:59,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:59,342 INFO L225 Difference]: With dead ends: 15364 [2025-03-03 14:15:59,342 INFO L226 Difference]: Without dead ends: 8718 [2025-03-03 14:15:59,363 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-03 14:15:59,365 INFO L435 NwaCegarLoop]: 369 mSDtfsCounter, 2007 mSDsluCounter, 1269 mSDsCounter, 0 mSdLazyCounter, 2932 mSolverCounterSat, 448 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2081 SdHoareTripleChecker+Valid, 1638 SdHoareTripleChecker+Invalid, 3380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 448 IncrementalHoareTripleChecker+Valid, 2932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 14:15:59,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2081 Valid, 1638 Invalid, 3380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [448 Valid, 2932 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 14:15:59,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8718 states. [2025-03-03 14:15:59,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8718 to 8213. [2025-03-03 14:15:59,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8213 states, 6130 states have (on average 1.6256117455138663) internal successors, (9965), 6540 states have internal predecessors, (9965), 1707 states have call successors, (1707), 279 states have call predecessors, (1707), 375 states have return successors, (2330), 1685 states have call predecessors, (2330), 1702 states have call successors, (2330) [2025-03-03 14:15:59,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8213 states to 8213 states and 14002 transitions. [2025-03-03 14:15:59,653 INFO L78 Accepts]: Start accepts. Automaton has 8213 states and 14002 transitions. Word has length 108 [2025-03-03 14:15:59,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:59,653 INFO L471 AbstractCegarLoop]: Abstraction has 8213 states and 14002 transitions. [2025-03-03 14:15:59,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 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-03 14:15:59,654 INFO L276 IsEmpty]: Start isEmpty. Operand 8213 states and 14002 transitions. [2025-03-03 14:15:59,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 14:15:59,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:59,656 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] [2025-03-03 14:15:59,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 14:15:59,656 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:59,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:59,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1809016143, now seen corresponding path program 1 times [2025-03-03 14:15:59,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:59,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873602181] [2025-03-03 14:15:59,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:59,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:59,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 14:15:59,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 14:15:59,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:59,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:59,763 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-03 14:15:59,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:59,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873602181] [2025-03-03 14:15:59,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873602181] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:59,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:59,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:15:59,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866049959] [2025-03-03 14:15:59,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:59,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:15:59,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:59,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:15:59,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:15:59,765 INFO L87 Difference]: Start difference. First operand 8213 states and 14002 transitions. Second operand has 8 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 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-03 14:16:00,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:00,252 INFO L93 Difference]: Finished difference Result 18553 states and 31784 transitions. [2025-03-03 14:16:00,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:16:00,253 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 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 113 [2025-03-03 14:16:00,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:00,317 INFO L225 Difference]: With dead ends: 18553 [2025-03-03 14:16:00,317 INFO L226 Difference]: Without dead ends: 11672 [2025-03-03 14:16:00,346 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-03 14:16:00,347 INFO L435 NwaCegarLoop]: 1287 mSDtfsCounter, 753 mSDsluCounter, 7157 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 8444 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-03 14:16:00,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [754 Valid, 8444 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:16:00,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11672 states. [2025-03-03 14:16:00,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11672 to 10998. [2025-03-03 14:16:00,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10998 states, 8212 states have (on average 1.6356551388212373) internal successors, (13432), 8749 states have internal predecessors, (13432), 2310 states have call successors, (2310), 360 states have call predecessors, (2310), 475 states have return successors, (3089), 2297 states have call predecessors, (3089), 2305 states have call successors, (3089) [2025-03-03 14:16:00,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10998 states to 10998 states and 18831 transitions. [2025-03-03 14:16:00,797 INFO L78 Accepts]: Start accepts. Automaton has 10998 states and 18831 transitions. Word has length 113 [2025-03-03 14:16:00,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:00,797 INFO L471 AbstractCegarLoop]: Abstraction has 10998 states and 18831 transitions. [2025-03-03 14:16:00,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 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-03 14:16:00,798 INFO L276 IsEmpty]: Start isEmpty. Operand 10998 states and 18831 transitions. [2025-03-03 14:16:00,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-03 14:16:00,799 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:00,799 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] [2025-03-03 14:16:00,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 14:16:00,800 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:00,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:00,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1668000288, now seen corresponding path program 1 times [2025-03-03 14:16:00,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:00,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303340154] [2025-03-03 14:16:00,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:00,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:00,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-03 14:16:00,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-03 14:16:00,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:00,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:01,003 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-03 14:16:01,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:01,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303340154] [2025-03-03 14:16:01,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303340154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:01,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:01,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 14:16:01,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082113802] [2025-03-03 14:16:01,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:01,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 14:16:01,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:01,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 14:16:01,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:16:01,004 INFO L87 Difference]: Start difference. First operand 10998 states and 18831 transitions. Second operand has 13 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 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-03 14:16:04,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:04,428 INFO L93 Difference]: Finished difference Result 23772 states and 40381 transitions. [2025-03-03 14:16:04,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 14:16:04,428 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 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 115 [2025-03-03 14:16:04,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:04,511 INFO L225 Difference]: With dead ends: 23772 [2025-03-03 14:16:04,511 INFO L226 Difference]: Without dead ends: 13925 [2025-03-03 14:16:04,560 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-03 14:16:04,561 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 2715 mSDsluCounter, 4287 mSDsCounter, 0 mSdLazyCounter, 8175 mSolverCounterSat, 615 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2798 SdHoareTripleChecker+Valid, 4798 SdHoareTripleChecker+Invalid, 8790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 615 IncrementalHoareTripleChecker+Valid, 8175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:04,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2798 Valid, 4798 Invalid, 8790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [615 Valid, 8175 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-03 14:16:04,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13925 states. [2025-03-03 14:16:05,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13925 to 12735. [2025-03-03 14:16:05,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12735 states, 9584 states have (on average 1.6159223706176962) internal successors, (15487), 10186 states have internal predecessors, (15487), 2538 states have call successors, (2538), 449 states have call predecessors, (2538), 612 states have return successors, (3425), 2501 states have call predecessors, (3425), 2533 states have call successors, (3425) [2025-03-03 14:16:05,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12735 states to 12735 states and 21450 transitions. [2025-03-03 14:16:05,287 INFO L78 Accepts]: Start accepts. Automaton has 12735 states and 21450 transitions. Word has length 115 [2025-03-03 14:16:05,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:05,288 INFO L471 AbstractCegarLoop]: Abstraction has 12735 states and 21450 transitions. [2025-03-03 14:16:05,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 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-03 14:16:05,288 INFO L276 IsEmpty]: Start isEmpty. Operand 12735 states and 21450 transitions. [2025-03-03 14:16:05,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 14:16:05,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:05,290 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] [2025-03-03 14:16:05,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 14:16:05,290 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:05,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:05,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1241186672, now seen corresponding path program 1 times [2025-03-03 14:16:05,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:05,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937149500] [2025-03-03 14:16:05,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:05,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:05,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 14:16:05,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 14:16:05,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:05,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:05,394 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-03 14:16:05,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:05,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937149500] [2025-03-03 14:16:05,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937149500] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:05,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:05,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:16:05,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197840110] [2025-03-03 14:16:05,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:05,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:16:05,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:05,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:16:05,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:16:05,396 INFO L87 Difference]: Start difference. First operand 12735 states and 21450 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:16:06,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:06,078 INFO L93 Difference]: Finished difference Result 12863 states and 21676 transitions. [2025-03-03 14:16:06,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:16:06,079 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 113 [2025-03-03 14:16:06,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:06,147 INFO L225 Difference]: With dead ends: 12863 [2025-03-03 14:16:06,147 INFO L226 Difference]: Without dead ends: 12848 [2025-03-03 14:16:06,159 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-03 14:16:06,160 INFO L435 NwaCegarLoop]: 784 mSDtfsCounter, 864 mSDsluCounter, 2031 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 2815 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-03 14:16:06,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [865 Valid, 2815 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:16:06,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12848 states. [2025-03-03 14:16:06,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12848 to 12747. [2025-03-03 14:16:06,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12747 states, 9596 states have (on average 1.6151521467278032) internal successors, (15499), 10198 states have internal predecessors, (15499), 2538 states have call successors, (2538), 449 states have call predecessors, (2538), 612 states have return successors, (3425), 2501 states have call predecessors, (3425), 2533 states have call successors, (3425) [2025-03-03 14:16:06,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12747 states to 12747 states and 21462 transitions. [2025-03-03 14:16:06,640 INFO L78 Accepts]: Start accepts. Automaton has 12747 states and 21462 transitions. Word has length 113 [2025-03-03 14:16:06,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:06,640 INFO L471 AbstractCegarLoop]: Abstraction has 12747 states and 21462 transitions. [2025-03-03 14:16:06,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:16:06,640 INFO L276 IsEmpty]: Start isEmpty. Operand 12747 states and 21462 transitions. [2025-03-03 14:16:06,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-03 14:16:06,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:06,642 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, 1] [2025-03-03 14:16:06,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 14:16:06,642 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:06,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:06,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1034453390, now seen corresponding path program 1 times [2025-03-03 14:16:06,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:06,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754879159] [2025-03-03 14:16:06,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:06,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:06,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 14:16:06,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 14:16:06,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:06,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:06,807 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-03 14:16:06,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:06,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754879159] [2025-03-03 14:16:06,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754879159] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:06,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:06,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 14:16:06,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798867259] [2025-03-03 14:16:06,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:06,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 14:16:06,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:06,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 14:16:06,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:16:06,808 INFO L87 Difference]: Start difference. First operand 12747 states and 21462 transitions. Second operand has 10 states, 9 states have (on average 10.0) internal successors, (90), 8 states have internal predecessors, (90), 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-03 14:16:07,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:07,207 INFO L93 Difference]: Finished difference Result 12762 states and 21480 transitions. [2025-03-03 14:16:07,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:16:07,208 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 10.0) internal successors, (90), 8 states have internal predecessors, (90), 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 119 [2025-03-03 14:16:07,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:07,262 INFO L225 Difference]: With dead ends: 12762 [2025-03-03 14:16:07,262 INFO L226 Difference]: Without dead ends: 12747 [2025-03-03 14:16:07,274 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-03 14:16:07,274 INFO L435 NwaCegarLoop]: 785 mSDtfsCounter, 17 mSDsluCounter, 6246 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 7031 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-03 14:16:07,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 7031 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:16:07,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12747 states. [2025-03-03 14:16:07,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12747 to 12747. [2025-03-03 14:16:07,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12747 states, 9596 states have (on average 1.6143184660275114) internal successors, (15491), 10198 states have internal predecessors, (15491), 2538 states have call successors, (2538), 449 states have call predecessors, (2538), 612 states have return successors, (3425), 2501 states have call predecessors, (3425), 2533 states have call successors, (3425) [2025-03-03 14:16:07,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12747 states to 12747 states and 21454 transitions. [2025-03-03 14:16:07,728 INFO L78 Accepts]: Start accepts. Automaton has 12747 states and 21454 transitions. Word has length 119 [2025-03-03 14:16:07,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:07,728 INFO L471 AbstractCegarLoop]: Abstraction has 12747 states and 21454 transitions. [2025-03-03 14:16:07,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 10.0) internal successors, (90), 8 states have internal predecessors, (90), 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-03 14:16:07,728 INFO L276 IsEmpty]: Start isEmpty. Operand 12747 states and 21454 transitions. [2025-03-03 14:16:07,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-03 14:16:07,730 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:07,730 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, 1] [2025-03-03 14:16:07,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 14:16:07,730 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:07,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:07,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1122644671, now seen corresponding path program 1 times [2025-03-03 14:16:07,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:07,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484832652] [2025-03-03 14:16:07,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:07,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:07,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 14:16:07,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 14:16:07,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:07,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:07,880 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-03 14:16:07,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:07,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484832652] [2025-03-03 14:16:07,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484832652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:07,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:07,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:16:07,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955791529] [2025-03-03 14:16:07,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:07,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:16:07,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:07,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:16:07,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:16:07,882 INFO L87 Difference]: Start difference. First operand 12747 states and 21454 transitions. Second operand has 8 states, 8 states have (on average 12.125) internal successors, (97), 7 states have internal predecessors, (97), 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-03 14:16:09,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:09,213 INFO L93 Difference]: Finished difference Result 25499 states and 43080 transitions. [2025-03-03 14:16:09,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:16:09,214 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 7 states have internal predecessors, (97), 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 129 [2025-03-03 14:16:09,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:09,269 INFO L225 Difference]: With dead ends: 25499 [2025-03-03 14:16:09,269 INFO L226 Difference]: Without dead ends: 12813 [2025-03-03 14:16:09,305 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-03 14:16:09,306 INFO L435 NwaCegarLoop]: 372 mSDtfsCounter, 1187 mSDsluCounter, 1203 mSDsCounter, 0 mSdLazyCounter, 2461 mSolverCounterSat, 318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1187 SdHoareTripleChecker+Valid, 1575 SdHoareTripleChecker+Invalid, 2779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 318 IncrementalHoareTripleChecker+Valid, 2461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:09,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1187 Valid, 1575 Invalid, 2779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 2461 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 14:16:09,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12813 states. [2025-03-03 14:16:09,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12813 to 12747. [2025-03-03 14:16:09,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12747 states, 9596 states have (on average 1.6134847853272196) internal successors, (15483), 10198 states have internal predecessors, (15483), 2538 states have call successors, (2538), 449 states have call predecessors, (2538), 612 states have return successors, (3425), 2501 states have call predecessors, (3425), 2533 states have call successors, (3425) [2025-03-03 14:16:09,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12747 states to 12747 states and 21446 transitions. [2025-03-03 14:16:09,738 INFO L78 Accepts]: Start accepts. Automaton has 12747 states and 21446 transitions. Word has length 129 [2025-03-03 14:16:09,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:09,738 INFO L471 AbstractCegarLoop]: Abstraction has 12747 states and 21446 transitions. [2025-03-03 14:16:09,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 7 states have internal predecessors, (97), 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-03 14:16:09,739 INFO L276 IsEmpty]: Start isEmpty. Operand 12747 states and 21446 transitions. [2025-03-03 14:16:09,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-03 14:16:09,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:09,741 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:09,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 14:16:09,741 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:09,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:09,741 INFO L85 PathProgramCache]: Analyzing trace with hash -2020082816, now seen corresponding path program 1 times [2025-03-03 14:16:09,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:09,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572766076] [2025-03-03 14:16:09,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:09,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:09,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 14:16:09,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 14:16:09,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:09,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:09,820 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-03 14:16:09,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:09,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572766076] [2025-03-03 14:16:09,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572766076] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:09,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:09,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:16:09,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891551526] [2025-03-03 14:16:09,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:09,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:16:09,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:09,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:16:09,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:16:09,821 INFO L87 Difference]: Start difference. First operand 12747 states and 21446 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 4 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-03 14:16:11,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:11,848 INFO L93 Difference]: Finished difference Result 42066 states and 72992 transitions. [2025-03-03 14:16:11,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:16:11,848 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 4 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 140 [2025-03-03 14:16:11,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:12,016 INFO L225 Difference]: With dead ends: 42066 [2025-03-03 14:16:12,016 INFO L226 Difference]: Without dead ends: 29364 [2025-03-03 14:16:12,063 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-03 14:16:12,064 INFO L435 NwaCegarLoop]: 394 mSDtfsCounter, 1773 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 359 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1841 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 1512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 359 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:12,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1841 Valid, 914 Invalid, 1512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [359 Valid, 1153 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 14:16:12,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29364 states. [2025-03-03 14:16:13,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29364 to 28466. [2025-03-03 14:16:13,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28466 states, 20864 states have (on average 1.6062595858895705) internal successors, (33513), 22317 states have internal predecessors, (33513), 6315 states have call successors, (6315), 893 states have call predecessors, (6315), 1286 states have return successors, (9856), 6269 states have call predecessors, (9856), 6310 states have call successors, (9856) [2025-03-03 14:16:13,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28466 states to 28466 states and 49684 transitions. [2025-03-03 14:16:13,607 INFO L78 Accepts]: Start accepts. Automaton has 28466 states and 49684 transitions. Word has length 140 [2025-03-03 14:16:13,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:13,607 INFO L471 AbstractCegarLoop]: Abstraction has 28466 states and 49684 transitions. [2025-03-03 14:16:13,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 4 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-03 14:16:13,607 INFO L276 IsEmpty]: Start isEmpty. Operand 28466 states and 49684 transitions. [2025-03-03 14:16:13,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-03 14:16:13,610 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:13,610 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:13,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-03 14:16:13,611 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:13,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:13,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1801779043, now seen corresponding path program 1 times [2025-03-03 14:16:13,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:13,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091804417] [2025-03-03 14:16:13,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:13,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:13,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-03 14:16:13,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-03 14:16:13,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:13,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:13,685 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-03 14:16:13,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:13,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091804417] [2025-03-03 14:16:13,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091804417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:13,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:13,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:16:13,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468610366] [2025-03-03 14:16:13,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:13,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:16:13,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:13,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:16:13,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:16:13,686 INFO L87 Difference]: Start difference. First operand 28466 states and 49684 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 4 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-03 14:16:17,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:17,757 INFO L93 Difference]: Finished difference Result 95774 states and 174533 transitions. [2025-03-03 14:16:17,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:16:17,758 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 4 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 141 [2025-03-03 14:16:17,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:18,186 INFO L225 Difference]: With dead ends: 95774 [2025-03-03 14:16:18,187 INFO L226 Difference]: Without dead ends: 67353 [2025-03-03 14:16:18,301 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-03 14:16:18,301 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 1775 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 1138 mSolverCounterSat, 363 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1842 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 1501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 363 IncrementalHoareTripleChecker+Valid, 1138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:18,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1842 Valid, 881 Invalid, 1501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [363 Valid, 1138 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 14:16:18,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67353 states. [2025-03-03 14:16:22,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67353 to 65373. [2025-03-03 14:16:22,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65373 states, 46510 states have (on average 1.597140399913997) internal successors, (74283), 50078 states have internal predecessors, (74283), 16147 states have call successors, (16147), 1781 states have call predecessors, (16147), 2715 states have return successors, (29602), 16129 states have call predecessors, (29602), 16142 states have call successors, (29602) [2025-03-03 14:16:22,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65373 states to 65373 states and 120032 transitions. [2025-03-03 14:16:22,899 INFO L78 Accepts]: Start accepts. Automaton has 65373 states and 120032 transitions. Word has length 141 [2025-03-03 14:16:22,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:22,900 INFO L471 AbstractCegarLoop]: Abstraction has 65373 states and 120032 transitions. [2025-03-03 14:16:22,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 4 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-03 14:16:22,900 INFO L276 IsEmpty]: Start isEmpty. Operand 65373 states and 120032 transitions. [2025-03-03 14:16:22,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-03 14:16:22,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:22,906 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, 1] [2025-03-03 14:16:22,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-03 14:16:22,906 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:22,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:22,906 INFO L85 PathProgramCache]: Analyzing trace with hash -441377943, now seen corresponding path program 1 times [2025-03-03 14:16:22,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:22,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915216222] [2025-03-03 14:16:22,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:22,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:22,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 14:16:22,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 14:16:22,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:22,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:23,001 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-03 14:16:23,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:23,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915216222] [2025-03-03 14:16:23,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915216222] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:23,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:23,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:16:23,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828252748] [2025-03-03 14:16:23,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:23,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:16:23,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:23,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:16:23,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:16:23,002 INFO L87 Difference]: Start difference. First operand 65373 states and 120032 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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-03 14:16:33,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:33,878 INFO L93 Difference]: Finished difference Result 223863 states and 435403 transitions. [2025-03-03 14:16:33,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:16:33,878 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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 140 [2025-03-03 14:16:33,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:35,337 INFO L225 Difference]: With dead ends: 223863 [2025-03-03 14:16:35,337 INFO L226 Difference]: Without dead ends: 158535 [2025-03-03 14:16:35,753 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-03 14:16:35,754 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 1769 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 1140 mSolverCounterSat, 367 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1837 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 1507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 367 IncrementalHoareTripleChecker+Valid, 1140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:35,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1837 Valid, 884 Invalid, 1507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [367 Valid, 1140 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 14:16:35,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158535 states.