./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec3_product19.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_spec3_product19.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 4eb5ae4a2b95fd78cf87e688565203c0839d6de752e442a1cce7638954224909 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:37:17,026 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:37:17,063 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:37:17,067 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:37:17,067 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:37:17,081 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:37:17,082 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:37:17,082 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:37:17,082 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:37:17,082 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:37:17,082 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:37:17,082 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:37:17,082 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:37:17,083 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:37:17,083 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:37:17,083 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:37:17,083 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:37:17,083 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:37:17,083 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:37:17,083 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:37:17,083 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:37:17,083 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:37:17,083 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:37:17,084 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:37:17,084 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:37:17,084 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:37:17,084 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:37:17,084 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:37:17,084 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:37:17,084 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:37:17,084 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:37:17,084 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:37:17,084 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:37:17,085 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:37:17,085 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:37:17,085 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:37:17,085 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:37:17,085 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:37:17,085 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:37:17,085 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:37:17,085 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:37:17,085 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:37:17,085 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:37:17,085 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 -> 4eb5ae4a2b95fd78cf87e688565203c0839d6de752e442a1cce7638954224909 [2025-02-05 15:37:17,268 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:37:17,275 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:37:17,277 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:37:17,277 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:37:17,278 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:37:17,278 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec3_product19.cil.c [2025-02-05 15:37:18,405 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/609efc086/259c5d7f5bae4a50a0d343e7095a5f63/FLAG6b3bb1905 [2025-02-05 15:37:18,747 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:37:18,748 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product19.cil.c [2025-02-05 15:37:18,767 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/609efc086/259c5d7f5bae4a50a0d343e7095a5f63/FLAG6b3bb1905 [2025-02-05 15:37:18,959 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/609efc086/259c5d7f5bae4a50a0d343e7095a5f63 [2025-02-05 15:37:18,962 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:37:18,963 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:37:18,965 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:37:18,965 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:37:18,969 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:37:18,970 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:37:18" (1/1) ... [2025-02-05 15:37:18,970 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47818d6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:37:18, skipping insertion in model container [2025-02-05 15:37:18,972 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:37:18" (1/1) ... [2025-02-05 15:37:19,014 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:37:19,334 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_spec3_product19.cil.c[55726,55739] [2025-02-05 15:37:19,375 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:37:19,389 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:37:19,395 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [48] [2025-02-05 15:37:19,396 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [408] [2025-02-05 15:37:19,396 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [423] [2025-02-05 15:37:19,396 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [789] [2025-02-05 15:37:19,396 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [2329] [2025-02-05 15:37:19,396 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2447] [2025-02-05 15:37:19,396 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [2482] [2025-02-05 15:37:19,396 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2669] [2025-02-05 15:37:19,396 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [2678] [2025-02-05 15:37:19,397 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2769] [2025-02-05 15:37:19,477 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_spec3_product19.cil.c[55726,55739] [2025-02-05 15:37:19,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:37:19,506 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:37:19,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:37:19 WrapperNode [2025-02-05 15:37:19,507 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:37:19,507 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:37:19,507 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:37:19,507 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:37:19,511 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:37:19" (1/1) ... [2025-02-05 15:37:19,528 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:37:19" (1/1) ... [2025-02-05 15:37:19,560 INFO L138 Inliner]: procedures = 92, calls = 346, calls flagged for inlining = 23, calls inlined = 20, statements flattened = 1087 [2025-02-05 15:37:19,561 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:37:19,561 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:37:19,561 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:37:19,561 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:37:19,567 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:37:19" (1/1) ... [2025-02-05 15:37:19,567 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:37:19" (1/1) ... [2025-02-05 15:37:19,571 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:37:19" (1/1) ... [2025-02-05 15:37:19,587 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2025-02-05 15:37:19,588 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:37:19" (1/1) ... [2025-02-05 15:37:19,588 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:37:19" (1/1) ... [2025-02-05 15:37:19,598 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:37:19" (1/1) ... [2025-02-05 15:37:19,599 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:37:19" (1/1) ... [2025-02-05 15:37:19,601 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:37:19" (1/1) ... [2025-02-05 15:37:19,602 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:37:19" (1/1) ... [2025-02-05 15:37:19,606 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:37:19,607 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:37:19,607 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:37:19,607 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:37:19,607 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:37:19" (1/1) ... [2025-02-05 15:37:19,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:37:19,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:37:19,629 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:37:19,631 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:37:19,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:37:19,646 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2025-02-05 15:37:19,646 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2025-02-05 15:37:19,646 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-02-05 15:37:19,646 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-02-05 15:37:19,646 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__weight [2025-02-05 15:37:19,647 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__weight [2025-02-05 15:37:19,647 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-02-05 15:37:19,647 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-02-05 15:37:19,647 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2025-02-05 15:37:19,647 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2025-02-05 15:37:19,647 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-02-05 15:37:19,647 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-02-05 15:37:19,647 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2025-02-05 15:37:19,647 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2025-02-05 15:37:19,647 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-02-05 15:37:19,647 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-02-05 15:37:19,647 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-02-05 15:37:19,648 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-02-05 15:37:19,648 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-02-05 15:37:19,648 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-02-05 15:37:19,648 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-02-05 15:37:19,648 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-02-05 15:37:19,648 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-02-05 15:37:19,648 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-02-05 15:37:19,648 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-02-05 15:37:19,648 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-02-05 15:37:19,648 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-02-05 15:37:19,648 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-02-05 15:37:19,648 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2025-02-05 15:37:19,648 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2025-02-05 15:37:19,648 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2025-02-05 15:37:19,649 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2025-02-05 15:37:19,649 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-02-05 15:37:19,649 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-02-05 15:37:19,649 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2025-02-05 15:37:19,649 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2025-02-05 15:37:19,649 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-02-05 15:37:19,649 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-02-05 15:37:19,649 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-02-05 15:37:19,649 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-02-05 15:37:19,649 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-02-05 15:37:19,649 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-02-05 15:37:19,649 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-02-05 15:37:19,649 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-02-05 15:37:19,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:37:19,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 15:37:19,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 15:37:19,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 15:37:19,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-05 15:37:19,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-05 15:37:19,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-05 15:37:19,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-05 15:37:19,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-05 15:37:19,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-05 15:37:19,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-05 15:37:19,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-05 15:37:19,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-05 15:37:19,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-05 15:37:19,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-05 15:37:19,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-05 15:37:19,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-05 15:37:19,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-05 15:37:19,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-02-05 15:37:19,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-02-05 15:37:19,655 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2025-02-05 15:37:19,655 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2025-02-05 15:37:19,655 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-02-05 15:37:19,655 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-02-05 15:37:19,655 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-02-05 15:37:19,655 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-02-05 15:37:19,655 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-02-05 15:37:19,655 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-02-05 15:37:19,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:37:19,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:37:19,655 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-02-05 15:37:19,655 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-02-05 15:37:19,810 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:37:19,812 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:37:19,837 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1082: #res := ~retValue_acc~9; [2025-02-05 15:37:19,854 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2366: #res := ~retValue_acc~22; [2025-02-05 15:37:19,867 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1686: #res := ~retValue_acc~16; [2025-02-05 15:37:19,891 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2317: #res := ~retValue_acc~20; [2025-02-05 15:37:20,060 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1596: #res#1 := ~retValue_acc~14#1; [2025-02-05 15:37:20,061 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1567-1: stopRequestedInDirection__wrappee__weight_#res#1 := stopRequestedInDirection__wrappee__weight_~retValue_acc~13#1; [2025-02-05 15:37:20,069 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1731: #res := ~retValue_acc~18; [2025-02-05 15:37:20,135 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1202-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~11#1; [2025-02-05 15:37:20,136 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1215-1: isIdle_#res#1 := isIdle_~retValue_acc~12#1; [2025-02-05 15:37:20,295 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1717-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~17#1; [2025-02-05 15:37:20,299 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3427: #res := ~retValue_acc~29; [2025-02-05 15:37:20,309 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2444: #res := ~retValue_acc~24; [2025-02-05 15:37:20,310 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L877: #res := ~retValue_acc~5; [2025-02-05 15:37:20,312 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1030: #res := ~retValue_acc~6; [2025-02-05 15:37:20,467 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2405: #res := ~retValue_acc~23; [2025-02-05 15:37:20,482 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1073: #res := ~retValue_acc~8; [2025-02-05 15:37:20,560 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3116: #res := ~retValue_acc~28; [2025-02-05 15:37:20,607 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L405-1: main_#res#1 := main_~retValue_acc~1#1; [2025-02-05 15:37:20,607 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2479-1: valid_product_#res#1 := valid_product_~retValue_acc~26#1; [2025-02-05 15:37:20,615 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2880: #res := ~retValue_acc~27; [2025-02-05 15:37:20,723 INFO L? ?]: Removed 457 outVars from TransFormulas that were not future-live. [2025-02-05 15:37:20,724 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:37:20,742 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:37:20,742 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:37:20,742 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:37:20 BoogieIcfgContainer [2025-02-05 15:37:20,743 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:37:20,748 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:37:20,748 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:37:20,751 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:37:20,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:37:18" (1/3) ... [2025-02-05 15:37:20,752 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63a2de73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:37:20, skipping insertion in model container [2025-02-05 15:37:20,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:37:19" (2/3) ... [2025-02-05 15:37:20,752 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63a2de73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:37:20, skipping insertion in model container [2025-02-05 15:37:20,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:37:20" (3/3) ... [2025-02-05 15:37:20,753 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product19.cil.c [2025-02-05 15:37:20,765 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:37:20,766 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec3_product19.cil.c that has 28 procedures, 589 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:37:20,838 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:37:20,852 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;@3d878237, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:37:20,852 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:37:20,856 INFO L276 IsEmpty]: Start isEmpty. Operand has 589 states, 451 states have (on average 1.6674057649667406) internal successors, (752), 470 states have internal predecessors, (752), 108 states have call successors, (108), 27 states have call predecessors, (108), 27 states have return successors, (108), 105 states have call predecessors, (108), 108 states have call successors, (108) [2025-02-05 15:37:20,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-05 15:37:20,873 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:20,874 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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] [2025-02-05 15:37:20,875 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:20,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:20,878 INFO L85 PathProgramCache]: Analyzing trace with hash -762808819, now seen corresponding path program 1 times [2025-02-05 15:37:20,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:20,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623749929] [2025-02-05 15:37:20,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:20,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:20,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-05 15:37:21,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-05 15:37:21,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:21,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:21,507 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 15:37:21,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:21,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623749929] [2025-02-05 15:37:21,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623749929] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:21,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:21,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:37:21,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206790223] [2025-02-05 15:37:21,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:21,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:37:21,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:21,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:37:21,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:37:21,530 INFO L87 Difference]: Start difference. First operand has 589 states, 451 states have (on average 1.6674057649667406) internal successors, (752), 470 states have internal predecessors, (752), 108 states have call successors, (108), 27 states have call predecessors, (108), 27 states have return successors, (108), 105 states have call predecessors, (108), 108 states have call successors, (108) Second operand has 7 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:37:21,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:21,690 INFO L93 Difference]: Finished difference Result 1175 states and 1948 transitions. [2025-02-05 15:37:21,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:37:21,692 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 113 [2025-02-05 15:37:21,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:21,702 INFO L225 Difference]: With dead ends: 1175 [2025-02-05 15:37:21,702 INFO L226 Difference]: Without dead ends: 593 [2025-02-05 15:37:21,708 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:37:21,709 INFO L435 NwaCegarLoop]: 953 mSDtfsCounter, 91 mSDsluCounter, 4679 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 5632 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:21,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 5632 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:37:21,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-02-05 15:37:21,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 591. [2025-02-05 15:37:21,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 454 states have (on average 1.6607929515418502) internal successors, (754), 472 states have internal predecessors, (754), 109 states have call successors, (109), 27 states have call predecessors, (109), 27 states have return successors, (108), 104 states have call predecessors, (108), 106 states have call successors, (108) [2025-02-05 15:37:21,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 971 transitions. [2025-02-05 15:37:21,766 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 971 transitions. Word has length 113 [2025-02-05 15:37:21,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:21,767 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 971 transitions. [2025-02-05 15:37:21,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:37:21,767 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 971 transitions. [2025-02-05 15:37:21,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-05 15:37:21,771 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:21,772 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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] [2025-02-05 15:37:21,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 15:37:21,772 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:21,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:21,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1967448154, now seen corresponding path program 1 times [2025-02-05 15:37:21,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:21,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742094923] [2025-02-05 15:37:21,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:21,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:21,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-05 15:37:21,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-05 15:37:21,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:21,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:21,909 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 15:37:21,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:21,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742094923] [2025-02-05 15:37:21,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742094923] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:21,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:21,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:37:21,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557657155] [2025-02-05 15:37:21,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:21,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:37:21,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:21,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:37:21,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:37:21,911 INFO L87 Difference]: Start difference. First operand 591 states and 971 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:37:21,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:21,963 INFO L93 Difference]: Finished difference Result 1164 states and 1923 transitions. [2025-02-05 15:37:21,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:37:21,963 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 114 [2025-02-05 15:37:21,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:21,966 INFO L225 Difference]: With dead ends: 1164 [2025-02-05 15:37:21,967 INFO L226 Difference]: Without dead ends: 567 [2025-02-05 15:37:21,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:37:21,969 INFO L435 NwaCegarLoop]: 941 mSDtfsCounter, 14 mSDsluCounter, 1877 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2818 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:21,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2818 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:37:21,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-02-05 15:37:21,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 567. [2025-02-05 15:37:21,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 433 states have (on average 1.651270207852194) internal successors, (715), 449 states have internal predecessors, (715), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 103 states have call predecessors, (105), 105 states have call successors, (105) [2025-02-05 15:37:21,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 928 transitions. [2025-02-05 15:37:21,995 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 928 transitions. Word has length 114 [2025-02-05 15:37:21,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:21,995 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 928 transitions. [2025-02-05 15:37:21,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:37:21,995 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 928 transitions. [2025-02-05 15:37:21,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-05 15:37:21,999 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:21,999 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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] [2025-02-05 15:37:21,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 15:37:21,999 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:22,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:22,000 INFO L85 PathProgramCache]: Analyzing trace with hash -292698083, now seen corresponding path program 1 times [2025-02-05 15:37:22,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:22,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390249197] [2025-02-05 15:37:22,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:22,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:22,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-05 15:37:22,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-05 15:37:22,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:22,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:22,270 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 15:37:22,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:22,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390249197] [2025-02-05 15:37:22,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390249197] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:22,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:22,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:37:22,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91838099] [2025-02-05 15:37:22,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:22,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:37:22,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:22,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:37:22,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:37:22,271 INFO L87 Difference]: Start difference. First operand 567 states and 928 transitions. Second operand has 7 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:37:22,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:22,383 INFO L93 Difference]: Finished difference Result 1127 states and 1855 transitions. [2025-02-05 15:37:22,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:37:22,383 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 114 [2025-02-05 15:37:22,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:22,389 INFO L225 Difference]: With dead ends: 1127 [2025-02-05 15:37:22,390 INFO L226 Difference]: Without dead ends: 561 [2025-02-05 15:37:22,393 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:37:22,393 INFO L435 NwaCegarLoop]: 917 mSDtfsCounter, 77 mSDsluCounter, 4515 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 5432 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:22,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 5432 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:37:22,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2025-02-05 15:37:22,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2025-02-05 15:37:22,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 427 states have (on average 1.6440281030444965) internal successors, (702), 443 states have internal predecessors, (702), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 103 states have call predecessors, (105), 105 states have call successors, (105) [2025-02-05 15:37:22,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 915 transitions. [2025-02-05 15:37:22,433 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 915 transitions. Word has length 114 [2025-02-05 15:37:22,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:22,434 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 915 transitions. [2025-02-05 15:37:22,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:37:22,435 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 915 transitions. [2025-02-05 15:37:22,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-05 15:37:22,440 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:22,440 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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] [2025-02-05 15:37:22,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 15:37:22,440 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:22,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:22,441 INFO L85 PathProgramCache]: Analyzing trace with hash 546064103, now seen corresponding path program 1 times [2025-02-05 15:37:22,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:22,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187314667] [2025-02-05 15:37:22,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:22,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:22,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-05 15:37:22,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-05 15:37:22,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:22,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:22,683 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 15:37:22,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:22,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187314667] [2025-02-05 15:37:22,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187314667] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:22,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:22,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:37:22,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998549920] [2025-02-05 15:37:22,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:22,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:37:22,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:22,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:37:22,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:37:22,687 INFO L87 Difference]: Start difference. First operand 561 states and 915 transitions. Second operand has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:37:22,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:22,768 INFO L93 Difference]: Finished difference Result 1115 states and 1829 transitions. [2025-02-05 15:37:22,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:37:22,769 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 115 [2025-02-05 15:37:22,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:22,774 INFO L225 Difference]: With dead ends: 1115 [2025-02-05 15:37:22,774 INFO L226 Difference]: Without dead ends: 555 [2025-02-05 15:37:22,777 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:37:22,778 INFO L435 NwaCegarLoop]: 905 mSDtfsCounter, 63 mSDsluCounter, 4467 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 5372 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:22,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 5372 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:37:22,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2025-02-05 15:37:22,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2025-02-05 15:37:22,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 421 states have (on average 1.6365795724465557) internal successors, (689), 437 states have internal predecessors, (689), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 103 states have call predecessors, (105), 105 states have call successors, (105) [2025-02-05 15:37:22,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 902 transitions. [2025-02-05 15:37:22,810 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 902 transitions. Word has length 115 [2025-02-05 15:37:22,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:22,811 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 902 transitions. [2025-02-05 15:37:22,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:37:22,811 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 902 transitions. [2025-02-05 15:37:22,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-05 15:37:22,815 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:22,815 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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] [2025-02-05 15:37:22,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 15:37:22,815 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:22,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:22,816 INFO L85 PathProgramCache]: Analyzing trace with hash -71880649, now seen corresponding path program 1 times [2025-02-05 15:37:22,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:22,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578589904] [2025-02-05 15:37:22,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:22,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:22,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-05 15:37:22,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-05 15:37:22,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:22,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:22,994 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 15:37:22,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:22,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578589904] [2025-02-05 15:37:22,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578589904] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:22,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:22,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:37:22,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092805279] [2025-02-05 15:37:22,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:22,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:37:22,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:22,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:37:22,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:37:22,996 INFO L87 Difference]: Start difference. First operand 555 states and 902 transitions. Second operand has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:37:23,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:23,087 INFO L93 Difference]: Finished difference Result 1103 states and 1803 transitions. [2025-02-05 15:37:23,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:37:23,088 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 116 [2025-02-05 15:37:23,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:23,091 INFO L225 Difference]: With dead ends: 1103 [2025-02-05 15:37:23,091 INFO L226 Difference]: Without dead ends: 549 [2025-02-05 15:37:23,098 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:37:23,099 INFO L435 NwaCegarLoop]: 893 mSDtfsCounter, 49 mSDsluCounter, 4419 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 5312 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:23,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 5312 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:37:23,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-02-05 15:37:23,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 549. [2025-02-05 15:37:23,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 415 states have (on average 1.6289156626506025) internal successors, (676), 431 states have internal predecessors, (676), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 103 states have call predecessors, (105), 105 states have call successors, (105) [2025-02-05 15:37:23,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 889 transitions. [2025-02-05 15:37:23,133 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 889 transitions. Word has length 116 [2025-02-05 15:37:23,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:23,133 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 889 transitions. [2025-02-05 15:37:23,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:37:23,134 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 889 transitions. [2025-02-05 15:37:23,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-05 15:37:23,136 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:23,136 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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] [2025-02-05 15:37:23,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 15:37:23,137 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:23,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:23,137 INFO L85 PathProgramCache]: Analyzing trace with hash 692254319, now seen corresponding path program 1 times [2025-02-05 15:37:23,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:23,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777281770] [2025-02-05 15:37:23,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:23,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:23,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-05 15:37:23,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-05 15:37:23,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:23,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:23,283 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 15:37:23,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:23,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777281770] [2025-02-05 15:37:23,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777281770] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:23,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:23,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:37:23,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841333192] [2025-02-05 15:37:23,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:23,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:37:23,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:23,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:37:23,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:37:23,285 INFO L87 Difference]: Start difference. First operand 549 states and 889 transitions. Second operand has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:37:23,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:23,340 INFO L93 Difference]: Finished difference Result 1091 states and 1777 transitions. [2025-02-05 15:37:23,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:37:23,341 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 116 [2025-02-05 15:37:23,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:23,345 INFO L225 Difference]: With dead ends: 1091 [2025-02-05 15:37:23,346 INFO L226 Difference]: Without dead ends: 549 [2025-02-05 15:37:23,348 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:37:23,349 INFO L435 NwaCegarLoop]: 881 mSDtfsCounter, 24 mSDsluCounter, 4383 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 5264 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:23,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 5264 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:37:23,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-02-05 15:37:23,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 549. [2025-02-05 15:37:23,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 415 states have (on average 1.6265060240963856) internal successors, (675), 431 states have internal predecessors, (675), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 103 states have call predecessors, (105), 105 states have call successors, (105) [2025-02-05 15:37:23,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 888 transitions. [2025-02-05 15:37:23,376 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 888 transitions. Word has length 116 [2025-02-05 15:37:23,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:23,377 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 888 transitions. [2025-02-05 15:37:23,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:37:23,377 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 888 transitions. [2025-02-05 15:37:23,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-02-05 15:37:23,381 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:23,382 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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] [2025-02-05 15:37:23,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:37:23,382 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:23,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:23,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1396899777, now seen corresponding path program 1 times [2025-02-05 15:37:23,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:23,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231583812] [2025-02-05 15:37:23,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:23,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:23,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-05 15:37:23,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-05 15:37:23,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:23,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:23,499 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 15:37:23,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:23,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231583812] [2025-02-05 15:37:23,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231583812] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:23,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:23,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:37:23,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590309297] [2025-02-05 15:37:23,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:23,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:37:23,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:23,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:37:23,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:37:23,501 INFO L87 Difference]: Start difference. First operand 549 states and 888 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:37:23,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:23,543 INFO L93 Difference]: Finished difference Result 1082 states and 1762 transitions. [2025-02-05 15:37:23,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:37:23,544 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 117 [2025-02-05 15:37:23,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:23,547 INFO L225 Difference]: With dead ends: 1082 [2025-02-05 15:37:23,547 INFO L226 Difference]: Without dead ends: 549 [2025-02-05 15:37:23,549 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:37:23,550 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 15 mSDsluCounter, 1731 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2604 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:23,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2604 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:37:23,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-02-05 15:37:23,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 549. [2025-02-05 15:37:23,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 415 states have (on average 1.6240963855421686) internal successors, (674), 431 states have internal predecessors, (674), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 103 states have call predecessors, (105), 105 states have call successors, (105) [2025-02-05 15:37:23,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 887 transitions. [2025-02-05 15:37:23,571 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 887 transitions. Word has length 117 [2025-02-05 15:37:23,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:23,571 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 887 transitions. [2025-02-05 15:37:23,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:37:23,571 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 887 transitions. [2025-02-05 15:37:23,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-05 15:37:23,573 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:23,573 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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] [2025-02-05 15:37:23,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:37:23,573 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:23,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:23,574 INFO L85 PathProgramCache]: Analyzing trace with hash 370152703, now seen corresponding path program 1 times [2025-02-05 15:37:23,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:23,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196386144] [2025-02-05 15:37:23,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:23,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:23,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-05 15:37:23,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-05 15:37:23,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:23,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:23,676 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 15:37:23,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:23,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196386144] [2025-02-05 15:37:23,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196386144] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:23,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:23,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:37:23,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862041199] [2025-02-05 15:37:23,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:23,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:37:23,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:23,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:37:23,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:37:23,678 INFO L87 Difference]: Start difference. First operand 549 states and 887 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:37:23,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:23,721 INFO L93 Difference]: Finished difference Result 1082 states and 1760 transitions. [2025-02-05 15:37:23,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:37:23,722 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 118 [2025-02-05 15:37:23,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:23,725 INFO L225 Difference]: With dead ends: 1082 [2025-02-05 15:37:23,725 INFO L226 Difference]: Without dead ends: 549 [2025-02-05 15:37:23,728 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:37:23,729 INFO L435 NwaCegarLoop]: 874 mSDtfsCounter, 14 mSDsluCounter, 1732 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2606 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:23,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2606 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:37:23,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-02-05 15:37:23,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 549. [2025-02-05 15:37:23,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 415 states have (on average 1.621686746987952) internal successors, (673), 431 states have internal predecessors, (673), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 103 states have call predecessors, (105), 105 states have call successors, (105) [2025-02-05 15:37:23,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 886 transitions. [2025-02-05 15:37:23,749 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 886 transitions. Word has length 118 [2025-02-05 15:37:23,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:23,749 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 886 transitions. [2025-02-05 15:37:23,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:37:23,750 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 886 transitions. [2025-02-05 15:37:23,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-05 15:37:23,752 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:23,752 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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] [2025-02-05 15:37:23,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:37:23,752 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:23,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:23,753 INFO L85 PathProgramCache]: Analyzing trace with hash -644902972, now seen corresponding path program 1 times [2025-02-05 15:37:23,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:23,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242715424] [2025-02-05 15:37:23,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:23,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:23,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-05 15:37:23,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-05 15:37:23,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:23,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:23,865 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 15:37:23,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:23,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242715424] [2025-02-05 15:37:23,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242715424] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:23,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:23,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:37:23,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661858256] [2025-02-05 15:37:23,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:23,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:37:23,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:23,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:37:23,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:37:23,867 INFO L87 Difference]: Start difference. First operand 549 states and 886 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:37:23,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:23,901 INFO L93 Difference]: Finished difference Result 1082 states and 1758 transitions. [2025-02-05 15:37:23,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:37:23,901 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 119 [2025-02-05 15:37:23,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:23,904 INFO L225 Difference]: With dead ends: 1082 [2025-02-05 15:37:23,905 INFO L226 Difference]: Without dead ends: 549 [2025-02-05 15:37:23,907 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:37:23,907 INFO L435 NwaCegarLoop]: 875 mSDtfsCounter, 13 mSDsluCounter, 1733 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2608 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:37:23,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2608 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:37:23,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-02-05 15:37:23,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 549. [2025-02-05 15:37:23,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 415 states have (on average 1.619277108433735) internal successors, (672), 431 states have internal predecessors, (672), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 103 states have call predecessors, (105), 105 states have call successors, (105) [2025-02-05 15:37:23,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 885 transitions. [2025-02-05 15:37:23,923 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 885 transitions. Word has length 119 [2025-02-05 15:37:23,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:23,924 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 885 transitions. [2025-02-05 15:37:23,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:37:23,924 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 885 transitions. [2025-02-05 15:37:23,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-05 15:37:23,926 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:23,926 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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] [2025-02-05 15:37:23,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:37:23,926 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:23,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:23,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1297525278, now seen corresponding path program 1 times [2025-02-05 15:37:23,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:23,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506337042] [2025-02-05 15:37:23,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:23,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:23,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-05 15:37:23,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-05 15:37:23,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:23,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:24,011 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 15:37:24,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:24,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506337042] [2025-02-05 15:37:24,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506337042] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:24,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:24,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:37:24,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703028370] [2025-02-05 15:37:24,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:24,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:37:24,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:24,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:37:24,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:37:24,013 INFO L87 Difference]: Start difference. First operand 549 states and 885 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:37:24,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:24,045 INFO L93 Difference]: Finished difference Result 1082 states and 1756 transitions. [2025-02-05 15:37:24,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:37:24,046 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 120 [2025-02-05 15:37:24,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:24,049 INFO L225 Difference]: With dead ends: 1082 [2025-02-05 15:37:24,049 INFO L226 Difference]: Without dead ends: 549 [2025-02-05 15:37:24,051 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:37:24,052 INFO L435 NwaCegarLoop]: 876 mSDtfsCounter, 12 mSDsluCounter, 1734 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2610 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:24,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2610 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:37:24,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-02-05 15:37:24,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 549. [2025-02-05 15:37:24,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 415 states have (on average 1.616867469879518) internal successors, (671), 431 states have internal predecessors, (671), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 103 states have call predecessors, (105), 105 states have call successors, (105) [2025-02-05 15:37:24,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 884 transitions. [2025-02-05 15:37:24,068 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 884 transitions. Word has length 120 [2025-02-05 15:37:24,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:24,068 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 884 transitions. [2025-02-05 15:37:24,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:37:24,068 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 884 transitions. [2025-02-05 15:37:24,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-05 15:37:24,070 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:24,070 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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] [2025-02-05 15:37:24,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 15:37:24,071 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:24,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:24,071 INFO L85 PathProgramCache]: Analyzing trace with hash 695352263, now seen corresponding path program 1 times [2025-02-05 15:37:24,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:24,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719105044] [2025-02-05 15:37:24,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:24,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:24,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-05 15:37:24,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-05 15:37:24,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:24,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:24,234 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-05 15:37:24,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:24,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719105044] [2025-02-05 15:37:24,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719105044] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:37:24,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230749916] [2025-02-05 15:37:24,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:24,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:37:24,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:37:24,237 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:37:24,239 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:37:24,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-05 15:37:24,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-05 15:37:24,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:24,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:24,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 1642 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 15:37:24,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:37:24,663 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 15:37:24,665 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:37:24,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230749916] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:24,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:37:24,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-02-05 15:37:24,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250687380] [2025-02-05 15:37:24,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:24,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:37:24,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:24,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:37:24,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:37:24,667 INFO L87 Difference]: Start difference. First operand 549 states and 884 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:37:24,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:24,733 INFO L93 Difference]: Finished difference Result 1558 states and 2540 transitions. [2025-02-05 15:37:24,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:37:24,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 121 [2025-02-05 15:37:24,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:24,741 INFO L225 Difference]: With dead ends: 1558 [2025-02-05 15:37:24,741 INFO L226 Difference]: Without dead ends: 1027 [2025-02-05 15:37:24,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:37:24,745 INFO L435 NwaCegarLoop]: 1510 mSDtfsCounter, 808 mSDsluCounter, 779 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 808 SdHoareTripleChecker+Valid, 2289 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:24,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [808 Valid, 2289 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:37:24,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2025-02-05 15:37:24,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 1012. [2025-02-05 15:37:24,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 772 states have (on average 1.6295336787564767) internal successors, (1258), 803 states have internal predecessors, (1258), 191 states have call successors, (191), 49 states have call predecessors, (191), 48 states have return successors, (193), 185 states have call predecessors, (193), 188 states have call successors, (193) [2025-02-05 15:37:24,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1642 transitions. [2025-02-05 15:37:24,785 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1642 transitions. Word has length 121 [2025-02-05 15:37:24,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:24,786 INFO L471 AbstractCegarLoop]: Abstraction has 1012 states and 1642 transitions. [2025-02-05 15:37:24,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:37:24,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1642 transitions. [2025-02-05 15:37:24,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-05 15:37:24,790 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:24,790 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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] [2025-02-05 15:37:24,799 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:37:24,991 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,SelfDestructingSolverStorable10 [2025-02-05 15:37:24,991 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:24,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:24,992 INFO L85 PathProgramCache]: Analyzing trace with hash -712089278, now seen corresponding path program 1 times [2025-02-05 15:37:24,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:24,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116920798] [2025-02-05 15:37:24,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:24,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:25,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-05 15:37:25,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-05 15:37:25,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:25,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:25,164 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-05 15:37:25,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:25,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116920798] [2025-02-05 15:37:25,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116920798] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:37:25,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428652845] [2025-02-05 15:37:25,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:25,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:37:25,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:37:25,167 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:37:25,172 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:37:25,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-05 15:37:25,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-05 15:37:25,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:25,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:25,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 1643 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 15:37:25,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:37:25,562 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 15:37:25,562 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:37:25,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428652845] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:25,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:37:25,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-02-05 15:37:25,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925593632] [2025-02-05 15:37:25,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:25,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:37:25,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:25,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:37:25,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:37:25,564 INFO L87 Difference]: Start difference. First operand 1012 states and 1642 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:37:25,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:25,631 INFO L93 Difference]: Finished difference Result 2484 states and 4058 transitions. [2025-02-05 15:37:25,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:37:25,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 122 [2025-02-05 15:37:25,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:25,640 INFO L225 Difference]: With dead ends: 2484 [2025-02-05 15:37:25,641 INFO L226 Difference]: Without dead ends: 1490 [2025-02-05 15:37:25,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:37:25,645 INFO L435 NwaCegarLoop]: 1567 mSDtfsCounter, 809 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 2345 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:25,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 2345 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:37:25,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2025-02-05 15:37:25,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 1442. [2025-02-05 15:37:25,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1442 states, 1102 states have (on average 1.6415607985480944) internal successors, (1809), 1148 states have internal predecessors, (1809), 271 states have call successors, (271), 68 states have call predecessors, (271), 68 states have return successors, (278), 264 states have call predecessors, (278), 268 states have call successors, (278) [2025-02-05 15:37:25,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1442 states to 1442 states and 2358 transitions. [2025-02-05 15:37:25,704 INFO L78 Accepts]: Start accepts. Automaton has 1442 states and 2358 transitions. Word has length 122 [2025-02-05 15:37:25,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:25,704 INFO L471 AbstractCegarLoop]: Abstraction has 1442 states and 2358 transitions. [2025-02-05 15:37:25,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:37:25,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1442 states and 2358 transitions. [2025-02-05 15:37:25,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-05 15:37:25,708 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:25,708 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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] [2025-02-05 15:37:25,716 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:37:25,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:37:25,913 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:25,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:25,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1424314212, now seen corresponding path program 1 times [2025-02-05 15:37:25,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:25,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742571120] [2025-02-05 15:37:25,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:25,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:25,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-05 15:37:25,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 15:37:25,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:25,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:26,041 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 15:37:26,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:26,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742571120] [2025-02-05 15:37:26,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742571120] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:26,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:26,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:37:26,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870037383] [2025-02-05 15:37:26,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:26,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:37:26,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:26,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:37:26,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:37:26,044 INFO L87 Difference]: Start difference. First operand 1442 states and 2358 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-05 15:37:26,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:26,548 INFO L93 Difference]: Finished difference Result 4262 states and 7075 transitions. [2025-02-05 15:37:26,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:37:26,549 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) Word has length 124 [2025-02-05 15:37:26,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:26,565 INFO L225 Difference]: With dead ends: 4262 [2025-02-05 15:37:26,566 INFO L226 Difference]: Without dead ends: 2838 [2025-02-05 15:37:26,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:37:26,575 INFO L435 NwaCegarLoop]: 987 mSDtfsCounter, 873 mSDsluCounter, 3556 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 4543 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:26,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 4543 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 15:37:26,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2838 states. [2025-02-05 15:37:26,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2838 to 2791. [2025-02-05 15:37:26,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2791 states, 2137 states have (on average 1.6448291998128217) internal successors, (3515), 2225 states have internal predecessors, (3515), 521 states have call successors, (521), 130 states have call predecessors, (521), 132 states have return successors, (597), 513 states have call predecessors, (597), 517 states have call successors, (597) [2025-02-05 15:37:26,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2791 states to 2791 states and 4633 transitions. [2025-02-05 15:37:26,702 INFO L78 Accepts]: Start accepts. Automaton has 2791 states and 4633 transitions. Word has length 124 [2025-02-05 15:37:26,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:26,704 INFO L471 AbstractCegarLoop]: Abstraction has 2791 states and 4633 transitions. [2025-02-05 15:37:26,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-05 15:37:26,704 INFO L276 IsEmpty]: Start isEmpty. Operand 2791 states and 4633 transitions. [2025-02-05 15:37:26,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-05 15:37:26,709 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:26,709 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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] [2025-02-05 15:37:26,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 15:37:26,710 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:26,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:26,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1118311592, now seen corresponding path program 1 times [2025-02-05 15:37:26,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:26,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854114404] [2025-02-05 15:37:26,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:26,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:26,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-05 15:37:26,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-05 15:37:26,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:26,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:26,898 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-05 15:37:26,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:26,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854114404] [2025-02-05 15:37:26,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854114404] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:37:26,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958619109] [2025-02-05 15:37:26,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:26,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:37:26,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:37:26,901 INFO L229 MonitoredProcess]: Starting monitored process 4 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:37:26,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 15:37:27,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-05 15:37:27,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-05 15:37:27,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:27,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:27,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 1661 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 15:37:27,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:37:27,315 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 15:37:27,315 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:37:27,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958619109] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:27,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:37:27,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-02-05 15:37:27,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583857308] [2025-02-05 15:37:27,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:27,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:37:27,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:27,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:37:27,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:37:27,317 INFO L87 Difference]: Start difference. First operand 2791 states and 4633 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-05 15:37:27,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:27,609 INFO L93 Difference]: Finished difference Result 8083 states and 13604 transitions. [2025-02-05 15:37:27,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:37:27,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 125 [2025-02-05 15:37:27,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:27,646 INFO L225 Difference]: With dead ends: 8083 [2025-02-05 15:37:27,646 INFO L226 Difference]: Without dead ends: 5311 [2025-02-05 15:37:27,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:37:27,667 INFO L435 NwaCegarLoop]: 908 mSDtfsCounter, 718 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 1697 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:27,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 1697 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:37:27,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5311 states. [2025-02-05 15:37:27,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5311 to 5274. [2025-02-05 15:37:27,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5274 states, 4024 states have (on average 1.6123260437375746) internal successors, (6488), 4198 states have internal predecessors, (6488), 990 states have call successors, (990), 254 states have call predecessors, (990), 259 states have return successors, (1239), 977 states have call predecessors, (1239), 984 states have call successors, (1239) [2025-02-05 15:37:27,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5274 states to 5274 states and 8717 transitions. [2025-02-05 15:37:27,957 INFO L78 Accepts]: Start accepts. Automaton has 5274 states and 8717 transitions. Word has length 125 [2025-02-05 15:37:27,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:27,957 INFO L471 AbstractCegarLoop]: Abstraction has 5274 states and 8717 transitions. [2025-02-05 15:37:27,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-05 15:37:27,957 INFO L276 IsEmpty]: Start isEmpty. Operand 5274 states and 8717 transitions. [2025-02-05 15:37:27,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-05 15:37:27,962 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:27,962 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 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] [2025-02-05 15:37:27,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 15:37:28,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:37:28,163 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:28,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:28,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1393425773, now seen corresponding path program 1 times [2025-02-05 15:37:28,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:28,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117503993] [2025-02-05 15:37:28,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:28,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:28,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-05 15:37:28,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-05 15:37:28,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:28,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:28,361 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-05 15:37:28,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:28,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117503993] [2025-02-05 15:37:28,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117503993] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:37:28,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145290040] [2025-02-05 15:37:28,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:28,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:37:28,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:37:28,366 INFO L229 MonitoredProcess]: Starting monitored process 5 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:37:28,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 15:37:28,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-05 15:37:28,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-05 15:37:28,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:28,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:28,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 1654 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:37:28,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:37:28,646 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 15:37:28,647 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:37:28,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145290040] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:28,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:37:28,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-02-05 15:37:28,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246364113] [2025-02-05 15:37:28,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:28,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:37:28,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:28,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:37:28,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:37:28,648 INFO L87 Difference]: Start difference. First operand 5274 states and 8717 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:37:29,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:29,010 INFO L93 Difference]: Finished difference Result 15708 states and 26284 transitions. [2025-02-05 15:37:29,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:37:29,010 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 127 [2025-02-05 15:37:29,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:29,081 INFO L225 Difference]: With dead ends: 15708 [2025-02-05 15:37:29,081 INFO L226 Difference]: Without dead ends: 10455 [2025-02-05 15:37:29,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:37:29,118 INFO L435 NwaCegarLoop]: 884 mSDtfsCounter, 869 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 SdHoareTripleChecker+Valid, 1743 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:29,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [869 Valid, 1743 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:37:29,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10455 states. [2025-02-05 15:37:29,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10455 to 10352. [2025-02-05 15:37:29,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10352 states, 7924 states have (on average 1.6157243816254416) internal successors, (12803), 8252 states have internal predecessors, (12803), 1920 states have call successors, (1920), 490 states have call predecessors, (1920), 507 states have return successors, (2472), 1915 states have call predecessors, (2472), 1910 states have call successors, (2472) [2025-02-05 15:37:29,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10352 states to 10352 states and 17195 transitions. [2025-02-05 15:37:29,530 INFO L78 Accepts]: Start accepts. Automaton has 10352 states and 17195 transitions. Word has length 127 [2025-02-05 15:37:29,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:29,530 INFO L471 AbstractCegarLoop]: Abstraction has 10352 states and 17195 transitions. [2025-02-05 15:37:29,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:37:29,531 INFO L276 IsEmpty]: Start isEmpty. Operand 10352 states and 17195 transitions. [2025-02-05 15:37:29,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-05 15:37:29,534 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:29,535 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 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] [2025-02-05 15:37:29,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 15:37:29,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-05 15:37:29,736 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:29,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:29,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1898984398, now seen corresponding path program 1 times [2025-02-05 15:37:29,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:29,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560782684] [2025-02-05 15:37:29,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:29,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:29,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-05 15:37:29,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-05 15:37:29,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:29,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:29,951 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-05 15:37:29,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:29,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560782684] [2025-02-05 15:37:29,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560782684] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:37:29,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656177940] [2025-02-05 15:37:29,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:29,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:37:29,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:37:29,960 INFO L229 MonitoredProcess]: Starting monitored process 6 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:37:29,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 15:37:30,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-05 15:37:30,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-05 15:37:30,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:30,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:30,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 1653 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-05 15:37:30,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:37:30,303 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 15:37:30,303 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:37:30,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656177940] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:30,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:37:30,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2025-02-05 15:37:30,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757154818] [2025-02-05 15:37:30,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:30,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:37:30,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:30,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:37:30,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:37:30,305 INFO L87 Difference]: Start difference. First operand 10352 states and 17195 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 5 states have internal predecessors, (83), 4 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2025-02-05 15:37:31,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:31,216 INFO L93 Difference]: Finished difference Result 19561 states and 32568 transitions. [2025-02-05 15:37:31,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:37:31,217 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 5 states have internal predecessors, (83), 4 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 127 [2025-02-05 15:37:31,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:31,271 INFO L225 Difference]: With dead ends: 19561 [2025-02-05 15:37:31,271 INFO L226 Difference]: Without dead ends: 9227 [2025-02-05 15:37:31,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-02-05 15:37:31,331 INFO L435 NwaCegarLoop]: 930 mSDtfsCounter, 739 mSDsluCounter, 3142 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 4072 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:31,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 4072 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 15:37:31,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9227 states. [2025-02-05 15:37:31,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9227 to 9205. [2025-02-05 15:37:31,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9205 states, 7065 states have (on average 1.602689313517339) internal successors, (11323), 7340 states have internal predecessors, (11323), 1678 states have call successors, (1678), 446 states have call predecessors, (1678), 461 states have return successors, (2138), 1674 states have call predecessors, (2138), 1668 states have call successors, (2138) [2025-02-05 15:37:31,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9205 states to 9205 states and 15139 transitions. [2025-02-05 15:37:31,712 INFO L78 Accepts]: Start accepts. Automaton has 9205 states and 15139 transitions. Word has length 127 [2025-02-05 15:37:31,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:31,713 INFO L471 AbstractCegarLoop]: Abstraction has 9205 states and 15139 transitions. [2025-02-05 15:37:31,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 5 states have internal predecessors, (83), 4 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2025-02-05 15:37:31,713 INFO L276 IsEmpty]: Start isEmpty. Operand 9205 states and 15139 transitions. [2025-02-05 15:37:31,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-05 15:37:31,716 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:31,716 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 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] [2025-02-05 15:37:31,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-05 15:37:31,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-05 15:37:31,920 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:31,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:31,921 INFO L85 PathProgramCache]: Analyzing trace with hash -403742618, now seen corresponding path program 1 times [2025-02-05 15:37:31,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:31,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659837338] [2025-02-05 15:37:31,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:31,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:31,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-05 15:37:31,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-05 15:37:31,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:31,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:31,989 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-05 15:37:31,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:31,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659837338] [2025-02-05 15:37:31,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659837338] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:31,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:31,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:37:31,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864222461] [2025-02-05 15:37:31,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:31,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:37:31,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:31,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:37:31,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:37:31,991 INFO L87 Difference]: Start difference. First operand 9205 states and 15139 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:37:32,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:32,372 INFO L93 Difference]: Finished difference Result 18440 states and 30673 transitions. [2025-02-05 15:37:32,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:37:32,373 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 127 [2025-02-05 15:37:32,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:32,425 INFO L225 Difference]: With dead ends: 18440 [2025-02-05 15:37:32,425 INFO L226 Difference]: Without dead ends: 9253 [2025-02-05 15:37:32,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:37:32,470 INFO L435 NwaCegarLoop]: 867 mSDtfsCounter, 12 mSDsluCounter, 1709 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2576 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:32,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2576 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:37:32,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9253 states. [2025-02-05 15:37:32,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9253 to 9221. [2025-02-05 15:37:32,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9221 states, 7077 states have (on average 1.6011021619330226) internal successors, (11331), 7352 states have internal predecessors, (11331), 1678 states have call successors, (1678), 454 states have call predecessors, (1678), 465 states have return successors, (2112), 1670 states have call predecessors, (2112), 1668 states have call successors, (2112) [2025-02-05 15:37:32,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9221 states to 9221 states and 15121 transitions. [2025-02-05 15:37:32,741 INFO L78 Accepts]: Start accepts. Automaton has 9221 states and 15121 transitions. Word has length 127 [2025-02-05 15:37:32,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:32,742 INFO L471 AbstractCegarLoop]: Abstraction has 9221 states and 15121 transitions. [2025-02-05 15:37:32,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:37:32,742 INFO L276 IsEmpty]: Start isEmpty. Operand 9221 states and 15121 transitions. [2025-02-05 15:37:32,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-05 15:37:32,746 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:32,746 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 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] [2025-02-05 15:37:32,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 15:37:32,746 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:32,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:32,748 INFO L85 PathProgramCache]: Analyzing trace with hash -277102313, now seen corresponding path program 1 times [2025-02-05 15:37:32,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:32,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158234101] [2025-02-05 15:37:32,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:32,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:32,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-05 15:37:32,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-05 15:37:32,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:32,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:32,925 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-05 15:37:32,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:32,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158234101] [2025-02-05 15:37:32,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158234101] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:32,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:32,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:37:32,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47061537] [2025-02-05 15:37:32,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:32,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:37:32,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:32,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:37:32,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:37:32,926 INFO L87 Difference]: Start difference. First operand 9221 states and 15121 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2025-02-05 15:37:33,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:33,721 INFO L93 Difference]: Finished difference Result 27609 states and 46461 transitions. [2025-02-05 15:37:33,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:37:33,722 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) Word has length 135 [2025-02-05 15:37:33,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:33,906 INFO L225 Difference]: With dead ends: 27609 [2025-02-05 15:37:33,907 INFO L226 Difference]: Without dead ends: 18406 [2025-02-05 15:37:33,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:37:33,937 INFO L435 NwaCegarLoop]: 954 mSDtfsCounter, 867 mSDsluCounter, 3465 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 875 SdHoareTripleChecker+Valid, 4419 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:33,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [875 Valid, 4419 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 15:37:33,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18406 states. [2025-02-05 15:37:34,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18406 to 18305. [2025-02-05 15:37:34,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18305 states, 14060 states have (on average 1.5975817923186344) internal successors, (22462), 14601 states have internal predecessors, (22462), 3311 states have call successors, (3311), 902 states have call predecessors, (3311), 933 states have return successors, (4825), 3313 states have call predecessors, (4825), 3293 states have call successors, (4825) [2025-02-05 15:37:34,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18305 states to 18305 states and 30598 transitions. [2025-02-05 15:37:34,607 INFO L78 Accepts]: Start accepts. Automaton has 18305 states and 30598 transitions. Word has length 135 [2025-02-05 15:37:34,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:34,607 INFO L471 AbstractCegarLoop]: Abstraction has 18305 states and 30598 transitions. [2025-02-05 15:37:34,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2025-02-05 15:37:34,608 INFO L276 IsEmpty]: Start isEmpty. Operand 18305 states and 30598 transitions. [2025-02-05 15:37:34,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-05 15:37:34,612 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:34,612 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 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] [2025-02-05 15:37:34,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 15:37:34,613 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:34,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:34,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1478317184, now seen corresponding path program 1 times [2025-02-05 15:37:34,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:34,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161859538] [2025-02-05 15:37:34,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:34,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:34,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-05 15:37:34,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-05 15:37:34,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:34,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:34,706 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-05 15:37:34,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:34,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161859538] [2025-02-05 15:37:34,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161859538] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:34,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:34,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:37:34,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963598208] [2025-02-05 15:37:34,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:34,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:37:34,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:34,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:37:34,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:37:34,709 INFO L87 Difference]: Start difference. First operand 18305 states and 30598 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:37:35,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:35,593 INFO L93 Difference]: Finished difference Result 36736 states and 62411 transitions. [2025-02-05 15:37:35,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:37:35,593 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 136 [2025-02-05 15:37:35,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:35,710 INFO L225 Difference]: With dead ends: 36736 [2025-02-05 15:37:35,710 INFO L226 Difference]: Without dead ends: 18449 [2025-02-05 15:37:35,804 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:37:35,805 INFO L435 NwaCegarLoop]: 864 mSDtfsCounter, 12 mSDsluCounter, 1706 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2570 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:35,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2570 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:37:35,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18449 states. [2025-02-05 15:37:36,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18449 to 18385. [2025-02-05 15:37:36,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18385 states, 14132 states have (on average 1.595103311633173) internal successors, (22542), 14657 states have internal predecessors, (22542), 3311 states have call successors, (3311), 934 states have call predecessors, (3311), 941 states have return successors, (4785), 3305 states have call predecessors, (4785), 3293 states have call successors, (4785) [2025-02-05 15:37:36,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18385 states to 18385 states and 30638 transitions. [2025-02-05 15:37:36,445 INFO L78 Accepts]: Start accepts. Automaton has 18385 states and 30638 transitions. Word has length 136 [2025-02-05 15:37:36,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:36,446 INFO L471 AbstractCegarLoop]: Abstraction has 18385 states and 30638 transitions. [2025-02-05 15:37:36,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:37:36,446 INFO L276 IsEmpty]: Start isEmpty. Operand 18385 states and 30638 transitions. [2025-02-05 15:37:36,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 15:37:36,451 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:36,451 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 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] [2025-02-05 15:37:36,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 15:37:36,451 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:36,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:36,452 INFO L85 PathProgramCache]: Analyzing trace with hash -23307469, now seen corresponding path program 1 times [2025-02-05 15:37:36,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:36,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776139197] [2025-02-05 15:37:36,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:36,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:36,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 15:37:36,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 15:37:36,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:36,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:36,566 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:37:36,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:36,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776139197] [2025-02-05 15:37:36,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776139197] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:36,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:36,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:37:36,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835322109] [2025-02-05 15:37:36,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:36,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:37:36,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:36,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:37:36,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:37:36,568 INFO L87 Difference]: Start difference. First operand 18385 states and 30638 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-05 15:37:38,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:38,023 INFO L93 Difference]: Finished difference Result 55241 states and 95558 transitions. [2025-02-05 15:37:38,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:37:38,023 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) Word has length 145 [2025-02-05 15:37:38,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:38,260 INFO L225 Difference]: With dead ends: 55241 [2025-02-05 15:37:38,260 INFO L226 Difference]: Without dead ends: 36874 [2025-02-05 15:37:38,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:37:38,380 INFO L435 NwaCegarLoop]: 944 mSDtfsCounter, 863 mSDsluCounter, 3444 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 SdHoareTripleChecker+Valid, 4388 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:38,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [869 Valid, 4388 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 15:37:38,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36874 states. [2025-02-05 15:37:39,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36874 to 36709. [2025-02-05 15:37:39,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36709 states, 28227 states have (on average 1.5916321252701315) internal successors, (44927), 29268 states have internal predecessors, (44927), 6588 states have call successors, (6588), 1862 states have call predecessors, (6588), 1893 states have return successors, (11427), 6602 states have call predecessors, (11427), 6554 states have call successors, (11427) [2025-02-05 15:37:39,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36709 states to 36709 states and 62942 transitions. [2025-02-05 15:37:39,964 INFO L78 Accepts]: Start accepts. Automaton has 36709 states and 62942 transitions. Word has length 145 [2025-02-05 15:37:39,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:39,966 INFO L471 AbstractCegarLoop]: Abstraction has 36709 states and 62942 transitions. [2025-02-05 15:37:39,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-05 15:37:39,966 INFO L276 IsEmpty]: Start isEmpty. Operand 36709 states and 62942 transitions. [2025-02-05 15:37:39,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 15:37:39,972 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:39,972 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 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] [2025-02-05 15:37:39,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 15:37:39,972 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:39,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:39,973 INFO L85 PathProgramCache]: Analyzing trace with hash 602600683, now seen corresponding path program 1 times [2025-02-05 15:37:39,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:39,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759029869] [2025-02-05 15:37:39,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:39,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:39,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 15:37:39,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 15:37:39,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:39,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:40,071 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-05 15:37:40,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:40,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759029869] [2025-02-05 15:37:40,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759029869] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:40,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:40,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:37:40,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293427426] [2025-02-05 15:37:40,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:40,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:37:40,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:40,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:37:40,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:37:40,074 INFO L87 Difference]: Start difference. First operand 36709 states and 62942 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:37:42,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:42,145 INFO L93 Difference]: Finished difference Result 73688 states and 129540 transitions. [2025-02-05 15:37:42,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:37:42,153 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 146 [2025-02-05 15:37:42,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:42,388 INFO L225 Difference]: With dead ends: 73688 [2025-02-05 15:37:42,389 INFO L226 Difference]: Without dead ends: 36997 [2025-02-05 15:37:42,653 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:37:42,654 INFO L435 NwaCegarLoop]: 864 mSDtfsCounter, 11 mSDsluCounter, 1706 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 2570 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:42,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 2570 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:37:42,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36997 states. [2025-02-05 15:37:43,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36997 to 36869. [2025-02-05 15:37:43,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36869 states, 28371 states have (on average 1.5891931902294596) internal successors, (45087), 29412 states have internal predecessors, (45087), 6588 states have call successors, (6588), 1894 states have call predecessors, (6588), 1909 states have return successors, (11371), 6586 states have call predecessors, (11371), 6554 states have call successors, (11371) [2025-02-05 15:37:44,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36869 states to 36869 states and 63046 transitions. [2025-02-05 15:37:44,316 INFO L78 Accepts]: Start accepts. Automaton has 36869 states and 63046 transitions. Word has length 146 [2025-02-05 15:37:44,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:44,317 INFO L471 AbstractCegarLoop]: Abstraction has 36869 states and 63046 transitions. [2025-02-05 15:37:44,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:37:44,317 INFO L276 IsEmpty]: Start isEmpty. Operand 36869 states and 63046 transitions. [2025-02-05 15:37:44,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 15:37:44,322 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:44,322 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 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] [2025-02-05 15:37:44,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 15:37:44,323 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:44,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:44,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1633904045, now seen corresponding path program 1 times [2025-02-05 15:37:44,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:44,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086806980] [2025-02-05 15:37:44,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:44,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:44,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 15:37:44,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 15:37:44,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:44,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:44,465 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-02-05 15:37:44,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:44,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086806980] [2025-02-05 15:37:44,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086806980] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:44,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:44,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:37:44,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959447825] [2025-02-05 15:37:44,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:44,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:37:44,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:44,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:37:44,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:37:44,467 INFO L87 Difference]: Start difference. First operand 36869 states and 63046 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 5 states have internal predecessors, (94), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) [2025-02-05 15:37:47,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:47,963 INFO L93 Difference]: Finished difference Result 110929 states and 200578 transitions. [2025-02-05 15:37:47,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:37:47,963 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 5 states have internal predecessors, (94), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) Word has length 156 [2025-02-05 15:37:47,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:48,606 INFO L225 Difference]: With dead ends: 110929 [2025-02-05 15:37:48,607 INFO L226 Difference]: Without dead ends: 74078 [2025-02-05 15:37:48,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:37:48,902 INFO L435 NwaCegarLoop]: 935 mSDtfsCounter, 859 mSDsluCounter, 3425 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 4360 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:48,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [863 Valid, 4360 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 15:37:48,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74078 states. [2025-02-05 15:37:51,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74078 to 73785. [2025-02-05 15:37:51,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73785 states, 56786 states have (on average 1.5865882435811645) internal successors, (90096), 58859 states have internal predecessors, (90096), 13153 states have call successors, (13153), 3782 states have call predecessors, (13153), 3845 states have return successors, (28385), 13191 states have call predecessors, (28385), 13087 states have call successors, (28385) [2025-02-05 15:37:52,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73785 states to 73785 states and 131634 transitions. [2025-02-05 15:37:52,236 INFO L78 Accepts]: Start accepts. Automaton has 73785 states and 131634 transitions. Word has length 156 [2025-02-05 15:37:52,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:52,236 INFO L471 AbstractCegarLoop]: Abstraction has 73785 states and 131634 transitions. [2025-02-05 15:37:52,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 5 states have internal predecessors, (94), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) [2025-02-05 15:37:52,237 INFO L276 IsEmpty]: Start isEmpty. Operand 73785 states and 131634 transitions. [2025-02-05 15:37:52,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-05 15:37:52,241 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:52,241 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 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] [2025-02-05 15:37:52,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 15:37:52,241 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:52,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:52,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1055204936, now seen corresponding path program 1 times [2025-02-05 15:37:52,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:52,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109305891] [2025-02-05 15:37:52,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:52,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:52,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-05 15:37:52,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-05 15:37:52,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:52,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:52,305 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-02-05 15:37:52,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:52,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109305891] [2025-02-05 15:37:52,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109305891] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:52,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:52,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:37:52,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919990796] [2025-02-05 15:37:52,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:52,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:37:52,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:52,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:37:52,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:37:52,307 INFO L87 Difference]: Start difference. First operand 73785 states and 131634 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:37:57,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:57,632 INFO L93 Difference]: Finished difference Result 148192 states and 274705 transitions. [2025-02-05 15:37:57,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:37:57,632 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 157 [2025-02-05 15:37:57,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:58,093 INFO L225 Difference]: With dead ends: 148192 [2025-02-05 15:37:58,094 INFO L226 Difference]: Without dead ends: 74425 [2025-02-05 15:37:58,827 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:37:58,827 INFO L435 NwaCegarLoop]: 864 mSDtfsCounter, 10 mSDsluCounter, 1706 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2570 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:58,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2570 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:37:58,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74425 states. [2025-02-05 15:38:01,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74425 to 74169. [2025-02-05 15:38:01,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74169 states, 57138 states have (on average 1.5835346004410376) internal successors, (90480), 59211 states have internal predecessors, (90480), 13153 states have call successors, (13153), 3846 states have call predecessors, (13153), 3877 states have return successors, (28321), 13159 states have call predecessors, (28321), 13087 states have call successors, (28321) [2025-02-05 15:38:02,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74169 states to 74169 states and 131954 transitions. [2025-02-05 15:38:02,268 INFO L78 Accepts]: Start accepts. Automaton has 74169 states and 131954 transitions. Word has length 157 [2025-02-05 15:38:02,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:02,269 INFO L471 AbstractCegarLoop]: Abstraction has 74169 states and 131954 transitions. [2025-02-05 15:38:02,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:38:02,269 INFO L276 IsEmpty]: Start isEmpty. Operand 74169 states and 131954 transitions. [2025-02-05 15:38:02,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-05 15:38:02,274 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:02,275 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 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] [2025-02-05 15:38:02,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 15:38:02,275 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:02,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:02,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1441108551, now seen corresponding path program 1 times [2025-02-05 15:38:02,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:02,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086069103] [2025-02-05 15:38:02,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:02,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:02,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 15:38:02,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 15:38:02,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:02,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:02,417 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-02-05 15:38:02,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:02,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086069103] [2025-02-05 15:38:02,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086069103] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:38:02,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484680822] [2025-02-05 15:38:02,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:02,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:38:02,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:38:02,420 INFO L229 MonitoredProcess]: Starting monitored process 7 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:38:02,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 15:38:02,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 15:38:02,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 15:38:02,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:02,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:02,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 1749 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-05 15:38:02,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:38:02,776 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-05 15:38:02,776 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:38:02,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484680822] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:02,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:38:02,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2025-02-05 15:38:02,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974672555] [2025-02-05 15:38:02,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:02,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:38:02,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:02,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:38:02,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:38:02,778 INFO L87 Difference]: Start difference. First operand 74169 states and 131954 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 5 states have internal predecessors, (107), 4 states have call successors, (22), 3 states have call predecessors, (22), 4 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20)