./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec2_product18.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/elevator_spec2_product18.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4d9d31939acfea5ee9b43b1f06257671943c7251c27c351c5e445aa6495fd098 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:35:15,969 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:35:16,023 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 15:35:16,026 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:35:16,026 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:35:16,042 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:35:16,043 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:35:16,043 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:35:16,045 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:35:16,045 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:35:16,045 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:35:16,045 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:35:16,046 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:35:16,046 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:35:16,046 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:35:16,046 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:35:16,046 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:35:16,046 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:35:16,046 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:35:16,046 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:35:16,046 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:35:16,046 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:35:16,046 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:35:16,046 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:35:16,046 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:35:16,046 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:35:16,046 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:35:16,046 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:35:16,046 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:35:16,046 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:35:16,047 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:35:16,047 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:35:16,047 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:35:16,047 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:35:16,047 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:35:16,047 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:35:16,047 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:35:16,047 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:35:16,047 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:35:16,047 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:35:16,047 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:35:16,047 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:35:16,047 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:35:16,047 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4d9d31939acfea5ee9b43b1f06257671943c7251c27c351c5e445aa6495fd098 [2025-02-05 15:35:16,265 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:35:16,271 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:35:16,274 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:35:16,275 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:35:16,275 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:35:16,278 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec2_product18.cil.c [2025-02-05 15:35:17,410 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/30ff27ead/49fc12f199b04bee8843674f316d2ca7/FLAG9b7f88c87 [2025-02-05 15:35:17,691 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:35:17,692 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product18.cil.c [2025-02-05 15:35:17,719 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/30ff27ead/49fc12f199b04bee8843674f316d2ca7/FLAG9b7f88c87 [2025-02-05 15:35:17,735 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/30ff27ead/49fc12f199b04bee8843674f316d2ca7 [2025-02-05 15:35:17,737 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:35:17,738 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:35:17,740 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:35:17,740 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:35:17,743 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:35:17,744 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:35:17" (1/1) ... [2025-02-05 15:35:17,745 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e62939 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:35:17, skipping insertion in model container [2025-02-05 15:35:17,746 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:35:17" (1/1) ... [2025-02-05 15:35:17,790 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:35:18,058 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product18.cil.c[38051,38064] [2025-02-05 15:35:18,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:35:18,160 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:35:18,167 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [48] [2025-02-05 15:35:18,169 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [150] [2025-02-05 15:35:18,169 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [164] [2025-02-05 15:35:18,169 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [284] [2025-02-05 15:35:18,170 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [322] [2025-02-05 15:35:18,170 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1825] [2025-02-05 15:35:18,171 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1834] [2025-02-05 15:35:18,171 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2200] [2025-02-05 15:35:18,171 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [2552] [2025-02-05 15:35:18,171 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2733] [2025-02-05 15:35:18,237 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product18.cil.c[38051,38064] [2025-02-05 15:35:18,283 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:35:18,309 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:35:18,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:35:18 WrapperNode [2025-02-05 15:35:18,310 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:35:18,311 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:35:18,311 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:35:18,311 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:35:18,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:35:18" (1/1) ... [2025-02-05 15:35:18,339 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:35:18" (1/1) ... [2025-02-05 15:35:18,377 INFO L138 Inliner]: procedures = 92, calls = 338, calls flagged for inlining = 26, calls inlined = 22, statements flattened = 813 [2025-02-05 15:35:18,377 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:35:18,377 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:35:18,379 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:35:18,379 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:35:18,386 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:35:18" (1/1) ... [2025-02-05 15:35:18,386 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:35:18" (1/1) ... [2025-02-05 15:35:18,394 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:35:18" (1/1) ... [2025-02-05 15:35:18,430 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-02-05 15:35:18,430 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:35:18" (1/1) ... [2025-02-05 15:35:18,430 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:35:18" (1/1) ... [2025-02-05 15:35:18,447 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:35:18" (1/1) ... [2025-02-05 15:35:18,449 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:35:18" (1/1) ... [2025-02-05 15:35:18,453 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:35:18" (1/1) ... [2025-02-05 15:35:18,458 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:35:18" (1/1) ... [2025-02-05 15:35:18,472 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:35:18,472 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:35:18,472 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:35:18,472 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:35:18,473 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:35:18" (1/1) ... [2025-02-05 15:35:18,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:35:18,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:35:18,503 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 15:35:18,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 15:35:18,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:35:18,522 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-02-05 15:35:18,522 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-02-05 15:35:18,522 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-02-05 15:35:18,522 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-02-05 15:35:18,523 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-02-05 15:35:18,523 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-02-05 15:35:18,523 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-02-05 15:35:18,523 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-02-05 15:35:18,523 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-02-05 15:35:18,523 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-02-05 15:35:18,523 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-02-05 15:35:18,523 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-02-05 15:35:18,523 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-02-05 15:35:18,523 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-02-05 15:35:18,523 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2025-02-05 15:35:18,523 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2025-02-05 15:35:18,523 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-02-05 15:35:18,523 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-02-05 15:35:18,523 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-02-05 15:35:18,523 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-02-05 15:35:18,523 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-02-05 15:35:18,524 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-02-05 15:35:18,524 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-02-05 15:35:18,524 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-02-05 15:35:18,524 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-02-05 15:35:18,524 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-02-05 15:35:18,524 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-02-05 15:35:18,524 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-02-05 15:35:18,524 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-02-05 15:35:18,524 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-02-05 15:35:18,524 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-02-05 15:35:18,524 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-02-05 15:35:18,524 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-02-05 15:35:18,524 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-02-05 15:35:18,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:35:18,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 15:35:18,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 15:35:18,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 15:35:18,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-05 15:35:18,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-05 15:35:18,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-05 15:35:18,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-05 15:35:18,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-05 15:35:18,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-05 15:35:18,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-05 15:35:18,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-05 15:35:18,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-05 15:35:18,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-05 15:35:18,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-05 15:35:18,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-05 15:35:18,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-05 15:35:18,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-05 15:35:18,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-02-05 15:35:18,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-02-05 15:35:18,525 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__weight [2025-02-05 15:35:18,525 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__weight [2025-02-05 15:35:18,525 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-02-05 15:35:18,525 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-02-05 15:35:18,525 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-02-05 15:35:18,525 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-02-05 15:35:18,525 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-02-05 15:35:18,525 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-02-05 15:35:18,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:35:18,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:35:18,526 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-02-05 15:35:18,526 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-02-05 15:35:18,693 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:35:18,696 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:35:18,757 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L281: #res := ~retValue_acc~2; [2025-02-05 15:35:18,786 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L203: #res := ~retValue_acc~0; [2025-02-05 15:35:18,790 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L403: #res := ~retValue_acc~5; [2025-02-05 15:35:19,157 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1098: #res := ~retValue_acc~13; [2025-02-05 15:35:19,225 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1202: #res := ~retValue_acc~16; [2025-02-05 15:35:19,238 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L242: #res := ~retValue_acc~1; [2025-02-05 15:35:19,388 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1188-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~15#1; [2025-02-05 15:35:19,388 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L604-1: buttonForFloorIsPressed_#res#1 := buttonForFloorIsPressed_~retValue_acc~8#1; [2025-02-05 15:35:19,503 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L733-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~11#1; [2025-02-05 15:35:19,503 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-1: isIdle_#res#1 := isIdle_~retValue_acc~12#1; [2025-02-05 15:35:19,548 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-1: getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~6#1; [2025-02-05 15:35:19,596 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3080: #res := ~retValue_acc~24; [2025-02-05 15:35:19,668 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L319-1: valid_product_#res#1 := valid_product_~retValue_acc~4#1; [2025-02-05 15:35:19,669 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2549-1: main_#res#1 := main_~retValue_acc~22#1; [2025-02-05 15:35:19,678 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2844: #res := ~retValue_acc~23; [2025-02-05 15:35:19,680 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L570: #res := ~retValue_acc~7; [2025-02-05 15:35:19,683 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3391: #res := ~retValue_acc~25; [2025-02-05 15:35:19,787 INFO L? ?]: Removed 429 outVars from TransFormulas that were not future-live. [2025-02-05 15:35:19,787 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:35:19,811 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:35:19,815 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:35:19,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:35:19 BoogieIcfgContainer [2025-02-05 15:35:19,818 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:35:19,820 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:35:19,820 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:35:19,823 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:35:19,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:35:17" (1/3) ... [2025-02-05 15:35:19,824 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3337f67c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:35:19, skipping insertion in model container [2025-02-05 15:35:19,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:35:18" (2/3) ... [2025-02-05 15:35:19,824 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3337f67c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:35:19, skipping insertion in model container [2025-02-05 15:35:19,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:35:19" (3/3) ... [2025-02-05 15:35:19,825 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product18.cil.c [2025-02-05 15:35:19,834 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:35:19,837 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec2_product18.cil.c that has 23 procedures, 541 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:35:19,902 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:35:19,912 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;@33a648ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:35:19,913 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:35:19,917 INFO L276 IsEmpty]: Start isEmpty. Operand has 541 states, 425 states have (on average 1.7058823529411764) internal successors, (725), 449 states have internal predecessors, (725), 91 states have call successors, (91), 22 states have call predecessors, (91), 22 states have return successors, (91), 84 states have call predecessors, (91), 91 states have call successors, (91) [2025-02-05 15:35:19,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-05 15:35:19,936 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:19,936 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-02-05 15:35:19,937 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:19,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:19,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1707364172, now seen corresponding path program 1 times [2025-02-05 15:35:19,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:19,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993435711] [2025-02-05 15:35:19,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:19,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:20,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-05 15:35:20,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-05 15:35:20,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:20,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:20,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:35:20,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:20,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993435711] [2025-02-05 15:35:20,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993435711] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:20,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:20,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:35:20,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074799936] [2025-02-05 15:35:20,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:20,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:35:20,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:20,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:35:20,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:35:20,486 INFO L87 Difference]: Start difference. First operand has 541 states, 425 states have (on average 1.7058823529411764) internal successors, (725), 449 states have internal predecessors, (725), 91 states have call successors, (91), 22 states have call predecessors, (91), 22 states have return successors, (91), 84 states have call predecessors, (91), 91 states have call successors, (91) 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-02-05 15:35:20,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:20,616 INFO L93 Difference]: Finished difference Result 1062 states and 1788 transitions. [2025-02-05 15:35:20,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:35:20,621 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-02-05 15:35:20,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:20,632 INFO L225 Difference]: With dead ends: 1062 [2025-02-05 15:35:20,633 INFO L226 Difference]: Without dead ends: 532 [2025-02-05 15:35:20,640 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-02-05 15:35:20,641 INFO L435 NwaCegarLoop]: 887 mSDtfsCounter, 5 mSDsluCounter, 1770 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2657 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-02-05 15:35:20,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2657 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:35:20,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-02-05 15:35:20,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2025-02-05 15:35:20,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 419 states have (on average 1.6992840095465394) internal successors, (712), 440 states have internal predecessors, (712), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2025-02-05 15:35:20,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 889 transitions. [2025-02-05 15:35:20,729 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 889 transitions. Word has length 74 [2025-02-05 15:35:20,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:20,730 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 889 transitions. [2025-02-05 15:35:20,730 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-02-05 15:35:20,730 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 889 transitions. [2025-02-05 15:35:20,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-05 15:35:20,737 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:20,737 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] [2025-02-05 15:35:20,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 15:35:20,738 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:20,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:20,738 INFO L85 PathProgramCache]: Analyzing trace with hash 104068347, now seen corresponding path program 1 times [2025-02-05 15:35:20,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:20,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666391114] [2025-02-05 15:35:20,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:20,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:20,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-05 15:35:20,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-05 15:35:20,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:20,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:20,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:35:20,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:20,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666391114] [2025-02-05 15:35:20,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666391114] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:20,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:20,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:35:20,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708208581] [2025-02-05 15:35:20,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:20,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:35:20,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:20,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:35:20,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:35:20,910 INFO L87 Difference]: Start difference. First operand 532 states and 889 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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-02-05 15:35:20,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:20,975 INFO L93 Difference]: Finished difference Result 1046 states and 1755 transitions. [2025-02-05 15:35:20,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:35:20,975 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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 75 [2025-02-05 15:35:20,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:20,980 INFO L225 Difference]: With dead ends: 1046 [2025-02-05 15:35:20,981 INFO L226 Difference]: Without dead ends: 532 [2025-02-05 15:35:20,983 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-02-05 15:35:20,983 INFO L435 NwaCegarLoop]: 878 mSDtfsCounter, 4 mSDsluCounter, 1752 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2630 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-02-05 15:35:20,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2630 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:35:20,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-02-05 15:35:21,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2025-02-05 15:35:21,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 419 states have (on average 1.6968973747016707) internal successors, (711), 440 states have internal predecessors, (711), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2025-02-05 15:35:21,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 888 transitions. [2025-02-05 15:35:21,021 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 888 transitions. Word has length 75 [2025-02-05 15:35:21,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:21,021 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 888 transitions. [2025-02-05 15:35:21,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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-02-05 15:35:21,021 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 888 transitions. [2025-02-05 15:35:21,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-05 15:35:21,024 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:21,024 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:35:21,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 15:35:21,024 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:21,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:21,025 INFO L85 PathProgramCache]: Analyzing trace with hash -966549327, now seen corresponding path program 1 times [2025-02-05 15:35:21,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:21,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996011805] [2025-02-05 15:35:21,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:21,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:21,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-05 15:35:21,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-05 15:35:21,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:21,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:21,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:35:21,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:21,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996011805] [2025-02-05 15:35:21,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996011805] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:21,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:21,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:35:21,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869089678] [2025-02-05 15:35:21,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:21,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:35:21,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:21,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:35:21,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:35:21,185 INFO L87 Difference]: Start difference. First operand 532 states and 888 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 15:35:21,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:21,254 INFO L93 Difference]: Finished difference Result 1046 states and 1754 transitions. [2025-02-05 15:35:21,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:35:21,257 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 76 [2025-02-05 15:35:21,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:21,264 INFO L225 Difference]: With dead ends: 1046 [2025-02-05 15:35:21,264 INFO L226 Difference]: Without dead ends: 532 [2025-02-05 15:35:21,267 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-02-05 15:35:21,268 INFO L435 NwaCegarLoop]: 878 mSDtfsCounter, 3 mSDsluCounter, 1752 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2630 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-02-05 15:35:21,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2630 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:35:21,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-02-05 15:35:21,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2025-02-05 15:35:21,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 419 states have (on average 1.694510739856802) internal successors, (710), 440 states have internal predecessors, (710), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2025-02-05 15:35:21,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 887 transitions. [2025-02-05 15:35:21,296 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 887 transitions. Word has length 76 [2025-02-05 15:35:21,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:21,297 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 887 transitions. [2025-02-05 15:35:21,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 15:35:21,297 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 887 transitions. [2025-02-05 15:35:21,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 15:35:21,300 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:21,300 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-02-05 15:35:21,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 15:35:21,301 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:21,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:21,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1186409768, now seen corresponding path program 1 times [2025-02-05 15:35:21,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:21,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65405907] [2025-02-05 15:35:21,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:21,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:21,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 15:35:21,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 15:35:21,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:21,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:21,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:35:21,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:21,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65405907] [2025-02-05 15:35:21,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65405907] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:21,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:21,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:35:21,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928341087] [2025-02-05 15:35:21,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:21,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:35:21,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:21,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:35:21,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:35:21,445 INFO L87 Difference]: Start difference. First operand 532 states and 887 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-02-05 15:35:21,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:21,498 INFO L93 Difference]: Finished difference Result 1046 states and 1753 transitions. [2025-02-05 15:35:21,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:35:21,499 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-02-05 15:35:21,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:21,502 INFO L225 Difference]: With dead ends: 1046 [2025-02-05 15:35:21,503 INFO L226 Difference]: Without dead ends: 532 [2025-02-05 15:35:21,504 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-02-05 15:35:21,507 INFO L435 NwaCegarLoop]: 878 mSDtfsCounter, 2 mSDsluCounter, 1752 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2630 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-02-05 15:35:21,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2630 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:35:21,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-02-05 15:35:21,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2025-02-05 15:35:21,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 419 states have (on average 1.692124105011933) internal successors, (709), 440 states have internal predecessors, (709), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2025-02-05 15:35:21,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 886 transitions. [2025-02-05 15:35:21,528 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 886 transitions. Word has length 77 [2025-02-05 15:35:21,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:21,529 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 886 transitions. [2025-02-05 15:35:21,529 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-02-05 15:35:21,529 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 886 transitions. [2025-02-05 15:35:21,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-05 15:35:21,531 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:21,531 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-02-05 15:35:21,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 15:35:21,531 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:21,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:21,532 INFO L85 PathProgramCache]: Analyzing trace with hash -802599762, now seen corresponding path program 1 times [2025-02-05 15:35:21,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:21,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487908745] [2025-02-05 15:35:21,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:21,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:21,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-05 15:35:21,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-05 15:35:21,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:21,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:21,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:35:21,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:21,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487908745] [2025-02-05 15:35:21,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487908745] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:21,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:21,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:35:21,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625537784] [2025-02-05 15:35:21,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:21,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:35:21,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:21,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:35:21,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:35:21,668 INFO L87 Difference]: Start difference. First operand 532 states and 886 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-02-05 15:35:21,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:21,703 INFO L93 Difference]: Finished difference Result 1046 states and 1752 transitions. [2025-02-05 15:35:21,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:35:21,707 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-02-05 15:35:21,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:21,710 INFO L225 Difference]: With dead ends: 1046 [2025-02-05 15:35:21,710 INFO L226 Difference]: Without dead ends: 532 [2025-02-05 15:35:21,712 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-02-05 15:35:21,713 INFO L435 NwaCegarLoop]: 878 mSDtfsCounter, 1 mSDsluCounter, 1752 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2630 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-02-05 15:35:21,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2630 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:35:21,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-02-05 15:35:21,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2025-02-05 15:35:21,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 419 states have (on average 1.6897374701670644) internal successors, (708), 440 states have internal predecessors, (708), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2025-02-05 15:35:21,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 885 transitions. [2025-02-05 15:35:21,740 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 885 transitions. Word has length 78 [2025-02-05 15:35:21,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:21,740 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 885 transitions. [2025-02-05 15:35:21,740 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-02-05 15:35:21,740 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 885 transitions. [2025-02-05 15:35:21,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 15:35:21,742 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:21,742 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-02-05 15:35:21,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 15:35:21,743 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:21,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:21,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1115124917, now seen corresponding path program 1 times [2025-02-05 15:35:21,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:21,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577486444] [2025-02-05 15:35:21,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:21,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:21,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 15:35:21,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 15:35:21,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:21,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:21,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:35:21,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:21,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577486444] [2025-02-05 15:35:21,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577486444] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:21,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:21,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 15:35:21,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702506902] [2025-02-05 15:35:21,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:21,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 15:35:21,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:21,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 15:35:21,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:35:21,960 INFO L87 Difference]: Start difference. First operand 532 states and 885 transitions. Second operand has 9 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 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-02-05 15:35:22,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:22,116 INFO L93 Difference]: Finished difference Result 1012 states and 1684 transitions. [2025-02-05 15:35:22,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 15:35:22,120 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 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 79 [2025-02-05 15:35:22,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:22,127 INFO L225 Difference]: With dead ends: 1012 [2025-02-05 15:35:22,128 INFO L226 Difference]: Without dead ends: 547 [2025-02-05 15:35:22,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:35:22,130 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 91 mSDsluCounter, 6028 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 6901 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:35:22,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 6901 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:35:22,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-02-05 15:35:22,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 545. [2025-02-05 15:35:22,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 429 states have (on average 1.6853146853146854) internal successors, (723), 452 states have internal predecessors, (723), 92 states have call successors, (92), 22 states have call predecessors, (92), 23 states have return successors, (89), 84 states have call predecessors, (89), 87 states have call successors, (89) [2025-02-05 15:35:22,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 904 transitions. [2025-02-05 15:35:22,154 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 904 transitions. Word has length 79 [2025-02-05 15:35:22,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:22,154 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 904 transitions. [2025-02-05 15:35:22,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 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-02-05 15:35:22,155 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 904 transitions. [2025-02-05 15:35:22,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 15:35:22,157 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:22,157 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-02-05 15:35:22,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:35:22,158 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:22,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:22,158 INFO L85 PathProgramCache]: Analyzing trace with hash -692722604, now seen corresponding path program 1 times [2025-02-05 15:35:22,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:22,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537762861] [2025-02-05 15:35:22,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:22,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:22,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 15:35:22,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 15:35:22,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:22,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:22,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:35:22,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:22,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537762861] [2025-02-05 15:35:22,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537762861] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:22,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:22,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:35:22,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520427529] [2025-02-05 15:35:22,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:22,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:35:22,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:22,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:35:22,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:35:22,272 INFO L87 Difference]: Start difference. First operand 545 states and 904 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-02-05 15:35:22,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:22,330 INFO L93 Difference]: Finished difference Result 1064 states and 1778 transitions. [2025-02-05 15:35:22,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:35:22,331 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-02-05 15:35:22,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:22,335 INFO L225 Difference]: With dead ends: 1064 [2025-02-05 15:35:22,335 INFO L226 Difference]: Without dead ends: 526 [2025-02-05 15:35:22,337 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-02-05 15:35:22,338 INFO L435 NwaCegarLoop]: 879 mSDtfsCounter, 0 mSDsluCounter, 1753 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2632 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-02-05 15:35:22,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2632 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:35:22,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-02-05 15:35:22,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2025-02-05 15:35:22,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 413 states have (on average 1.6803874092009685) internal successors, (694), 434 states have internal predecessors, (694), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2025-02-05 15:35:22,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 871 transitions. [2025-02-05 15:35:22,354 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 871 transitions. Word has length 79 [2025-02-05 15:35:22,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:22,354 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 871 transitions. [2025-02-05 15:35:22,354 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-02-05 15:35:22,354 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 871 transitions. [2025-02-05 15:35:22,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 15:35:22,356 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:22,356 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-02-05 15:35:22,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:35:22,356 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:22,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:22,357 INFO L85 PathProgramCache]: Analyzing trace with hash 417186835, now seen corresponding path program 1 times [2025-02-05 15:35:22,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:22,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878257838] [2025-02-05 15:35:22,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:22,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:22,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 15:35:22,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 15:35:22,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:22,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:22,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:35:22,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:22,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878257838] [2025-02-05 15:35:22,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878257838] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:22,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:22,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:35:22,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319181522] [2025-02-05 15:35:22,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:22,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:35:22,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:22,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:35:22,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:35:22,510 INFO L87 Difference]: Start difference. First operand 526 states and 871 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 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-02-05 15:35:22,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:22,692 INFO L93 Difference]: Finished difference Result 1009 states and 1676 transitions. [2025-02-05 15:35:22,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:35:22,693 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 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 80 [2025-02-05 15:35:22,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:22,696 INFO L225 Difference]: With dead ends: 1009 [2025-02-05 15:35:22,697 INFO L226 Difference]: Without dead ends: 535 [2025-02-05 15:35:22,699 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-02-05 15:35:22,699 INFO L435 NwaCegarLoop]: 828 mSDtfsCounter, 55 mSDsluCounter, 3283 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4111 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-02-05 15:35:22,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4111 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:35:22,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-02-05 15:35:22,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 526. [2025-02-05 15:35:22,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 413 states have (on average 1.6707021791767553) internal successors, (690), 434 states have internal predecessors, (690), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2025-02-05 15:35:22,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 867 transitions. [2025-02-05 15:35:22,719 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 867 transitions. Word has length 80 [2025-02-05 15:35:22,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:22,719 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 867 transitions. [2025-02-05 15:35:22,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 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-02-05 15:35:22,720 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 867 transitions. [2025-02-05 15:35:22,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-05 15:35:22,722 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:22,722 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-02-05 15:35:22,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:35:22,722 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:22,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:22,723 INFO L85 PathProgramCache]: Analyzing trace with hash -799678772, now seen corresponding path program 1 times [2025-02-05 15:35:22,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:22,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164007705] [2025-02-05 15:35:22,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:22,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:22,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 15:35:22,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 15:35:22,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:22,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:22,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:35:22,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:22,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164007705] [2025-02-05 15:35:22,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164007705] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:22,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:22,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:35:22,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211415893] [2025-02-05 15:35:22,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:22,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:35:22,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:22,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:35:22,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:35:22,855 INFO L87 Difference]: Start difference. First operand 526 states and 867 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 15:35:23,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:23,020 INFO L93 Difference]: Finished difference Result 1009 states and 1672 transitions. [2025-02-05 15:35:23,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:35:23,023 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 81 [2025-02-05 15:35:23,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:23,027 INFO L225 Difference]: With dead ends: 1009 [2025-02-05 15:35:23,027 INFO L226 Difference]: Without dead ends: 535 [2025-02-05 15:35:23,029 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-02-05 15:35:23,031 INFO L435 NwaCegarLoop]: 828 mSDtfsCounter, 54 mSDsluCounter, 3283 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4111 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-02-05 15:35:23,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4111 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:35:23,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-02-05 15:35:23,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 526. [2025-02-05 15:35:23,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 413 states have (on average 1.6610169491525424) internal successors, (686), 434 states have internal predecessors, (686), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2025-02-05 15:35:23,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 863 transitions. [2025-02-05 15:35:23,051 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 863 transitions. Word has length 81 [2025-02-05 15:35:23,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:23,051 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 863 transitions. [2025-02-05 15:35:23,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 15:35:23,052 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 863 transitions. [2025-02-05 15:35:23,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-05 15:35:23,054 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:23,054 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-02-05 15:35:23,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:35:23,054 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:23,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:23,055 INFO L85 PathProgramCache]: Analyzing trace with hash 784911030, now seen corresponding path program 1 times [2025-02-05 15:35:23,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:23,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32108774] [2025-02-05 15:35:23,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:23,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:23,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-05 15:35:23,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-05 15:35:23,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:23,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:23,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:35:23,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:23,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32108774] [2025-02-05 15:35:23,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32108774] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:23,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:23,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:35:23,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736290851] [2025-02-05 15:35:23,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:23,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:35:23,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:23,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:35:23,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:35:23,175 INFO L87 Difference]: Start difference. First operand 526 states and 863 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-02-05 15:35:23,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:23,313 INFO L93 Difference]: Finished difference Result 1009 states and 1668 transitions. [2025-02-05 15:35:23,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:35:23,314 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-02-05 15:35:23,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:23,319 INFO L225 Difference]: With dead ends: 1009 [2025-02-05 15:35:23,319 INFO L226 Difference]: Without dead ends: 535 [2025-02-05 15:35:23,321 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-02-05 15:35:23,322 INFO L435 NwaCegarLoop]: 827 mSDtfsCounter, 53 mSDsluCounter, 3266 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4093 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-02-05 15:35:23,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4093 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:35:23,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-02-05 15:35:23,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 526. [2025-02-05 15:35:23,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 413 states have (on average 1.6513317191283292) internal successors, (682), 434 states have internal predecessors, (682), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2025-02-05 15:35:23,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 859 transitions. [2025-02-05 15:35:23,343 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 859 transitions. Word has length 82 [2025-02-05 15:35:23,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:23,345 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 859 transitions. [2025-02-05 15:35:23,345 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-02-05 15:35:23,346 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 859 transitions. [2025-02-05 15:35:23,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-05 15:35:23,347 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:23,348 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-02-05 15:35:23,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 15:35:23,348 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:23,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:23,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1372698459, now seen corresponding path program 1 times [2025-02-05 15:35:23,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:23,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907733006] [2025-02-05 15:35:23,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:23,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:23,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-05 15:35:23,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-05 15:35:23,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:23,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:23,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:35:23,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:23,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907733006] [2025-02-05 15:35:23,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907733006] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:23,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:23,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:35:23,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128458504] [2025-02-05 15:35:23,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:23,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:35:23,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:23,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:35:23,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:35:23,508 INFO L87 Difference]: Start difference. First operand 526 states and 859 transitions. Second operand has 7 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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-02-05 15:35:23,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:23,576 INFO L93 Difference]: Finished difference Result 1000 states and 1650 transitions. [2025-02-05 15:35:23,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:35:23,577 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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 82 [2025-02-05 15:35:23,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:23,584 INFO L225 Difference]: With dead ends: 1000 [2025-02-05 15:35:23,584 INFO L226 Difference]: Without dead ends: 505 [2025-02-05 15:35:23,586 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-02-05 15:35:23,587 INFO L435 NwaCegarLoop]: 848 mSDtfsCounter, 84 mSDsluCounter, 4167 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 5015 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-02-05 15:35:23,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 5015 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:35:23,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2025-02-05 15:35:23,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2025-02-05 15:35:23,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 392 states have (on average 1.653061224489796) internal successors, (648), 413 states have internal predecessors, (648), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2025-02-05 15:35:23,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 825 transitions. [2025-02-05 15:35:23,607 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 825 transitions. Word has length 82 [2025-02-05 15:35:23,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:23,607 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 825 transitions. [2025-02-05 15:35:23,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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-02-05 15:35:23,608 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 825 transitions. [2025-02-05 15:35:23,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-05 15:35:23,609 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:23,610 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-02-05 15:35:23,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 15:35:23,610 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:23,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:23,610 INFO L85 PathProgramCache]: Analyzing trace with hash -979694705, now seen corresponding path program 1 times [2025-02-05 15:35:23,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:23,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598118003] [2025-02-05 15:35:23,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:23,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:23,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-05 15:35:23,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-05 15:35:23,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:23,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:23,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:35:23,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:23,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598118003] [2025-02-05 15:35:23,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598118003] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:23,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:23,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:35:23,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970440074] [2025-02-05 15:35:23,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:23,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:35:23,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:23,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:35:23,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:35:23,723 INFO L87 Difference]: Start difference. First operand 505 states and 825 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-02-05 15:35:23,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:23,804 INFO L93 Difference]: Finished difference Result 979 states and 1616 transitions. [2025-02-05 15:35:23,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:35:23,805 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-02-05 15:35:23,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:23,809 INFO L225 Difference]: With dead ends: 979 [2025-02-05 15:35:23,809 INFO L226 Difference]: Without dead ends: 505 [2025-02-05 15:35:23,811 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-02-05 15:35:23,811 INFO L435 NwaCegarLoop]: 808 mSDtfsCounter, 17 mSDsluCounter, 3223 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4031 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-02-05 15:35:23,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4031 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:35:23,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2025-02-05 15:35:23,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2025-02-05 15:35:23,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 392 states have (on average 1.6505102040816326) internal successors, (647), 413 states have internal predecessors, (647), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2025-02-05 15:35:23,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 824 transitions. [2025-02-05 15:35:23,831 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 824 transitions. Word has length 83 [2025-02-05 15:35:23,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:23,831 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 824 transitions. [2025-02-05 15:35:23,831 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-02-05 15:35:23,832 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 824 transitions. [2025-02-05 15:35:23,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-05 15:35:23,833 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:23,834 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-02-05 15:35:23,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 15:35:23,834 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:23,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:23,834 INFO L85 PathProgramCache]: Analyzing trace with hash 804820313, now seen corresponding path program 1 times [2025-02-05 15:35:23,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:23,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391563052] [2025-02-05 15:35:23,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:23,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:23,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-05 15:35:23,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-05 15:35:23,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:23,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:23,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:35:23,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:23,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391563052] [2025-02-05 15:35:23,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391563052] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:23,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:23,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:35:23,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669924613] [2025-02-05 15:35:23,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:23,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:35:23,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:23,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:35:23,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:35:23,950 INFO L87 Difference]: Start difference. First operand 505 states and 824 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-02-05 15:35:24,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:24,007 INFO L93 Difference]: Finished difference Result 979 states and 1615 transitions. [2025-02-05 15:35:24,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:35:24,008 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-02-05 15:35:24,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:24,013 INFO L225 Difference]: With dead ends: 979 [2025-02-05 15:35:24,013 INFO L226 Difference]: Without dead ends: 505 [2025-02-05 15:35:24,015 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-02-05 15:35:24,016 INFO L435 NwaCegarLoop]: 808 mSDtfsCounter, 16 mSDsluCounter, 3223 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4031 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-02-05 15:35:24,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4031 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:35:24,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2025-02-05 15:35:24,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2025-02-05 15:35:24,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 392 states have (on average 1.6479591836734695) internal successors, (646), 413 states have internal predecessors, (646), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2025-02-05 15:35:24,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 823 transitions. [2025-02-05 15:35:24,031 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 823 transitions. Word has length 84 [2025-02-05 15:35:24,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:24,031 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 823 transitions. [2025-02-05 15:35:24,032 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-02-05 15:35:24,032 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 823 transitions. [2025-02-05 15:35:24,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-05 15:35:24,034 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:24,034 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-02-05 15:35:24,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 15:35:24,034 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:24,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:24,034 INFO L85 PathProgramCache]: Analyzing trace with hash 942928978, now seen corresponding path program 1 times [2025-02-05 15:35:24,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:24,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633181740] [2025-02-05 15:35:24,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:24,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:24,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-05 15:35:24,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-05 15:35:24,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:24,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:24,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:35:24,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:24,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633181740] [2025-02-05 15:35:24,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633181740] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:24,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:24,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 15:35:24,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946251225] [2025-02-05 15:35:24,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:24,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 15:35:24,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:24,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 15:35:24,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:35:24,225 INFO L87 Difference]: Start difference. First operand 505 states and 823 transitions. Second operand has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 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-02-05 15:35:24,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:24,302 INFO L93 Difference]: Finished difference Result 973 states and 1603 transitions. [2025-02-05 15:35:24,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 15:35:24,302 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 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 85 [2025-02-05 15:35:24,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:24,306 INFO L225 Difference]: With dead ends: 973 [2025-02-05 15:35:24,306 INFO L226 Difference]: Without dead ends: 505 [2025-02-05 15:35:24,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:35:24,308 INFO L435 NwaCegarLoop]: 807 mSDtfsCounter, 6 mSDsluCounter, 6434 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 7241 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:35:24,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 7241 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:35:24,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2025-02-05 15:35:24,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2025-02-05 15:35:24,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 392 states have (on average 1.6454081632653061) internal successors, (645), 413 states have internal predecessors, (645), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2025-02-05 15:35:24,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 822 transitions. [2025-02-05 15:35:24,321 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 822 transitions. Word has length 85 [2025-02-05 15:35:24,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:24,321 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 822 transitions. [2025-02-05 15:35:24,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 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-02-05 15:35:24,321 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 822 transitions. [2025-02-05 15:35:24,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-05 15:35:24,323 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:24,323 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-02-05 15:35:24,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 15:35:24,323 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:24,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:24,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1091391444, now seen corresponding path program 1 times [2025-02-05 15:35:24,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:24,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476029545] [2025-02-05 15:35:24,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:24,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:24,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-05 15:35:24,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-05 15:35:24,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:24,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:24,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:35:24,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:24,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476029545] [2025-02-05 15:35:24,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476029545] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:24,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:24,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:35:24,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132296393] [2025-02-05 15:35:24,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:24,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:35:24,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:24,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:35:24,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:35:24,502 INFO L87 Difference]: Start difference. First operand 505 states and 822 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 6 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-02-05 15:35:26,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:26,315 INFO L93 Difference]: Finished difference Result 1568 states and 2617 transitions. [2025-02-05 15:35:26,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:35:26,315 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), 6 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 86 [2025-02-05 15:35:26,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:26,323 INFO L225 Difference]: With dead ends: 1568 [2025-02-05 15:35:26,323 INFO L226 Difference]: Without dead ends: 1108 [2025-02-05 15:35:26,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:35:26,326 INFO L435 NwaCegarLoop]: 368 mSDtfsCounter, 1906 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 1756 mSolverCounterSat, 410 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1966 SdHoareTripleChecker+Valid, 1143 SdHoareTripleChecker+Invalid, 2166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 410 IncrementalHoareTripleChecker+Valid, 1756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 15:35:26,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1966 Valid, 1143 Invalid, 2166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [410 Valid, 1756 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 15:35:26,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2025-02-05 15:35:26,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 986. [2025-02-05 15:35:26,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 986 states, 774 states have (on average 1.669250645994832) internal successors, (1292), 804 states have internal predecessors, (1292), 174 states have call successors, (174), 36 states have call predecessors, (174), 37 states have return successors, (176), 158 states have call predecessors, (176), 169 states have call successors, (176) [2025-02-05 15:35:26,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1642 transitions. [2025-02-05 15:35:26,371 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 1642 transitions. Word has length 86 [2025-02-05 15:35:26,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:26,372 INFO L471 AbstractCegarLoop]: Abstraction has 986 states and 1642 transitions. [2025-02-05 15:35:26,372 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), 6 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-02-05 15:35:26,372 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1642 transitions. [2025-02-05 15:35:26,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-05 15:35:26,377 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:26,377 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:35:26,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 15:35:26,377 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:26,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:26,378 INFO L85 PathProgramCache]: Analyzing trace with hash 846703514, now seen corresponding path program 1 times [2025-02-05 15:35:26,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:26,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913281331] [2025-02-05 15:35:26,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:26,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:26,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-05 15:35:26,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-05 15:35:26,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:26,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:26,654 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 15:35:26,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:26,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913281331] [2025-02-05 15:35:26,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913281331] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:35:26,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503259346] [2025-02-05 15:35:26,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:26,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:35:26,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:35:26,659 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:35:26,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 15:35:26,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-05 15:35:26,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-05 15:35:26,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:26,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:26,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 1663 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 15:35:26,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:35:26,978 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:35:26,979 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:35:26,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503259346] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:26,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:35:26,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2025-02-05 15:35:26,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343537201] [2025-02-05 15:35:26,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:26,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:35:26,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:26,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:35:26,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:35:26,981 INFO L87 Difference]: Start difference. First operand 986 states and 1642 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:35:27,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:27,024 INFO L93 Difference]: Finished difference Result 1930 states and 3244 transitions. [2025-02-05 15:35:27,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:35:27,025 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2025-02-05 15:35:27,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:27,031 INFO L225 Difference]: With dead ends: 1930 [2025-02-05 15:35:27,031 INFO L226 Difference]: Without dead ends: 990 [2025-02-05 15:35:27,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:35:27,035 INFO L435 NwaCegarLoop]: 820 mSDtfsCounter, 0 mSDsluCounter, 1634 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2454 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:35:27,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2454 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:35:27,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2025-02-05 15:35:27,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 990. [2025-02-05 15:35:27,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 778 states have (on average 1.6658097686375322) internal successors, (1296), 808 states have internal predecessors, (1296), 174 states have call successors, (174), 36 states have call predecessors, (174), 37 states have return successors, (176), 158 states have call predecessors, (176), 169 states have call successors, (176) [2025-02-05 15:35:27,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1646 transitions. [2025-02-05 15:35:27,078 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1646 transitions. Word has length 115 [2025-02-05 15:35:27,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:27,079 INFO L471 AbstractCegarLoop]: Abstraction has 990 states and 1646 transitions. [2025-02-05 15:35:27,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:35:27,079 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1646 transitions. [2025-02-05 15:35:27,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-05 15:35:27,082 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:27,082 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:35:27,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 15:35:27,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-05 15:35:27,283 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:27,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:27,284 INFO L85 PathProgramCache]: Analyzing trace with hash 907749606, now seen corresponding path program 1 times [2025-02-05 15:35:27,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:27,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460841790] [2025-02-05 15:35:27,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:27,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:27,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-05 15:35:27,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-05 15:35:27,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:27,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:27,528 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:35:27,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:27,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460841790] [2025-02-05 15:35:27,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460841790] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:27,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:27,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:35:27,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927115935] [2025-02-05 15:35:27,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:27,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:35:27,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:27,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:35:27,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:35:27,529 INFO L87 Difference]: Start difference. First operand 990 states and 1646 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 5 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2025-02-05 15:35:29,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:29,919 INFO L93 Difference]: Finished difference Result 3454 states and 5846 transitions. [2025-02-05 15:35:29,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 15:35:29,920 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 5 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) Word has length 118 [2025-02-05 15:35:29,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:29,934 INFO L225 Difference]: With dead ends: 3454 [2025-02-05 15:35:29,934 INFO L226 Difference]: Without dead ends: 2510 [2025-02-05 15:35:29,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-02-05 15:35:29,941 INFO L435 NwaCegarLoop]: 417 mSDtfsCounter, 2307 mSDsluCounter, 1548 mSDsCounter, 0 mSdLazyCounter, 3523 mSolverCounterSat, 492 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2387 SdHoareTripleChecker+Valid, 1965 SdHoareTripleChecker+Invalid, 4015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 492 IncrementalHoareTripleChecker+Valid, 3523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:35:29,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2387 Valid, 1965 Invalid, 4015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [492 Valid, 3523 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 15:35:29,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2510 states. [2025-02-05 15:35:30,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2510 to 2297. [2025-02-05 15:35:30,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2297 states, 1810 states have (on average 1.6790055248618785) internal successors, (3039), 1878 states have internal predecessors, (3039), 392 states have call successors, (392), 75 states have call predecessors, (392), 94 states have return successors, (443), 369 states have call predecessors, (443), 387 states have call successors, (443) [2025-02-05 15:35:30,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2297 states to 2297 states and 3874 transitions. [2025-02-05 15:35:30,056 INFO L78 Accepts]: Start accepts. Automaton has 2297 states and 3874 transitions. Word has length 118 [2025-02-05 15:35:30,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:30,057 INFO L471 AbstractCegarLoop]: Abstraction has 2297 states and 3874 transitions. [2025-02-05 15:35:30,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 5 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2025-02-05 15:35:30,057 INFO L276 IsEmpty]: Start isEmpty. Operand 2297 states and 3874 transitions. [2025-02-05 15:35:30,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-05 15:35:30,061 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:30,061 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:35:30,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 15:35:30,061 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:30,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:30,062 INFO L85 PathProgramCache]: Analyzing trace with hash 307145771, now seen corresponding path program 1 times [2025-02-05 15:35:30,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:30,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259924610] [2025-02-05 15:35:30,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:30,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:30,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-05 15:35:30,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-05 15:35:30,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:30,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:30,288 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:35:30,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:30,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259924610] [2025-02-05 15:35:30,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259924610] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:30,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:30,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 15:35:30,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73735825] [2025-02-05 15:35:30,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:30,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 15:35:30,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:30,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 15:35:30,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:35:30,291 INFO L87 Difference]: Start difference. First operand 2297 states and 3874 transitions. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 10 states have internal predecessors, (92), 5 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2025-02-05 15:35:34,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:34,568 INFO L93 Difference]: Finished difference Result 8520 states and 14406 transitions. [2025-02-05 15:35:34,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-05 15:35:34,569 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 10 states have internal predecessors, (92), 5 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) Word has length 122 [2025-02-05 15:35:34,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:34,606 INFO L225 Difference]: With dead ends: 8520 [2025-02-05 15:35:34,606 INFO L226 Difference]: Without dead ends: 6268 [2025-02-05 15:35:34,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2025-02-05 15:35:34,621 INFO L435 NwaCegarLoop]: 740 mSDtfsCounter, 2744 mSDsluCounter, 3781 mSDsCounter, 0 mSdLazyCounter, 8699 mSolverCounterSat, 935 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2818 SdHoareTripleChecker+Valid, 4521 SdHoareTripleChecker+Invalid, 9634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 935 IncrementalHoareTripleChecker+Valid, 8699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-02-05 15:35:34,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2818 Valid, 4521 Invalid, 9634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [935 Valid, 8699 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-02-05 15:35:34,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6268 states. [2025-02-05 15:35:34,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6268 to 6174. [2025-02-05 15:35:34,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6174 states, 4739 states have (on average 1.6463388900611944) internal successors, (7802), 4924 states have internal predecessors, (7802), 1178 states have call successors, (1178), 173 states have call predecessors, (1178), 256 states have return successors, (1380), 1142 states have call predecessors, (1380), 1173 states have call successors, (1380) [2025-02-05 15:35:34,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6174 states to 6174 states and 10360 transitions. [2025-02-05 15:35:34,893 INFO L78 Accepts]: Start accepts. Automaton has 6174 states and 10360 transitions. Word has length 122 [2025-02-05 15:35:34,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:34,896 INFO L471 AbstractCegarLoop]: Abstraction has 6174 states and 10360 transitions. [2025-02-05 15:35:34,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 10 states have internal predecessors, (92), 5 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2025-02-05 15:35:34,896 INFO L276 IsEmpty]: Start isEmpty. Operand 6174 states and 10360 transitions. [2025-02-05 15:35:34,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 15:35:34,900 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:34,901 INFO L218 NwaCegarLoop]: trace histogram [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-02-05 15:35:34,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 15:35:34,901 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:34,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:34,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1443300691, now seen corresponding path program 1 times [2025-02-05 15:35:34,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:34,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138092353] [2025-02-05 15:35:34,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:34,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:34,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 15:35:34,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 15:35:34,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:34,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:35,031 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:35:35,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:35,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138092353] [2025-02-05 15:35:35,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138092353] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:35,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:35,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:35:35,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444957735] [2025-02-05 15:35:35,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:35,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:35:35,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:35,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:35:35,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:35:35,033 INFO L87 Difference]: Start difference. First operand 6174 states and 10360 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:35:35,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:35,248 INFO L93 Difference]: Finished difference Result 12397 states and 20898 transitions. [2025-02-05 15:35:35,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:35:35,249 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 123 [2025-02-05 15:35:35,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:35,286 INFO L225 Difference]: With dead ends: 12397 [2025-02-05 15:35:35,288 INFO L226 Difference]: Without dead ends: 6270 [2025-02-05 15:35:35,316 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-02-05 15:35:35,317 INFO L435 NwaCegarLoop]: 820 mSDtfsCounter, 0 mSDsluCounter, 2430 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3250 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-02-05 15:35:35,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3250 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:35:35,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6270 states. [2025-02-05 15:35:35,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6270 to 6246. [2025-02-05 15:35:35,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6246 states, 4793 states have (on average 1.639056958063843) internal successors, (7856), 4978 states have internal predecessors, (7856), 1178 states have call successors, (1178), 173 states have call predecessors, (1178), 274 states have return successors, (1416), 1160 states have call predecessors, (1416), 1173 states have call successors, (1416) [2025-02-05 15:35:35,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6246 states to 6246 states and 10450 transitions. [2025-02-05 15:35:35,621 INFO L78 Accepts]: Start accepts. Automaton has 6246 states and 10450 transitions. Word has length 123 [2025-02-05 15:35:35,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:35,621 INFO L471 AbstractCegarLoop]: Abstraction has 6246 states and 10450 transitions. [2025-02-05 15:35:35,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:35:35,622 INFO L276 IsEmpty]: Start isEmpty. Operand 6246 states and 10450 transitions. [2025-02-05 15:35:35,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-05 15:35:35,625 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:35,625 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:35:35,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 15:35:35,625 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:35,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:35,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1922688045, now seen corresponding path program 1 times [2025-02-05 15:35:35,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:35,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30410913] [2025-02-05 15:35:35,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:35,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:35,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-05 15:35:35,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-05 15:35:35,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:35,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:35,829 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:35:35,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:35,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30410913] [2025-02-05 15:35:35,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30410913] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:35,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:35,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:35:35,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142765697] [2025-02-05 15:35:35,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:35,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:35:35,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:35,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:35:35,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:35:35,830 INFO L87 Difference]: Start difference. First operand 6246 states and 10450 transitions. Second operand has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 7 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2025-02-05 15:35:37,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:37,884 INFO L93 Difference]: Finished difference Result 19419 states and 33000 transitions. [2025-02-05 15:35:37,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:35:37,885 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 7 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) Word has length 127 [2025-02-05 15:35:37,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:37,948 INFO L225 Difference]: With dead ends: 19419 [2025-02-05 15:35:37,949 INFO L226 Difference]: Without dead ends: 13220 [2025-02-05 15:35:37,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:35:37,968 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 2767 mSDsluCounter, 1022 mSDsCounter, 0 mSdLazyCounter, 2781 mSolverCounterSat, 646 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2914 SdHoareTripleChecker+Valid, 1636 SdHoareTripleChecker+Invalid, 3427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 646 IncrementalHoareTripleChecker+Valid, 2781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 15:35:37,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2914 Valid, 1636 Invalid, 3427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [646 Valid, 2781 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 15:35:37,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13220 states. [2025-02-05 15:35:38,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13220 to 13185. [2025-02-05 15:35:38,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13185 states, 10040 states have (on average 1.6100597609561753) internal successors, (16165), 10444 states have internal predecessors, (16165), 2506 states have call successors, (2506), 392 states have call predecessors, (2506), 638 states have return successors, (3382), 2491 states have call predecessors, (3382), 2501 states have call successors, (3382) [2025-02-05 15:35:38,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13185 states to 13185 states and 22053 transitions. [2025-02-05 15:35:38,637 INFO L78 Accepts]: Start accepts. Automaton has 13185 states and 22053 transitions. Word has length 127 [2025-02-05 15:35:38,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:38,638 INFO L471 AbstractCegarLoop]: Abstraction has 13185 states and 22053 transitions. [2025-02-05 15:35:38,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 7 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2025-02-05 15:35:38,638 INFO L276 IsEmpty]: Start isEmpty. Operand 13185 states and 22053 transitions. [2025-02-05 15:35:38,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-05 15:35:38,642 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:38,642 INFO L218 NwaCegarLoop]: trace histogram [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-02-05 15:35:38,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 15:35:38,642 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:38,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:38,643 INFO L85 PathProgramCache]: Analyzing trace with hash 786431565, now seen corresponding path program 1 times [2025-02-05 15:35:38,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:38,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229700750] [2025-02-05 15:35:38,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:38,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:38,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 15:35:38,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 15:35:38,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:38,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:38,806 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:35:38,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:38,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229700750] [2025-02-05 15:35:38,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229700750] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:38,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:38,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:35:38,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614797485] [2025-02-05 15:35:38,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:38,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:35:38,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:38,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:35:38,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:35:38,809 INFO L87 Difference]: Start difference. First operand 13185 states and 22053 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 15:35:39,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:39,452 INFO L93 Difference]: Finished difference Result 27497 states and 47118 transitions. [2025-02-05 15:35:39,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:35:39,453 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 130 [2025-02-05 15:35:39,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:39,522 INFO L225 Difference]: With dead ends: 27497 [2025-02-05 15:35:39,522 INFO L226 Difference]: Without dead ends: 13457 [2025-02-05 15:35:39,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:35:39,572 INFO L435 NwaCegarLoop]: 862 mSDtfsCounter, 225 mSDsluCounter, 3195 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 4057 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:35:39,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 4057 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:35:39,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13457 states. [2025-02-05 15:35:40,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13457 to 13185. [2025-02-05 15:35:40,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13185 states, 10040 states have (on average 1.5841633466135459) internal successors, (15905), 10444 states have internal predecessors, (15905), 2506 states have call successors, (2506), 392 states have call predecessors, (2506), 638 states have return successors, (3382), 2491 states have call predecessors, (3382), 2501 states have call successors, (3382) [2025-02-05 15:35:40,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13185 states to 13185 states and 21793 transitions. [2025-02-05 15:35:40,267 INFO L78 Accepts]: Start accepts. Automaton has 13185 states and 21793 transitions. Word has length 130 [2025-02-05 15:35:40,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:40,267 INFO L471 AbstractCegarLoop]: Abstraction has 13185 states and 21793 transitions. [2025-02-05 15:35:40,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 15:35:40,268 INFO L276 IsEmpty]: Start isEmpty. Operand 13185 states and 21793 transitions. [2025-02-05 15:35:40,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 15:35:40,271 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:40,271 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:35:40,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 15:35:40,271 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:40,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:40,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1591487709, now seen corresponding path program 1 times [2025-02-05 15:35:40,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:40,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009467468] [2025-02-05 15:35:40,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:40,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:40,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 15:35:40,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 15:35:40,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:40,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:40,378 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 15:35:40,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:40,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009467468] [2025-02-05 15:35:40,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009467468] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:35:40,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828140348] [2025-02-05 15:35:40,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:40,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:35:40,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:35:40,382 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:35:40,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 15:35:40,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 15:35:40,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 15:35:40,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:40,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:40,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 1722 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:35:40,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:35:40,756 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 15:35:40,756 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:35:40,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828140348] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:40,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:35:40,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-02-05 15:35:40,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841349501] [2025-02-05 15:35:40,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:40,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:35:40,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:40,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:35:40,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:35:40,757 INFO L87 Difference]: Start difference. First operand 13185 states and 21793 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:35:41,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:41,307 INFO L93 Difference]: Finished difference Result 26635 states and 44942 transitions. [2025-02-05 15:35:41,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:35:41,308 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 134 [2025-02-05 15:35:41,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:41,368 INFO L225 Difference]: With dead ends: 26635 [2025-02-05 15:35:41,368 INFO L226 Difference]: Without dead ends: 13481 [2025-02-05 15:35:41,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:35:41,419 INFO L435 NwaCegarLoop]: 798 mSDtfsCounter, 14 mSDsluCounter, 1562 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2360 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:35:41,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2360 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:35:41,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13481 states. [2025-02-05 15:35:42,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13481 to 13481. [2025-02-05 15:35:42,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13481 states, 10296 states have (on average 1.5863442113442114) internal successors, (16333), 10704 states have internal predecessors, (16333), 2506 states have call successors, (2506), 428 states have call predecessors, (2506), 678 states have return successors, (3408), 2491 states have call predecessors, (3408), 2501 states have call successors, (3408) [2025-02-05 15:35:42,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13481 states to 13481 states and 22247 transitions. [2025-02-05 15:35:42,164 INFO L78 Accepts]: Start accepts. Automaton has 13481 states and 22247 transitions. Word has length 134 [2025-02-05 15:35:42,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:42,164 INFO L471 AbstractCegarLoop]: Abstraction has 13481 states and 22247 transitions. [2025-02-05 15:35:42,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:35:42,164 INFO L276 IsEmpty]: Start isEmpty. Operand 13481 states and 22247 transitions. [2025-02-05 15:35:42,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-05 15:35:42,167 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:42,168 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:35:42,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 15:35:42,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:35:42,373 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:42,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:42,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1590797399, now seen corresponding path program 1 times [2025-02-05 15:35:42,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:42,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900526570] [2025-02-05 15:35:42,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:42,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:42,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-05 15:35:42,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-05 15:35:42,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:42,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:42,576 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 15:35:42,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:42,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900526570] [2025-02-05 15:35:42,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900526570] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:42,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:42,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:35:42,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921404808] [2025-02-05 15:35:42,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:42,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:35:42,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:42,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:35:42,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:35:42,579 INFO L87 Difference]: Start difference. First operand 13481 states and 22247 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 5 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2025-02-05 15:35:44,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:44,682 INFO L93 Difference]: Finished difference Result 28171 states and 46818 transitions. [2025-02-05 15:35:44,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 15:35:44,683 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 5 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) Word has length 135 [2025-02-05 15:35:44,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:44,779 INFO L225 Difference]: With dead ends: 28171 [2025-02-05 15:35:44,779 INFO L226 Difference]: Without dead ends: 15568 [2025-02-05 15:35:44,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2025-02-05 15:35:44,829 INFO L435 NwaCegarLoop]: 380 mSDtfsCounter, 2020 mSDsluCounter, 1306 mSDsCounter, 0 mSdLazyCounter, 3039 mSolverCounterSat, 473 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2096 SdHoareTripleChecker+Valid, 1686 SdHoareTripleChecker+Invalid, 3512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 473 IncrementalHoareTripleChecker+Valid, 3039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 15:35:44,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2096 Valid, 1686 Invalid, 3512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [473 Valid, 3039 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 15:35:44,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15568 states. [2025-02-05 15:35:45,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15568 to 14135. [2025-02-05 15:35:45,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14135 states, 10782 states have (on average 1.5738267482841772) internal successors, (16969), 11238 states have internal predecessors, (16969), 2566 states have call successors, (2566), 482 states have call predecessors, (2566), 786 states have return successors, (3612), 2557 states have call predecessors, (3612), 2561 states have call successors, (3612) [2025-02-05 15:35:45,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14135 states to 14135 states and 23147 transitions. [2025-02-05 15:35:45,343 INFO L78 Accepts]: Start accepts. Automaton has 14135 states and 23147 transitions. Word has length 135 [2025-02-05 15:35:45,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:45,343 INFO L471 AbstractCegarLoop]: Abstraction has 14135 states and 23147 transitions. [2025-02-05 15:35:45,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 5 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2025-02-05 15:35:45,343 INFO L276 IsEmpty]: Start isEmpty. Operand 14135 states and 23147 transitions. [2025-02-05 15:35:45,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-05 15:35:45,348 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:45,348 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:35:45,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 15:35:45,348 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:45,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:45,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1353373201, now seen corresponding path program 1 times [2025-02-05 15:35:45,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:45,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021063990] [2025-02-05 15:35:45,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:45,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:45,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-05 15:35:45,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-05 15:35:45,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:45,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:45,679 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 15:35:45,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:45,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021063990] [2025-02-05 15:35:45,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021063990] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:45,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:45,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 15:35:45,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230008175] [2025-02-05 15:35:45,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:45,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 15:35:45,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:45,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 15:35:45,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:35:45,682 INFO L87 Difference]: Start difference. First operand 14135 states and 23147 transitions. Second operand has 10 states, 10 states have (on average 10.2) internal successors, (102), 10 states have internal predecessors, (102), 5 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 5 states have call predecessors, (16), 4 states have call successors, (16) [2025-02-05 15:35:48,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:48,720 INFO L93 Difference]: Finished difference Result 33200 states and 54676 transitions. [2025-02-05 15:35:48,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 15:35:48,721 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.2) internal successors, (102), 10 states have internal predecessors, (102), 5 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 5 states have call predecessors, (16), 4 states have call successors, (16) Word has length 142 [2025-02-05 15:35:48,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:48,825 INFO L225 Difference]: With dead ends: 33200 [2025-02-05 15:35:48,825 INFO L226 Difference]: Without dead ends: 19786 [2025-02-05 15:35:48,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2025-02-05 15:35:48,882 INFO L435 NwaCegarLoop]: 448 mSDtfsCounter, 2125 mSDsluCounter, 2623 mSDsCounter, 0 mSdLazyCounter, 6029 mSolverCounterSat, 476 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2210 SdHoareTripleChecker+Valid, 3071 SdHoareTripleChecker+Invalid, 6505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 476 IncrementalHoareTripleChecker+Valid, 6029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-05 15:35:48,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2210 Valid, 3071 Invalid, 6505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [476 Valid, 6029 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-05 15:35:49,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19786 states. [2025-02-05 15:35:49,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19786 to 17760. [2025-02-05 15:35:49,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17760 states, 13640 states have (on average 1.5582111436950146) internal successors, (21254), 14228 states have internal predecessors, (21254), 3022 states have call successors, (3022), 668 states have call predecessors, (3022), 1097 states have return successors, (4296), 3006 states have call predecessors, (4296), 3017 states have call successors, (4296) [2025-02-05 15:35:49,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17760 states to 17760 states and 28572 transitions. [2025-02-05 15:35:49,719 INFO L78 Accepts]: Start accepts. Automaton has 17760 states and 28572 transitions. Word has length 142 [2025-02-05 15:35:49,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:49,719 INFO L471 AbstractCegarLoop]: Abstraction has 17760 states and 28572 transitions. [2025-02-05 15:35:49,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.2) internal successors, (102), 10 states have internal predecessors, (102), 5 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 5 states have call predecessors, (16), 4 states have call successors, (16) [2025-02-05 15:35:49,719 INFO L276 IsEmpty]: Start isEmpty. Operand 17760 states and 28572 transitions. [2025-02-05 15:35:49,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-05 15:35:49,721 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:49,722 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:35:49,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 15:35:49,722 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:49,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:49,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1133746574, now seen corresponding path program 1 times [2025-02-05 15:35:49,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:49,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450744850] [2025-02-05 15:35:49,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:49,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:49,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-05 15:35:49,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-05 15:35:49,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:49,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:49,902 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 15:35:49,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:49,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450744850] [2025-02-05 15:35:49,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450744850] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:49,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:49,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:35:49,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754363861] [2025-02-05 15:35:49,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:49,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:35:49,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:49,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:35:49,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:35:49,905 INFO L87 Difference]: Start difference. First operand 17760 states and 28572 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:35:51,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:51,100 INFO L93 Difference]: Finished difference Result 41504 states and 67500 transitions. [2025-02-05 15:35:51,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:35:51,100 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 142 [2025-02-05 15:35:51,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:51,241 INFO L225 Difference]: With dead ends: 41504 [2025-02-05 15:35:51,242 INFO L226 Difference]: Without dead ends: 24622 [2025-02-05 15:35:51,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:35:51,318 INFO L435 NwaCegarLoop]: 1321 mSDtfsCounter, 755 mSDsluCounter, 3429 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 755 SdHoareTripleChecker+Valid, 4750 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:35:51,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [755 Valid, 4750 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:35:51,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24622 states. [2025-02-05 15:35:52,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24622 to 20905. [2025-02-05 15:35:52,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20905 states, 16081 states have (on average 1.5638330949567814) internal successors, (25148), 16733 states have internal predecessors, (25148), 3579 states have call successors, (3579), 770 states have call predecessors, (3579), 1244 states have return successors, (5227), 3577 states have call predecessors, (5227), 3574 states have call successors, (5227) [2025-02-05 15:35:52,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20905 states to 20905 states and 33954 transitions. [2025-02-05 15:35:52,332 INFO L78 Accepts]: Start accepts. Automaton has 20905 states and 33954 transitions. Word has length 142 [2025-02-05 15:35:52,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:52,333 INFO L471 AbstractCegarLoop]: Abstraction has 20905 states and 33954 transitions. [2025-02-05 15:35:52,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:35:52,333 INFO L276 IsEmpty]: Start isEmpty. Operand 20905 states and 33954 transitions. [2025-02-05 15:35:52,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-05 15:35:52,336 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:52,336 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:35:52,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 15:35:52,336 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:52,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:52,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1391657012, now seen corresponding path program 1 times [2025-02-05 15:35:52,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:52,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96114142] [2025-02-05 15:35:52,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:35:52,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:52,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-05 15:35:52,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-05 15:35:52,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:35:52,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:52,542 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 15:35:52,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:52,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96114142] [2025-02-05 15:35:52,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96114142] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:52,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:52,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:35:52,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467188025] [2025-02-05 15:35:52,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:52,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:35:52,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:52,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:35:52,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:35:52,544 INFO L87 Difference]: Start difference. First operand 20905 states and 33954 transitions. Second operand has 8 states, 8 states have (on average 13.0) internal successors, (104), 7 states have internal predecessors, (104), 4 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-05 15:35:54,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:54,478 INFO L93 Difference]: Finished difference Result 42117 states and 68796 transitions. [2025-02-05 15:35:54,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:35:54,478 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.0) internal successors, (104), 7 states have internal predecessors, (104), 4 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 3 states have call successors, (15) Word has length 140 [2025-02-05 15:35:54,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:54,617 INFO L225 Difference]: With dead ends: 42117 [2025-02-05 15:35:54,617 INFO L226 Difference]: Without dead ends: 21261 [2025-02-05 15:35:54,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 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-02-05 15:35:54,693 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 1206 mSDsluCounter, 1234 mSDsCounter, 0 mSdLazyCounter, 2526 mSolverCounterSat, 339 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1206 SdHoareTripleChecker+Valid, 1617 SdHoareTripleChecker+Invalid, 2865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 339 IncrementalHoareTripleChecker+Valid, 2526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:35:54,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1206 Valid, 1617 Invalid, 2865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [339 Valid, 2526 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 15:35:54,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21261 states. [2025-02-05 15:35:55,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21261 to 21041. [2025-02-05 15:35:55,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21041 states, 16181 states have (on average 1.5603485569495086) internal successors, (25248), 16837 states have internal predecessors, (25248), 3579 states have call successors, (3579), 770 states have call predecessors, (3579), 1280 states have return successors, (5283), 3609 states have call predecessors, (5283), 3574 states have call successors, (5283) [2025-02-05 15:35:55,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21041 states to 21041 states and 34110 transitions. [2025-02-05 15:35:55,578 INFO L78 Accepts]: Start accepts. Automaton has 21041 states and 34110 transitions. Word has length 140 [2025-02-05 15:35:55,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:35:55,579 INFO L471 AbstractCegarLoop]: Abstraction has 21041 states and 34110 transitions. [2025-02-05 15:35:55,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.0) internal successors, (104), 7 states have internal predecessors, (104), 4 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-05 15:35:55,579 INFO L276 IsEmpty]: Start isEmpty. Operand 21041 states and 34110 transitions. [2025-02-05 15:35:55,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-05 15:35:55,581 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:35:55,581 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:35:55,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-05 15:35:55,581 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:35:55,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:35:55,582 INFO L85 PathProgramCache]: Analyzing trace with hash -732277146, now seen corresponding path program 2 times [2025-02-05 15:35:55,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:35:55,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659029503] [2025-02-05 15:35:55,582 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:35:55,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:35:55,596 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 141 statements into 2 equivalence classes. [2025-02-05 15:35:55,605 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 141 statements. [2025-02-05 15:35:55,605 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-05 15:35:55,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:35:55,710 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 15:35:55,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:35:55,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659029503] [2025-02-05 15:35:55,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659029503] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:35:55,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:35:55,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:35:55,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494210487] [2025-02-05 15:35:55,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:35:55,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:35:55,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:35:55,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:35:55,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:35:55,714 INFO L87 Difference]: Start difference. First operand 21041 states and 34110 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 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-02-05 15:35:58,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:35:58,887 INFO L93 Difference]: Finished difference Result 55601 states and 92144 transitions. [2025-02-05 15:35:58,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:35:58,888 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 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-02-05 15:35:58,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:35:59,097 INFO L225 Difference]: With dead ends: 55601 [2025-02-05 15:35:59,097 INFO L226 Difference]: Without dead ends: 34605 [2025-02-05 15:35:59,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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-02-05 15:35:59,210 INFO L435 NwaCegarLoop]: 407 mSDtfsCounter, 1802 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 1179 mSolverCounterSat, 380 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1874 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 1559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 380 IncrementalHoareTripleChecker+Valid, 1179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:35:59,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1874 Valid, 942 Invalid, 1559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [380 Valid, 1179 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 15:35:59,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34605 states. [2025-02-05 15:36:00,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34605 to 33337. [2025-02-05 15:36:00,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33337 states, 25335 states have (on average 1.5513321492007104) internal successors, (39303), 26502 states have internal predecessors, (39303), 5964 states have call successors, (5964), 1170 states have call predecessors, (5964), 2037 states have return successors, (9411), 6096 states have call predecessors, (9411), 5959 states have call successors, (9411) [2025-02-05 15:36:00,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33337 states to 33337 states and 54678 transitions. [2025-02-05 15:36:00,857 INFO L78 Accepts]: Start accepts. Automaton has 33337 states and 54678 transitions. Word has length 141 [2025-02-05 15:36:00,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:00,857 INFO L471 AbstractCegarLoop]: Abstraction has 33337 states and 54678 transitions. [2025-02-05 15:36:00,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 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-02-05 15:36:00,858 INFO L276 IsEmpty]: Start isEmpty. Operand 33337 states and 54678 transitions. [2025-02-05 15:36:00,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-05 15:36:00,860 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:00,860 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:36:00,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-05 15:36:00,860 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:00,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:00,861 INFO L85 PathProgramCache]: Analyzing trace with hash -418451831, now seen corresponding path program 1 times [2025-02-05 15:36:00,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:00,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831356479] [2025-02-05 15:36:00,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:00,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:00,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 15:36:00,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 15:36:00,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:00,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:00,924 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 15:36:00,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:00,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831356479] [2025-02-05 15:36:00,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831356479] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:00,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:00,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:36:00,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826681401] [2025-02-05 15:36:00,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:00,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:36:00,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:00,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:36:00,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:36:00,926 INFO L87 Difference]: Start difference. First operand 33337 states and 54678 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-05 15:36:02,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:02,525 INFO L93 Difference]: Finished difference Result 66804 states and 110874 transitions. [2025-02-05 15:36:02,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:36:02,530 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) Word has length 144 [2025-02-05 15:36:02,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:02,700 INFO L225 Difference]: With dead ends: 66804 [2025-02-05 15:36:02,700 INFO L226 Difference]: Without dead ends: 32869 [2025-02-05 15:36:02,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-02-05 15:36:02,805 INFO L435 NwaCegarLoop]: 790 mSDtfsCounter, 12 mSDsluCounter, 1545 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2335 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:02,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2335 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:36:02,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32869 states. [2025-02-05 15:36:04,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32869 to 32869. [2025-02-05 15:36:04,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32869 states, 24921 states have (on average 1.5384615384615385) internal successors, (38340), 26034 states have internal predecessors, (38340), 5964 states have call successors, (5964), 1218 states have call predecessors, (5964), 1983 states have return successors, (9327), 6048 states have call predecessors, (9327), 5959 states have call successors, (9327) [2025-02-05 15:36:05,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32869 states to 32869 states and 53631 transitions. [2025-02-05 15:36:05,233 INFO L78 Accepts]: Start accepts. Automaton has 32869 states and 53631 transitions. Word has length 144 [2025-02-05 15:36:05,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:05,233 INFO L471 AbstractCegarLoop]: Abstraction has 32869 states and 53631 transitions. [2025-02-05 15:36:05,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-05 15:36:05,233 INFO L276 IsEmpty]: Start isEmpty. Operand 32869 states and 53631 transitions. [2025-02-05 15:36:05,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-05 15:36:05,237 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:05,237 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:36:05,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-05 15:36:05,237 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:05,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:05,237 INFO L85 PathProgramCache]: Analyzing trace with hash 22737742, now seen corresponding path program 1 times [2025-02-05 15:36:05,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:05,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347777284] [2025-02-05 15:36:05,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:05,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:05,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 15:36:05,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 15:36:05,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:05,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:05,511 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 15:36:05,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:05,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347777284] [2025-02-05 15:36:05,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347777284] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:05,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:05,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:36:05,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220510215] [2025-02-05 15:36:05,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:05,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:36:05,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:05,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:36:05,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:36:05,513 INFO L87 Difference]: Start difference. First operand 32869 states and 53631 transitions. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 4 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:36:10,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:10,161 INFO L93 Difference]: Finished difference Result 102616 states and 174741 transitions. [2025-02-05 15:36:10,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:36:10,162 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 4 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) Word has length 144 [2025-02-05 15:36:10,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:10,628 INFO L225 Difference]: With dead ends: 102616 [2025-02-05 15:36:10,628 INFO L226 Difference]: Without dead ends: 69797 [2025-02-05 15:36:10,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:36:10,739 INFO L435 NwaCegarLoop]: 449 mSDtfsCounter, 2017 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 2218 mSolverCounterSat, 455 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2088 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 2673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 455 IncrementalHoareTripleChecker+Valid, 2218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:10,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2088 Valid, 1249 Invalid, 2673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [455 Valid, 2218 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 15:36:10,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69797 states.